CIS2533 — 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. (PLO 1, 2) Demonstrate OOP concepts by developing a fully functional class. (PLO 1, 2) Apply pointers in managing data. (PLO 1, 2) Write an ADT-Linked List. (PLO 1, 2) Write an ADT-Stack and Queue. (PLO 1, 2) Employ recursion to solve a programming problem. (PLO 1, 2) Construct and manipulate Binary and Multiway Trees. (PLO 1, 2) Write and compare multiple sort algorithms. (PLO 1, 2) Design and complete multiple projects. (PLO 1, 2) Design and complete a final project. (PLO 1, 2)
Prerequisites: CIS1043