0% found this document useful (0 votes)
483 views1 page

Combinatorial Studies 1

This document provides an overview of the CSE333 course on Combinatorial Studies-I. The course aims to help students improve problem solving skills through practice with discrete mathematics, graph theory, combinatorics, linear algebra, calculus, probability, and numerical ability. It is divided into 6 units covering topics such as propositional logic, graphs, counting, matrices, limits, random variables, and data interpretation. The course outcomes are to solve a variety of problems in these areas and evaluate students' understanding and numerical ability. Recommended textbooks include books on engineering mathematics, discrete mathematics, and mathematical statistics.

Uploaded by

Nishant Sharma
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)
483 views1 page

Combinatorial Studies 1

This document provides an overview of the CSE333 course on Combinatorial Studies-I. The course aims to help students improve problem solving skills through practice with discrete mathematics, graph theory, combinatorics, linear algebra, calculus, probability, and numerical ability. It is divided into 6 units covering topics such as propositional logic, graphs, counting, matrices, limits, random variables, and data interpretation. The course outcomes are to solve a variety of problems in these areas and evaluate students' understanding and numerical ability. Recommended textbooks include books on engineering mathematics, discrete mathematics, and mathematical statistics.

Uploaded by

Nishant Sharma
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/ 1

CSE333:COMBINATORIAL STUDIES-I

Course Outcomes: Through this course students should be able to

CO1 :: practice various problems of Discrete Mathematics in order to improve problem solving
time.

CO2 :: solve variety of problems of graph theory and combinatorics.

CO3 :: practice variety of problems of linear algebra.

CO4 :: test student's understanding of Calculus.

CO5 :: solve various engineering problems based on probability theory.

CO6 :: evaluate students' numerical ability

Unit I
Discrete Mathematics : propositional logic, first order logic, sets, relations, functions, partial orders,
lattices, groups
Unit II
Graphs : connectivity, matching, coloring

Combinatorics : counting, recurrence relations, generating functions

Unit III
Linear Algebra : matrices, determinants, system of linear equations, eigenvalues, eigenvectors, LU
decomposition
Unit IV
Calculus : limits, continuity, differentiability, maxima and minima, mean value theorem, integration

Unit V
Probability : random variables, uniform, normal, exponential, poisson and binomial distributions,
mean, median, mode, standard deviation, conditional probability, Bayes theorem
Unit VI
Numerical Ability : numerical computation, numerical estimation, numerical reasoning, data
interpretation

Text Books:
1. WILEY ACING THE GATE: ENGINEERING MATHEMATICS AND GENERAL APTITUDE by ANIL
K. MAINI, VARSHA AGRAWAL, NAKUL MAINI, WILEY
References:
1. ADVANCED ENGINEERING MATHEMATICS by R K JAIN, NAROSA PUBLISHING HOUSE

2. FUNDAMENTALS OF MATHEMATICAL STATISTICS by GUPTA S.C. , KAPOOR V.K., SULTAN


CHAND & SONS (P) LTD.
3. DISCRETE MATHEMATICS, WITH GRAPH THEROY AND COMBINATORICS by T VEERARAJAN,
Tata McGraw Hill, India

Session 2021-22 Page:1/1

You might also like