CIS 2533 - Data Structures and Algorithms

3 Credits

The content covers data abstraction, various structures for data representation including lists, stacks, queues, trees, andgraphs, and associated operations. It also covers searching and sorting algorithms, hash tables, and their algorithmic analyses.

Prerequisite: CIS 1043 Computer Science II

Course Level Objectives
Upon successful completion of this course, the student will be able to:

1. Explain the need and use of abstract data types. (PLO 1, 2)
2. Demonstrate OOP concepts by developing a fully functional class. (PLO 1, 2)
3. Apply pointers in managing data. (PLO 1, 2)
4. Write an ADT-Linked List. (PLO 1, 2)
5. Write an ADT-Stack and Queue. (PLO 1, 2)
6. Employ recursion to solve a programming problem. (PLO 1, 2)
7. Construct and manipulate Binary and Multiway Trees. (PLO 1, 2)
8. Write and compare multiple sort algorithms. (PLO 1, 2)
9. Design and complete multiple projects. (PLO 1, 2)
10. Design and complete a final project. (PLO 1, 2)