Thumbnail Image
Publication

COMP 172-01, Discrete Structures for Computer Science, Fall 2007

Williams, Betsy
Citations
Altmetric:
Contributor
Photographer
Author
Williams, Betsy
Artist
Editor
Advisor
Keywords
Mathematics and Computer Science, Department of, Syllabus, Curriculum, Academic departments, 2007 Fall
Local ID
Collections
Course Syllabi
Show all metadata
Files
Thumbnail Image
2007_fall_CS_172-01_18179.pdf
Adobe PDF, 38.66 KB
URI
http://hdl.handle.net/10267/1964
Abstract
At end of this course you should be able to: • Use logical notation to define and reason about fundamental mathematical concepts such as sets, relations, functions, and integers. • Evaluate elementary mathematical arguments. • Synthesize induction hypotheses and simple induction proofs. • Calculate numbers of possible outcomes of elementary combinatorial processes such as permutations and combinations. • Analyze the running time of non-recursive algorithms with loops by means of counting. • Analyze the running time of divide and conquer recursive algorithms by means of recurrence equations. • Use trees and graphs to formulate computational problems.
Description
This syllabus was submitted to the Rhodes College Office of Academic Affairs by the course instructor.