Recent SemestersFall 2026, Spring 2026, Fall 2025, Spring 2025Class SizeNot publishedCredits4PrerequisiteCISP 400 with a grade of "C" or better Transfers ToCSUDescriptionThis is a course in data structures for computer science. Topics include time complexity analysis and big-O notation, searching and sorting, linked lists, stacks, queues, priority queues, lists, binary trees, B-trees, AVL trees, splay trees, graphs, and hash tables. Analysis of algorithms including mergesort, quicksort, heapsort. Graph theory, including shortest paths, topological sort, depth-first search, minimum spanning tree. If time permits, any of the following topics: tries, Huffman codes, branch and bound, Fibonacci heaps, critical path analysis, Open Shortest Path first (OSPF), and basic encryption algorithms. Computer Information Science 221Usually HeldThu 10:30am–11:50am, Thu 6:00pm–7:20pm 