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

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 7 3 + 2 0 English

Instructor Assistant Coordinator
Adnan Hodžić, Senior Teaching Assistant Elmedin Selmanović, Assist. Prof. Dr.
[email protected] no email

COURSE OBJECTIVE
The course explains the most important algorithms and data structures in
use on computers today. Special focus is put on sorting, searching, and
string processing algorithms and related data structures. Other fundamental
algorithms from different areas are covered as well, such as geometric and
graph algorithms. The course will concentrate on developing
implementations, understanding their performance characteristics, and
estimating their potential effectiveness in applications.

COURSE CONTENT
Week
Topic
  1. Introduction to the Course
  2. Algorithm Analysis
  3. Sorting I
  4. Sorting II
  5. Searching I
  6. Searching II
  7. Graphs I
  8. MIDTERM EXAM
  9. Graphs II
  10. Graphs III
  11. Strings I
  12. Strings II
  13. Project Presentations
  14. FINAL EXAMINATION

LABORATORY/PRACTICE PLAN
Week
Topic

    TEACHING/ASSESSMENT
    Description
    • Lectures
    • Practical Sessions
    • Excersises
    • Presentation
    • Project
    • Assignments
    Description (%)
    Method Quantity Percentage (%)
    Quiz30
    Homework20
    Project10
    Midterm Exam(s)15
    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 Examination70
    Total Workload: 0
    ECTS Credit (Total workload/25): 0