Dokuz Eylül University Information Package / Courses Catalog

Description of Individual Course Units

Course Unit Code	Course Unit Title	Type Of Course	D	U	L	ECTS
CME 2201	DATA STRUCTURES	COMPULSORY	2	2	0	7

Offered By

Computer Engineering (English)

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSISTANT PROFESSOR FERIŞTAH DALKILIÇ

Offered to

Computer Engineering (English)

Course Objective

This course intends to equip students with basic knowledge and skills int the areas of data structures and object oriented design methodologies.

Learning Outcomes of the Course Unit

1	Learn object-oriented programming (OOP) skills and implement data structures with OOP.
2	Learn and implement fundamental data structures (hash table, stack, queue, linked list, heap, tree, graph).
3	Learn and implement fundamental graph algorithms.
4	Develop new algorithms that involve use of various data structures.
5	Identify the most suitable data structure for a given real-life problem.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

CME 1212 - ALGORITHMS AND PROGRAMMING II

Recomended Optional Programme Components

None

Course Contents

Week	Subject	Description
1	Object Oriented Programming Design Principles
2	Recursion and Efficieny of Algorithms
3	Priority Queue Implementation
4	List Implementation
5	Dictionary and Implemetation Methods
6	Hash Tables, Design of Hash Function, Collision Resolution
7	Hashing as a Dictionary Implementation
8	Graph Abstract Data Ttype, Graph Traversals
9	Finding Topological Ordering and Shortest-paths
10	Tree Abstract Data Type
11	Binary Search Trees
12	AVL Trees
13	Red-Black Trees
14	Data Structures Review

Recomended or Required Reading

Textbook: Data Structures and Abstractions with Java, Fourth Edition, FM Carrano, TM Henry, Pearson, 2016

Supplementary Book: Introduction To Algorithms, Third Edition, TH Cormen, CE Leiserson, RL Rivest, C Stein, MIT Press, 2001

Planned Learning Activities and Teaching Methods

1. Lectures, individual and group work, homeworks

Assessment Methods

SORTING NUMBER	SHORT CODE	LONG CODE	FORMULA
1	ASG	ASSIGNMENT
2	MTE	MIDTERM EXAM
3	FIN	FINAL EXAM
4	FCGR	FINAL COURSE GRADE (RESIT)	ASG * 0.40 + MTE * 0.20 + FIN * 0.40
5	RST	RESIT
6	FCGR	FINAL COURSE GRADE (RESIT)	ASG * 0.40 + MTE * 0.20 + RST * 0.40

Further Notes About Assessment Methods

Homeworks, midterm exams and final exam are used for asessment.

Assessment Criteria

Homeworks, midterm exams and final exam determine student marks.

Language of Instruction

English

Course Policies and Rules

Late homework submissions are not allowed.

Contact Details for the Lecturer(s)

feristah@cs.deu.edu.tr

Office Hours

TBA in the first lecture.

Work Placement(s)