Document Type

Syllabus

Description

This is a fundamental course for students majoring in Computer Science. Students will learn: basic algorithm analysis techniques; asymptotic complexity; big-0 and big-Omega notations; efficient algorithms for discrete structures including lists, trees, stacks, and graphs; fundamental computing algorithms including sorting, searching, and hashing techniques.

Publication Date

Fall 2012

College

College of Engineering and Computer Science

Department

Computer Science

Course Number

CS 3100/5100


Share

COinS