Login
Course Information
Identification

CS 218: Design and Analysis of Algorithms
 
Description

Models of computation, algorithm analysis, time and space complexity, average and worst case analysis, lower bounds.
Algorithm design techniques: divide and conquer, greedy, dynamic programming, amortization, randomization.
Problem classes P, NP, PSPACE; reducibility, NP-hard and NPcomplete problems. Approximation algorithms for some NP-hard problems.
 
References

1. T.H.Cormen, C.E.Leiserson, R.L.Rivest, C. Stein, Introduction
to Algorithms, 2nd edition, Prentice-Hall India, 2001.
2. J. Kleinberg and E. Tardos, Algorithm Design, Pearson
International Edition, 2005.
 
Home Page

Not Available
 
Prerequisites

N/A
 
Other Details

Duration : Full Semester Total Credit : 0
Type : Theory
 
Current Semester (Autumn 2017-18)

Status : Not Offered Instructor : ---
 
Next Semester (Spring 2017-18)

Status : Offered Instructor : Prof. Bharat Adsul




Last Modified Date: 09-May-2016

Webmail

Username:
Password:
Faculty CSE IT
Forgot Password
    [+] Sitemap     Feedback