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

Q61.
A recursive function h, is defined as follows:

h(m) = k, if m=0
= 1, if m=1
= 2h(m-1) + 4h(m-2), if m≥2

If the value of h(4) is 88 then the value of k is:

a.

0

b.

1

c.

2

d.

-1

Discuss
Answer: (c).2
Q62.
The asymptotic upper bound solution of the recurrence relation given by

T(n)= 2T(n/2)+n/log n is:
Discuss
Answer: (c).O(n log log n)
Q63.
The minimum number of scalar multiplication required, for parenthesization of a matrix-chain product whose sequence of dimensions for four matrices is <5,10,3,12,5> is
Discuss
Answer: (d).405
Q64.
What is the probability that a randomly selected bit string of length 10 is a palindrome?
Discuss
Answer: (b).1/32
Discuss
Answer: (c).Both G1 and G2 do not contain Euler circuit
Q66.
Consider a weighted complete graph G on the vertex set {v1, v2, …. vn} such that the weight of the edge (vi, vj) is 4 |i – j|. The weight of minimum cost spanning tree of G is:
Discuss
Answer: (c).4n – 4
Q67.
A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are there in the graph shown below?

a.

2

b.

4

c.

5

d.

6

Discuss
Answer: (c).5
Q68.
The symmetric difference of two sets S1 and S2 is defined as

S1ΘS2 = {x|xϵS1 or xϵS2, but x is not in both S1 and S2}

The nor of two languages is defined as
nor (L1,L2) = {w|w ∉ L1 and w|w ∉ L2}

Which of the following is correct?
Discuss
Answer: (c).The family of regular languages are closed under both symmetric difference and nor
Q69.
Consider a source with symbols A, B, C, D with probabilities 1/2, 1/4, 1/8, 1/8 respectively. What is the average number of bits per symbol for the Huffman code generated from above information?
Discuss
Answer: (b).1.75 bits per symbol
Q70.
How many committees of five people can be chosen from 20 men and 12 women such that each committee contains at least three women?
Discuss
Answer: (b).52492

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!