CS310: Algorithms and Data Structure

Instructor: Beenish Chaudry
Office Number: Dennis Hall 204
E-mail: bchaudhry@cs.earlham.edu
Class Times: MTWR 9:00 am - 9:50am
Class Location: Dennis Hall 231
Course Information: Syllabus
TextBook: Introduction to Algorithms. Cormen, Leiserson, Riverst and Stein. 3rd Edition. 2009
Schedule
Week Mondays Tuesdays Wednesdays Thursdays
8/22-8/24 - - Introductions Insertion Sort I
HW 1 (Due 9/3)
Page 22: 1,2,3,4
Page 29: 2,3,4
Write Pseudocode for CheckSort
8/27-8/31 Insertion Sort II Selection Sort Selection Sort II Review
9/3-9/7 Merge Sort I Merge Sort II Asymptotic Notation I Asymptotic Notation II
9/10-9/14 Asymptotic Notation III Asymptotic Notation IV
HW 2 (Due 9/25)
Pg39: 3,4,5,6 Prob: 1,2
Asymptotic Notation V Asymptotic Notation VI
9/17-9/21 Search Problem Binary Search Recursion Tree 1 Recursion Tree 2
9/24-9/28 Master Method I Master Method II
HW 3 (Due 10/2)
Pg93: 2,8
Pg97: 1b,d
Pg107: 1a,d,f, 2
 Master Method Substitution Method
10/1-10/5 Review Substitution Method Substitution Method Practice Midterm
10/8-10/12 Review Review Midterm Exam Break
10/15-10/19 Quick Sort Quick Sort Quick Sort
7.2:4,5; 7.3:1,2
7.4:2,5 Problem 4
QuickSort
(QuickSort.cpp)
due 10/23		 Stacks & Queues
10/22-10/25 Priority Queues Linked Lists Linked Lists Heaps
10.1: 2
10.2: 2,3,5,7
Problem 10-1 (due 11/2)
10/29-11/2 Heaps HeapSort Counting Sort Bucket Sort, Radix Sort
(due Fri. 11/9)
6.5: 6,9
Pg 166: 1,2
8.2: 3,4; 8.3: 5
8.4: 2;
Pg 206: 2,3
11/5-11/9 No Class No Class Hash Hash Functions
11/12-11/16 Hash Functions Applications Binary Search Trees Binary Search Trees
Pg261: 2,4,5
Pg277: 1,2,3
EC: Pg277: 5
11/19-11/23 Break Break Break Break
11/26-11/30 Binary Search Trees Red-Black Trees Red-Black Trees Red-Black Trees
Pg289: 5
Pg293: 1,4
Pg299: 5 (Search)
Pg311: 1,2
Pg313: 1
Pg322: 2 (due 12/5)
12/3-12/7 Review Review Practice Final Review

Web Resources