A continuation of the study of data structures begun in CS 210 with emphasis on the design and analysis of algorithms. Also an introduction to questions of efficiency and NP completeness. Prerequisites: CS 210 , CS 270 , MATH 111 , MATH 250 . (Group II)

Global Search Catalog Search
Choose Search Location

Search Keyword Field

Whole Word/Phrase
Advanced Search

Catalog Navigation

Catalog Home

The University

Academic Regulations and Procedures

Academic Honors and Distinctions

Degrees and Special Programs

Majors and Minors

Courses of Instruction

Student Engagement and Success and Non-Academic Regulations

Expenses and Financial Aid

Facilities

Prizes and Awards

Corporation (Board of Trustees)

University Personnel