Catalog Entries |
2018 Fall
May 14, 2024 |
|
 |
||
| Return to Previous | New Search |
= This course has restrictions
= There are pre-requisites to take this course
= This course has co-requisites.
= There are fees to take this course.
 | Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course. |
| CIS 3223 - Data Structures and Algorithms |
|
This course is typically offered in Fall and Spring. 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.
|
|