Skip Ribbon Commands
Skip to main content

Course

BS - Theory of Algorithms

Description

Definition of an algorithm; Algorithm design and techniques, such as sequential versus divide-and-conquer; Algorithm analysis; Concept of basic operations; Concept of worst, best, and average case analysis; Complexity analysis: big O, Omega and Theta notations; Recurrence equations and recursive algorithms; Searching and sorting algorithms; Concept of graphs; Graph algorithms.

Academic Year

Undergraduate Level - Third Year

Attachments

Created at 7/19/2010 4:44 PM by Basel Mahafzah
Last modified at 9/29/2018 12:58 PM by Basel Mahafzah