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

Q81.
Consider the following transportation problem.
The initial basic feasible solution of the transportation problem using Vogel’s Approximation Method(VAM) is given below. The solution of the this problem:
Discuss
Answer: (b).is optimum solution
Q82.
Consider the Graph shown below. This graph is a ...............
Discuss
Answer: (c).Hamiltonian Graph
Q83.
Five men are available to do five different jobs. From past records, the time (in hours) that each man takes to do each job is known and is given in the following table. Find out the minimum time required to complete all the jobs.
Discuss
Answer: (c).13
Q84.
Consider the graph given below. Which one of the following graph is isomorphic to the above graph?

a.

A

b.

B

c.

C

d.

D

Discuss
Answer: (c).C
Q85.
Consider a complete bipartite graph km,n. For which values of m and n does this, complete graph have a Hamilton circuit ?
Discuss
Answer: (c).m=n≥2
Q86.
How many cards must be chosen from a deck to guarantee that atleast

i. two aces of two kinds are chosen.
ii. two aces are chosen.
iii. two cards of the same kind are chosen.
iv. two cards of two different kinds are chosen
Discuss
Answer: (a).50, 50, 14, 5
Q87.
A text is made up of the characters α, β, γ, δ and σ with the probability 0.12, 0.40, 0.15, 0.08 and 0.25 respectively. The optimal coding technique will have the average length of
Discuss
Answer: (b).2.15
Q88.
Consider an undirected graph G with 100 nodes. The maximum number of edges to be included in G so that the graph is not connected is
Discuss
Answer: (c).4851
Q89.
The amortized time complexity to perform ............. operation(s) in Splay trees is O(Ig n).
Discuss
Answer: (d).Search, Insert and Delete
Q90.
The number of eight-bit strings beginning with either 111 or 101 is ...............
Discuss
Answer: (a).64

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!