CISC1400: Discrete Structure Introduction 1 Dr. Zhang, Fall 2011, Fordham Univ.

Slides:



Advertisements
Similar presentations
Introduction to Graph Theory Instructor: Dr. Chaudhary Department of Computer Science Millersville University Reading Assignment Chapter 1.
Advertisements

Walks, Paths and Circuits Walks, Paths and Circuits Sanjay Jain, Lecturer, School of Computing.
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.
Lecture 24 Coping with NPC and Unsolvable problems. When a problem is unsolvable, that's generally very bad news: it means there is no general algorithm.
COUNTING AND PROBABILITY
Graphs Graphs are the most general data structures we will study in this course. A graph is a more general version of connected nodes than the tree. Both.
3.5 Paradox  1.Russell’s paradox  A  A, A  A 。  Russell’s paradox: Let S={A|A  A}. The question is, does S  S?  i.e. S  S or S  S?  If S  S,
The Engineering Design of Systems: Models and Methods
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Math 308 Discrete Mathematics Discrete Mathematics deals with “Separated” or discrete sets of objects (rather than continuous sets) Processes with a sequence.
Discrete Structures Chapter 5 Pigeonhole Principle Nurul Amelina Nasharuddin Multimedia Department.
Tirgul 10 Rehearsal about Universal Hashing Solving two problems from theoretical exercises: –T2 q. 1 –T3 q. 2.
Blobs and Graphs Prof. Noah Snavely CS1114
Theoretical Computer Science COMP 335 Fall 2004
Selected Topics in Data Networking Graph Representation.
CSC 2300 Data Structures & Algorithms January 16, 2007 Chapter 1. Introduction.
TR1413: Discrete Math for Computer Science Lecture 0: Introduction.
THE TRANSITION FROM ARITHMETIC TO ALGEBRA: WHAT WE KNOW AND WHAT WE DO NOT KNOW (Some ways of asking questions about this transition)‏
Chapter 7 Functions Dr. Curry Guinn. Outline of Today Section 7.1: Functions Defined on General Sets Section 7.2: One-to-One and Onto Section 7.3: The.
Functions A B f( ) =. This Lecture We will define a function formally, and then in the next lecture we will use this concept in counting. We will also.
Relations & Functions CISC1400, Fall 2011 Fordham Univ.
CSNB143 – Discrete Structure
Chapter 1 Probability and Distributions Math 6203 Fall 2009 Instructor: Ayona Chatterjee.
 Jim has six children.  Chris fights with Bob,Faye, and Eve all the time; Eve fights (besides with Chris) with Al and Di all the time; and Al and Bob.
Lecture Discrete Probability. 5.1 Probabilities Important in study of complexity of algorithms. Modeling the uncertain world: information, data.
Chapter The Basics of Counting 5.2 The Pigeonhole Principle
Angie Rangel Jose De Jesus Melendez Carlos Aguilar Drake Jain DISCRETE MATHEMATICS MATH 170 PROJECT PART II.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Sets.
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
Unit Unit 04 Relations IT DisiciplineITD1111 Discrete Mathematics & Statistics STDTLP1 Unit 4 Relations.
Chapter 2 Mathematical preliminaries 2.1 Set, Relation and Functions 2.2 Proof Methods 2.3 Logarithms 2.4 Floor and Ceiling Functions 2.5 Factorial and.
Dr. Eng. Farag Elnagahy Office Phone: King ABDUL AZIZ University Faculty Of Computing and Information Technology CPCS 222.
Discrete Structures for Computing
CS 103 Discrete Structures Lecture 10 Basic Structures: Sets (1)
CCM 4300 Lecture 1 Computer Networks: Wireless and Mobile Communication Systems. Permutations and Combinations Dr E. Ever School of Engineering and Information.
Graph Colouring L09: Oct 10. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including the famous.
CS201: Data Structures and Discrete Mathematics I
Copyright © Cengage Learning. All rights reserved.
COSC 2007 Data Structures II Chapter 14 Graphs I.
THEORY OF COMPUTATION Komate AMPHAWAN 1. 2.
1 Melikyan/DM/Fall09 Discrete Mathematics Ch. 7 Functions Instructor: Hayk Melikyan Today we will review sections 7.3, 7.4 and 7.5.
CSC 413/513: Intro to Algorithms
1 Chapter 2 Pigeonhole Principle. 2 Summary Pigeonhole principle –simple form Pigeonhole principle –strong form Ramsey’s theorem.
Chapter 20: Graphs. Objectives In this chapter, you will: – Learn about graphs – Become familiar with the basic terminology of graph theory – Discover.
Functions CSRU1400 Spring 2008Ellen Zhang 1 CISC1400, Fall 2010 Ellen Zhang.
COMPSCI 102 Introduction to Discrete Mathematics.
The Pigeonhole Principle. Pigeonhole principle The pigeonhole principle : If k is a positive integer and k+1 or more objects are placed into k boxes,
Pigeonhole Principle – Page 1CPTR311 – Discrete Structures CPTR311 Discrete Structures Pigeonhole Principle Reading: Kolman, Section 3.3.
Discrete Mathematics. Exercises Exercise 1:  There are 18 Computer Science (CS) majors and 325 Business Administration (BA) majors at a college.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
Week 10 - Monday.  What did we talk about last time?  Combinations  Binomial theorem.
ICS 253: Discrete Structures I Counting and Applications King Fahd University of Petroleum & Minerals Information & Computer Science Department.
Blobs and Graphs Prof. Noah Snavely CS1114
COUNTING Discrete Math Team KS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) 1.
Theory of Computational Complexity Probability and Computing Chapter Hikaru Inada Iwama and Ito lab M1.
Introduction to the Theory of Computation
Discrete Structures for Computer Science
Copyright © Zeph Grunschlag,
Discrete Structure II: Introduction
CS100: Discrete structures
Introduction Dr. X. Zhang, Fordham Univ. 1.
Mathematics for Computer Science MIT 6.042J/18.062J
Graphs Chapter 11 Objectives Upon completion you will be able to:
CSCI-2400 Models of Computation.
CS 220: Discrete Structures and their Applications
SETS, RELATIONS, FUNCTIONS
REVISION Relation. REVISION Relation Introduction to Relations and Functions.
Discrete Mathematics and Its Applications
The Pigeonhole Principle
Presentation transcript:

CISC1400: Discrete Structure Introduction 1 Dr. Zhang, Fall 2011, Fordham Univ.

What’s discrete mathematics ? 2  Discrete mathematics: dealing with objects that can assume only distinct, separated values  Sequence, set  Logic  Relations, functions  Counting, probability  Graphs  Useful for modeling real world objects  Especially useful for computer problem solving

3 Discrete mathematics is concrete, i.e., very practical …

We start with set … 4  Set is everywhere …  the group of all students in our class is a set  the group of all freshmen in our class is a set  Some set are subset of another set  Some sets are disjoint, i.e., have no common elements  e.g., the set of freshmen and the set of sophomore  Operations on sets makes sense too  union, intersection, complement, …

With set, we define relations 5 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

6 Graph representation of relations

Graph is a way to visualize relations 7 A graph for “having same birthday” relation among class members An airline graph represents “having direct flight” relation A network graph connects two nodes if they are connected (via a wire or a wireless radio). …

Graph problems 8  Can you draw the following picture without lifting the pencil or retracing any part of the figure ?

Graph: many real world applications 9  Computer network: how to send data (URL request you type in browser) from your PC to a web server ?  Engineering: how to connect five cities with highway with minimum cost ?  Scheduling: how to assign classes to classrooms so that minimal # of classrooms are used?  …

Functions as a special type of relations… 10 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

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

Still too obvious ? 12  Suppose I randomly pick some students from class, how many students do I need to pick to guarantee that there are at least two students of same gender among those I picked ?  Students: pigeons (x)  Gender: holes (2)  If x>2, then there are at least one gender that has more than one student  Note: the tricky part is  Recognize the theorem/formula that applies  Map entities/functions in your problem to those in the theorem/formula

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

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

Counting problem: history 15  First known results on counting goes back to six century BCE’s India:  Using 6 different tastes, bitter, sour, salty, astringent, sweet, hot, one can make 63 different combinations…  first formula for counting combinations appears more than one thousand years later  # of ways to elect two class representatives

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

Ex: Probability problems 17  Suppose I choose one person randomly, what’s the probability that you will be chosen ?  Suppose I choose two persons randomly, what’s the probability that you and your neighbor are chosen ?  What’s the probability of winning NY lottery ?

18 Logic: a tool for reasoning and proving

An example 19  Your friend’s comment:  If the birds are flying south and the leaves are turning, then it must be fall. Falls brings cold weather. The leaves are turning but the weather is not cold. Therefore the birds are not flying south.  Do you agree with her ?  Is her argument sound/valid?

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

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

So we have seen a list of topics … 22  Sequence  Set  Logic  Relation, Function  Counting  Probability  Graph

Goals 23  Master the basics of discrete mathematics  Develop mathematical and computational reasoning abilities  Become more comfortable and confident with both mathematics and computation

24 Discrete structure is essential for computer problem solving

Computer problem solving 25  Model real world entity  Student records in a registration system=> objects in a set  Network nodes => graph vertices  Develop/identify algorithm for solving specific problem  Search for a student record using name (or ID, …)  Query for a course using a prefix (all CSRU courses ?)  Find shortest path in a graph  Implement algorithm using a programming language that computers “understand”

Computer projects 26  We will learn basic web programming  Build your own web page  Learn HTML, JavaScript, …  Use Alice to build 3D animation clip  Cartoon, simple game …

27 Let’s look at syllabus …

Expectations of students 28  Think, think, think and practice  Make sense of the concepts, notations  Relate to your intuitions  Reflect about connections among different concepts  Active participation in class  There are no silly questions !  Keep up with homework  Take advantage of office hour and tutor room