Design and Analysis of Algorithm (Fall 2013)

Courses‎ > ‎

Design and Analysis of Algorithm (Fall 2013)

Lectures:

03-09-2013 Week01: Introduction
09-09-2013 Week02: Insertion and Merge Sort
17-09-2013 Week03: Growth of Function
24-09-2013 Week04: Quiz, Big-Oh Revision and Examples
01-10-2013 Week05: Divide and Conquer
07-10-2013 Week06: Sorting in Linear Time
21-10-2013 Week 07: Revision
28-10-2013 Week 08: Midterm
05-11-2013 Week 09: Stacks, Queues, Hashtables
12-11-2013 Week 10: Binary Search Trees, Red-Black Trees
19-11-2013 Week 11-12: Dynamic Programming
02-12-2013 Week 13: Greedy Algorithms
09-12-2013 Week 14: Elementary Graph Algorithms
16-12-2013 Week 15: P, NP, NP-Complete, and NP-Hard
26-12-2013 Week 16: String Matching

Assignments:

S.No	Assignment	Due Date
01	Sequential Array Splitter	24-09-2013 (9:00 AM)
02	Sorting Algorithms Analyser	21-10-2013 (9:00 AM)
03	Rod Cutting Problem Analysis	09-12-2013 (9:00 AM)

Credit:

This course include materials from the following courses available at coursera:

Algorithms Part 1 by Kevin Wayne and Robert Sedgewick, Princeton University
Algorithms: Design and Analysis by Tim Roughgarden, Stanford University

Instructor: Waheed Iqbal; Faculty Office Room 10; Email: waheed751 at gmail.com.

Lectures: Tuesday 3:30-5:00 Room B-08, Thursday 9:00-10:30 Room B-07.

Office Hours: Monday 15:30-17:00, Wednesday 12:00-1:00

Textbooks: Cormen, Leiserson, Rivest, and Stein, Introduction to Algorithms , 3rd Edition, MIT Press and Sedgewick, Wayne, Algorithms , 4th Edition.

Waheed Iqbal	Search this site