Description
This course expands students' knowledge in an efficient algorithm design, introduces general data structures such as linked lists, stacks, queues, binary trees, binary search trees, heaps, and graphs. The course also expands knowledge of object-oriented programming, template library and classes. As a main tool, the pseudocode is implemented to represent algorithms based on main data structure processing. Besides main data structures, students will be introduced to sorting and search algorithms, recursion, and algorithms' efficiency. Some examples from business related applications are used to illustrate main data structures concepts.
Prerequisite: Completion of CIS 254 with a grade of 70% or higher is required. This course replaces CIS 256.