Prerequisite: CIS 183 or CIS 115, or permission of instructor.
Introduction to data structures and fundamental algorithms. This course covers the design and implementation of dynamic data structures including linked list, queue, stack, heap, trees and graphs. This course also provides comprehensive coverage of fundamental groups of algorithms, including divide-and-conquer, dynamic programming, and greedy algorithms.
Class#
Sct
Type
Seats
Units
2770
7101
Other
25
3.00
Days
Location
MONTUEWEDTHUFRISAT
Online
Instructor: Ryan Robidoux
Class status: O
Prerequisite: CIS 183 or CIS 115, or permission of instructor.