Computing and Information Technology Interactive Digital Educational Library

 

CITIDEL >
Syllabus Collection >
Syllabus >

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

Title: Discrete Structures
Authors: WPI Computer Science
Issue Date: 
Publisher: WPI Computer Science
Citation: http://www.cs.wpi.edu/~ghamel/courses/cs501/fall.99/syllabus.html
Abstract: CS 501 Discrete Structures Fall Semester 1999 Monday, 6:00 - 8:50 pm, FL 311 Glynis Hamel office hours by appointment ghamel@cs.wpi.edu FL 139 Overview: This course provides an introduction to some of the mathematical concepts that computer scientists find useful in their work. Except for email communication and WWW resources, we will not be using computers in this course. Some experience with recursive programming would be helpful. Text: Rosen, Kenneth H., ``Discrete Mathematics and its Applications'', 4th Edition, McGraw-Hill, 1999 Homework: Homework will be assigned weekly, and will be due at the beginning of the following class meeting. Late homework will not be accepted. Your homework is to be done individually. If you have problems with the homework, schedule a time to meet with me during the week, or contact me by email. Each week I will grade two or three problems from the homework set. Homework will count for 30% of your final grade. Exams: Two exams will be given, each worth 35% of your final grade. Each exam will be one full class period long. Tentative dates for the exams are October 25 and December 13. No makeup exams will be given. Web Pages: Check out the CS 501 Web pages at http://www.cs.wpi.edu/~ghamel/courses/cs501/fall.99/ Handouts, sample exams, course schedule, and other course material can be found here. Syllabus: The class will cover the following topics: (sections of the textbook in parentheses) * Propositional Calculus and Predicate Calculus (1.1, 1.2, 1.3) * Integers (2.3, 2.4) (read these sections for background) * Methods of Proof (3.1) * Sets and Counting (1.4, 1.5, 4.1, 4.3, 4.6, 5.5) * Mathematical Induction and Recursion (1.7 (pp. 69 - 76), 3.2, 3.3, 3.4, 3.5) * Functions (1.6, 1.7 (pp. 76 - 78), 1.8 (pp.80 - 88), 2.2, 4.2) * Relations (Chapter 6) * Graphs and Trees (Chapter 7, Chapter 8) * Algebraic Structures (Chapter 9) About this document ... This document was generated using the LaTeX2HTML translator Version 96.1 (Feb 5, 1996) Copyright © 1993, 1994, 1995, 1996, Nikos Drakos, Computer Based Learning Unit, University of Leeds. The command line arguments were: latex2html -split 0 syll.tex. The translation was initiated by Glynis Hamel on Fri Aug 20 12:39:17 EDT 1999 Glynis Hamel Fri Aug 20 12:39:17 EDT 1999
URI: http://www.citidel.org/handle/10117/7206
Appears in Collections:Syllabus

Files in This Item:

File SizeFormat
76-syllabus.html3KbHTMLView/Open

All items in DSpace are protected by copyright, with all rights reserved.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2006 MIT and Hewlett-Packard - Feedback