Syllabus & Assignments: INFS 501 - Fall Semester 2009
See courses.gmu.edu after each class for an updated Syllabus & Assignments.
Instructor: William D. Ellis, E-mail: wellis1@gmu.edu
Office Hours: By appt. (usually Wed. 5-6 pm) Room 5323, Engineering Building
Teaching Asst: Anyi Liu, E-mail: wagnerliuay@gmail.com
Office Hours: By appointment
Web Site: http://courses.gmu.edu . Your ID = 1st part of your GMU e-mailaddress, before the @; Password = your e-mail password.
Schedule: Classes are Wednesdays, 7:20 - 10 pm in Robinson B201
9/02/2009 – 12/09/2009, except 11/25/2009 (14 classes).
Final Exam will be on Wednesday 12/16/2009, 7:30 - 10:15 pm.
Prerequisite: “Completion of 6 hours of undergraduate mathematics.” As a practical matter, you must have a working knowledge of algebra. Several free tutorials may be found on the Internet.
Topics: Course Catalog: “Study of discrete and logical structures for information systems analysis and design including basic set theory and proof techniques, propositional and predicate logic, trees and graphs, finite state machines, formal languages and their relation to automata, computability and computational complexity, formal semantics-operational, axiomatic and denotational approaches.” We will focus on problem solving.
Textbook: Discrete Mathematics with Applications, 3 edition (Dec. 22, 2003) By Susanna S. Epp, Publ: Brooks Cole; ISBN-10: 0534359450; ISBN-13: 978-0534359454. We will start with mathematical induction, a method of proof with maybe the least conceptual and notational overhead. With that apology, we’ll follow the textbook in this order: Chapters 4, 3, 5, 7, 10, 11, 1, and 2. Note the glossary of symbols inside the front and back covers.
Calculator: You will need a calculator capable of raising numbers to powers. No cell-phone calculators or calculator-sharing during exams.
Exams: We will have: (i) 3 Quizzes, (ii) 2 Hour Exams, and (iii) a comprehensive Final Exam on Dec. 16, 2009. Quizzes will be “closed book,” Exams will be “open book & notes.” Exams and Quizzes will never be given late.
Grades: 1 Final Exam: 45% of final grade.
2 Hour Exams: 20% of final grade each, 40% total.
Homework and Quizzes together: remaining 15% of final grade.
Help: Questions? Send me an e-mail! If you e-mail anything more than simple text, please send a .pdf.
Homework: Homework assignments will always be on the Syllabus. The Syllabus will be updated each week after class. See courses.gmu.edu. Homework will never be accepted late. Of the 13 Homework assignments, only the 12 with the highest percentage scores will be counted toward your grade.
Honor Code: Any Honor Code violations will be reported to the Honor Committee.
Homework Problem Sets Are Updated Weekly After Class - See courses.gmu.edu.
Row |
Sec |
Problems |
Due |
(1) |
4.1 |
2, 13, 16, 21, 31, 60 |
9/09/2009 |
(2) |
4.2 |
2, 11, 20, 22 |
9/09/2009 |
(3) |
4.3 |
9, 12, 22 |
9/16/2009 |
(4) |
3.1 |
3, 5, 12, 27, 32, 46 |
9/16/2009 |
(5) |
3.2 |
2, 15, 21, 27 |
|
(6) |
3.3 |
2, 9, 16, 18, 38 |
|
(7) |
3.4 |
17, 18, 24, 35, 50 |
|
(8) |
3.8 |
2, 12, 16, 20, 25 |
|
(9) |
3.8 |
Observe: 247,710 2 - 38,573 2 = 61,360,244,100 - 1,487,876,329 = 59,872,367,771 = 260,867*229,513 Factor 260,867 in a non-trivial way. |
|
(10) |
5.1 |
#2; #3; #7; #11 a, b, g-j; #12 a, c, e, g, i; #15 |
|
(11) |
5.1 |
Of a population of students taking 1-3 classes each, exactly: 19 are taking English, 20 are taking Comp Sci, 17 are taking Math, 2 are taking only Math, 8 are taking only English, 5 are taking all 3 subjects, and 7 are taking only Computer Science. How many are taking exactly 2 subjects? |
|
(12) |
5.2 |
#4; #9 (Venn-diag. proof OK); #13; #21, b, c; # 30 |
|
(13) |
5.3 |
2, 4, 7, 16, 17 |
|
(14) |
7.1 |
2; 11; 14; 35 d, e, f |
|
(15) |
7.2 |
8, 13, 18, 19 |
|
(16) |
7.4 |
2, 4, 11, 17 |
|
(17) |
10.1 |
2, 6, 18, 30 |
|
(18) |
10.2 |
2, 13, 16, 17, 19 |
|
(19) |
10.3 |
11; 12; 13 b, c, d; 19 |
|
(20) |
10.4 |
2, 4, 5, 8, 17, 18 |
|
(21) |
10.4 |
Calculate 1740 mod 83,523. Your answer should be between 0 and 83,522. |
|
(22) |
10.4 |
20, 23, 27, 32, 42 |
|
(23) |
10.4 |
37, 38, 40 |
|
(24) |
Under RSA: p = 13, q = 17, n = 221, & e = 37 is the encryption exponent. Find the decryption exponent d. |
|
|
(25) |
11.1 |
4, 17, 18, 29, 34 |
|
(26) |
11.2 |
8, 9, 10 |
|
(27) |
Solve for x: x2 = 4 (mod 675,683). Give all 4 solutions. Your answers should be between 0 & 675,682. Note: 675,683 = 821 * 823, the product of 2 prime numbers. |
|
|
(28) |
11.4 |
4, 7, 9, 11, 13. When giving an isomorphism, it’s OK to only give the map between sets of vertices. Hint on 13: Looks for circuits of length 5. |
|
(29) |
11.5 |
3, 15-20, 43-47, 49 |
|
(30) |
1.1 |
2, 17, 36, 44, 46 |
|
(31) |
1.2 |
2, 15, 27 |
|
(32) |
1.3 |
10, 11 |
|
(33) |
2.2 |
2, 4, 10, 37 |
|
Tentative Schedule: Exam and Quiz Dates Are Subject to Change
Class |
Date |
Event |
Details |
(1) |
Sep 2, 2009 |
1st Class |
|
(2) |
Sep 9, 2009 |
|
|
(3) |
Sep 16, 2009 |
Quiz 1 |
on everything covered to date |
(4) |
Sep 23, 2009 |
|
|
(5) |
Sep 30, 2009 |
|
|
(6) |
Oct 7, 2009 |
Quiz 2 |
on everything covered since Quiz 1 |
(7) |
Oct 14, 2009 |
|
|
(8) |
Oct 21, 2009 |
EXAM I |
On everything covered to date |
(9) |
Oct 28, 2009 |
|
|
(10) |
Nov 4, 2009 |
|
|
(11) |
Nov 11, 2009 |
Quiz 3 |
on everything covered since Exam I |
(12) |
Nov 18, 2009 |
|
|
|
Nov 25, 2009 |
No Class |
Thanksgiving Recess |
(13) |
Dec 2, 2009 |
|
|
(14) |
Dec 9, 2009 |
EXAM II & Review |
on everything covered since Exam I |
(15) |
Dec 16, 2009 7:30-10:15 pm |
FINAL EXAM |
will be on everything covered during the entire semester. Problems will be like in the Quizzes & Hour Exams (including samples), and Homework. |