Scribd
Upload
292 views14 pages

DSCS RL 1.1

This document introduces the course "Discrete Structures for Computer Science". It discusses that discrete structures are composed of distinct, separable parts, unlike continuous structures. Topics covered in the course include sets, matrices, logic, functions, relations, number theory, graph theory, counting, and combinatorics. These topics are fundamental to computer science and describe how digital computers store and manipulate discrete data. The course provides an essential mathematical foundation for all areas of computer science.

Uploaded by

Adil Rashid
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
292 views14 pages

DSCS RL 1.1

This document introduces the course "Discrete Structures for Computer Science". It discusses that discrete structures are composed of distinct, separable parts, unlike continuous structures. Topics covered in the course include sets, matrices, logic, functions, relations, number theory, graph theory, counting, and combinatorics. These topics are fundamental to computer science and describe how digital computers store and manipulate discrete data. The course provides an essential mathematical foundation for all areas of computer science.

Uploaded by

Adil Rashid
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/ 14

Discrete Structures for Computer Science

Dr.N.L.Bhanu Murthy
BITS Pilani
Hyderabad Campus
What is Mathematics, really?

Its not just about numbers!


Mathematics is much more than that:

Mathematics is, most generally, the study of any and


all truths about any and all well-defined concepts.

But, these concepts can be about numbers, symbols,


objects, images, sounds, anything!

BITS Pilani, Hyderabad Campus


So, whats this class (Discrete Structures for Computer Science) about?

A set is an unordered collection of objects called the elements.


For example, V = { a, e, i, o, u} is the set of all vowels in the English alphabet.
A matrix is a rectangular array of numbers arranged in m horizontal rows
and n vertical columns.

Sets, Matrices etc are all called mathematical objects.


Collection of mathematical objects with operations defined on them and
the accompanying properties form a mathematical structure or system.
Example: The collection of sets with the operations of union, intersection, and
complement and their accompanying properties is mathematical structure. We
denote this structure by (sets, , U, ).

BITS Pilani, Hyderabad Campus


So, whats this class (Discrete Structures for Computer Science) about?

What are discrete structures anyway?

Discrete ( discreet!) - Composed of distinct, separable parts.


(Opposite of continuous.)
discrete:continuous :: digital:analog
Example - integers, people, house

Discrete Mathematical Structures or Discrete structures -


The abstract mathematical structures used to represent discrete
objects and relationships between the objects
Example graphs, sets, relations
Discrete Mathematics - The mathematical study of discrete
objects and structures.

BITS Pilani, Hyderabad Campus


BITS Pilani, Hyderabad Campus
Why study this course?

Information is stored and manipulated by computers in a discrete


fashion. 0101101

Digital computers are based on discrete bits. Therefore, both a


computers
structure (circuits) and
operations (execution of algorithms)
can be described by discrete math.

The basis of all of computing is: Discrete manipulations of discrete


structures represented in memory.

Discrete Math is the basic language and conceptual foundation for


all of computer science.

BITS Pilani, Hyderabad Campus


Discrete Math in Computer Science

Networking Artificial Intelligence


Database Computer Architecture
Image Processing Operating Systems
Programming Security & Cryptography
Languages Data Structures
Compilers & Interpreters Algorithms
Software Engineering Graphics & Animation

What else is remaining in computer science?

BITS Pilani, Hyderabad Campus


Quick Overview - Topics

Logic is a tool for working with elaborate compound


statements.

Propositional Logic

Predicate Logic
Aristotle
(ca. 384-322 B.C.)
Equivalences

Logical Inference

Chrysippus of Soli George Boole


(ca. 281 B.C. 205 B.C.) (1815-1864)

BITS Pilani, Hyderabad Campus


Quick Overview - Topics

Methods of proof

Direct proof: Assume p is true, and prove q.

Indirect proof: Assume q, and prove p.

Vacuous proof: Prove p by itself.

Trivial proof: Prove q by itself.

Proof by cases:

Proof by Contradiction

Proof by Induction

Fundamental to all mathematical disciplines


Useful for digital circuits, hardware design
BITS Pilani, Hyderabad Campus
Quick Overview - Topics

Sets, Relations & Functions


Sets - Fundamental to all mathematical disciplines
Functions are heavily used in analysis of algorithms
Relations as concepts are building blocks modern databases
Equivalence Relations, Partially Ordered Sets, Lattice Theory

Number Theory & Introduction to Cryptography


Get to rediscover the old reliable number theory and find out some
surprising facts
Very useful in crypto-systems

Recurrence Relations
Problems solved using recurrence

BITS Pilani, Hyderabad Campus


Quick Overview - Topics

Graph Theory
Many clever data-structures for organizing information and making
programs highly efficient are based on graph theory
Very useful in describing problems in
Databases
Operating Systems
Networks
EVERY CS DISCIPLINE!!!!

Counting and Combinatorics


Compute your odds of winning lottery
Important for predicting how long certain computer program will take
to finish
Pigeonhole principle

BITS Pilani, Hyderabad Campus


Books

R1. Kolman, Busby, Ross and Rehman, Discrete Mathematical Structures for
Computer Science, Pearson Education, 5th Edition, 2003.

R2. Kenneth H. Rosen : Discrete Mathematics and its Applications, Tata


McGraw Hill, 5th Edition, 2004 Seventh Edition

R3. Goodaire & Parmenter : Discrete Mathematics & Graph Theory, Pearson
Education, 2000

R4. D.S.Malik and M.K.Sen, Discrete Mathematical Structures: Theory and


Applications, Thomson, 2004.

R5. C.L.Liu, Elements of Discrete Mathematics, 2nd Edition, McGraw Hill, 1986.

BITS Pilani, Hyderabad Campus


Notations

p pq pq pq pq x P( x)
x P( x) {a1 , , an } Z, N, R {x | P( x)} xS
n
S T |S| A B A A
i 1
i

n
f :A B f 1 ( x) f g x a a i
S i 1
O, , min, max a /| b gcd, lcm mod a b (mod m)
n
( a k a0 ) b [aij ] AT A
B A[ n ]
r
C (n; n1 , , nm ) p( E | F ) R [a ]R deg (v)

BITS Pilani, Hyderabad Campus


Thank You!!

BITS Pilani, Hyderabad Campus

You might also like