Course Administrivia:

+
Introduction [What
and Why?]
 Welcome!!!
O To the Benchmark Course for the Computer
Science Students….

O You will be tested for:

O Patience ☺
O Determination
O Consistency
O Passion
 Course Description
O A computer science course, seasoned with a
soupçon of math.
O It Counts towards the mathematical and
computational reasoning requirement of the
CS curriculum at MAJU.
O The objective is:
O to develop the necessary abstract reasoning
abilities while learning to succeed in a
mathematical and computer environment.
 Learning Outcomes…
O Be able to analyse and understand common math
notation
O Be able to develop solutions to mathematical problems
O Be able to use a well-defined methodology to reason
about math
O Master the basics of discrete mathematics
O Develop mathematical and computational reasoning
abilities
O Become more comfortable and confident with both
mathematics and computation
 Text Books
O Primary:
“Discrete Mathematics and its Applications”,
7th Edition, by Kenneth Rossen.

O Reference:
“Fundamentals of Discrete Structures”, by
Damian Lyons, Christina Papadakis-Kanaris,
Gary Weiss, and Arthur G. Werschulz.
 Grading Scheme ☺
Instrument % of grade
Quizzes (5) 10%
Assignments (03) 10%
Practice Sets(05) 0%
Programming Assignment 10%
Midterm Exam (1) 20%
Final exam (1) 50%
 Attendance Policy ☺
O Really just short of mandatory.

O We are all busy people but I need to have

you here for all 32 sessions ☺

O Unexcused absences or missing more than

2 classes will lower your course grade
Exams
 Cheating Policy ☺
O Zero tolerance towards cheating!!

O 0 assigned for the 1st attempt,

O 5 marks (out of semester’s 100 marks)

deducted for the 2nd attempt AND

O An F assigned for the 3rd attempt... Simply☺

 How to get an ‘F’ grade in Discrete☺
[Any of the following actions will get an F 4 u]
O Simply make 2 attempts of cheating
O Be ABSENT in 11 one hour sessions
O Always sit at the last bench where the instructor is not
able to disturb you through his voice
O Always sit with the students who are joyful and never let
you be serious about the course or the GRADE
O NEVER Submit an Assignment
O Be confident about your instructor’s capabilities and
NEVER touch the Text Book/Resources
O DO NOT withdraw the course even if your instructor
assures that you CAN’T PASS the course
 Lecture Plan
S.N Topics # of Weeks
o
1 Course Administrivia 1/3

2 Sets/Relations/Functions 5

3 Logic 3

4 Proof Methods 4

5 Graph 3
 Course Style
O Conversational Class Room: We will follow a modified
version of the Modified Moore Method (MMM)

O Students are assigned homework [Groups MADE in the

first session] daily/weekly
O They discuss the problems in group, BUT
O Write the solutions separately AND
O Present the solutions in class ☺
O Presentations are scheduled in every session or at
least every week…
O Simply, the course will be taught on a 50-50 scheme.
50% by Instructor and 50% by Students ☺
 Expectations of students ☺
O Think, think, think and practice
O Make sense of the concepts, notations
O Relate to your intuitions
O Reflect about connections among different concepts
O Active participation in class
O There are no silly questions !
O Keep up with homework
O Take advantage of office hour and Instructor room

16
 Make Groups….
Groups will continue for the whole semester…
 Class Web Site
Google Classroom
• Need MAJU ID to access
• [email protected]
• You need to frequently visit the page for
Announcements, Lectures, and Resources

class code: rs7axn2

 Discrete
Mathematics
What and Why???
 Discrete mathematics
What and Why???
O Discrete mathematics: dealing
with objects that
can assume only distinct, separated values
O Set
O Logic [Proof Methods]
O Relations, functions
O Graphs
O Useful for modeling real world objects
O Especially useful for computer problem solving

20
 Discrete mathematics
What and Why???
O Discrete mathematics is used
O − whenever objects are counted
O − when relationships between finite (or
countable) sets are studied, and
O − when processes involving a finite number
of steps are analysed
The kinds of problems solved
using discrete mathematics…
O How many ways are there to choose a valid password on a computer
system?
O What is the probability of winning a lottery?
O Is there a link between two computers in a network?
O How can I identify spam e-mail messages?
O How can I encrypt a message so that no unintended recipient can read
it?
O What is the shortest path between two cities using a transportation
system?
O How can a list of integers be sorted so that the integers are in
increasing order?
O How many steps are required to do such a sorting?
O How can it be proved that a sorting algorithm correctly sorts a list?
O How can a circuit that adds two integers be designed?
O How many valid Internet addresses are there?
O AND Finally… You have to PROVE each of your ANSWERS ☺
 We start with set …
O Set is everywhere …
O the group of all students in our class is a set
O the group of all freshmen in our class is a set
O Some set are subset of another set
O Some sets are disjoint, i.e., have no common
elements
O e.g., the set of freshmen and the set of sophomore
O Operations on sets makes sense too
O union, intersection, complement, …

23
 With set, we define relations
 Among the set of all students in our
class, some pairs are special …
 The pairs have same birthday
 The pairs are from same states
 The first is older than the second
 All are binary relation defined on a set
of students
24
 Functions as a special type of relations…

 Where one element in a set is related

(mapped) to one and only one element in
another set
 “birthday of” can be viewed as a function
defined on our set
 Any student is mapped to the date when
he/she was born

25
 Our class: birthday remark
O Some says, “there are at least two students in the
class that are born in the same month (not
necessarily same year).”
O Do you agree ?
O Pigeonhole theorem
O If put n pigeons into
m holes, where n>m,
there is at least a hole
that has more than one
pigeons.

26
With set defined, one is naturally
interested in its size, counting the
number of elements in a set

27
 Our class: counting problem
O Simple ones:
O How many students are there in the class, i.e. the
cardinality of the set ?
O How many ways can we elect a representative ?
O How many ways can we elect a representative and a
helper ?
O How many ways can we form studying groups of 2
students (3 students, …) ?

28
Counting is essential for
studying probability, i.e.,
how likely something
happens …

29
Logic: a tool for reasoning
and proving

30
 An example
O Your friend’s comment:
O If the birds are flying south and the leaves are
turning, then it must be fall. Falls brings cold weather.

O The leaves are turning but the weather is not cold.

Therefore the birds are not flying south.
O Do you agree with her ?
O Is her argument sound/valid?

31
 An example
O Is her argument sound/valid?
O Suppose the followings are true:
O If the birds are flying south and the leaves are turning,
the it must be fall.
O Falls brings cold weather.
O The leaves are turning but the weather is not cold.
O Can one conclude “the birds are not flying south” ?

32
 Reasoning & Proving
O Prove by contradiction
O Assume the birds are flying south,
O then since leaves are turning too, then it must be fall.
O Falls bring cold weather, so it must be cold.
O But it’s actually not cold.
O We have a contradiction, therefore our assumption
that the birds are flying south is wrong.

33
So we have seen a list of topics
…
O Set
O Logic [Proof Techniques]
O Relation, Function
O Counting

O We will follow the ACM/IEEE Curricula

34
 Discrete structure is
essential for computer
problem solving

35
Problem solving Requires
Determination……..
Problem Solving……Mistakes
O You will make mistakes;
O Accept it.
O This is normal and you learn from them.
O Do not avoid risking making them.
O The Process is MORE important than ANSWER ☺

O Solution is not always complex;

O Sometimes a simple solution can fix a complex problem.

O “An expert is a man who has made all the mistakes which can
be made in a very narrow field.”Niels Bohr

O “Anyone who has never made a mistake has never tried

anything new.” Albert Einstein
Problem Solving……Simplicity
O “Any intelligent fool can make things bigger and more
complex... It takes a touch of genius - and a lot of
courage to move in the opposite direction.”
Albert Einstein

O “Everything should be made as simple as possible,

but not simpler.” Albert Einstein

O Take the problem and break it down in to smaller and

smaller chunks that are now manageable.
WAKE UP!!!! ☺
Session ENDS….