Assoc. Prof. Dr. Mehmet Bodur

CMPE108 - Algorithms & Programming Outline

Outline (PDF).
Department: Computer Engineering Year/Semester 2023-2024 Spring ProgramCode: 25 Course Code CMPE 108 Course Type Service Course Credits 4 Cr Prerequisite None

Instructor:

Assoc. Prof. Dr. Mehmet Bodur E-mail: mehmet.bodur@emu.edu.tr Office: CMPE216 Office Tel: 2841

Lab Coordinator: Samaneh Sarfarazi 226 Tel:2847 ,
Assistant: Foad Farahbod

Catalog Description

Problem-Solving concepts for computers. Program structures for computer languages. Sequential logic structures: algorithm instructions and flowcharts. Problem-Solving with: decisions, loops and case logic structures. Data structures: arrays, lists. File processing. Laboratory applications will be done with programming languages such as Fortran, C or Visual Basic or other languages.

Course Web Page http://cmpe.emu.edu.tr/ > Offered Courses > Computer Engineering-CMPE (English) > CMPE108

Textbooks

(PDF)  100MB  “C Programming: A Modern Approach”, Second Edition, K. N. King, Norton, 2008.
(PDF) 2MB "Introduction to Flowcharts and C Programming"  M. Bodur, 2023.
More e-books: (PDF for beginners 2MB) . . . (PDF Kernighan-Ritchie 20MB)

Lecture Notes (PDF)

1 - Introduction to Computers Hardware & Software . . . 2 - Algorithms & Flowcharts . . . 3 - Ch1 Introducing C  . . . 4 - Ch2 C Fundamentals  . . . 5 - Ch3 Formatted Input/Output. . . 6 - Ch4 Expressions . . . 7 - Ch5 Selection Statements . . . 8 - Ch6 Loops  . . . 9 - Ch7 Basic Types . . . 10 - Ch8 Arrays  . . . 11 - Ch9 Functions  . . .

Reference Book(s)

“Problem Solving and Programming Concepts”, Maureen Sprankle and Jim Hubbard, Pearson Prentice Hall, 8th Edition,2008.

“Programming in ANSI C”, Ram Kumar and Rakesh Agrawal, West Publishing Company, 1992.

“C How to Program”, Paul Deitel and Harvey Deitel, Sixth Edition, Pearson Prentice Hall, 2009.

“Problem Solving and Program Design in C”, J. R. Hanly and E. B. Koffman, Sixth Ed., Pearson Addison-Wesley, 2009.

“C: The Complete reference”, Herbert Schildt, McGraw-Hill, 1995.

Topics Covered and Class Schedule (DATES TBA)

(4 hours of lectures + 2 hours lab per week)

WEEK OFTOPICSLABS
Sep 28 – Sep 29Computers (Hardware and Software) No Lab
Oct 5 - Oct 6Problem solving concepts for the computer - Algorithms and Flowcharts No Lab
Oct 12 - Oct 13Problem solving concepts for the computer - Algorithms and FlowchartsLab 0 - Computer Hardware and Architecture 
Oct 19 - Oct 20Introduction to C (Chapter 1) and C Fundamentals   (Chapter 2)Lab 1 - Introduction to DEVC++ and MS Visual Studio 
Oct 26 - Oct 27Formatted input / output (Chapter 3)Lab 2 - Sequential Programming
Oct 2 - Nov 3Expressions (Chapter 4)Lab 2 - Sequential Programming (cont.) 
Mar 26 – Mar 30Selection Structures (Chapter 5)Lab 3 - Selection Structures
Nov 9 - (10:lab)Selection Structures (Chapter 5) and Repetitive Structures (Chapter 6)Lab 3 - Selection Structures (cont.)
Nov 11 - Nov 25 Midterm ExamsNo Lab
Nov 30 - Dec 1 Repetitive Structures  (Chapter 6)Lab 4 - Repetitive Structures
Dec 7 - Dec 8 Repetitive Structures  (Chapter 6) and Types - char (Chapter 7)Lab 5 - Repetitive Structures (cont.)
Dec 21– Dec 22
Arrays(Chapter 8)Lab 6-Arrays
Dec 28 - Dec 29Functions (Chapter 9)Lab 7-Functions
Jan 3 – Jan 18Final Exams No Lab

Course Learning Outcomes

A successful student passing this course gains an ability to

  1. know the of hardware and software requirements for coding, compiling and executing C programs.(e1,e2,e3)

  2. use a suitable IDE to edit, compile, and execute C codes (k1,k2,k3)

  3. construct an algorithm and /or flowchart for solving a problem (e1,e2,e3)

  4. include library headers, and declare variables of basic types (e1,e2,e3)

  5. use if, if-then-else and switch statements in C codes (e1,e2,e3)

  6. use while-loop, do-while loop, and for-loop in C codes (e1,e2,e3)

  7. use arrays concept in C programming (e1,e2,e3)

  8. use functions with arguments by value (e1,e2,e3)

The contribution of each course learning outcome to student outcomes is specified in parenthesis. The student outcomes are available at http://cmpe.emu.edu.tr/abet

Assessment

Method-    Percentage
Midterm Exam(s)
-
40%
Final Examination-
45%
Labs and Homeworks  
-
15%

Attendance and Participation: Attendance to every lecture is mandatory.

There will be no points for the attendance.

Policy on makeups and re-sit

  • If a student misses midterm or final exams with a reasonable excuse, he/she MUST submit a written report to the CMPE department secretary stating their excuse, within 3 days of that examination. Otherwise, make-up examination will not be provided.

  • Only one makeup exam will be given for the midterm or final at the end of the semester that will cover all the topics listed above.

  • The re-sit exam will cover both midterm and final topics, and it will replace both midterm and final.

  • If you miss both midterm and final exams and do not submit any written report, you will get an “NG” grade.

Policy on labs

  • No exemption will be provided for labs.

  • There will be no makeup for the missed lab experiments. On application of a student with an acceptable reason within the previous week, lab coordinator may change the lab hours of the student to another group.

  • If you miss three or more labs, your lab grade will be zero.

Policy on cheating and plagiarism: Plagiarism (which also includes any kind of cheating in exams, assignments, and lab works) is a disciplinary offence and will be dealt with accordingly. Furthermore, the penalty of plagiarism is to get grade zero for the corresponding exam, assignment, or lab work.

Contribution of Course to ABET Criterion 5

Credit Hours for:

  • Mathematics & Basic Science : 0

  • Engineering Sciences and Design : 3

  • General Education : 0

Updated by: Assoc. Prof. Dr. Mehmet Bodur

Date Updated: 21 September 2023

Assoc. Prof. Dr. Mehmet Bodur