Welcome to the Discrete Structures MCQs Page

Dive deep into the fascinating world of Discrete Structures with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Discrete Structures, a crucial aspect of UGC CBSE NET Exam. In this section, you will encounter a diverse range of MCQs that cover various aspects of Discrete Structures, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within UGC CBSE NET Exam.


Check out the MCQs below to embark on an enriching journey through Discrete Structures. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of UGC CBSE NET Exam.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Discrete Structures. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Discrete Structures MCQs | Page 1 of 19

The power set of the set { φ} is
Answer: (b).{ φ, { φ}}
The number of bit strings of length eight that will either start with a 1 bit or end with two bits 00 shall be
Answer: (a).32
In which tree, for every node the height of its left subtree and right subtree differ almost by one ?
Answer: (b).AVL tree
Suppose that someone starts with a chain letter. Each person who receives the letter is asked to send it on to 4 other people. Some people do this, while some do not send any letter. How many people have seen the letter, including the first person, if no one receives more than one letter and if the chain letter ends after there have been 100 people who read it but did not send it out ? Also find how many people sent out the letter ?
Answer: (c).133 & 33
The maximum number of keys stored in a B-tree of order m and depth d is
Answer: (d).m^d-1
Which of the following is the most powerful parring method ?
Answer: (b).Canonical LR
The graph K3,4 has
Answer: (d).12 edges
The time complexities of some standard graph algorithms are given. Match each algorithm with its time complexity ? (n and m are no. of nodes and edges respectively)

a. Bellman Ford algorithm 1. O (m log n)
b. Kruskals algorithm 2. O (n3)
c. Floyd Warshall algorithm 3. O(mn)
d. Topological sorting 4. O(n + m)

Codes :
a b c d
Answer: (a).3 1 2 4
Let V1 = 2I – J + K and V2 = I + J – K, then the angle between V1 & V2 and a vector perpendicular to both V1 & V2 shall be :
Answer: (d).90 degrees and (–2I – J + 3K)
Let T(n) be the function defined by T(n) = 1 and T(n) = 2T (n/2) + n, which of the following is TRUE ?
Answer: (c).T(n) = O(n)
Page 1 of 19

Suggested Topics

Are you eager to expand your knowledge beyond Discrete Structures? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!