ITS-2592 - Computer Science II* (4)

Prerequisite: ITS 2591 or ITS 1390

This course builds on the first course training students to better employ advanced data-structures (two dimensional arrays, linked lists, stacks, queues, trees, heaps, priority queues, sets and maps) and algorithms (hashing, quick-sort, heap-sort) to large programming projects. Students learn how to manipulate various data-structures: traversal, insertion, and deletion. Efficiency of various data-structures is explored via worst and average-case time and space analysis. For students who plan to use personal computers, this course may have specific computing requirements. Please refer to the Quick Link for Computing Requirements on the Business and Technology website.

Course Fee: $40