CS 212 Design and Analysis

CS 212 Design and Analysis - CS 212 Design and Analysis of...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 212 Design and Analysis of Algorithms Summary Design and analysis of algorithms using six algorithmic design techniques: divide-and-conquer, greedy method, dynamic programming, tree and graph traversals, backtracking, and branch-and-bound. Lower bound theory. NP-complete theory. Prerequisites: CS 123, CS 133. Text: Introduction to Algorithms, Cormen, leiserson and Rivest, McGraw-Hill, 2001 Announcement: The classroom has been changed to Phillips Hall 306. Summer 10 Handouts Sample Work: Summer 2001 Lecture ±otes Introduction Data Structures Divide and Conquer The Greedy Method Dynamic Programming Graph Traversal Techniques Backtracking Branch and Bound NP-Complete Theory Other Resources Lectures Notes on Data Structures Course Outline CS 212 Design and Analysis of Algorithms http://www.seas.gwu.edu/~ayoussef/cs212/ 1 of 2 9/3/2010 4:53 AM
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Basic Principles of Algorithm Design and Analysis 1. Data Structures: Stacks, queues, linked lists, trees, binary search trees, heaps, graphs, sets, union-find
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

CS 212 Design and Analysis - CS 212 Design and Analysis of...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online