Discrete Mathematics

Model Question Paper

Discrete Mathematics

Key Features

• Unit-wise Short Notes 
  Each unit includes a summary in both languages, making revision faster and more effective.

• Extensive MCQ Practice 
  1500+ MCQ Practice Questions: This comprehensive question bank includes 1500+ multiple-choice questions (MCQs). Each unit contains approximately 150 MCQs covering a wide range of cognitive levels such as remembering, understanding, application, and analysis.

• Exam Practice Paper with Mock Tests 
  Includes three full-length mock tests for real exam practice. One mock test is free for students to assess the quality of our question paper.

• Latest Syllabus as per NEP 
  The syllabus aligns with the latest National Education Policy (NEP) and follows the exam patterns of MSU, CCSU, and other universities following the NEP.

• Designed by Experts 
  This question bank has been meticulously prepared by subject matter experts to ensure accuracy and relevance.

Why Choose This Model Paper?

• Complete Exam Preparation: Unit-wise summaries, MCQ practice, and mock tests provide a complete study solution.

• Latest NEP-Based Pattern: Ensures compliance with the latest university exam structure.

  Program Class: Certificate/ B.SC.		Year: First		Semester: Second
  Subject: Computer Science
  Course Title: Discrete Mathematics
  Course Learning Outcomes: The main objectives of the course are to: • Introduce concepts of mathematical logic for analysing propositions and proving theorems. • Use sets for solving applied problems, and use the properties of set operations • algebraically. • Work with relations and investigate their properties. • Investigate functions as relations and their properties. • Introduce basic concepts of graphs, digraphs and trees.
  Credits: 4			Core Compulsory
  Max. Marks: –25+75			Min. Passing Marks: 33
  Unit	Topics
  I	Mathematical Logic: Propositional and Predicate Logic, Propositional Equivalences, Normal Forms, Predicates and Quantifies, Nested Quantifiers, Rules of Inference.
  II	Set and Relations: Set Operations, Representations and Properties of Relations, Equivalence Relations, Partially Ordering.
  III	Group Theory: Groups, Subgroups, Semi Groups, Product and Quotients of Algebraic Structures, Isomorphism, Homomorphism, Automorphism, Rings, Integral Domains, Fields, Applications of Group Theory
  IV	Graph Theory: Simple Graph, Multigraph, Weighted Graph, Paths and Circuits, Shortest Path in Weighted Graphs, Eulerian Path and Circuits, Hamiltonian Path and Circuits, Planner Graph, Graph Coloring, Bipartite Graphs, Trees and Rooted Trees, Prefix Codes, Tree Traversals, Spanning Trees and Cut-Sets.
  V	Boolean Algebra: Boolean Functions and its Representations, Simplification of Boolean Functions.