Please use this identifier to cite or link to this item:
Title: COMP 172-01, Discrete Structures for Computer Science, Fall 2007
Authors: Williams, Betsy
Keywords: Computer Science, Department of;Syllabus;Curriculum;Academic departments;Text;2007 Fall
Issue Date: 26-Jun-2008
Publisher: Memphis, Tenn. : Rhodes College
Series/Report no.: Syllabi CRN
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.
Appears in Collections:Course Syllabi

Files in This Item:
File Description SizeFormat 
2007_fall_CS_172-01_18179.pdf38.66 kBAdobe PDFThumbnail

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.