|
DLynx at Rhodes College >
Academic Affairs, Office of >
Mathematics and Computer Science >
Computer Science. Syllabi >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10267/1964
|
| Title: | COMP 172-01, Discrete Structures for Computer Science, Fall 2007 |
| Authors: | Williams, Betsy |
| Keywords: | Computer Science
Syllabus
Curriculum
2007 Fall |
| Date Issued: | 26-Jun-2008 |
| Series/Report no.: | Syllabi CRN
18179 |
| 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. |
| URI: | http://hdl.handle.net/10267/1964 |
| Appears in Collections: | Computer Science. Syllabi
|
Items in DLynx are protected by copyright, with all rights reserved, unless otherwise indicated.
|
