Please use this identifier to cite or link to this item:
http://hdl.handle.net/10267/15832
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sanders, Betsy Williams | - |
dc.date.accessioned | 2013-03-19T14:22:23Z | - |
dc.date.available | 2013-03-19T14:22:23Z | - |
dc.date.issued | 2009-02-17 | - |
dc.identifier.uri | http://hdl.handle.net/10267/15832 | - |
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 | This course provides a tour into the mathematical underpinning of computer science. To understand what this course is about, we must first understand what the term “discrete structures” means. Discrete mathematical structures refer to structures or objects that are fundamentally discrete rather than continuous. Examples of discrete objects are integers (whole numbers), binary numbers (or logical values), graphs, information on a digital computer, etc. In contrast, the real number set is not discrete. For example, there are infinitely many real numbers (even rational numbers) between 7 and 8 while there is no integer “between” 7 and 8. In computer science, the topics that are normally covered in a discrete mathematics course are counting (permutations and combinations), discrete functions, basic number theory, relations and order relations, number systems, logic, sets, graph theory (especially trees), proof techniques, and finite state machines and languages. We’ll introduce all of these ideas in this course! This course is important to your studies in computer science because it lays the mathematical reasoning and problem solving background necessary for approaching more advanced computing problems. It provides you with a language that you need to discuss computer systems and it provides you with a toolbox full of problem solving techniques. | en_US |
dc.language.iso | en_US | en_US |
dc.publisher | Memphis, Tenn. : Rhodes College | - |
dc.relation.ispartofseries | Syllabi CRN;22266 | - |
dc.rights | Rhodes 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.subject | Mathematics and Computer Science, Department of | en_US |
dc.subject | 2012 Spring | en_US |
dc.subject | Curriculum | en_US |
dc.subject | Syllabus | en_US |
dc.subject | Academic departments | en_US |
dc.title | CS 172-01, Discrete Structures for Computer Science, Spring 2012 | en_US |
dc.type | Text | en_US |
Appears in Collections: | Course Syllabi |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
2012_Spring_CS_172-01_22266.pdf | 202.01 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.