Saint Louis University Menu Search

CSCI 3100
Algorithms

Course Description

Introduction to analysis and complexity of algorithms. Big-O notation. Running time analysis of algorithms for traversing graphs and trees, searching and sorting. Recursive versus iterative algorithms. Complexity, completeness, computability.

Prerequisite(s):

CSCI 2100, MATH 1660, MATH 1510

Offerings

Show all
Fall 2018Kate HoldenerMWF 9:00am-9:50am
Fall 2017Erin Wolf ChambersMWF 11:00am-11:50am
Course webpage
Fall 2016Michael GoldwasserMWF 10:00am-10:50am
Course webpage
Fall 2015Theresa JeevanjeeMWF 10:00am-10:50am
Fall 2014Michael GoldwasserMWF 10:00am-10:50am
Course webpage
Fall 2013Erin Wolf ChambersMWF 1:10pm-2:00pm
Course webpage
Fall 2012Michael GoldwasserMWF 1:10pm-2:00pm
Course webpage
Spring 2011David LetscherMWF 1:10pm-2:00pm
Spring 2010Erin Wolf ChambersMWF 1:10pm-2:00pm
Course webpage
Spring 2009Erin Wolf ChambersMWF 1:10pm-2:00pm
Course webpage
Spring 2008Michael GoldwasserMWF 1:10pm-2:00pm
Course webpage
Spring 2007Michael GoldwasserMWF 1:10pm-2:00pm
Course webpage
Spring 2006Michael GoldwasserMWF 12:00pm-12:50pm
Course webpage