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 searching and sorting algorithms. Fundamental strategies for algorithm design are presented, analyzed, and evaluated. 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: CSC105 or CSC200a, and CSC115 or CSC202J.