1. Rhodes College Digital Archives - DLynx
  2. Academics
  3. Course Syllabi
Please use this identifier to cite or link to this item: http://hdl.handle.net/10267/16007
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKirlin, Phillip-
dc.date.accessioned2013-03-28T16:40:03Z-
dc.date.available2013-03-28T16:40:03Z-
dc.date.issued2009-03-01-
dc.identifier.urihttp://hdl.handle.net/10267/16007-
dc.descriptionThis syllabus was submitted to the Rhodes College Office of Academic Affairs by the course instructor. Uploaded by Archives RSA Josephine Hill.en_US
dc.description.abstractAn introduction to and survey of the mathematics used in computer science including propositional and predicate logic, proof techniques, induction, sets, counting, prob- ability, functions, and relations. Other topics may be included as time permits.en_US
dc.language.isoen_USen_US
dc.publisherMemphis, Tenn. : Rhodes College-
dc.relation.ispartofseriesSyllabi CRN;23256-
dc.rightsRhodes College owns the rights to the archival digital objects in this collection. Objects are made available for educational use only and may not be used for any non-educational or commercial purpose. Approved educational uses include private research and scholarship, teaching, and student projects. For additional information please contact archives@rhodes.edu. Fees may apply.-
dc.subjectMathematics and Computer Science, Department ofen_US
dc.subject2013 Springen_US
dc.subjectCurriculumen_US
dc.subjectSyllabusen_US
dc.subjectAcademic departmentsen_US
dc.titleCS 172-01, Discrete Structures for Computer Science, Spring 2013en_US
dc.typeTexten_US
Appears in Collections:Course Syllabi

Files in This Item:
File Description SizeFormat 
2013_SPRING_CS_172-01_23256.pdf78.57 kBAdobe PDFThumbnail
View/Open
Show simple item record


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