Course Detail
Course Description
| Course | Code | Semester | T+P (Hour) | Credit | ECTS |
|---|---|---|---|---|---|
| ALGORITHMS and DATA STRUCTURES | - | Spring Semester | 2+0 | 2 | 4 |
| Course Program |
| Prerequisites Courses | |
| Recommended Elective Courses |
| Language of Course | Turkish |
| Course Level | First Cycle (Bachelor's Degree) |
| Course Type | Required |
| Course Coordinator | Prof.Dr. Gökhan SİLAHTAROĞLU |
| Name of Lecturer(s) | Prof.Dr. Gökhan SİLAHTAROĞLU |
| Assistant(s) | |
| Aim | To enable our students to recognize data structures, the basis that determines how the data is organized in computers, the data to be processed must be organized for an algorithm to be effective, understandable, and correct. In addition, it is essential to show how much time and memory are needed in the computer environment to operate a particular algorithm. |
| Course Content | This course contains; General definitions and basic concepts of the course.,Data Models,General Review on C Programming Language,Enum, struct, union, typedef Structure,Stack,queue,Lists,Trees,Sorting Algorithms,Search,Graphs,Shortest Path Algorithm,Storage management,Automatic List Management,Dynamic Memory Management. |
| Dersin Öğrenme Kazanımları | Teaching Methods | Assessment Methods |
| 1. will be able to recognize and use the basic concepts by making general definitions about Data Constructions. | 17, 2, 8, 9 | A, E |
| 1.1. Explains types of data structures. | 2, 9 | |
| 1.2. Distinguish different types of data structures. | 17, 8 | |
| 2. will be able to use general information about C Programming Language. | 2, 8, 9 | E |
| 2.1. Uses characteristics of C programming language. | 2, 9 | |
| 2.2. Explains historical development process of C programming language. | 9 | |
| 3. will be able to recognize the stack | 13, 9 | A |
| 3.1. Uses the properties of the stack. | 13, 9 | |
| 3.2. Uses recursion. | 13, 9 | |
| 4. will be able to recognize Queues and List Data Structures and use their properties. | 2, 9 | E |
| 4.1. Defines queue and use its properties. | 2, 9 | |
| 4.2. Defines List Data Structure and uses its properties. | 2, 9 | |
| 5. will be able to recognize and use tree data structure. | 9 | A |
| 5.1. Applies tree structure. | 9 | |
| 5.2. Lists types of trees. | 9 | |
| 6. will be able to recognize and use sorting and search algorithms. | 13, 2, 9 | |
| 6.1. Lists sorting algorithms. | 13, 2, 9 | |
| 6.2. Applies sorting algorithm. | ||
| 6.2. Applies Search algorithm. | ||
| 6.3. Lists search algorithms. | 13, 2, 9 | |
| 7. Will be able to recognize and use Warshall and Shortest Path Algorithms | 8, 9 | A |
| 7.1. Uses Warshal algoritms. | 8, 9 | |
| 7.2. Uses shortest path algorithms. | 8, 9 | |
| 8. Will be able to use the features Storage, List, Dynamic Memory Management | 13, 9 | A |
| 8.1. Defines Storage, List and Memory. | 13, 9 | |
| 8.2. Performs storage, list and memory operations. | 13, 9 |
| Teaching Methods: | 13: Case Study Method, 17: Experimental Technique, 2: Project Based Learning Model, 8: Flipped Classroom Learning, 9: Lecture Method |
| Assessment Methods: | A: Traditional Written Exam, E: Homework |
Course Outline
| Order | Subjects | Preliminary Work |
|---|---|---|
| 1 | General definitions and basic concepts of the course. | |
| 2 | Data Models | Related chapter in the course book should be read. |
| 3 | General Review on C Programming Language | |
| 4 | Enum, struct, union, typedef Structure | Related chapter in the course book should be read. |
| 5 | Stack | Related chapter in the course book should be read. |
| 6 | queue | Related chapter in the course book should be read. |
| 7 | Lists | Related chapter in the course book should be read. |
| 8 | Trees | Study on the example to be applied. |
| 8 | Sorting Algorithms | Study on the example to be applied |
| 9 | Search | Related chapter in the course book should be read. |
| 10 | Graphs | Related chapter in the course book should be read. |
| 11 | Shortest Path Algorithm | Related chapter in the course book should be read and previous assigment should be done. |
| 12 | Storage management | Related chapter in the course book should be read. |
| 13 | Automatic List Management | Related chapter in the course book should be read and previous assigment should be done. |
| 14 | Dynamic Memory Management | Related chapter in the course book should be read and previous assigment should be done. |
| Resources |
| Rifat Çölkesen, Veri Yapıları ve Algoritmalar, Papatya Bilim Yay. |
| [1] http://mebis.medipol.edu.tr adresinde yayınlanacak olan ilgili bağlantılar 2] Rifat Çölkesen, Veri Yapıları ve Algoritmalar, Papatya Bilim Yay. [3] Introduction to the Design and Analysis of Algorithms 3rd Edition, Anany Levitin (Author) Data Structures and Algorithms Made Easy: Data Structures and Algorithmic Puzzles 5th ed. Edition Narasimha Karumanchi (Author) |
Course Contribution to Program Qualifications
| Course Contribution to Program Qualifications | |||||||
| No | Program Qualification | Contribution Level | |||||
| 1 | 2 | 3 | 4 | 5 | |||
| 1 | Defines the theoretical issues in the field of information and management. | ||||||
| 2 | Describes the necessary mathematical and statistical methods in the field of information and management. | X | |||||
| 3 | Uses at least one computer program in the field of information and management. | X | |||||
| 4 | Sustains proficiency in a foreign language requiredor information and management studies. | ||||||
| 5 | Prepares informatics/software projects and work in a team. | ||||||
| 6 | Constantly updates himself / herself by following developments in science and technology with an understanding of the importance of lifelong learning through critically evaluating the knowledge and skills that s/he has got.7. Uses theoretical and practical expertise in the field of information and management | ||||||
| 7 | Follows up-to-date technology using a foreign language at least A1 level, holds verbal / written communication skills. | X | |||||
| 8 | Follows up-to-date technology using a foreign language at least A1 level, holds verbal / written communication. | ||||||
| 9 | Adopts organizational / institutional and social ethical values. | ||||||
| 10 | Within the framework of community involvement adopts social responsibility principles and takes initiative when necessary. | ||||||
| 11 | Uses and analyses basic facts and data in various disciplines (economics, finance, sociology, law, business) in order to conduct interdisciplinary studies. | ||||||
| 12 | Writes software in different platforms such as desktop, mobile, web on its own and / or in a team. | ||||||
Assessment Methods
| Contribution Level | Absolute Evaluation | |
| Rate of Midterm Exam to Success | 40 | |
| Rate of Final Exam to Success | 60 | |
| Total | 100 | |
| ECTS / Workload Table | ||||||
| Activities | Number of | Duration(Hour) | Total Workload(Hour) | |||
| Course Hours | 14 | 2 | 28 | |||
| Guided Problem Solving | 14 | 2 | 28 | |||
| Resolution of Homework Problems and Submission as a Report | 6 | 5 | 30 | |||
| Term Project | 0 | 0 | 0 | |||
| Presentation of Project / Seminar | 0 | 0 | 0 | |||
| Quiz | 1 | 2 | 2 | |||
| Midterm Exam | 1 | 15 | 15 | |||
| General Exam | 1 | 15 | 15 | |||
| Performance Task, Maintenance Plan | 0 | 0 | 0 | |||
| Total Workload(Hour) | 118 | |||||
| Dersin AKTS Kredisi = Toplam İş Yükü (Saat)/30*=(118/30) | 4 | |||||
| ECTS of the course: 30 hours of work is counted as 1 ECTS credit. | ||||||
Detail Informations of the Course
Course Description
| Course | Code | Semester | T+P (Hour) | Credit | ECTS |
|---|---|---|---|---|---|
| ALGORITHMS and DATA STRUCTURES | - | Spring Semester | 2+0 | 2 | 4 |
| Course Program |
| Prerequisites Courses | |
| Recommended Elective Courses |
| Language of Course | Turkish |
| Course Level | First Cycle (Bachelor's Degree) |
| Course Type | Required |
| Course Coordinator | Prof.Dr. Gökhan SİLAHTAROĞLU |
| Name of Lecturer(s) | Prof.Dr. Gökhan SİLAHTAROĞLU |
| Assistant(s) | |
| Aim | To enable our students to recognize data structures, the basis that determines how the data is organized in computers, the data to be processed must be organized for an algorithm to be effective, understandable, and correct. In addition, it is essential to show how much time and memory are needed in the computer environment to operate a particular algorithm. |
| Course Content | This course contains; General definitions and basic concepts of the course.,Data Models,General Review on C Programming Language,Enum, struct, union, typedef Structure,Stack,queue,Lists,Trees,Sorting Algorithms,Search,Graphs,Shortest Path Algorithm,Storage management,Automatic List Management,Dynamic Memory Management. |
| Dersin Öğrenme Kazanımları | Teaching Methods | Assessment Methods |
| 1. will be able to recognize and use the basic concepts by making general definitions about Data Constructions. | 17, 2, 8, 9 | A, E |
| 1.1. Explains types of data structures. | 2, 9 | |
| 1.2. Distinguish different types of data structures. | 17, 8 | |
| 2. will be able to use general information about C Programming Language. | 2, 8, 9 | E |
| 2.1. Uses characteristics of C programming language. | 2, 9 | |
| 2.2. Explains historical development process of C programming language. | 9 | |
| 3. will be able to recognize the stack | 13, 9 | A |
| 3.1. Uses the properties of the stack. | 13, 9 | |
| 3.2. Uses recursion. | 13, 9 | |
| 4. will be able to recognize Queues and List Data Structures and use their properties. | 2, 9 | E |
| 4.1. Defines queue and use its properties. | 2, 9 | |
| 4.2. Defines List Data Structure and uses its properties. | 2, 9 | |
| 5. will be able to recognize and use tree data structure. | 9 | A |
| 5.1. Applies tree structure. | 9 | |
| 5.2. Lists types of trees. | 9 | |
| 6. will be able to recognize and use sorting and search algorithms. | 13, 2, 9 | |
| 6.1. Lists sorting algorithms. | 13, 2, 9 | |
| 6.2. Applies sorting algorithm. | ||
| 6.2. Applies Search algorithm. | ||
| 6.3. Lists search algorithms. | 13, 2, 9 | |
| 7. Will be able to recognize and use Warshall and Shortest Path Algorithms | 8, 9 | A |
| 7.1. Uses Warshal algoritms. | 8, 9 | |
| 7.2. Uses shortest path algorithms. | 8, 9 | |
| 8. Will be able to use the features Storage, List, Dynamic Memory Management | 13, 9 | A |
| 8.1. Defines Storage, List and Memory. | 13, 9 | |
| 8.2. Performs storage, list and memory operations. | 13, 9 |
| Teaching Methods: | 13: Case Study Method, 17: Experimental Technique, 2: Project Based Learning Model, 8: Flipped Classroom Learning, 9: Lecture Method |
| Assessment Methods: | A: Traditional Written Exam, E: Homework |
Course Outline
| Order | Subjects | Preliminary Work |
|---|---|---|
| 1 | General definitions and basic concepts of the course. | |
| 2 | Data Models | Related chapter in the course book should be read. |
| 3 | General Review on C Programming Language | |
| 4 | Enum, struct, union, typedef Structure | Related chapter in the course book should be read. |
| 5 | Stack | Related chapter in the course book should be read. |
| 6 | queue | Related chapter in the course book should be read. |
| 7 | Lists | Related chapter in the course book should be read. |
| 8 | Trees | Study on the example to be applied. |
| 8 | Sorting Algorithms | Study on the example to be applied |
| 9 | Search | Related chapter in the course book should be read. |
| 10 | Graphs | Related chapter in the course book should be read. |
| 11 | Shortest Path Algorithm | Related chapter in the course book should be read and previous assigment should be done. |
| 12 | Storage management | Related chapter in the course book should be read. |
| 13 | Automatic List Management | Related chapter in the course book should be read and previous assigment should be done. |
| 14 | Dynamic Memory Management | Related chapter in the course book should be read and previous assigment should be done. |
| Resources |
| Rifat Çölkesen, Veri Yapıları ve Algoritmalar, Papatya Bilim Yay. |
| [1] http://mebis.medipol.edu.tr adresinde yayınlanacak olan ilgili bağlantılar 2] Rifat Çölkesen, Veri Yapıları ve Algoritmalar, Papatya Bilim Yay. [3] Introduction to the Design and Analysis of Algorithms 3rd Edition, Anany Levitin (Author) Data Structures and Algorithms Made Easy: Data Structures and Algorithmic Puzzles 5th ed. Edition Narasimha Karumanchi (Author) |
Course Contribution to Program Qualifications
| Course Contribution to Program Qualifications | |||||||
| No | Program Qualification | Contribution Level | |||||
| 1 | 2 | 3 | 4 | 5 | |||
| 1 | Defines the theoretical issues in the field of information and management. | ||||||
| 2 | Describes the necessary mathematical and statistical methods in the field of information and management. | X | |||||
| 3 | Uses at least one computer program in the field of information and management. | X | |||||
| 4 | Sustains proficiency in a foreign language requiredor information and management studies. | ||||||
| 5 | Prepares informatics/software projects and work in a team. | ||||||
| 6 | Constantly updates himself / herself by following developments in science and technology with an understanding of the importance of lifelong learning through critically evaluating the knowledge and skills that s/he has got.7. Uses theoretical and practical expertise in the field of information and management | ||||||
| 7 | Follows up-to-date technology using a foreign language at least A1 level, holds verbal / written communication skills. | X | |||||
| 8 | Follows up-to-date technology using a foreign language at least A1 level, holds verbal / written communication. | ||||||
| 9 | Adopts organizational / institutional and social ethical values. | ||||||
| 10 | Within the framework of community involvement adopts social responsibility principles and takes initiative when necessary. | ||||||
| 11 | Uses and analyses basic facts and data in various disciplines (economics, finance, sociology, law, business) in order to conduct interdisciplinary studies. | ||||||
| 12 | Writes software in different platforms such as desktop, mobile, web on its own and / or in a team. | ||||||
Assessment Methods
| Contribution Level | Absolute Evaluation | |
| Rate of Midterm Exam to Success | 40 | |
| Rate of Final Exam to Success | 60 | |
| Total | 100 | |