Skip Navigation Links.

BIM213 - Data Structures and Algorithms

Instructor: Asst.Prof.Dr.Alper Kürşat UYSAL
Teaching Assistants:
Course Book: Data Structures & Problem Solving Using Java, Mark Allen Weiss, 4th Edition, Pearson, 2012
Grading: Midterm I: 20%, Midterm II: 20%, Homeworks: 20% Final: 40%
Other Resources:
Course Outline:
1. Week

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


2. Week

Iterative Sorting Algorithms - Bubble Sort, Selection Sort, Insertion Sort
https://www.cs.usfca.edu/~galles/visualization/Algorithms.html -- Animations


3. Week

Introduction to Divide-Conquer (Recursive) Algorithms


4. Week

Lists & Array Implementation - ArrayList


5. Week

Linked Lists


6. Week

MIDTERM I


7. Week

Stacks and Queues


8. Week

Trees


9. Week

Binary Search Trees


10. Week

AVL Trees


11. Week

Splay Trees
 


12. Week

MIDTERM II


13. Week

B-Trees


14. Week

Hash Tables


Home | Department | Undergraduate | Graduate | Research | Continual Improvement

© 1993-2017 CENG. All rights reserved.