ECTS - Data Structures
Data Structures (CMPE226) Course Detail
| Course Name | Course Code | Season | Lecture Hours | Application Hours | Lab Hours | Credit | ECTS |
|---|---|---|---|---|---|---|---|
| Data Structures | CMPE226 | 4. Semester | 3 | 0 | 0 | 3 | 8 |
| Pre-requisite Course(s) |
|---|
| CMPE225 |
| Course Language | English |
|---|---|
| Course Type | Compulsory Departmental Courses |
| Course Level | Bachelor’s Degree (First Cycle) |
| Mode of Delivery | Face To Face |
| Learning and Teaching Strategies | Lecture, Discussion, Question and Answer, Drill and Practice, Brain Storming. |
| Course Lecturer(s) |
|
| Course Objectives | This course introduces the abstract concepts that are useful in problem solving, and shows how these concepts are implemented in a programming language. The students learn how to choose a suitable data structure for a specific problem, how to create more complex data structures using the already existing data types, and also how to implement and analyze the algorithms developed for these data structures. The students get a chance to apply their knowledge by completing assignments written in the C++ language. |
| Course Learning Outcomes |
The students who succeeded in this course;
|
| Course Content | Stacks, recursion, queues; creation and destruction of dynamic variables, serial linked lists, circular lists, doubly linked lists, circular doubly linked lists; sorting and searching algorithms, space and time considerations, binary trees, binary search trees, tree traversal algorithms, binary tree sorting algorithms, hashing. |
Weekly Subjects and Releated Preparation Studies
| Week | Subjects | Preparation |
|---|---|---|
| 1 | Introduction, Standard Template Library (STL) | Chapter 2,4 (main text) |
| 2 | Linked Lists | Chapter 5 |
| 3 | Linked Lists | Chapter 5 |
| 4 | Linked Lists | Chapter 5 |
| 5 | Recursion | Chapter 6 |
| 6 | Stack | Chapter 7 |
| 7 | Stack | Chapter 7 |
| 8 | Queues | Chapter 8 |
| 9 | Queues | Chapter 8 |
| 10 | Searching, Sorting | Chapter 9,10 |
| 11 | Hashing | Chapter 5 |
| 12 | Binary Trees | Chapter 11 |
| 13 | Binary Trees | Chapter 11 |
| 14 | Heap Sort | Chapter 11 |
| 15 | Review | |
| 16 | Review |
Sources
| Course Book | 1. Data Structures Using C++, D.S. Malik, Thomson Course Technology, 1st Edition. |
|---|---|
| Other Sources | 2. Data Structures Using C and C++, Y.Langsam, Prentice-Hall International Inc., 2nd Edition. |
| 3. Data Structures and Algorithm Analysis in C++, M. Weiss, Addison Wesley, 3rd Edition | |
| 4. Practical Data Structures in C++, B. Flamig, John Wiley & Sons, Pap/Dis Edition. | |
| 5. Fundamentals of Data Structures in C++, E. Horowitz, S. Sahni, D. Mehta, Silicon Press, 2nd Edition. | |
| 6. Data Structures and Algorithms in C++, M.T. Goodrich, R.Tamassia, D. M. Mount, Wiley, 2nd Edition. |
Evaluation System
| Requirements | Number | Percentage of Grade |
|---|---|---|
| Attendance/Participation | - | - |
| Laboratory | - | - |
| Application | - | - |
| Field Work | - | - |
| Special Course Internship | - | - |
| Quizzes/Studio Critics | - | - |
| Homework Assignments | - | - |
| Presentation | - | - |
| Project | - | - |
| Report | - | - |
| Seminar | - | - |
| Midterms Exams/Midterms Jury | 2 | 60 |
| Final Exam/Final Jury | 1 | 40 |
| Toplam | 3 | 100 |
| Percentage of Semester Work | 60 |
|---|---|
| Percentage of Final Work | 40 |
| Total | 100 |
Course Category
| Core Courses | X |
|---|---|
| Major Area Courses | |
| Supportive Courses | |
| Media and Managment Skills Courses | |
| Transferable Skill Courses |
The Relation Between Course Learning Competencies and Program Qualifications
| # | Program Qualifications / Competencies | Level of Contribution | ||||
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | ||
| 1 | Has adequate knowledge in mathematics, science, and computer engineering-specific subjects; uses theoretical and practical knowledge in these areas to solve complex engineering problems. | X | ||||
| 2 | Identifies, defines, formulates, and solves complex engineering problems; selects and applies appropriate analysis and modeling methods for this purpose. | X | ||||
| 3 | Designs a complex system, process, device, or product to meet specific requirements under realistic constraints and conditions; applies modern design methods for this purpose. | X | ||||
| 4 | Develops, selects, and uses modern techniques and tools necessary for the analysis and solution of complex problems encountered in computer engineering applications; uses information technologies effectively. | X | ||||
| 5 | Designs experiments, conducts experiments, collects data, analyzes and interprets results for the investigation of complex engineering problems or research topics specific to the discipline of computer engineering. | X | ||||
| 6 | Works effectively in disciplinary and multidisciplinary teams; gains the ability to work individually. | |||||
| 7 | Communicates effectively in Turkish, both orally and in writing; writes effective reports and understands written reports, prepares design and production reports, makes effective presentations, gives and receives clear and understandable instructions. | |||||
| 8 | Knows at least one foreign language; writes effective reports and understands written reports, prepares design and production reports, makes effective presentations, gives and receives clear and understandable instructions. | |||||
| 9 | Has awareness of the necessity of lifelong learning; accesses information, follows developments in science and technology, and continuously improves oneself. | |||||
| 10 | Acts in accordance with ethical principles and has awareness of professional and ethical responsibility. | |||||
| 11 | Has knowledge about the standards used in computer engineering applications. | |||||
| 12 | Has knowledge about workplace practices such as project management, risk management, and change management. | |||||
| 13 | Gains awareness about entrepreneurship and innovation. | |||||
| 14 | Has knowledge about sustainable development. | |||||
| 15 | Has knowledge about the health, environmental, and safety impacts of computer engineering applications in universal and societal dimensions and the contemporary issues reflected in the field of engineering. | |||||
| 16 | Gains awareness of the legal consequences of engineering solutions. | |||||
| 17 | Analyzes, designs, and expresses numerical computation and digital representation systems. | X | ||||
| 18 | Uses programming languages and appropriate computer engineering concepts to solve computational problems. | X | ||||
ECTS/Workload Table
| Activities | Number | Duration (Hours) | Total Workload |
|---|---|---|---|
| Course Hours (Including Exam Week: 16 x Total Hours) | 16 | 3 | 48 |
| Laboratory | |||
| Application | |||
| Special Course Internship | |||
| Field Work | |||
| Study Hours Out of Class | 16 | 4 | 64 |
| Presentation/Seminar Prepration | |||
| Project | |||
| Report | |||
| Homework Assignments | 3 | 12 | 36 |
| Quizzes/Studio Critics | |||
| Prepration of Midterm Exams/Midterm Jury | 2 | 15 | 30 |
| Prepration of Final Exams/Final Jury | 1 | 20 | 20 |
| Total Workload | 198 | ||