COURSE UNIT TITLE

: ALGORITHMS AND DATA STRUCTURES

DEGREE PROGRAMMES

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
BIL 2001 ALGORITHMS AND DATA STRUCTURES COMPULSORY 4 0 0 6

Offered By

Computer Science

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

INSTRUCTOR ALPER VAHAPLAR

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

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Introduction Basic and composed data structures
2 Data Models
3 Running time and memory request of an algorithm
4 Sorting algorithms
5 Sorting algorithms (continue )
6 Searching algorithms
7 Searching algorithms (continue )
8 Midterm exam
9 Linked lists and applications
10 Linked lists and applications (continue )
11 Stack and Queue data models
12 Tree data model
13 Tree data model (continue )
14 Tree applications Data compressing methods

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 QUZ QUIZ
3 ASG ASSIGNMENT
4 FIN FINAL EXAM
5 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.30 + QUZ * 0.10 + ASG * 0.10 + FIN * 0.50
6 RST RESIT
7 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.30 + QUZ * 0.10 + ASG * 0.10 + RST * 0.50


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 13 4 52
Preparations before/after weekly lectures 12 2 24
Preparation for midterm exam 1 12 12
Preparation for final exam 1 20 20
Preparation for quiz etc. 2 3 6
Preparing assignments 2 10 20
Final 1 2 2
Midterm 1 2 2
Quiz etc. 2 1 2
TOTAL WORKLOAD (hours) 140

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10PO.11PO.12PO.13
LO.1545355455
LO.255525455
LO.3554355
LO.455332255
LO.54554345

CONTACT INFORMATION
Dokuz Eylül Üniversitesi Cumhuriyet Bulvarı No: 144 35210 Alsancak / İZMİR
Phone: +90(232) 412 12 12 - Fax: +90 (232) 464 81 35

Copyright 2015 DEÜ. BİD

HOME / ABOUT US / DEGREE PROGRAMMES / GENERAL INFORMATION FOR STUDENTS / INTERNATIONAL RELATIONS