INTERNATIONAL BURCH UNIVERSITY
Faculty of Engineering and Natural Sciences
Department of Information Technologies
||Number of ECTS Credits
||Class Hours Per Week
||Total Hours Per Semester
||3 + 2
|Dino Kečo, Assist. Prof. Dr.
||Nejdet Dogru, Assist. Prof. Dr.
|The objective of this course is to give an introduction to the concepts of data structures and algorithms which are related to specific data structure. Main goal of the course is to give essential information that every serious programmer needs to know about algorithms and data structures.
All algorithms and data structures which are covered in this course will be implemented using Java programming language.
- Introduction. Stacks and Queues
- Analysis of Algorithm
- Bubble Sort
- Elementary Sorts
- Merge Sort
- Quick Sort
- Radix Sort
- MIDTERM EXAM
- Binary Search Trees
- Balanced Search Trees
- Hash Tables
- Undirected Graphs
- Directed Graphs
- FINAL EXAMINATION
- Practical Sessions
| Midterm Exam(s)||20|
| Final Exam||1||25|
- Implement basic numerical algorithms.
- Implement simple search algorithms and explain the differences in their time complexities.
- Be able to implement common quadratic and O(N log N) sorting algorithms.
- Describe the implementation of hash tables, including collision avoidance and resolution.
- Discuss the runtime and memory efficiency of principal algorithms for sorting, searching, and hashing.
- 1. Robert Sedgewick and Kevin Wayne, “Algorithms”, 4th ed., 2011
|ECTS (Allocated based on student) WORKLOAD
|Lecture (14 weeks x Lecture hours per week)||75||0|
|Laboratory / Practice (14 weeks x Laboratory/Practice hours per week)|| || ||0|
|Midterm Examination (1 week)|| || ||0|
|Final Examination(1 week)|| || ||0|
|Preparation for Midterm Examination|| || ||0|
|Preparation for Final Examination||7|| ||0|
|Assignment / Homework/ Project|| || ||0|
|Seminar / Presentation|| || ||0|