INTERNATIONAL BURCH UNIVERSITY
Faculty of Engineering and Natural Sciences
Department of Information Technologies
2014-2015

SYLLABUS
Code Name Level Year Semester
CEN 254 Data Structures Undergraduate 2 Spring
Status Number of ECTS Credits Class Hours Per Week Total Hours Per Semester Language
Compulsory 5 3 + 2 0 English

Instructor Assistant Coordinator
Dino Kečo, Senior Teaching Assistant Nejdet Dogru, Assist. Prof. Dr.
[email protected] no email

COURSE OBJECTIVE
The objective of this course is to give an introduction to the concepts of data structures and algorithms which are related to specific data structure. Main goal of the course is to give essential information that every serious programmer needs to know about algorithms and data structures.

All algorithms and data structures which are covered in this course will be implemented using Java programming language.

COURSE CONTENT
Week
Topic
  1. Introduction. Stacks and Queues
  2. Analysis of Algorithm
  3. Bubble Sort
  4. Elementary Sorts
  5. Merge Sort
  6. Quick Sort
  7. Radix Sort
  8. MIDTERM EXAM
  9. Heap
  10. Binary Search Trees
  11. Balanced Search Trees
  12. Hash Tables
  13. Undirected Graphs
  14. Directed Graphs
  15. FINAL EXAMINATION

LABORATORY/PRACTICE PLAN
Week
Topic

    TEACHING/ASSESSMENT
    Description
    • Lectures
    • Practical Sessions
    • Excersises
    • Presentation
    • Project
    • Assignments
    Description (%)
    Method Quantity Percentage (%)
    Quiz125
    Homework10
    Project20
    Midterm Exam(s)20
    Final Exam125
    Total: 100
    Learning outcomes
    • Implement basic numerical algorithms.
    • Implement simple search algorithms and explain the differences in their time complexities.
    • Be able to implement common quadratic and O(N log N) sorting algorithms.
    • Describe the implementation of hash tables, including collision avoidance and resolution.
    • Discuss the runtime and memory efficiency of principal algorithms for sorting, searching, and hashing.
    TEXTBOOK(S)
    • 1. Robert Sedgewick and Kevin Wayne, “Algorithms”, 4th ed., 2011

    ECTS (Allocated based on student) WORKLOAD
    Activities Quantity Duration (Hour) Total Work Load
    Lecture (14 weeks x Lecture hours per week)750
    Laboratory / Practice (14 weeks x Laboratory/Practice hours per week) 0
    Midterm Examination (1 week) 0
    Final Examination(1 week) 0
    Preparation for Midterm Examination 0
    Preparation for Final Examination7 0
    Assignment / Homework/ Project 0
    Seminar / Presentation 0
    Total Workload: 0
    ECTS Credit (Total workload/25): 0