{"id":77,"title":"Design and Analysis of Algorithms","credit_hour":"3","lecture_hour":"45","outcome":"<!DOCTYPE html>\r\n<html>\r\n<head>\r\n<\/head>\r\n<body>\r\n\r\n<\/body>\r\n<\/html>","description":"<!DOCTYPE html>\r\n<html>\r\n<head>\r\n<\/head>\r\n<body>\r\n<p>The study of complexity of algorithms: best case, worst-case and expected case analysis. Lower bound arguments; divide and conquer techniques; greedy algorithms. Computational complexity and intractability: Cook's Theorem. NP-completeness oracles and approximation. Polynomial hierarchy, heuristics.<\/p>\r\n<\/body>\r\n<\/html>","books":"<!DOCTYPE html>\r\n<html>\r\n<head>\r\n<\/head>\r\n<body>\r\n\r\n<\/body>\r\n<\/html>","created_at":"2016-09-18 11:37:23","updated_at":"2016-10-17 19:52:56"} Details | Department of Computer Science and Engineering, IUB

CSC 503: Design and Analysis of Algorithms

Offered Under: M.Sc. in Computer Science (CSC)

Description

The study of complexity of algorithms: best case, worst-case and expected case analysis. Lower bound arguments; divide and conquer techniques; greedy algorithms. Computational complexity and intractability: Cook's Theorem. NP-completeness oracles and approximation. Polynomial hierarchy, heuristics.

Prerequisites:

CSC 203 + Lab : Data Structure

CSC 306 + Lab : Algorithms

Course Type	Major
Credit Hour	3
Lecture Hour	45

Expected Outcome(s):

Suggested Books:

Grading Policy: