Skip to main content

2024-2025 Undergraduate & Graduate Catalog [In Progress]

Search Help

CIS 263 - Data Structures and Algorithms

Algorithms and data structures, including heaps, hash tables, trees, graphs, greedy algorithms, divide and conquer, and dynamic programming will be covered. Analysis of algorithms as well as the complexity class of problems (P, NP, NPC) will be studied. Other topics include approximation, randomized algorithms and data structure implementation. (3-0-0) Offered fall and winter semesters. Prerequisites: (C or better in either CIS 163 or CIS 164) and (MTH 225 or STA 220).

Credits: 3



If you are in need of assistance please submit any questions or comments.