CEN231 Data Structures and Algorithms

Lecture LAB settings	: :	Friday 13:30 - 16:20 Monday 08:30- 10:20 (Section 1), Thursday 08:30- 10:20 (Section 2)
Language	:	English
Class room	:	Lecture: Lab: A-410, A-503
Units	:	3+2
-	-	-
Instructor	:	Asst. Prof.Dr. Gökhan DALKILIÇ
E-mail	:
Office room	:
Office hours	:
Office Tel.	:
-	-	-
Teaching Assistants	:	Necati DURAN
Office room	:	A-201
Office hours	:
Office Tel.	:	0232-2464949 - 425

1.Prerequisites	:	No
2.Contents	:	This course gives a deeper look into the spirit of computing. It drills on the basic algorithms, data structures, and their algorithmic efficiencies. It covers solving recurrence, the big-O notation, sorting algorithms, stack and queue, hash table, binary tree, binary search tree, and balanced binary search tree. The C language is used for implementation of data structures.
3.Objectives	:	You should gain the following skills after this course : 1. Analyzing the time complexities of some algorithms. 2. Manipulation of the three fundamental data structures, namely array, linked list, and tree, and their variants.
4.Textbook/ Lecture notes	:
5.Attendance	:	Compulsory attendance for theory lectures is 70% and for lab lectures 80%.
6.Grading	:
7.Academic dishonesty	: