Comparative analysis of algorithms and data structures. Data structures include heaps, priority queues, binary and general trees, binary search trees, AVL trees, Red-Black trees, B-trees, and graphs. Algorithms include heapsort, topological sort, breadth-first search, depth-first search, shortest path algorithms, and Greedy algorithms. Students will gain experience working in a group on at least one moderate-size project. NOTE: For Computer Science Majors.

For any CIS prerequisite course taken prior to Spring 2012 a grade of C or better is required.
Credit Hours: 3.000

Levels: Graduate, NonDegree Continuing Undergrad, Undergraduate
Schedule Types: Base Lecture

Division: Undergraduate
Department: CST:Computer & Info Sci

General Requirements:
(  Course or Test: CIS 2166 | Minimum Grade of C- | May not be taken concurrently.  )
AND (  Course or Test: CIS 2168 | Minimum Grade of C- | May not be taken concurrently.  )
AND (  Course or Test: CIS 2033 | Minimum Grade of C- | May not be taken concurrently.  )
OR
(  Course or Test: MATH 3031 | Minimum Grade of C- | May not be taken concurrently.  )
AND (  Course or Test: MATH 1042 | Minimum Grade of C- | May not be taken concurrently.  )
OR
(  Course or Test: MATH 1942 | Minimum Grade of C- | May not be taken concurrently.  )
OR
(  Course or Test: MATH 1951 | Minimum Grade of C- | May not be taken concurrently.  )
OR
(  Course or Test: MATH 2043 to 3080 | Required Courses: 1 | Minimum Grade of C- | May be taken concurrently.  )
OR
(  MA07 Y - May not be taken concurrently.  )
OR
(  MATW Y - May not be taken concurrently. )