Computer Programming
Course Details
KTO KARATAY UNIVERSITY
Trade and Industry Vocational School
Programme of Computer Programming
Course Details
Trade and Industry Vocational School
Programme of Computer Programming
Course Details
| Course Code | Course Name | Year | Period | Semester | T+A+L | Credit | ECTS |
|---|---|---|---|---|---|---|---|
| 03831195 | Data Structures | 2 | Autumn | 3 | 2+1+0 | 5 | 5 |
| Course Type | Elective |
| Course Cycle | Associate (Short Cycle) (TQF-HE: Level 5 / QF-EHEA: Short Cycle / EQF-LLL: Level 5) |
| Course Language | Turkish |
| Methods and Techniques | - |
| Mode of Delivery | Face to Face |
| Prerequisites | - |
| Coordinator | - |
| Instructor(s) | Lect. Seda YILDIRIM |
| Instructor Assistant(s) | - |
Course Instructor(s)
| Name and Surname | Room | E-Mail Address | Internal | Meeting Hours |
|---|---|---|---|---|
| Lect. Seda YILDIRIM | TSMYO-T213 | [email protected] | 7915 |
Course Content
Classification of data structures, memory and time considerations. Linked lists, stacks and queues, tree structures, graphs. Study of the basic data structures and their implementations. Recursive applications.
Objectives of the Course
The aim is to provide an introduction to basic data structures, and algorithms for manipulating them, using an object-oriented programming language.
Contribution of the Course to Field Teaching
| Basic Vocational Courses | |
| Specialization / Field Courses | X |
| Support Courses | |
| Transferable Skills Courses | |
| Humanities, Communication and Management Skills Courses |
Relationships between Course Learning Outcomes and Program Outcomes
| Relationship Levels | ||||
| Lowest | Low | Medium | High | Highest |
| 1 | 2 | 3 | 4 | 5 |
| # | Program Learning Outcomes | Level |
|---|---|---|
| P4 | Effectively uses information technologies (software, programs, animations, etc.) related to her/his profession. | 5 |
| P1 | He/she has basic, current and applied information about his/her profession. | 4 |
| P7 | Takes responsibility as a team member to solve unforeseen complex problems encountered in applications related to her/his field | 4 |
| P11 | Creates algorithms and data structures and performs mathematical calculations. | 5 |
| P14 | Tests software and fixes bugs. | 4 |
Course Learning Outcomes
| Upon the successful completion of this course, students will be able to: | |||
|---|---|---|---|
| No | Learning Outcomes | Outcome Relationship | Measurement Method ** |
| O1 | Knows how to develop algorithms and creates a data structure suitable for the algorithm. | P.4.1 | 1,4,7 |
| O2 | Addresses complex problems and produces creative solutions. | P.3.3 | 1,4,7 |
| O3 | Tests software and fixes bugs. | P.5.1 | 1,4,7 |
| O4 | Knows how to develop algorithms and creates a data structure appropriate to the algorithm. | P.11.1 | 1,4,7 |
| O5 | Tests software and fixes bugs. | P.14.1 | 1,4,7 |
| ** Written Exam: 1, Oral Exam: 2, Homework: 3, Lab./Exam: 4, Seminar/Presentation: 5, Term Paper: 6, Application: 7 | |||
Weekly Detailed Course Contents
| Week | Topics |
|---|---|
| 1 | Introduction |
| 2 | Classification of data structures |
| 3 | Memory and time considerations |
| 4 | Linked lists |
| 5 | Stacks and queues |
| 6 | Tree structures |
| 7 | Graphs |
| 8 | Study of the basic data structures and their implementations |
| 9 | Recursive applications |
Textbook or Material
| Resources | Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, 1997 |
Evaluation Method and Passing Criteria
| In-Term Studies | Quantity | Percentage |
|---|---|---|
| Attendance | - | - |
| Laboratory | - | - |
| Practice | - | - |
| Field Study | - | - |
| Course Specific Internship (If Any) | - | - |
| Homework | - | - |
| Presentation | - | - |
| Projects | - | - |
| Seminar | - | - |
| Quiz | - | - |
| Listening | - | - |
| Midterms | 1 | 40 (%) |
| Final Exam | 1 | 60 (%) |
| Total | 100 (%) | |
ECTS / Working Load Table
| Quantity | Duration | Total Work Load | |
|---|---|---|---|
| Course Week Number and Time | 14 | 2 | 28 |
| Out-of-Class Study Time (Pre-study, Library, Reinforcement) | 14 | 1 | 14 |
| Midterms | 1 | 15 | 15 |
| Quiz | 0 | 0 | 0 |
| Homework | 0 | 0 | 0 |
| Practice | 14 | 1 | 14 |
| Laboratory | 14 | 1 | 14 |
| Project | 0 | 0 | 0 |
| Workshop | 0 | 0 | 0 |
| Presentation/Seminar Preparation | 0 | 0 | 0 |
| Fieldwork | 0 | 0 | 0 |
| Final Exam | 1 | 15 | 15 |
| Other | 0 | 0 | 0 |
| Total Work Load: | 100 | ||
| Total Work Load / 30 | 3,33 | ||
| Course ECTS Credits: | 3 | ||
Course - Learning Outcomes Matrix
| Relationship Levels | ||||
| Lowest | Low | Medium | High | Highest |
| 1 | 2 | 3 | 4 | 5 |
| # | Learning Outcomes | P3 | P4 | P5 | P11 | P14 |
|---|---|---|---|---|---|---|
| O1 | Addresses complex problems and produces creative solutions. | 4 | - | - | - | - |
| O2 | Knows how to develop algorithms and creates a data structure suitable for the algorithm. | - | 4 | - | - | - |
| O3 | Tests software and fixes bugs. | - | - | 5 | - | - |
| O4 | Knows how to develop algorithms and creates a data structure appropriate to the algorithm. | - | - | - | 5 | - |
| O5 | Tests software and fixes bugs. | - | - | - | - | 5 |