| Course Unit Code | Course Unit Title | Type of Course Unit | Year of Study | Semester | Number of ECTS Credits | | OÖE6012 | PRESCHOOL EDUCATIONAL TECHNOLOGIES AND CODING | Compulsory | 1 | 2 | 5 |
|
| Level of Course Unit |
| Second Cycle |
| Objectives of the Course |
| The main objective of this course is to help students develop basic programming skills in writing efficient computer programs. In this course, data structures which are two of the most important basic blocks of most computer programs and the algorithms defined on them are explained. In addition to the very widely used data structures and their associated algorithms, they are taught in concrete in common programming languages ??such as C and Java. Data structures and algorithms, working time, memory requirements and ease of programming in the examination of productivity is given great importance. In addition, Java Data Framework (Java Collections Framework), which is available in pre-execution, is also mentioned in summary. |
| Name of Lecturer(s) |
|
| Learning Outcomes |
| 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.
|
|
| Mode of Delivery |
| Formal Education |
| Prerequisites and co-requisities |
| None |
| Recommended Optional Programme Components |
| None |
| Course Contents |
| Topics covered in this course include pointer logic, asymptotic analysis of algorithms (Big O notation and its equivalent); iterative and iterative implementations of algorithms; data structures such as array, list, queue, heap, heap, dictionary, search tree and graph, and Java Collection Framework. Code writing is done in C and / or J programming languages. |
| Weekly Detailed Course Contents |
|
| 1 | Algorithms and flow chart concepts, introduction to programming
| | | | 2 | Variable concept and some mathematical algorithms
| | | | 3 | Algorithms and flow charts about series
| | | | 4 | Algorithms and flow charts about matrices
| | | | 5 | Sorting algorithms
| | | | 6 | Basic game algorithms and flow charts
| | | | 7 | Basic game algorithms and flow charts -2
| | | | 8 | MidTerm Exam
| | | | 9 | | project development | | | 10 | Variable and series concepts in C
| | | | 11 | Control statements in C
| | | | 12 | Loops in C
| | | | 13 | Coding programmes with C with given algorithms or flow charts
| | | | 14 | | project development | | | 15 | | project development | |
|
| Recommended or Required Reading |
| Herbert Schildt, C# 4.0: The Complete Reference, McGraw-Hill, 2010. |
| Planned Learning Activities and Teaching Methods |
|
| Assessment Methods and Criteria | |
| SUM | 0 | |
| SUM | 0 | | Yarıyıl (Yıl) İçi Etkinlikleri | 40 | | Yarıyıl (Yıl) Sonu Etkinlikleri | 60 | | SUM | 100 |
| | Language of Instruction | | | Work Placement(s) | | None |
|
| Workload Calculation |
|
| Midterm Examination | 1 | 40 | 40 |
| Project Preparation | 1 | 60 | 60 |
| Project Presentation | 1 | 60 | 60 |
|
| Contribution of Learning Outcomes to Programme Outcomes |
| LO1 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | | LO2 | 5 | 5 | 5 | 4 | 5 | 5 | 5 | | LO3 | 5 | 5 | 5 | 5 | 5 | 4 | 5 | | LO4 | 5 | 5 | 5 | 4 | 4 | 4 | 4 | | LO5 | 5 | 5 | 5 | 5 | 5 | 4 | 4 | | LO6 | 4 | 4 | 4 | 4 | 4 | 4 | 5 |
|
| * Contribution Level : 1 Very low 2 Low 3 Medium 4 High 5 Very High |
|
|
|
|
Ordu University Rectorate Building ,Cumhuriyet Campus , Center / ORDU / TURKEY • Tel: +90 452 226 52 00
|