Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
34 views28 pages

Lec # 01 (Discrete)

The document outlines a course on Discrete Structures, emphasizing the importance of attendance, assignments, and recommended textbooks. Key topics include logic, sets, relations, functions, and their applications in computer science. It also discusses the distinction between discrete and continuous data, and the foundational role of logic in reasoning and argument evaluation.

Uploaded by

40096
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
34 views28 pages

Lec # 01 (Discrete)

The document outlines a course on Discrete Structures, emphasizing the importance of attendance, assignments, and recommended textbooks. Key topics include logic, sets, relations, functions, and their applications in computer science. It also discusses the distinction between discrete and continuous data, and the foundational role of logic in reasoning and argument evaluation.

Uploaded by

40096
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 28

DISCRETE STRUCTURES

Credit Hours: 3(3-0)


Lecture # 01
DESCRIPTION
 75% attendance is mandatory
 6 Assignments

 4 quizzes

 Recommended books are;


 Discrete Mathematics and its applications by
Kenneth H Rosen
 Shaum’s outline of theory and problems of Discrete
Mathematics
 Discrete Mathematics with Applications (second
edition) by Susanna S. Epp
COURSE TOPICS
 Logic
 Sets & Operations on sets

 Relations & Their Properties

 Functions

 Sequences & Series

 Recurrence Relations

 Mathematical Induction

 Loop Invariants

 Combinatorial logics

 Probability

 Graphs and Trees


TODAY’S GOAL
 Introduction to discrete structures
 Logic

 Statements or Proposition

 Non proposition
SO the answer in the particular value is
actually a discrete structure
For example if I say today is Friday
What will be the answer?
Yes or No
THERE ARE TWO TYPES OF DATA SET
DISCRETE STRUCTURE
 The mathematics in which we deal with only
the discrete kind of data is called discrete
structure
DISCRETE STRUCTURE
 More about discrete structure…
 Concerns processes that consist of a

sequence of individual steps


 As a student in computer science, you need

to know the basic language and conceptual


foundation for all of the computer science
 Discrete structure concepts are widely used

throughout math, science, engineering,


economics, biology, etc.,…
DISCRETE VS CONTINUOUS
DISCRETE VS CONTINUOUS
 Set of integers also called discrete set
 Pointsare scattered in set of integers
 Graph of integers numbers is scattered

 Set of real numbers are continuous in nature


 Consecutive points have no gap among them
 Graph gives continuous line
USE OF DISCRETE STRUCTURE IN
COMPUTER SCIENCE
 Networking
 Advanced Algorithms &Database

 Image processing

 Data Structures

 Graphics & Animation Language

 Compilers & Interpreters

 Software Engineering

 Artificial Intelligence

 Computer Architecture

 Operating systems

 Security & Cryptography


 To understand the computer you must know
the working of CPU
 And to learn about CPU you should know it

works on the basis of Logic gates


 And logic gates works on LOW and HIGH(0,1)

value
 So as a computer science students you will

better understand it’s application


LOGIC
INTRODUCTION
 The first book on logic was written by the
Greek Philosopher Aristotle (384 BC).
 In seventeen century, the German

Philosopher and Mathematician Gottfried


Leibniz conceived the idea of using symbols
to mechanize the process of reasoning in
much the same way that algebraic notation
had mechanized the process of reasoning
about numbers and their relationships.
LOGIC
 “Logic" came from the Greek word logos,
which is sometimes translated as "sentence",
"reason", "rule“.
 The study of the principles of correct

reasoning
 Logic is the study of the principles and

methods that distinguish between a valid and


an invalid argument
 The study of methods and rules that

distinguish between a good(correct) and a


bad(incorrect)
WE CANNOT ASSOCIATE A QUESTION
WITH PROPOSITIONS
ALSO NOT B/C USE OF VARIABLES
WHAT ABOUT THIS??
 Ali is 30 years old and he is a college student
ANSWER….
 Yes we can associate a truth value with the
previous statement….
BASIC TERMS OF LOGIC(SUMMARY)…
 Statement(proposition)
A statement is a declarative sentence that is either
true or false but not both
 Also called proposition
 Some examples are;
 2+2 = 4 ……………………………… (1)
 It is Sunday today ………………… (2)
 First statement is true and second one is false..

 If a proposition(statement) is true, we say that


it has a truth value of "true”.
 If a proposition is false, its truth value is

"false".
EXAMPLES

 Grass is green
4 + 2 = 6

4 + 2 = 7

 There are four fingers in a hand

 All statements are declarative


 We know about their truth value

 Truth value for statement 1 & 2 is T

 Truth value for statement 3 & 4 is F


EXAMPLE OF NON-SENTENCES

 Close the door


 Non proposition because it is not declarative
 X is greater than 2
 We cannot say about its truth value
 For some truth values of x it is true and for
others it is false
 He is very rich
 Although it is declarative but we cannot say
about its truth value
 We don’t know about pronoun
UNDERSTANDING STATEMENTS
 x + 2 is positive.
 Not a statement
 May I come in?
 Not a statement
 Logic is interesting.
A statement
 It is hot today.
A statement
 -1 > 0
A statement
 x + y = 12
 Not a statement
Thank You

You might also like