**Discrete math is the mathematics of computing.** "The mathematics of modern computer science is built almost entirely on discrete math, in particular combinatorics and graph theory. This means that in order to learn the fundamental algorithms used by computer programmers, students will need a solid background in these subjects." From the boolean logic of the bits to the algorithms of internet search and the representations of online friendships, discrete mathematics is an integral part of computing. in this course, you will learn these mathematical foundations.

How To Get The Most Out Of This Course

There is a whole bunch of good discrete math and data structures texts that you may want to look at; it sometimes helps to have another voice say the same things a different way.

· Logic and Proofs.

· Sets, Functions, Sequences, Sums, and Matrices.

· Number Theory and Cryptography.

· Induction and Recursion

· Combinatorics.

· Runtime Analysis

· Relations and Graphs

For assignment, solutions, project submissions, and grades we will use UIC Blackboard system.

**Most handouts and important information will be posted there ( here). **Consequently, it is important that you become comfortable immediately using some WWW browser and familiarize yourself with Blackboard. See the TA for help in the event that this is all new to you.

You can submit your homeworks by email, to the TA teaching your your discussion class, in word, pdf or a ps file.

**Cheating will not be tolerated.**

Not only is cheating a violation of the campus code of integrity, which might incur a reduced grade, expulsion from the class or university, it is also a slight against the other students in the class who will give you dirty looks. Refer to the UIC Student Conduct Process for guidlines and policy on student integrity and possible reprocussions.

Please read the Guidelines for Written Homeworks before doing the first assignment.

The time and location for the final (2 hour) exam isdecided by the university based on the meeting time of the class. The final will be **Tue, May 5, 8:00 - 10:00 am.**

All exams will be closed book, closed notes, closed neighbor, no calculators, just a writing implement and your mind.

Homeworks (~10) |
50% |

Midterm Exam |
10% |

Final Exam |
40% |

(average of the homeworks) * .50 + midterm*.1 + final *.4

Grades will be posted online on the UIC Blackboad system.

If you have a question or complaint about the way a homework or exam problem was graded, then, **within one week** of the date the assignment is returned, you should either explain what it is on a separate piece of paper and give it to the TA along with the assignment or, better yet, come into office hours and get it straightened out then. We want everyone happy and satisfied, but we can't do much in the couple of minutes before and after class.

· Read the books.

· If you have trouble solving a homework problem, try doing some easier related problems first.

· Go over the printed solutions when they become available, and make sure you understand them.

· Go to the TA or instructor to discuss any misunderstandings you may have.

· **Think!** A big part of this class is being clever, but in just the right way.

If you do the homeworks, understand them and the solutions, implement the projects, then you will probably do well on the exams and do well in the class. Your life will be beautiful and fulfilled, you'll be forever happy and there will be peace on Earth.

(adapted from Lenny Pitt andJeff Erickson)

This topic: CS151 > WebHome > Syllabus

Topic revision: r7 - 2015-01-12 - 23:46:43 - Main.piotr

Copyright 2016 The Board of Trustees of the University of Illinois.webmaster@cs.uic.edu |
WISEST Helping Women Faculty Advance Funded by NSF |