Go to Main Content

Framingham State University



Catalog Entries


Fall 2009
Sep 01, 2015
Transparent Image
Information Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course.

CSCI 347 - Analysis of Algorithms
A presentation of asymptotic time and space complexity of sequential and parallel algorithms, using big-O and related notation. Complexity classes P and NP (tractable and intractable problems) and verification of algorithms by formal methods are also discussed. Prerequisites: CSCI 271 Data Structures and MATH 292 Discrete Mathematics I.
1.000 Credit hours
4.000 Lecture hours

Levels: Non-Matriculated, Post-Baccalaureate, Undergraduate
Schedule Types: Independent/Directed Study, Lecture

Computer Science Department

Course Attributes:
Undergraduate Level Course

Return to Previous New Search XML Extract
Transparent Image
Skip to top of page
Release: 8.5.4