CS211

Data Structure and Algorithms

Instructor: Modhi

Contact Info.

- email: msbayhey@taibahu.edu.sa
- twitter: https://twitter.com/cs_course_at_tu
- office hours: TBA and posted on the office- room 331

PLEASE! Allow 48 hours before following up!

Main Site

Course Info

Learning outcomes

Books

vClasses

TBA

Handouts

Recursion Exercises

Ref: Chapter 5 in the text

2. Complexity Analysis

A Gentle Introduction to Algorithm Complexity Analysis

Ref: Chapter 2 in the text

3. Linked Lists

Ref: Chapter 3 in the text

Example simple linked list code

Ref: Chapter 4 in the text

Queue - Linked List implementation

5. Trees

- Part1
- Part2

Ref: Chapter 6 in the text

Tree Operations Illustration

Tree traversal illustration

Example Tree Implementation

7. Searching and Sorting Algorithms

Searching algorithms: Reading

Sorting algorithms: Reading1 - Reading2

- 1. Bubble Sort
  2. Selection Sort
  3. Insertion Sort
  4. Heap Sort

Lab Packets

- Packet1 Due date: 1 wk after- from the lab session
- Packet2 Due date: 1 wk after- from the lab session
- Packet3 Due date: 1 wk after- from the lab session
- Packet4 Due date: 1 wk after- from the lab session
- Packet5 Due date: 1 wk after- from the lab session
- Packet6 Due date: 1 wk after- from the lab session
- Packet7 Due date: 1 wk after- from the lab session
- Packet8 Due date: 1 wk after- from the lab session
- Packet9 Due date: 1 wk after- from the lab session
- Mini Project Due date: as stated in the description

Extra Practice

Sample Exam Questions

1. Sample 1 4. Sample 4

(Haven't reviewed the answers)

2. Sample 2 5. Sample 5

(Haven't reviewed the answers)

Recourses

Visualization of all algorithms

Page updated

Google Sites

Report abuse