CS 172-01, Discrete Structures for Computer Science, Fall 2008

Gottlieb, Eric

Please use this identifier to cite or link to this item: http://hdl.handle.net/10267/15705

Full metadata record

DC Field	Value	Language
dc.contributor.author	Gottlieb, Eric	-
dc.date.accessioned	2013-02-28T16:50:02Z	-
dc.date.available	2013-02-28T16:50:02Z	-
dc.date.issued	2009-01-23	-
dc.identifier.uri	http://hdl.handle.net/10267/15705	-
dc.description	This 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.abstract	Many of the data structures, concepts, and techniques that you will learn about in later courses depend heavily on the mathematical ideas and structures that we will study in this class. We will examine topics including logic, sets, relations, functions, algorithms, number theory, induction, and basic counting techniques, and Boolean algebra.	en_US
dc.language.iso	en_US	en_US
dc.publisher	Memphis, Tenn. : Rhodes College	-
dc.relation.ispartofseries	Syllabi CRN;19549	-
dc.rights	Rhodes College owns the rights to the archival digital images in this repository. Images 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.subject	Syllabus	en_US
dc.subject	Academic departments	en_US
dc.subject	Mathematics and Computer Science, Department of	en_US
dc.subject	2008 Fall	en_US
dc.subject	Curriculum	en_US
dc.subject	Academic departments	en_US
dc.title	CS 172-01, Discrete Structures for Computer Science, Fall 2008	en_US
dc.type	Text	en_US
Appears in Collections:	Course Syllabi

Files in This Item:

File	Description	Size	Format
2008_FALL_CS_172-01_19549.pdf		275.57 kB	Adobe PDF	View/Open

Show simple item record