Discrete mathematics is the part of mathematics devoted to the study of discrete (i.e. distinct) objects. In general, it is used whenever objects are counted, when relationships between finite (or countable) sets are studied, and when processes involving a finite number of steps are analysed. It is important for computer science because in computing machines, information is stored and manipulated in a discrete fashion.

DISCRETE AND ENGINEERING MATHEMATICS holds a weightage about 15% in GATE examination for CS students. Discrete mathematics is exclusive paper for CS students.

Topics

1. Basic Counting
2. Sets
3. Logic
4. Relations
5. Functions
6. Algebraic Structures
7. Graph Theory
8. Advanced Counting
9. Recurrence Relations
10. Linear Algebra
11. Calculus
12. Probability and Statistics

Graduate Aptitude Test in Engineering or GATE is the competitive exam to test the comprehensive understanding of graduate and undergraduate subjects in science and engineering for admission into a master’s Program of educational institutes and public sector companies.

When someone wants to get admission in M Tech., MS at IISc, NITs, and IITs, or any other universities; they are advised to appear in the GATE exam. All these institutes expect and accept a good score in GATE.

The Graduate Aptitude Test in Engineering (GATE) is an examination conducted jointly by the Indian Institute of Science (IISc), Bangalore and the seven Indian Institutes of Technology (at Bombay, Delhi, Guwahati, Kanpur, Kharagpur, Madras and Roorkee) on behalf of the National Coordination Board (NCB)-GATE, Department of Higher Education, Ministry of Human Resource Development (MHRD), Government of India.