CSC-2592 - Computer Science II* (4)

Prerequisite: CSC-2591
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. ITS-2592 is now CSC-2592.

List Course Outcomes (consistent for all sections)
CO1 - Describe the concept of recursion and demonstrate its use.
CO2 - Select appropriate data structures and algorithms for a given situation including searches, operations on lists and abstract data types.
CO3 - Identify the roles of inheritance and polymorphism in creating hierarchical relationships between classes, enabling code reuse and extensibility.
CO4 - Describe and implement concurrent programming techniques, user interface development and event-based programming.
CO5 - Develop skills in writing effective unit tests for programs, debugging and using testing frameworks and techniques to ensure code correctness, reliability, and maintainability.

View Course Sections