Skip Navigation Links.

BIM213 - Data Structures and Algorithms

Instructor: Asst. Prof. Dr. Selcan KAPLAN BERKAYA
Teaching Assistants:
Course Book: Data Structures & Problem Solving Using Java, Mark Allen Weiss, 4th Edition, Pearson, 2012
Grading: Midterm I: 30%,Homeworks:15%, Project: 15%, Final: 40%
Other Resources:
Course Outline:
1. Week

Algorithm Analysis and Asymptotic (Big-O, Omega, Theta) notations

2. Week

Iterative Sorting Algorithms - Bubble Sort, Selection Sort, Insertion Sort -- Animations

3. Week

Introduction to Divide-Conquer (Recursive) Algorithms

4. Week

Lists & Array Implementation - ArrayList

5. Week

Linked Lists

6. Week

Stacks and Queues

7. Week


9. Week


Binary Search Trees

10. Week

AVL Trees

11. Week

Splay Trees

12. Week


13. Week

Hash Tables

14. Week

Course Recap

Home | Department | Undergraduate | Graduate | Research | Continual Improvement FACEBOOK TWITTER INSTAGRAM LINKEDIN YOUTUBE

© 1993-2021 CENG. All rights reserved.