Discrete Structure

• Chapter 1: Fundamentals of Logic and Propositions. Notes and past questions on Fundamentals of Logic and Propositions for TU BIT Discrete Structure.
• Chapter 2: Proof Techniques. Notes and past questions on Proof Techniques for TU BIT Discrete Structure.
• Chapter 3: Set Theory and Relations. Notes and past questions on Set Theory and Relations for TU BIT Discrete Structure.
• Chapter 4: Functions and Mappings. Notes and past questions on Functions and Mappings for TU BIT Discrete Structure.
• Chapter 5: Recurrence Relations and Recursion. Notes and past questions on Recurrence Relations and Recursion for TU BIT Discrete Structure.
• Chapter 6: Number Theory and Modular Arithmetic. Notes and past questions on Number Theory and Modular Arithmetic for TU BIT Discrete Structure.
• Chapter 7: Combinatorics and Counting. Notes and past questions on Combinatorics and Counting for TU BIT Discrete Structure.
• Chapter 8: Graph Theory Fundamentals. Notes and past questions on Graph Theory Fundamentals for TU BIT Discrete Structure.
• Chapter 9: Trees and Graph Algorithms. Notes and past questions on Trees and Graph Algorithms for TU BIT Discrete Structure.
• Chapter 10: Advanced Topics. Notes and past questions on Advanced Topics for TU BIT Discrete Structure.

• State division theory.Add two integers 13578 and 45730 using Chinese Remainder Theorem.[2+8] (2082)
• Why do we need quantifiers? List any three rules of inferences. Prove that $2\sqrt{2}$ is irrational using proof by contradiction. [2+3+5] (2082)
• List some advantages of randomized algorithm.Given any set of ten natural numbers between 1 and 99 inclusive, prove that there are two di... (2082)
• Mention the necessary and sufficient conditions for Euler path and Euler circuit with example. [5] (2082)
• How do you represent set? Explain. [5] (2082)
• Using mathematical induction prove that sum of first N odd integers is N2N^2N2. [5] (2082)
• Solve the recurrence relation $a_n = a_{n-1} + a_{n-2}$ with initial conditions $a_0 = 0$ and $a_1 = 1$. [5] (2082)
• Find the shortest path from a to z in following graph using Dijkstra’s algorithm. [5] (2082)
• Define Boolean and exponential function. Discuss about partial ordering. [2+3] (2082)
• Prove the correctness of following recursive algorithm for computing $a^n$ using induction. ``` Power(a, n) { if (n = 0) return 1; else r... (2082)
• Define spanning and minimum spanning tree? How do you traverse tree? [2+3] (2082)
• What do you mean by connectivity in graph? Discuss about Bipartite and Planar graph. [1+4] (2082)
• Define graph isomorphism with an example.Using Kruskal's algorithm generate the Minimum Spanning Tree from following graph.[5+5] (2081)
• What are the uses of randomized algorithm? Find the solution to the recurrence relation $a_n = 6a_{n-1} - 11a_{n-2} + 6a_{n-3}$ with the... (2081)
• Define Boolean function, exponential function and partial ordering. List the computer representations for following set over universal se... (2081)

Frequently asked questions

Based on the official syllabus.