CIS 2723 - Computer Science II

Credits: 3 Fall

This course is a continuation of CIS 2703 with emphasis upon good programming methodology (software engineering). The data structures of linked lists, stacks, queues and trees are developed along with an introduction to file structures. Recursion, searching and sorting algorithms are analyzed for order as well as time and space efficiency. Parallel sorting and searching algorithms are introduced. A high-level programming language will be used for programming.

Prerequisites: CIS 2703 and MATH 1163.