CMPE108 - Algorithms & Programming Outline

Department: Computer Engineering Year/Semester 2017-2018 Spring ProgramCode: 25 Course Code CMPE 108 Course Type Service Course Credits 3 Cr Prerequisite None


Coordinator:

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


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) “C Programming: A Modern Approach”, Second Edition, K. N. King, Norton, 2008.
More e-books: (PDF for beginners) . . . (PDF Kernighan-Ritchie)

Lecture Notes (power-pointers)

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

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)

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

WEEK OFTOPICSLABS
Feb 12 – Feb 16Computers (Hardware and Software) No Lab
Feb 19 – Feb 23Problem solving concepts for the computer - Algorithms and Flowcharts No Lab
Feb 26 – Mar 2Problem solving concepts for the computer - Algorithms and FlowchartsLab 0 - Computer Hardware and Architecture 
Mar 5 – Mar 9Introduction to C (Chapter 1) and C Fundamentals   (Chapter 2)Lab 1 - Introduction to DEVC++ and MS Visual Studio 
Mar 12 – Mar 16Formatted input / output (Chapter 3)Lab 2 - Sequential Programming
Mar 19 – Mar 23Expressions (Chapter 4)Lab 2 - Sequential Programming (cont.) 
Mar 26 – Mar 30Selection Structures (Chapter 5)Lab 3 - Selection Structures
Apr 2 - Apr 6Selection Structures (Chapter 5) and Repetitive Structures (Chapter 6)Lab 3 - Selection Structures (cont.)
Apr 9 - Apr 20 Midterm ExamsNo Lab
Apr 24 - Apr 27 Repetitive Structures  (Chapter 6)Lab 4 - Repetitive Structures
May 7 - May 11 Repetitive Structures  (Chapter 6) and Types - char (Chapter 7)Lab 5 - Repetitive Structures (cont.)
May 14 - May 18Arrays(Chapter 8)Lab 6-Arrays
May 21 - May 25Functions (Chapter 9)Lab 7-Functions
May 28 – June 9Final 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 No Percentage
Midterm Exam(s)140%
Final Examination145%
Homeworks45
Labs810%

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: 12 February 2017