CSC 260 Data Structures and Algorithms

4 Credit(s)

Basic data structures such as stacks, queues, linked lists, and trees are studied and applied to problems in data storage and manipulation. Applications include basic searching and sorting algorithms. Design, analysis and implementation techniques are discussed. Three lecture hours and three hours of scheduled laboratory per week, plus extensive programming work outside of class. Prerequisites: CSC 101 or CSC 200A, and CSC 115 or CSC 202J.