Professional Documents
Culture Documents
CS 310 Algorithms
Spring & 2015-2016
Instructor
Room No.
Office Hours
Email
Telephone
Secretary/TA
TA Office
Hours
Course URL
(if any)
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.
exists.
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
Dynamic Programming
Network Flow
NP-Completeness
Objectives/
Application