| Course Type | Elective Course |
|---|
| Course Level | Master's Degree Without Thesis |
|---|
| Year of Study | - |
|---|
| Semester | - |
|---|
| ECTS | 10 |
|---|
| Name of Lecturer(s) |
- |
| Learning Outcomes |
At the end of this course, the students;
- Should be able to understand and use some of the basic data structures.
- Are expected to see differences between different algorithms and implementations.
|
| Mode of Delivery | Face to face |
|---|
| Prerequisites | No |
|---|
| Recommended Optional Programme Components | There is no recommended optional programme component for this course. |
|---|
| Course Description | Object-Oriented Design, Analysis Tools, Stacks, Queues, and Deques, Vectors, Lists, and Sequences, Trees, Priority Queues, Dictionaries, Search Trees, Sorting and Selection, Text Processing, Graphs. |
|---|
| Course Contents |
| WEEK |
TOPICS |
|
1st Week |
Introduction: Abstract data types and data structures |
|
2nd Week |
Fundamental concepts |
|
3rd Week |
Collections |
|
4th Week |
Recursion |
|
5th Week |
Recursion |
|
6th Week |
Lists |
|
7th Week |
Linked lists |
|
8th Week |
MIDTERM |
|
9th Week |
Stacks and queues |
|
10th Week |
Binary trees |
|
11th Week |
Binary search trees |
|
12th Week |
Sorting |
|
13th Week |
Hashing |
|
14th Week |
Applications/Project presentations |
|
| Recommended or Required Reading | "Data Structures and Program Design in C++", J.R., R.L. Kruse, C.L. Tondo, B.P. Leung, 1999. |
|---|
| Planned Learning Activities and Teaching Methods |
- Lecture
- Problem Solving
- Questions/Answers
- Other
|
|---|
| Assessment Methods and Criteria |
|
Quantity |
Percentage (%) |
| Mid-term |
1 |
30 |
| Assignment |
1 |
10 |
| Project |
1 |
10 |
| Total(%) |
|
50 |
| Contribution of In-term Studies to Overall Grade(%) |
|
50 |
| Contribution of Final Examination to Overall Grade(%) |
|
50 |
| Total(%) |
|
100 |
|
| Language of Instruction | Turkish |
|---|
| Work Placement(s) | No |
|---|
