CS 1350 - Computer Science II

Prerequisite(s): CS 1300 with grade C or better.
A continuation of CS 1300. More detailed object-oriented design; more data structures such as linked lists, stacks, queues, binary trees and heaps; recursion; well-known algorithms for searching and sorting; manipulating linked lists and binary trees; hashing. Students will learn to look at data from the perspectives of abstraction, implementation and application. Unscheduled laboratory. Credit(s): 3 (3 plus 0)