Course Syllabus
|
Name and code of the course |
: ENF002 Programming Languages-I |
|
Type of the course (Obligatory/Elective) Course Prerequisite Term Credit |
: Elective : None : -- : Theo: 2 + Prac.: 2 = Tot: 3 |
|
Course Coordinators Department/Program |
: Dr. Ahmet BOZKURT : Department of Informatics |
|
Name of the instructor who taught the course last semester Room/Class Number Hours Office Hours Groups/Sections |
: Instructors from Department of Informatics : -- : -- : -- : -- |
|
Aim and goals of the course |
: This course aims to teach the fundamental principles of programming logic and methods to the 1st year or 2nd year undergraduate students. |
|
Contents of the course |
: Introduction to programming, problem solving with computer (algorithms and flowcharts), Program Structure in Pascal, Data types and definition blocks, editor usage in T.Pascal, I/O commands, comparison commands, loop commands, console commands, subprograms, array, sorting and searching methods, file I/O, Overly files. |
|
References (Minimum 4 books) |
: 1.Turbo Pascal 7.0, by Walter J.Savitch. 2.Turbo Pascal, by Elliot B. Koffman, 1994. 3. Turbo PASCAL ve programlama Sanatı, Ömer Akgöbek, Beta Basın Yayın, 2001. 4. Yapısal Programlama ve Turbo Pascal 7.0, Wolf-Gert Matthäus, Beta Basım Yayın ,1993. |
|
Semester Teaching Plan |
Week 1: Introduction to programming, programmin languages, logic of algorithms, compilers and program compiling Week 2: Introduction to pascal language, general structure, compiling, debugging, basic input-output commands Week 3: Concept of variables, assignments, calling, types and properties of variables, methods of assigning values to a variable Week 4: Adding library files, mathematical and logical operators, applications with input-output commands Week 5: Decision making, if statement Week 6: 1st Midterm Week 7: if () else statement, case- of () statement Week 8: Loop structures, for () loop Week 9: repeat – until and while loops Week 10: One dimensional and multi dimensional arrays, character arrays Week 11: 2nd Midterm Week 12: Standard functions, subroutines, sorting and searching algorithms Week 13: Pointers, file adding (header file), introduction to filing Week 14: Methods of filing (text file) |
|
Evaluation |
: There will be two midterm exams each weighing 20% and a final weighing 60%. |