CISC 320 - Introduction to Algorithms

Credit(s): 3

INTRODUCTION TO ALGORITHMS
Component: Lecture
Design and analysis of algorithms: worst/average case analysis, proofs for correctness and performance of algorithms. Algorithmic strategies (divide and conquer, greedy methods, dynamic programming, etc.). Algorithms for searching, forming and traversal of strings, trees and graphs. Categorization of computational problems: classes P and NP. NP completeness.
Repeatable for Credit: N Allowed Units: 3 Multiple Term Enrollment: N Grading Basis: Student Option

PREREQ: MATH 210 and a minimum grade of C- in CISC 220.

Course Typically Offered: Fall and Spring

General Education Objectives:
GE1B: Analyze Arguments and Information GE1C: Engage in Constructive Ideation GE2A: Communicate Effectively in Writing GE5A: Reason Quantitatively GE5B: Reason Computationally