Muddasir Shabbir
Email: Office Hours:
Tue 04:00-06:00 PM and/or By appointment.

Discrete Structures Spring 2016

Course Information

Class meetings Tue-Wed 10:15AM – 11:45PM in LT4
Instructor Office Hours Wed : After Class
TA Office Hours Mon : 9AM- 10 AM
Tue : 9AM- 10 AM & 12PM – 3PM
Wed : 9AM- 10 AM
Thur : 12PM- 3 PM
Pre-requisites Knowledge of basic concepts in mathematics and data structures is assumed (e.g. sets, functions, probability, proof by induction, permutations, logarithms, and the basics of solving recurances, graphs, trees).
Required text Kenneth Rosen, Discrete Mathematics and Its Applications(7th Ed)
Reference text Bernard Kolman, Robert Busby, and Sharon Ross, Discrete Mathematical Structures
Joseph K. Blitzstein, Jessica Hwang, Introduction to Probability

— Bulletin Board —

Date News
Mar 17 Here is the solution for Quiz # 1

Apr 17 Here is the solution for Quiz # 2

Apr 17 Here is the solution for Quiz # 3

Apr 17 Here is the solution for Quiz # 4

Apr 17 Here is the solution for Quiz # 5

Apr 19 Here is the solution for Quiz # 6

May 04 Here is the solution for Quiz # 7

May 04 Here is the solution for HW1 Quiz



There will be 6-10 homeworks, ~15 in-class quizzes and two exams. The grade break down will be as follows:

– Homeworks (15%)- Quizzes (30%)- Class Participation (5%)- MidTerm Exam (20%)- Final Exam (30%)Note : Final grades will be curved.

The homework assignments are mathematically oriented and involve derivations of mathematical equations, and proofs of statements.
Students can form groups of up to two for the purposes of homework. Homework is to be done independently within each group. Each group should understand and be able to explain the answers submitted. Each group should turn in one assignment, clearly marked with group-member names. Once you form a group, it can’t be changed.
To fairly account for natural disasters and emergencies, everyone is allowed to skip one homework and one quiz. If you choose to solve all homeworks(quizzes), your homework(quiz) with the least score will be discarded while computing your final grade.
25% credit will be given for any question for clearly marking the question with “I DON’T KNOW”. Questions with an entirely wrong answer will get 0% credit, but a partially correct answer will get partial credit. So if u don’t have any idea about a problem, it’s better for you to admit that you don’t know something, rather than trying to fake it. But, if you have some idea, but its not entirely correct but is partially correct, you should show your partial solution

Academic dishonesty

Under the Honor Code, each of you is expected to submit your own work in this course. However, as outlined above, for the homework submissions, you are allowed to work in groups or to ask for general advice from the course staff or other experts. Such activity is both acceptable and encouraged, but you must indicate any collaboration or assistance on your solution sets.
Any collaboration or assistance that is not given proper citation may be considered a violation of the Honor Code.
You are responsible for understanding and being able to explain the solutions you submit.
In case of plagiarism you may receive an ‘F’ grade in this course along with penalties dictated by university policy. The course staff will actively pursue any suspected cases of Honor Code violations.

Homework Submission

Use standard 8 by 11 sheets of paper with no ragged edges..
Your group name should appear at the top of each page. Pages should be numbered and stapled together.
You should have a cover page that gives your name and a table with three columns. The first column lists each of the assigned problems in the order that they appear on the assignment (whether you did them all or not). The second column contains the number of the page of your work where the solution to the problem appears (or the words “Not done” if you did not do it.) The third column is left blank for me to record the score.


# Topic Notes
1 Intro to Set Thoery (PDF)
2 Relations (PDF)
3 Relations (Contd) (PDF)
4 Equivalence Relations and Functions (PDF)
5 Induction (PDF)
6 Logics (PDF)
6a Logics(Dr. Imdad) (PDF)
7 Counting (PDF)
8 Probability (PDF)
9 Random Variables (PDF)
10 Expectation (PDF)
11 Variance (PDF)
12 Graphs (PDF)
13 Circuit, Cycles, Huffman (PDF)