| Course Code: | MIS110 | ||||
| Course Name: | Data Structure and Algorithms | ||||
| Semester: | Fall | ||||
| Course Credits: |
|
||||
| Language of instruction: | English | ||||
| Course Condition: | |||||
| Does the Course Require Work Experience?: | No | ||||
| Type of course: | Compulsory Courses | ||||
| Course Level: |
|
||||
| Mode of Delivery: | Face to face | ||||
| Course Coordinator: | Doç. Dr. ŞEBNEM ÖZDEMİR | ||||
| Course Lecturer(s): | Dr. Öğr. Üyesi Mustafa SUNDU | ||||
| Course Assistants: |
| Course Objectives: | The aim of this course is to learn basic concepts of programming, to have a deep knowledge of data structures and algorithms, and also to learn how to select the appropriate data structure for specific problems and to design the algorithm required. |
| Course Content: | The lecture covers the key ideas involved in designing algorithms such as how algorithms depend on the design of suitable data structures, and how some structures and algorithms are more efficient than others for the same task. Basic tasks, such as storing, sorting and searching data, that will be applicable for programming, will be covered. Some key data structures, such as arrays, lists, queues, stacks and trees, will be covered and then move on to explore their use in a range of different searching and sorting algorithms. |
|
The students who have succeeded in this course;
1) Know the concepts of data structures and algorithm. 2) Know pseudo language and flow charts. 3) Develop algorithms by Pseudo language or flow charts for solving any problem. 4) Apply appropriate algorithm to any data structure 5) Develop storing algorithms |
| Week | Subject | Related Preparation |
| 1) | Introduction to Algorithms and Data Structures | |
| 2) | Data models and structures | |
| 3) | The Concept of Variable, Value Transfer and Assignment, | |
| 4) | Pseudo language and Flow Chart Software | |
| 5) | Arrays, Iteration, Invariants | |
| 6) | Arithmetic Operations | |
| 7) | Sorting Algorithms | |
| 8) | Midterm | |
| 9) | Search Algorithms | |
| 10) | lists | |
| 11) | Queue and Stack | |
| 12) | Trees | |
| 13) | Graphs | |
| 14) | Indexed Filing, Storing Data and Data Compression | |
| 15) | Disruptive Concepts | |
| 16) | Final |
| Course Notes / Textbooks: | - Anany Levitin, 2012. Introduction to The Design & Analysis of Algorithms. Pearson. - Ders notları |
| References: | Ek kaynak ihtiyacı bulunmamaktadır. - There is no need for additional resources. |
| Course Learning Outcomes | 1 |
2 |
3 |
4 |
5 |
|---|---|---|---|---|---|
| Program Outcomes |
| No Effect | 1 Lowest | 2 Average | 3 Highest |
| Program Outcomes | Level of Contribution |
| Semester Requirements | Number of Activities | Level of Contribution |
| Quizzes | 3 | % 30 |
| Midterms | 1 | % 30 |
| Final | 1 | % 40 |
| total | % 100 | |
| PERCENTAGE OF SEMESTER WORK | % 60 | |
| PERCENTAGE OF FINAL WORK | % 40 | |
| total | % 100 | |
| Activities | Number of Activities | Workload |
| Course Hours | 14 | 42 |
| Application | 14 | 28 |
| Study Hours Out of Class | 14 | 42 |
| Homework Assignments | 14 | 15 |
| Quizzes | 3 | 6 |
| Final | 14 | 20 |
| Total Workload | 153 | |