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 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

ASSISTANT PROFESSOR BARIŞ TEKIN TEZEL

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 Hash Tables (cont.)
9 Binary Search Tree
10 Binary Search Tree (cont.)
11 Tree Traversal Algorithms
12 Searching Algorithms
13 Sorting Algorithms
14 Sorting Algorithms (cont.)
15 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 VZ Vize
2 FN Final
3 BNS BNS VZ * 0.40 + FN * 0.60
4 BUT Bütünleme Notu
5 BBN Bütünleme Sonu Başarı Notu VZ * 0.40 + BUT * 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

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/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10PO.11PO.12PO.13
LO.15545
LO.25545
LO.35545
LO.45545
LO.55545

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