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
BIL 2011	ALGORITHMS AND DATA STRUCTURES	COMPULSORY	2	2	0	6

Offered By

Computer Science

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

PROFESSOR DOCTOR EFENDI NASIBOĞLU

Offered to

Computer Science

Course Objective

This course aims to teach data structures concept and properties. Arrays, stacks, queues, linked lists, trees, sorting and searching algorithms will be discussed In the course context.

Learning Outcomes of the Course Unit

1	Have a basic knowledge of primitive and composite data structures.
2	Have ability to analyze time and memory complexity of an algorithm.
3	Have a good knowledge of basic searching and sorting algorithms.
4	Have a good knowledge of list, queue, stack, and tree data models.
5	Have a basic knowledge of data compressing techniques.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

BIL 1012 - Introduction to Computer Science II

Recomended Optional Programme Components

None

Course Contents

Week	Subject	Description
1	Introduction to Data Structures and Data Models
2	Time and Memory Analysis
3	Linked lists
4	Linked lists (cont.)
5	Stack and Queue
6	Heap Data Structure and Application
7	Hash Tables
8	Midterm exam
9	Binary Search Tree
10	Tree Traversal Algorithms
11	Searching Algorithms
12	Sorting Algorithms
13	Sorting Algorithms (cont.)
14	Other Data Structures Topics

Recomended or Required Reading

Textbook(s):
Çölkesen, R., Veri Yapıları ve Algoritmalar Bilg. Prog. ve Yaz. Müh., Papatya Yayıncılık, 2002.
Carrano, F.M., Data Abstraction and Problem Solving with C++: Walls and Mirrors (4th Edition), Addison Wesley, 2004
Supplementary Book(s):
Lafore, R., Data Structures and Algorithms in Java (2nd Edition), Sams, 2002.

Planned Learning Activities and Teaching Methods

The course is taught in a lecture, class presentation and discussion format. Besides the taught lecture, group presentations are to be prepared by the groups assigned and presented in a discussion session. In some weeks of the course, results of the homework given previously are discussed.

Assessment Methods

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

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

Further Notes About Assessment Methods

None

Assessment Criteria

To be announced.

Language of Instruction

Turkish

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

efendi.nasibov@deu.edu.tr
emel.kuruoglu@deu.edu.tr

Office Hours

Will be announced.

Work Placement(s)

None

Workload Calculation

Activities	Number	Time (hours)	Total Work Load (hours)
Lectures	14	2	28
Tutorials	14	2	28
Preparations before/after weekly lectures	14	4	56
Preparation for midterm exam	1	10	10
Preparation for final exam	1	15	15
Preparation for quiz etc.	0	0	0
Preparations before/after weekly lectures	0	0	0
Final	1	2	2
Midterm	1	2	2
TOTAL WORKLOAD (hours)			141

Contribution of Learning Outcomes to Programme Outcomes

PO/LO	PO.1	PO.2	PO.5	PO.10
LO.1	5	5	4	5
LO.2	5	5	4	5
LO.3	5	5	4	5
LO.4	5	5	4	5
LO.5	5	5	4	5

COURSE UNIT TITLE

DEGREE PROGRAMMES

Description of Individual Course Units

Offered By

Level of Course Unit

Course Coordinator

Offered to

Course Objective

Learning Outcomes of the Course Unit

Mode of Delivery

Prerequisites and Co-requisites

Recomended Optional Programme Components

Course Contents

Recomended or Required Reading

Planned Learning Activities and Teaching Methods

Assessment Methods

Further Notes About Assessment Methods

Assessment Criteria

Language of Instruction

Course Policies and Rules

Contact Details for the Lecturer(s)

Office Hours

Work Placement(s)

Workload Calculation

Contribution of Learning Outcomes to Programme Outcomes

CONTACT INFORMATION