CIT 266 - Data Structures and Algorithms

Min Credits: 3

This is an advanced programming course focusing on abstract data types and their implementation as data structures using object-oriented programming. Students will create and examine sequential and linked storage representations such as lists, stacks, queues, and tables. Students will create and examine nonlinear data structures such as trees and graphs. Students will implement and analyze recursion, sorting, searching, and algorithm complexity. This course includes hands on laboratory assignments requirig students to complete and submit programming projects.

Lecture: 2 Lab: 3
Prerequisite(s): CIT 165