Discrete Structures

C O UR S E I NS T R UC T O R :
E N G R . VA N E S H K U M AR
L EC TU R ER , TIEST
 Course Details
 Course Title: Discrete Structures
 Course Code: CT-162
 Credit Hours: 3+0
 Grading Scheme
 Quizzes/Class Tests ………………………….. 10
 Assignments………………………………….. 10
 Midterm Exam…..……………………………. 20
40
(SEMESTER WORK)

 Final/End-term Exam…………………………. 60 60 (SEMESTER ASSSESSMENT)

 Attendance Requirement
 Attendance is mandatory
 At least 75% attendance is required to get eligible for final examination.
For Example, During a semester (15 weeks; 45 Lectures), you can only miss 11 Lectures
 Course Outline
Mathematical logic, Sets, Functions, Algorithms, Complexity of Algorithms, Mathematical reasoning,
Induction, Recursion, Sequences and Sums, Recursive Definitions, Recursive Algorithms
Counting The Pigeonhole Principal, Permutations and Combinations, Binomial Coefficients, Discrete
Probability, Expected Value and Variance, Recurrence Relations, Solving Recurrence Relations,
Divide-and-Conquer Relations, Generating Functions
Inclusion-Exclusion Relations and their Properties, Representing Relations, Closures of Relations,
Equivalence Relations, Partial Ordering
Introduction to Graphs, Graph Terminology, Representing Graphs and Graph Isomorphism,
Connectivity, Euler and Hamilton Paths, Shortest Path Problems
Introduction to Trees, Applications of Trees, Tree Traversal, Spanning Trees, Minimum Spanning Trees
Boolean Algebra, Boolean Functions, Representing Boolean Functions, Logic Gates, Minimization of
Circuits, Modeling Computation, Languages and Grammars, Finite-State Machines with output, Finite-
State Machines with no output, Language Recognition.
 Books
1. “Discrete Mathematics and its Applications”, Kenneth H. Rosen, McGraw Hill
Science/Engineering/Math, 7th Edition, 2012.
2. “Mathematical Structures for Computer Science”, Judith L. Gersting, W. H. Freeman, 7th
Edition, 2014
3. “Discrete Mathematics with Applications”, Susana S. Epp
 Discrete Structures
 dis·crete / dis’krët.
 Adjective: Individually separate and distinct.
 Synonyms: separate - detached - distinct – abstract
 Discrete Structures
 Discrete – distinct or separable parts
 Structures - objects built up from simpler objects according to definite pattern.
 Discrete Structures
 Discrete structures are the abstract mathematical structures used to represent discrete objects
and relationships between these objects.
 These discrete structures include sets, permutations, relations, graphs, trees, and finite-state
machines.

 Discrete Structures describe processes that consists of a sequence of individuals steps.

 Why this is important?
 Provides mathematical foundations for Computer Science courses Data Structures,
Algorithms, Relational Database theory, Automata theory and Formal languages, Compiler
design, Cryptography.
 What it does?
 This helps the students to develop the ability to think logically and abstractly
 Students should learn a particular set of mathematical facts and how to apply them
Problems Solved using DS
The kinds of problems solved using discrete Structures include:
 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?
 What is the shortest path between two cities using a transportation system?
 How can a list of integers be sorted so that the integers are in increasing order?
 How can it be proved that a sorting algorithm correctly sorts a list?
 How can a circuit that adds two integers be designed?
 How many valid Internet addresses are there?
 Discrete v/s Continuous
 Examples of discrete Data

– Number of boys in the class.

– Number of candies in a packet.
– Number of suitcases lost by an airline.

 Examples of continuous Data

– Height of a person.
– Time in a race.
– Distance traveled by a car.
Discrete Continuous
 Discrete v/s Continuous
DISCRETE OBJECT CONTINUOUS OBJECT
 Natural Numbers are Discrete  Real Numbers are Continuous
For example, For example, between 0 &1
1, 2, 3, 4, ….. 0,0.001,0.0001, .., 0.000001,…,01001,and so on.

 Digital clock is discrete in nature  Analog clock is discrete in nature