2013-2014 Undergraduate and Graduate Catalog (without addenda) 
    
    Nov 22, 2024  
HELP
2013-2014 Undergraduate and Graduate Catalog (without addenda) [ARCHIVED CATALOG]

Facebook this Page (opens a new window)
Tweet this Page (opens a new window)

CS 6033 Design and Analysis of Algorithms I

3 Credits
This course reviews basic data structures and mathematical tools. Topics: Data structures, priority queues, binary search trees, balanced search trees. Btrees. Algorithm design and analysis techniques illustrated in searching and sorting: heapsort, quicksort, sorting in linear time, medians and order statistics. Design and analysis techniques: dynamic programming, greedy algorithms. Graph algorithms: elementary graph algorithms (breadth first search, depth first search, topological sort, connected components, strongly connected components), minimum spanning tree, shortest path. String algorithms. Geometric algorithms. Linear programming. Brief introduction to NP completeness.

Prerequisite(s): Graduate status, CS 5403  and CS 6003 .
Weekly Lecture Hours: 3 | Weekly Lab Hours: 0 | Weekly Recitation Hours: 0


Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
Catalog Navigation
  Bulletin Home
  Institute Profile
  Administration and Board of Trustees
  Admissions, Financial Aid, Tuition and Fees
  Administrative Offices
  Communication Policy
  Institute Compliance and Other Guidelines
  Statistics on Enrollment and the Student Body
  2013-2014 Academic Calendar
  Academic Department, Degree and Program Information
  List of Academic Programs and Curricula
  Course Descriptions
  Undergraduate Academic Requirements and Policies
  Graduate Academic Requirements and Policies
  Academic Success, Advising and Tutoring Services
  Registration
  Special Programs
  Student Services
  Index of HEGIS Codes
  Previous & PDF Catalogs