0% found this document useful (0 votes)
10 views

Disc Lec1 Introduction

discrete structures introduction

Uploaded by

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

Disc Lec1 Introduction

discrete structures introduction

Uploaded by

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

Mathematics for Computer

Science

https://www.youtube.com/watch
?v=q4L-wUF3yig
1
FACULTY OF ARTIFICIAL INTELLIGENCE
AND INFORMATICS

Discrete Structure (CS 104)

Introduction
References

Rosen, Kenneth H.
“Discrete mathematics
and its applications”,
Eighth Edition (2019).
What Is Discrete Mathematics?
• Discrete mathematics is the part of mathematics
devoted to the study of discrete objects

• Whenever objects are counted, when relationships


between finite sets are studied, and when processes
involving a finite number of steps are analyzed.

4
How many ways are there to choose a valid
password on a computer system?
What is the probability of winning a
lottery?
Is there a link between two computers in a
network?
The kinds of How can I identify spam e-mail messages?
problems How can I encrypt a message so that no
solved using unintended recipient can read it?
What is the shortest path between two
discrete cities using a transportation system?
mathematics How can a list of integers be sorted so that
the integers are in increasing order?
include: How many steps are required to do such a
sorting?
How can it be proved that a sorting
algorithm correctly sorts a list?
How can a circuit that adds two integers be
designed?

5
What is discrete mathematics?
Logic: artificial intelligence (AI), database, circuit design

Counting: probability, analysis of algorithm

Graph theory: computer network, data structures

Number theory: cryptography, coding theory

Logic, sets, functions, relations, etc.


Why Study Discrete Mathematics? (1)

Design efficient computer systems.

•How did Google manage to build a fast search engine?

•What is the foundation of internet security?

algorithms, data structures, database,


parallel computing, distributed systems,
cryptography, computer networks…

Logic, sets/functions, counting, graph theory…


Why Study Discrete Mathematics? (2)

Mathematical foundations for :


 logic, set, and number theory,
– Data Structures,
 linear algebra,
– Algorithms,
 abstract algebra,
– Database Theory,
 combinatorics,
– Compiler Theory,
 graph theory,
– Computer Security,
 and probability theory (the discrete part
– Operating Systems. of the subject).

 Solving problems in operations research (including discrete optimization),


chemistry, engineering, biology, and so on.

8
Topic 1: Logic and Proofs

How do computers think?

Logic: propositional logic, first order logic

Proof: induction, contradiction

Artificial intelligence, database, circuit, algorithms


Topic 2: Counting

How many steps are needed to sort n numbers?

• Sets
• Combinations, Permutations, Binomial theorem
• Functions
•Recursions

Probability, algorithms, data structures


Topic 3: Graph Theory

• Relations, graphs
• Degree sequence, isomorphism, Eulerian graphs
• Trees

Computer networks, circuit design, data structures


Topic 4: Number Theory

• Number sequence
• Euclidean algorithm
• Prime number

Cryptography, coding theory, data structures


Topics

13
Grade and weight of assessments

14
Lecture 1
Ch. 1
The Foundations:
Logic and Proofs

You might also like