CIS 5333 - Algorithms & Data Structures

Credits: 3
This advanced course provides a comprehensive exploration of algorithms and data structures, essential for efficient problem-solving and software development in computer science. Students will delve into a wide array of data structures including arrays, linked lists, stacks, queues, trees, graphs, and hash tables, while mastering algorithm design techniques such as divide and conquer, dynamic programming, greedy algorithms, backtracking, and graph traversal. The course emphasizes algorithm analysis, focusing on time and space complexity using Big O, Big Theta, and Big Omega notations. Through a combination of theoretical study and hands-on projects, students will learn to implement and optimize algorithms, select appropriate data structures for specific tasks, and apply these concepts to solve complex computational problems. By the course’s end, participants will be equipped with the advanced skills necessary to design, analyze, and implement efficient algorithms and data structures in real-world scenarios.