Lectures:
09-03-2015 Week 01: Introduction
16-03-2015 Week 02: Introduction to Sorting
25-03-2015 Week 03: Growth of Function
30-03-2015 Week 04-05: Divide and Conquer
13-04-2015 Week 06: Quick Sort
15-04-2015 Week 06: Data Structures
20-04-2015 Week 07: Linear Time Sorting Algorithms
28-04-2015 Week 08: Midterm
04-05-2015 Week 09-10: Dynamic Programming
18-05-2015 Week 11: Greedy Algorithms
25-05-2015 Week 12: Elementary Graph Algorithms
01-06-2015 Week 13: Minimum Spanning Tree
08-06-2015 Week 14: Single Source Shortest Path
15-06-2015 Week 15: Huffman Codes
Assignments:
Assignment 01: Algorithm Design and Analysis in Action (Deadline 29th March, 10:00pm)
Assignment 02: Executing Time Analysis (Deadline 22nd May, 11:00pm)
Assignment 03: Research Papers Citations Analysis Data Set (Deadline 09 June, 11:0pm)
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; Ph.D Faculty Offices; Email: waheed.iqbal (at) puci.edu.pk
Lectures: MSc-Morning:Monday and Wednesday 9:45:30-11:10, Room# 7; MSc-Afternoon: Monday and Wednesday 1:00-2:30 Room# 7
Textbooks: Cormen, Leiserson, Rivest, and Stein, Introduction to Algorithms , 3rd Edition, MIT Press