PAÜ .:. Eğitim Öğretim Bilgi Sistemi

COURSE INFORMATION

Course Code	Course Title	L+P Hour	Semester	ECTS
CENG 201	DATA STRUCTURES	3 + 2	3rd Semester	8

COURSE DESCRIPTION

Course Level	Bachelor's Degree
Course Type	Compulsory
Course Objective	The aim of this course is to improve students’ knowledge in algorithms, analysis, basic data structures, data abstraction and representation.
Course Content	Fundamental structures such as; recursion, stacks, queues, linked lists and trees, binary trees, binary search trees, guided trees, balanced trees, multiway search trees. B-tree, processes on trees (insertion, searching, deletion, creation), algorithm analysis, sorting and searching algorithms, graphs.
Prerequisites	No the prerequisite of lesson.
Corequisite	No the corequisite of lesson.

COURSE LEARNING OUTCOMES

1	Explains Array, Stack and Queue concepts
2	Explains linked lists
3	Trees, binary trees, AVL trees
4	Explains Graphs
5	Explains sorting algortihms

COURSE'S CONTRIBUTION TO PROGRAM

	PO 01	PO 02	PO 03	PO 04	PO 05	PO 06	PO 07	PO 08	PO 09	PO 10	PO 11	PO 12
LO 001	5	4	2		1		3	2	2
LO 002	5	4	2		1		3	2	2
LO 003	5			2	3			1	2	2	1
LO 004	5			2	3			1	2	2	1
LO 005	5			2	3			1	2	2	1
Sub Total	25	8	4	6	11		6	7	10	6	3
Contribution	5	2	1	1	2	0	1	1	2	1	1	0

ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION

Activities	Quantity	Duration (Hour)	Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)	14	5	70
Hours for off-the-classroom study (Pre-study, practice)	14	4	56
Assignments	5	10	50
Mid-terms	1	16	16
Final examination	1	16	16
Total Work Load ECTS Credit of the Course			208 8

COURSE DETAILS

Select Year

	Course Term	No	Instructors
Details	2013-2014 Fall	1	ŞEVKET UMUT ÇAKIR
Details	2013-2014 Fall	2	ŞEVKET UMUT ÇAKIR

Course Details

Course Code	Course Title	L+P Hour	Course Code	Language Of Instruction	Course Semester	Mode of Delivery
CENG 201	DATA STRUCTURES	3 + 2	1	English	2013-2014 Fall	Face to Face

Course Coordinator	E-Mail	Phone Number	Course Location	Attendance
Lecturer ŞEVKET UMUT ÇAKIR	sucakir@pau.edu.tr		MUH A0005 MUH A04153	%

Goals		The aim of this course is to improve students’ knowledge in algorithms, analysis, basic data structures, data abstraction and representation.
Content		Fundamental structures such as; recursion, stacks, queues, linked lists and trees, binary trees, binary search trees, guided trees, balanced trees, multiway search trees. B-tree, processes on trees (insertion, searching, deletion, creation), algorithm analysis, sorting and searching algorithms, graphs.

Topics

Weeks	Topics
1	Review of the course programming language
2	Arrays
3	Stacks
4	Queues
5	Linked lists
6	Doubly linked lists
7	Trees
8	Binary trees
9	AVL trees
10	B trees
11	Graphs
12	Graphs
13	Sorting algorithms
14	Sorting algorithms

Materials

Materials are not specified.

Resources

Resources	Resources Language
Data Structures and Algorithms Using C#, McMillan M., Cambridge Press	English
C && Java ile Veri Yapılarına Giriş, Yıldız O. T., Boğaziçi Üniversitesi Yayınevi	Türkçe
Data Structures Using C and C++,Langsam Y., Augenstein M. J., Tenenbaum A. M., Prentice Hall	English
Veri Yapıları ve Algoritmalar, Çölkesen R., Papatya Yayıncılık	Türkçe

Course Assessment

L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes

Prospective Student