CS 400/600: Data Structures and Software Design

Publication Year:
2010
Usage 7
Downloads 7
Repository URL:
https://corescholar.libraries.wright.edu/cecs_syllabi/265
Author(s):
Liu, Meilin
Tags:
Computer Engineering; Computer Sciences; Engineering; Physical Sciences and Mathematics
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.