<meta http-equiv="refresh" content="0; URL=noscript.html"> METU | Course Syllabus

Course Learning Outcomes

By the end of the course, undergraduate CEIT students will:

1. Define and describe the basic concepts of Algorithm and Flowcharts

2. Express the relationship between algorithmic design and problem solving in computer.

3. Apply functional decomposition in the design of a program. 

4. Develop an algorithmic solution to solve a problem using sequence, selection, and iteration.

5. Use simple data structures, such as arrays and strings, in an algorithmic solution.
6. Demonstrate the use of procedural abstraction through the design and implementation of effective procedures and functions.
7. Construct a readable, well documented, and syntactically correct Python script.
8. Explain the syntax and semantics of a target set of Python language elements.
9. Use UNIX tools to edit, compile, link, and execute a program.
10. Predict the state changes of a program in execution and trace its execution.