Javascript is currently not supported, or is disabled by this browser. Please enable Javascript for full functionality.

    Sep 26, 2023  
2022-2023 Catalog 
2022-2023 Catalog [ARCHIVED CATALOG]

CSCI 255 - Introduction to Algorithms & Discrete Structures

An introduction to the design and analysis of algorithms along with some of the discrete mathematical structures that are fundamental to the field of Computer Science. This course builds on the data structures topics from CSCI 235  by exploring efficient ways of using them to solve problems. Algorithm analysis topics include best, worst, and average case analysis of iterative and recursive algorithms; asymptotic notation; and solving recurrence relations. Algorithm design techniques include brute force, greedy, divide-and-conquer, dynamic programming, and space/time tradeoff. Discrete structures topics include propositional logic, proof techniques (especially induction), sets, matrices, sequences and summations, and basic combinatorics.

Credits: 4
Terms Offered: Fall
Prerequisites: CSCI 235  with a grade of C- or better