Course Unit Code  Course Unit Title  Type of Course Unit  Year of Study  Semester  Number of ECTS Credits  MAT203  COMPUTER SCIENCES I  Elective  3  5  4 

Level of Course Unit 
First Cycle 
Objectives of the Course 
The aim of this course is; to give the ability of algorithmic thinking and problem solving and to create the infrastructure for different programming languages 
Name of Lecturer(s) 
Prof. Dr. Alpay KIRLANGIÇ
Doç. Dr. Aysun AYTAÇ

Learning Outcomes 
1  To be able to learn algorithmic approach to solutions of problems related to mathematics and daily life  2  To be able to gain rational thinking technique  3  To be able to use the information taught in technology  4  To be able to construct a problem independently and develop a solution method for it 

Mode of Delivery 
Face to Face 
Prerequisites and corequisities 
No 
Recommended Optional Programme Components 
No 
Course Contents 
Forming the solution steps of a given problem and showing with flow diagram. Algorithm Design. Basic Properties of Algorithm (Precision, Efficiency, Finitude, InputOutput Information). General Structure of Algorithm. Basic Structures in Algorithms (Sequence Structure, Selection Structure and Repetition Structure). Arithmetic, Relational and Logical Operators. Variable Concept and Transferring Value to Variables. InputOutput Statements. Idioms Performing Control. Loop Statements. Indexed Variables. Character Information Processing. Subprograms .. 
Weekly Detailed Course Contents 

1  Algorithm definition and properties. Input information, output information, precision and finiteness concepts in algorithms. Step algorithm.
   2  Flow Diagram and symbols used in the diagram.    3  Sparks algorithm language. Variables. Variable definition rules. Arithmetic processors. Relational processors. Logical processors. Assigning values to variables and transferring values from input environment.    4  Transferring Value to Output Environment in Algorithm. IF  THEN statement. IF  THENELSE statement.    5  Nested IF statements. GOTO statement.    6  CASE statement. Examples.    7  Loop statements. FORDO loop statement. FORDO loop statement usage rules. Nested FOR  DO statements.    8  Midterm    9  WHILEDO loop statement and usage rules. Nested WHILEDO loop statements.    10  LOOPUNTIL loop statement and usage rules. Nested LOOPUNTIL loop statements.    11  Indexed Variables. One dimensional index variables (arrays). Transferring values to indexed variables.    12  Indexed variables    13  Sorting and moving numerical data    14  Subprograms    15  Subprograms    16  Semester final exam   

Recommended or Required Reading 

Planned Learning Activities and Teaching Methods 

Assessment Methods and Criteria  
Midterm Examination  1  100  SUM  100  
Final Examination  1  100  SUM  100  Term (or Year) Learning Activities  40  End Of Term (or Year) Learning Activities  60  SUM  100 
 Language of Instruction  Turkish  Work Placement(s)  No 

Workload Calculation 