triton%20logo%202004

 

 

 


HOME Page

CIS 101
Introduction to Business Computing

CIS 121
Introduction to Programming

CIS 125
Computer-Based/ Discrete Math

CIS 125 001
Computer-Based / Discrete Math

Spring 2012

Instructor:†††††† S.Paredes

Office:†††††††††††† M-101a

Phone:†††††††††††† 708-456-0300

E-Mail:†††††††††††

Class Website: triton.cc

 

Office Hours:

 

Text:††††††††††††††† Provided

 

The course is divided into multiple major topics. Each of these major topics has a series of assignment or activities.

As each is completed you are to submit it to the instructor for evaluation. Submission may be via the schoolís internal mail system, or, if you are able to scan your work, may be submitted electronically via e-mail.

 

Some topics have additional material that will be made available to you in class or other arrangements to be determined. As you complete each topic, submit the homework for credit. Assignments may be submitted via hardcopy or electronically.

Quizzes will be administered after each major topic. We will cover two topics per week, or approximately one per scheduled meeting.

Videos are available for your review. Specifics will be announced.
 

Topic

Assignment

Computer
Assignment

Number Systems

 

1. Number Systems, Decimal / Binary Conversion 

01

 

2. Decimal / Hexadecimal Conversion 

02

02a

3. Binary Addition

03

 

4. Negative Numbers and Binary Subtraction

04

 

5. Binary Multiplication

05

 

 

Propositional Logic

 

6. Propositions and Truth Tables

06

 

7. Conditional Propositions

07

 

8. DeMorgan's Law, etc.

08

 

 

Boolean Logic

 

9. Boolean Logic and Truth Tables

09

 

10. Boolean Algebra

10

 

11. Combinatorial Circuits

11

 

12. Introduction to Quantifiers

12

 

 

Proofs

 

13. Direct Proofs

13

 

14. Resolution Proofs

14

 

 

Set Properties and Operations

 

15. Introduction to Sets

15

 

16. Set Operations & Venn Diagrams

16

 

17. Set Properties and Relations

17

 

18. Functions

18

 

 

Graph Theory and Trees

 

19. Graph Theory

19

 

20. Introduction to Trees

20

20a

21. Binary Trees, Traversing Binary Trees

21

 

22. Applications 1, Stack Processing

22

22a

23. Applications 2

23

23a

24. Huffman Codes

24

 

 

Permutations and Combinations

 

25. Permutations

25

 

26. Combinations

26

 

27. Applications

27

 

28. Pascalís Triangle (Program)

28

 

29. Probability

29

 

 

Other requirements:

Exam dates will be announced in advance.

The specifications for the lab/programming assignments must be followed regarding the specific commands that must be used to solve the problem.

All assignments are due at the end of the period one week following the assignment. 25% will be deducted from the program for each week late. No credit will be given for a program more than 3 weeks late.

The lab portion of the class is a requirement unless you are up-to-date with all your assignments. Surfing of the web or other non-project related activities are not permitted.

Homework and programs are to be the sole work of you, the student, submitting the assignment.

 

Statement of Academic Honesty

Academic honesty is expected from students enrolled in courses and programs offered by the CIS department; violations of this expectation will not be tolerated. Violations of the expectation of academic honesty include, but are not limited to:

  • Obtaining or attempting to obtain a copy of an examination prior to its administration, and unauthorized use of study materials or textbooks during an examination.
  • Obtaining unauthorized assistance from or giving unauthorized assistance to another individual during an examination or completion of an assignment.