Course Information

Course Name	Turkish	Algoritma Analizi I
	English	Analysis of Algorithms I
Course Code	CEN 335E	Credit	Lecture (hour/week)	Recitation (hour/week)	Laboratory (hour/week)
Semester	-	3	-	-	-
Course Language		English
Course Coordinator		Mehmet Ali Sarıkaya
Course Objectives		1. This course aims to introduce the structures and techniques which are necessary at advanced level courses of Computer Engineering education such as Data Base, Computer Networks, Artificial Intelligence..... 2. Ability to develop a program to solve a specific problem by using advanced data structures and interpret the obtained results 3. Ability to examine a given solution based on the techniques learned in the course and enhance it 4. Ability to understand and write in english since the course is given in English
Course Description		Introduction, Secondary Storage Devices, Asymptotic Analysis; Recurrences, classwork; Sorting, merge sort, heap sort; Dictionaries, hashing; Binary search trees, 2-3 trees, 2-3-4 trees, red and black trees; Btrees; Binomial heaps; Fibonacci heaps;
Course Outcomes		Students who pass the course will be able to: I. Get knowledge on asymptotic notation II. Learn how to solve recurrences. III. Learn about the some sorting algorithms, such as merge, quick, heapsort. IV. Be familiar with the complicated data structures and algorithms used to store and retrieve data quickly into/from a file (hashing, B-trees, Red and Black trees, AVL trees). V. Be familiar with the heap structure, its kinds (Binomial, Fibonacci) and applications. VI. Understand how to analyze the search and/or sort time performance of advanced data structures and decide on the appropriate advanced data structure for a given problem
Pre-requisite(s)
Required Facilities
Other
Textbook		CLRS Introduction to Algorithms , 4th Edition (T.H.Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, MIT Press, 2022, ISBN: 978-0262046305)
Other References

Courses

Help

About