Scribd
Upload
14 views3 pages

2017 MC Syllabus Removed

Uploaded by

Divyam Baukhandi
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
14 views3 pages

2017 MC Syllabus Removed

Uploaded by

Divyam Baukhandi
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/ 3

UNIVERSITY OF PETROLEUM & ENERGY STUDIES

CSEG2006 Discrete Mathematical Structures L T P C


Version 1.0 4 0 0 4
Pre-requisites/Exposure Basic Knowledge of Mathematics I and Mathematics II

Co-requisites --
4. Database Systems-The Complete Book by Jeffrey D. Ullmam, Pearson India

Modes of Evaluation: Quiz/Assignment/ presentation/ extempore/ Written Examination


Examination Scheme:

Components MSE Test/Quiz/Assignment etc. ESE


Weightage (%) 20 30 50

Relationship between the Course Outcomes (COs), Program Outcomes (POs) and Program Specific
Objectives(PSOs)

PO/CO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO


1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 3 1 3 3 1 2 1 3 2

CO2 2 3 1 3 2 1 2 2 3 2
CO3 2 2 1 2 2 1 2 2 3 2
CO4 2 2 1 2 2 1 2 2 3 2
CO5 3 2 1 3 2 2 1 2 2

B.TECH (CSE) with Specialization in Mobile Computing 2.0 (210516) Page 64 of 93

This document is the Intellectual Property of University of Petroleum & Energy Studies and its contents
are protected under the ‘Intellectual Property Rights’.
UNIVERSITY OF PETROLEUM & ENERGY STUDIES

Course Objectives

1. To develop a mathematical foundation in order to solve non-trivial real world problems which are
challenging and interesting.
2. To develop logical and mathematical concepts necessary to appreciate computational systems and
study of concepts, techniques, and skills necessary to comprehend the structure of problems
encountered in design and analysis of algorithms.
3. To provide mathematical foundations for courses in computer science those rely upon the
comprehension of formal abstract concepts.
4. Graphs, directed graphs, planar graphs & their relevance to circuit design & map coloring problems.

5. To develop the fundamentals for comprehending subjects like Algorithms Designing, Complexity
Theory, Computability theory, Optimization techniques and programming languages.

Course Outcomes

At the end of this course student should be able to


CO1 : Understand and interpret the fundamental mathematical structures like Set theory,
Relation and Functions
CO2 : Write recursive definitions of sequences and collections of objects
CO3 : Understand the concepts and applications of vector algebra
CO4 : Understand and interpret the basic concepts of Graph Theory
CO5 : Apply the use of Graph theory concepts solving various Computer Science and
Engineering problems.

Catalog Description

This course is designed to understand and use discrete structures that are the backbones of computer science.
Discrete structures involve the study of objects that are separated or spaced apart from each other. Through
this course, students are expected to develop mathematical experience and maturity, and to enhance their
abilities to read, create and analyze mathematical arguments. In particular, this course is meant to introduce
sets, relations, functions, recurrence relations, vector spaces and graph theory concepts, with an emphasis
on applications in computer science.

B.TECH (CSE) with Specialization in Mobile Computing 2.0 (210516) Page 65 of 93

This document is the Intellectual Property of University of Petroleum & Energy Studies and its contents
are protected under the ‘Intellectual Property Rights’.
UNIVERSITY OF PETROLEUM & ENERGY STUDIES

Course Content

Unit I: SET THEORY, RELATION, FUNCTION, THEOREM PROVING TECHNIQUES


10 lecture hours
Set Theory: Definition of sets, countable and uncountable sets, Venn Diagrams, proofs of some general
identities on sets
Relation: Definition, types of relation, composition of relations, Pictorial representation of relation,
Equivalence relation, Partial ordering relation, Job-Scheduling problem
Function: Definition, type of functions, one to one, into and onto function, inverse function, composition
of functions, recursively defined functions, pigeonhole principle.
Theorem proving Techniques: Mathematical induction, Proof by contradiction.
Introduction to Recurrence Relation and Recursive algorithms, linear recurrence relations with
constant coefficients, Homogeneous solutions, Particular solutions, Total solutions, Generating functions,
Solution by method of generating functions.

UNIT II: VECTOR ALGEBRA 8 lecture hours

Vector Space, Subspaces, spanning set, basis and dimensions, linear transformations- definition and
properties, Kernel and image of a linear transformation, Rank-Nullity Theorem, Matrices of composite
linear transformation and inverse of a linear transformation, Isomorphism.

UNIT III: GRAPHS-1 8 lecture hours

Graph Theory and Applications, Types of graphs, Properties of Graph, Cut Sets, Cut Vertices, Sub graphs,
Digraphs and Isomorphism, Paths, Circuits, Walks, Euler and Hamiltonian graphs, Shortest Path Problem
in weighted graph, Dijkstra’s algorithm
Trees- Terminology and Representation, Types of trees, Spanning Trees (Prim’s and Kruskal’s
Algorithms), Counting spanning tree, Cayley’s Theorem.

UNIT IV: GRAPHS-2 10 lecture hours

Planar and Dual Graphs, Matrix representation of Graphs (Incidence and adjacency matrix), Graph vertex
coloring, Welch-Powell Algorithm, Chromatic Number and Polynomial, Decomposition Theorem,
Network flows, Maximum Flow in a Transport Network: The Ford–Fulkerson Algorithm, Max-flow Min-
cut Theorem.

Text Books
4. Discrete Mathematics and Its applications by Kenneth Rosen, McGraw Hill Publications.
5. Discrete Mathematics, by R. K. Bisht &H.S.Dhami Oxford University Press.

Reference Books
1. Discrete Mathematics and its Applications, Trembley and Manohar TMH publications.
2. Elementary Linear Algebra, 9th Edition by Howard Anton & Chris Rorres, published by Wiley
Publication.

B.TECH (CSE) with Specialization in Mobile Computing 2.0 (210516) Page 66 of 93

This document is the Intellectual Property of University of Petroleum & Energy Studies and its contents
are protected under the ‘Intellectual Property Rights’.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy