Analysis of Algorithm (Fall 2014)

• Syllabus

Lectures:

• 21-10-2014 Week 01: Introduction

• 27-10-2014 Week 02: Intro Sorting

• 06-11-2014 Week 03: Growth of Function

• 11-11-2014 Week 04-05: Divide and Conquer 

• 25-11-2014 Week 06: Sorting in Linear Time

• 27-11-2014 Week 06: Quick Sort

• 02-12-2014 Week 07: Dynamic Programming

• 09-12-2014 Week 08: Midterm 

• 16-12-2014 Week 09: Greedy Algorithms

• 13-01-2015 Week 10: Fractional and 0/1 Knapsack Problem 

• 20-01-2015 Week 11-12: Elementary Graph Algorithms

• 02-02-2015 Week 13: Minimum Spanning Tree

• 09-02-2015 Week 14: Single Source Shortest Problem

Assignments:

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; Senior Faculty Offices; Email: waheed.iqbal at puci.edu.pk

Lectures: BSCS5-Morning:Tuesday and Thursday 11:30-1:00, Room# 11; BSCS5-Afternoon: Tuesday and Thursday 4:00-5:30 Room# 11

Textbooks: Cormen, Leiserson, Rivest, and Stein, Introduction to Algorithms , 3rd Edition, MIT Press