Summer 2009 - Foundations of Digital Computing C251/I201 Syllabus

Instructor:      John F. Doyle

Office:          LF-112

Class:           CV 108

05:30P-08:50P

MTR

Office Hours:    MTR 11:00 am - 12:00 pm and 3:30 pm - 4:30 pm

                 WF  By Appointment

Laboratory:      LF-111

Lab Assistant:   William Apple

Phone:           812-941-2195 (Please Use email First!)

Email:           jfdoyle@ius.edu

Text:            Discrete Mathematics and its Applications 6e by 

                 Kenneth H. Rosen, The McGraw-Hill Companies. ISBN 0072880082

Course Goals:        click here

Prerequisites:   C201 and a 200 level mathematics course. Recommended: IUS MATH course M119 or M215. 

Grade Scale:     A+ 97% - 100%     A  93% - 96%        A-  90% - 92%

                 B+ 87% -  89%     B  83% - 86%        B-  80% - 82%

Click for        C+ 77% -  79%     C  73% - 76%        C-  70% - 72%

Grade Book:      D+ 67% -  69%     D  63% - 66%        D-  60% - 62%

                 F  0% -   59%

Course Evaluation:    2 Tests          =      30%

13 Homeworks =  30%

Project     =          10%

Final Exam  =        30%

            Total             =    100%

Homeworks - Due at the start of class.
Projects - On designated dates, part of class time will be spent practicing design skills necessary for homework assignments.
Teams - Student teams of two are required for homework and laboratory assignments.
Ethics - All graded work is expected to be the product of individual effort and is subject to the Indiana University Code of Student Ethics.

Frequently Asked Questions

Preliminary Class Schedule: [I reserve the right to change this syllabus at any time]

   Jun 29   Class Introduction. Formal Logic; 1.1, 1.2, 1.3 & Read 1.4-1.8

       30   Formal Logic, Proofs; 1.4, 1.5, Sets, Set Operations, Functions; 1.6, 1.7, 1.8 Homework #1 due & Read 2.1 - 2.3  

   Jul 02   Sets;  2.1, 2.2, and 2.3 Homework #2 due & Read 2.4 - 2.5           

       06   Sequences and Summations 2.4, Homework #3 due & Read 3.1 – 3.5 

       07   Algorithms, Growth of Functions, Complexity of Algorithms; 3.1 – 3.3 Homework #4 due

       09   Algorithms, Growth of Functions, Complexity of Algorithms; 3.1 – 3.3 Homework #5 due 

       13   Exam #1 - 1 single-sided crib sheet may be used, no other references/resources allowed Homework #6 due Read 5.1 - 5.4

       14   Counting, the Pigeonhole Principle, Permutations & Combinations, The Binomial Theorem, 5.1 - 5.4, read 6.1 - 6.4 and read 8.1 - 8.4

       16   Probability 6.1 - 6.4, Relations 8.1 - 8.4  Homework #7 due and Read 9.1 - 9.3

       20   Relations 8.1 - 8.4  Homework #8 due and Read 9.1 - 9.3       

       21   Graphs 9.1, 9.2, 9.3  Homework #9 due and Read 9.4 - 9.6 

       23   Graphs 9.4, 9.5, 9.6 Homework #10 due and Read 10.1 - 10.4

       27   Exam #2 - 1 single-sided crib sheet may be used, no other references/resources Homework #11 due and Read 11.1 - 11.4   

       28   Trees, 10.1, 10.2, 10.3, 10.4

       30   No class meeting today. Project Work Day on your own. Read 12.1 - 12.4

   Aug 03   Boolean Algebra; 11.1, 11.2, 11.3, and 11.4 Homework #12 due Finite State Machines 12.1, 13.2, 12.3 & 12.4 and Read 7.1 - 7.3 

       04   Recurrence Relations 7.1 - 7.3 due Programming Project Due Homework #13 due

       06   Last Day of Class – Final Exam Homework #14 due

Document last modified: