Scribd
Upload
342 views3 pages

CS 310-Algorithms-Imdad Ullah Khan-Arif Zaman

This document provides information about the CS 310 - Algorithms course offered at Lahore University of Management Sciences in Spring 2015-2016. The course is taught by Imdad Ullah Khan and Arif Zaman, covers fundamental algorithm design techniques like divide-and-conquer, greedy algorithms, and dynamic programming. Students will learn major algorithms for sorting, graph traversal, and analyze asymptotic complexity. The course aims to equip students with tools and techniques to solve algorithmic problems and introduce complexity computation concepts. Students will be evaluated through assignments, homeworks, quizzes, projects, and midterm and final exams.

Uploaded by

Ali Shahid
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
342 views3 pages

CS 310-Algorithms-Imdad Ullah Khan-Arif Zaman

This document provides information about the CS 310 - Algorithms course offered at Lahore University of Management Sciences in Spring 2015-2016. The course is taught by Imdad Ullah Khan and Arif Zaman, covers fundamental algorithm design techniques like divide-and-conquer, greedy algorithms, and dynamic programming. Students will learn major algorithms for sorting, graph traversal, and analyze asymptotic complexity. The course aims to equip students with tools and techniques to solve algorithmic problems and introduce complexity computation concepts. Students will be evaluated through assignments, homeworks, quizzes, projects, and midterm and final exams.

Uploaded by

Ali Shahid
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Lahore University of Management Sciences

CS 310 Algorithms
Spring & 2015-2016

Instructor
Room No.
Office Hours
Email
Telephone
Secretary/TA
TA Office
Hours
Course URL
(if any)

Imdad Ullah Khan/ Arif Zaman


9-10A, CS Dept. Ground Floor, SBA-SSE Building
11:30-1:00 Mondays and Wednesdays
[email protected]
8198
Zulfiqar N Malik

Course Basics
Credit Hours
Lecture(s)
Recitation/Lab
(per week)
Tutorial (per
week)

3
Nbr
Per
Nbr
Per
Nbr
Per

of Lec(s)
Week
of Lec(s)
Week
of Lec(s)
Week

Duration

75 Minutes

Duration
Duration

Course Distribution
Core
Elective
Open for Student
Category
Close for Student
Category
COURSE DESCRIPTION
A first course in Algorithms, introducing unifying themes in algorithms such as Divideand-Conquer, Greedy, Dynamic-Programming, etc. Also makes the student familiar with the
major well-known algorithms for sorting, graph traversal, etc.
Introduction to analysis of asymptotic algorithmic complexity, reductions, and NP
completeness.
COURSE PREREQUISITE(S)

Discrete Mathematics

COURSE OBJECTIVES

To familiarize the student with the major algorithmic design and analysis
techniques.
To equip and enlarge the toolbox of algorithms to solve any given problem
To introduce the concepts of complexity and its computation.

Lahore University of Management Sciences


Learning Outcomes
At the end of the course, the student shoud be able to
Reduce a described problem to some classical problem, if such a reduction

exists.

Create an algorithm to solve a problem, using standard general approaches.

Analyze the complexity of an algorithm, and recognize when a realistic


solution is not possible
Grading Breakup and Policy
Assignment(s):
Home Work:
Quizzes, In-class problems and attendance
Midterm Examination:
Project:
Final Examination:

15
25
25
35

Examination Detail
Midterm
Exam

Final
Exam

Duration: 75 minutes
Preferred Date: Seventh week
Exam Specifications: Closed Book, may bring one sheet of hand-written notes

Duration: 2 hours
Exam Specifications: Closed Book, may bring one sheet of hand-written notes

COURSE OVERVIEW
Topics

Foundations, Asymptotic
Growth

Graph algorithms, BFS, DFS,

Dynamic Programming

Network Flow

NP-Completeness

Greedy Algorithms, Interval


Scheduling, Dijkstra, MST
Divide and Conquer
Algorithms and Recurrence
relations
Greedy Algorithms: MST,
Huffman encoding,

Objectives/
Application

Lahore University of Management Sciences


Textbook(s)/Supplementary Readings
Required:
Algorithm Design by J. Kleinberg and E. Tardos
Supplementary:
Algorithms by Dasgupta, Papadimitriou and Vazirani (latest version available online at
U. C. Berkeley)
Introduction to Algorithms, Third Edition, by Thomas H. Cormen, Charles E. Leiserson,
Ronald L. Rivest and Clifford Stein

You might also like