Information Package / Course Catalogue
| Course Code | : ENR100 |
| Course Type | : Required |
| Couse Group | : First Cycle (Bachelor's Degree) |
| Education Language | : English |
| Work Placement | : N/A |
| Theory | : 2 |
| Prt. | : 0 |
| Credit | : 3 |
| Lab | : 2 |
| ECTS | : 2 |
The main objective of this course is to help students do develop basic programming skills in efficient computer program writing. In this course, data structures and algorithms defined on them, which are two of the most important basic blocks of most computer programs, are explained. In addition to the very widely used data structures and their associated algorithms, it is taught that implementation of these algorithms in common programming languages such as C and Java. Great importance is given to the productivity examination of data structures and algorithms in terms of run time, memory requirement and ease of programming.
Topics covered in tihs course include history of computers, a simple C program, algorithms, pseudocode, control structures, selection statements (if-else), iteration statements (while), function definitions, modularising program in C, array definition, character array, passing arrays to functions, searching arrays, sorting arrays, multidimensional arrays.
| Lec. Orçun EKİN |
| 1. | Explain the basics of dynamic memory management and how data is stored in the memory. |
| 2. | Analyze a given algorithm and calculate the asymptotical growth with respect to performans. |
| 3. | Differentiate between iterative and recursive design and choose the appropriate one. |
| 4. | Classify basic data structures and their functions. |
| 5. | Design own data structures using existing ones. |
| 6. | Appreciate the use of proper data structures in writing effective programs. |
| 1. | Paul Deitel, Harvey Deitel, C How to Program, Global Edition, 8th Edition, 2016. |
| 2. | Glenn Brookshear, Dennis Brylow, “Computer Science: An Overview” 12th Edition, Pearson, 2015 |
| 3. | Gary Shelly, Misty Vermaat, “Microsoft Office 2010: Introductory”, Cengage Learning, 2010. |
| Type of Assessment | Count | Percent |
|---|---|---|
| Midterm Examination | 1 | %30 |
| Final Examination | 1 | %50 |
| Practice | 1 | %20 |
| Activities | Count | Preparation | Time | Total Work Load (hours) |
|---|---|---|---|---|
| Lecture - Theory | 13 | 0 | 2 | 26 |
| Lecture - Practice | 13 | 0 | 2 | 26 |
| Midterm Examination | 1 | 1 | 1 | 2 |
| Final Examination | 1 | 1 | 1 | 2 |
| TOTAL WORKLOAD (hours) | 56 | |||
PÇ-1 | PÇ-2 | PÇ-3 | PÇ-4 | PÇ-5 | PÇ-6 | PÇ-7 | PÇ-8 | PÇ-9 | PÇ-10 | PÇ-11 | PÇ-12 | |
OÇ-1 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 |
OÇ-2 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 |
OÇ-3 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 |
OÇ-4 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 |
OÇ-5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 |
OÇ-6 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 |