adplus-dvertising

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.

frame-decoration

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 17 of 19

Discuss
Answer: (b).The set inclusion relation ⊆ is a partial ordering on the power set of a set S
Q162.
If the time is now 4 O'clock, what will be the time after 101 hours from now?
Discuss
Answer: (a).9 O'clock
Q163.
Let m = (313)4 and n = (322)4. Find the base 4 expansion of m + n.
Discuss
Answer: (d).(1301)4
Q164.
Consider the following two matrices. Find the boolean product AʘB of the two matrices.

a.

1

b.

2

c.

3

d.

4

Discuss
Answer: (a).1
Q165.
How many distinguishable permutations of the letters in the word BANANA are there?
Discuss
Answer: (c).60
Q166.
Consider the graph given below. Use Kruskal's algorithm to find a minimal spanning tree for the graph. The List of the edges of the tree in the order in which they are chosen is?
Discuss
Answer: (d).AD, AG, GC, AE, GB, BF
Q167.
Let P and Q be two propositions, ⌐(P ↔ Q) is equivalent to:
Discuss
Answer: (a).P ↔ ⌐ Q
Q168.
Negation of the proposition Ǝ x H(x) is:
Discuss
Answer: (b).∀ x ⌐H(x)
Q169.
Consider the following two sequences :

X = <B, C, D, C, A, B, C>
and Y = <C, A, D, B, C, B>

The length of longest common subsequence of X and Y is:

a.

5

b.

3

c.

4

d.

2

Discuss
Answer: (c).4
Q170.
A text is made up of the characters a, b, c, d, e each occurring with the probability 0.11, 0.40, 0.16, 0.09 and 0.24 respectively. The optimal Huffman coding technique will have the average length of:
Discuss
Answer: (b).2.16

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!