Skip Navigation Links Türkçe  
Skip Navigation Links.

BİM213 - Data Structures and Algorithms

Instructor: Dr. Öğretim ÜyesiMehmet FİDAN
Teaching Assistants:
Course Book: Problem Solving with Algorithms and Data Structures:Release 3.0-Brad Miller, David Ranum, 2013
Grading: Project:15%, Homework:15%, Midterm1:15%, Midterm2: 15%, Final:40%
Other Resources: 1. Data Structures and Algorithms with Python - K. D. Lee, S. Hubbard, Springer. 2. Data Structures and Algorithms in Python - M.T. Goodrich, R.Tamassia and M.H. Goldwasser, Wiley (www.it-ebooks.info)
Course Outline:
1. Week

Algorithm Analysis

Types of Complexities


2. Week

Performance of Python Data Structures


3. Week

Basic Data Structures

Stacks

Queues

Decks

 


4. Week

Lists

Unordered Lists

Linked Lists

Ordered Lists


5. Week

Review of Time Complexity

Comparison of Lists and Linked Lists


6. Week

Recursion:

1. Linear Recursion

2. Binary Recursion

3. Tail Recursion


7. Week

Searching Algorithms

1. Sequential Search

2. Binary Search


8. Week

Searching Algorithms

3. Hashing

3.1. HashSets

3.2. HashMaps


9. Week

Sorting Algorithms

1.Bubble Sort 2.Selection Sort

3. Insertion Sort 4. Shell Sort

5. Merge Sort 6. Quick Sort

 


10. Week

Trees

Binary Search Trees

Heaps


11. Week

Balanced Binary Search Trees


12. Week

Home | Department | Undergraduate | MS Program | PhD Program | Research | Continual Improvement

© 2011 CENG. All rights reserved.

Valid XHTML 1.0 Transitional Valid CSS!