ECTS - Introduction to Data Structures
Introduction to Data Structures (CMPE321) Course Detail
| Course Name | Course Code | Season | Lecture Hours | Application Hours | Lab Hours | Credit | ECTS |
|---|---|---|---|---|---|---|---|
| Introduction to Data Structures | CMPE321 | 6. Semester | 2 | 2 | 0 | 3 | 5 |
| Pre-requisite Course(s) |
|---|
| CMPE221 |
| 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, Question and Answer, Drill and Practice, Team/Group. |
| Course Lecturer(s) |
|
| Course Objectives | This course aims to introduce the students a number of popular data structures and algorithms, along with the basic techniques in algorithm analysis. |
| Course Learning Outcomes |
The students who succeeded in this course;
|
| Course Content | Static and dynamic memory allocation, recursion, algorithms, stacks, queues, linked lists, circular linked lists, trees, binary trees, Hash tables, searching and sorting algorithms. |
Weekly Subjects and Releated Preparation Studies
| Week | Subjects | Preparation |
|---|---|---|
| 1 | Introduction, Standard Template Library (STL) | Ch 2, 4 (Other Source 5) |
| 2 | Pointer Syntax in C++ | pp. 15-26 |
| 3 | Structures | pp.26-30 |
| 4 | Templates: Generic Functions | pp. 97-103 |
| 5 | Templates: Generic Classes | pp. 103-112 |
| 6 | Recursion | pp. 265-275 |
| 7 | Recursion (continued) | pp. 275-284 |
| 8 | Stacks and Queues | pp. 537-544 |
| 9 | Stacks and Queues (continued) | pp. 545-551 |
| 10 | Stacks and Queues (continued) | pp. 552-559 |
| 11 | Linked Lists | pp. 565-582 |
| 12 | Linked Lists (continued) | pp. 565-582 |
| 13 | Trees and Binary Trees | pp. 605-622 |
| 14 | Trees and Binary Trees (continued) | pp. 622-633 |
Sources
| Course Book | 1. Mark Allen Weiss, “Data Structures and Problem Solving Using C++, 2nd Edition”, Addison Wesley, 2003. ISBN # 0321205006 |
|---|---|
| Other Sources | 2. Yedidyah Langsam, Moshe J. Augenstein, and Aaron M. Tenenbaum, “Data Structures Using C and C++”, Prentice-Hall, 1996. ISBN # 0-13-036997-7 |
| 3. Absolute C++, W. Savitch, Addison-Wesley | |
| 4. Problem Solving with C++: The Object of Programming, W. Savitch, Addison-Wesley | |
| 5. C++ Primer, Stanley B. Lippman, Addison-Wesley. | |
| 6. Data Structures Using C++, D.S. Malik, Thomson Course Technology, 1st Edition |
Evaluation System
| Requirements | Number | Percentage of Grade |
|---|---|---|
| Attendance/Participation | - | - |
| Laboratory | - | - |
| Application | - | - |
| Field Work | - | - |
| Special Course Internship | - | - |
| Quizzes/Studio Critics | - | - |
| Homework Assignments | 5 | 10 |
| Presentation | - | - |
| Project | - | - |
| Report | - | - |
| Seminar | - | - |
| Midterms Exams/Midterms Jury | 2 | 50 |
| Final Exam/Final Jury | 1 | 40 |
| Toplam | 8 | 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 | Acquires skills to use the advanced theoretical and applied knowledge obtained at the mathematics bachelors program to do further academic and scientific research in both mathematics-based graduate programs and public or private sectors. | |||||
| 2 | Transplants and applies the theoretical and applicable knowledge gained in their field to the secondary education by using suitable tools and devices. | |||||
| 3 | Acquires the skill of choosing, using and improving problem solving techniques which are needed for modeling and solving current problems in mathematics or related fields by using the obtained knowledge and skills. | |||||
| 4 | Acquires analytical thinking and uses time effectively in the process of deduction. | |||||
| 5 | Acquires basic software knowledge necessary to work in the computer science related fields and together with the skills to use information technologies effectively. | X | ||||
| 6 | Obtains the ability to collect data, to analyze, interpret and use statistical methods necessary in decision making processes. | |||||
| 7 | Acquires the level of knowledge to be able to work in the mathematics and related fields and keeps professional knowledge and skills up-to-date with awareness in the importance of lifelong learning. | |||||
| 8 | Takes responsibility in mathematics related areas and has the ability to work affectively either individually or as a member of a team. | |||||
| 9 | Has proficiency in English language and has the ability to communicate with colleagues and to follow the innovations in mathematics and related fields. | |||||
| 10 | Has the ability to communicate ideas with peers supported by qualitative and quantitative data. | |||||
| 11 | Has professional and ethical consciousness and responsibility which takes into account the universal and social dimensions in the process of data collection, interpretation, implementation and declaration of results in mathematics and its applications. | |||||
ECTS/Workload Table
| Activities | Number | Duration (Hours) | Total Workload |
|---|---|---|---|
| Course Hours (Including Exam Week: 16 x Total Hours) | 16 | 2 | 32 |
| Laboratory | |||
| Application | |||
| Special Course Internship | |||
| Field Work | |||
| Study Hours Out of Class | 14 | 2 | 28 |
| Presentation/Seminar Prepration | |||
| Project | |||
| Report | |||
| Homework Assignments | 5 | 6 | 30 |
| Quizzes/Studio Critics | |||
| Prepration of Midterm Exams/Midterm Jury | 2 | 12 | 24 |
| Prepration of Final Exams/Final Jury | 1 | 12 | 12 |
| Total Workload | 126 | ||