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

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSISTANT PROFESSOR ZERRIN IŞIK

Offered to

Computer Engineering

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	Introduction to Object Oriented Programming (OOP)
2	OOP Design Principles
3	Implementation of Stack, Queue and Linked List with OOP
4	Heap and priority queue implementation
5	Hash Tables, Design of Hash Function
6	Chaining and Open Address Hashing, Implementation with OOP
7	Binary Search Trees, Implementation with OOP
8	Midterm
9	Tree-Walk Methods, Implementation with OOP
10	Red-Black Trees, Implementation with OOP
11	B-Trees, Implementation with OOP
12	Data Structures and Traversal Algorithms for Graphs
13	Minimum Spanning Tree Algorithms
14	Finding Shortest Paths

Recomended or Required Reading

Textbook: Introduction To Algorithms, Third Edition, Cormen TH, Leiserson CE, Rivest RL, and Stein C. The MIT Press, 2009.
Supplementary Book: Data Structures and algorithms in Java, Sixth Edition, GoodRich MT, Tamassia R, Goldwasser MH, Wiley, 2015

Planned Learning Activities and Teaching Methods

1. Lectures, individual and group work, homeworks

Assessment Methods

SORTING NUMBER	SHORT CODE	LONG CODE	FORMULA
1	MTE	MIDTERM EXAM
2	PRC	PRACTICE
3	FIN	FINAL EXAM
4	FCG	FINAL COURSE GRADE	MTE * 0.20 + PRC * 0.30 + FIN * 0.50
5	RST	RESIT
6	FCGR	FINAL COURSE GRADE (RESIT)	MTE * 0.20 + PRC * 0.30 + RST * 0.50

*** Resit Exam is Not Administered in Institutions Where Resit is not Applicable.

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)

zerrin@cs.deu.edu.tr

Office Hours

TBA in the first lecture.

Work Placement(s)