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

Explore more Topics under UGC CBSE NET Exam

Q91.
Find the number of ways to paint 12 offices so that 3 of them will be green, 2 of them pink, 2 of them yellow and the rest ones white.

a.

55,440

b.

1,66,320

c.

4.790E+08

d.

39,91,680

Discuss
Answer: (b).1,66,320
Q92.
How many people must there be in a room before there is a 50% chance that two of them were born on the same day of the year ?

a.

At least 23

b.

At least 183

c.

At least 366

d.

At least 730

Discuss
Answer: (a).At least 23
Q93.
The number of possible parenthesizations of a sequence of n matrices is

a.

O(n)

b.

θ(n Ig n)

c.

Ω(2^n)

d.

None of the above

Discuss
Answer: (c).Ω(2^n)
Q94.
The relation "divides" on a set of positive integers is ..................

a.

Symmetric and transitive

b.

Anti symmetric and transitive

c.

Symmetric only

d.

Transitive only

Discuss
Answer: (b).Anti symmetric and transitive
Q95.
A test contains 100 true/false questions. How many different ways can a student answer the questions on the test, if the answer may be left blank also.

a.

100P2 

b.

100C2

c.

2^100

d.

3^100

Discuss
Answer: (d).3^100
Q96.
Which of the following connected simple graph has exactly one spanning tree?

a.

Complete graph

b.

Hamiltonian graph

c.

Euler graph

d.

None of the above

Discuss
Answer: (d).None of the above
Q97.
How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components?

a.

M+N-C

b.

M-N-C

c.

M-N+C

d.

M+N+C

Discuss
Answer: (c).M-N+C
Q98.
The solution of recurrence relation, T(n) = 2T(floor (√n)) + logn is

a.

O(n log log logn)

b.

O(n log logn)

c.

O(log logn)

d.

O(logn log logn)

Discuss
Answer: (d).O(logn log logn)
Q99.
The upper bound of computing time of m coloring decision problem is

a.

O(nm)

b.

O(n^m)

c.

O(nm^n)

d.

O(n^mm6n)

Discuss
Answer: (c).O(nm^n)
Q100.
Which one of the following statements is incorrect ?

a.

The number of regions corresponds to the cyclomatic complexity.

b.

Cyclometric complexity for a flow graph G is V(G) = N–E+2, where E is the number of edges and N is the number of nodes in the flow graph.

c.

Cyclometric complexity for a flow graph G is V(G) = E–N+2, where E is the number of edges & N is the number of nodes in the flow graph.

d.

Cyclometric complexity for a flow graph G is V(G) = P + 1, where P is the number of predicate nodes contained in the flow graph G.

Discuss
Answer: (b).Cyclometric complexity for a flow graph G is V(G) = N–E+2, where E is the number of edges and N is the number of nodes in the flow graph.
Page 10 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!

Java Programming

Level up your coding skills with our Java Programming MCQs. From object-oriented...

Data Science

Discover the fascinating world of extracting insights from data with our Data Science...

Data Structures and Algorithms

Journey through the fundamentals of Data Structures and Algorithms with our extensive...

DBMS

Get a firm grasp on database systems with our DBMS MCQs. Explore relational...

IT Fundamentals

Navigate the basics of information technology with our IT Fundamentals MCQs. Get a...

Computer Hardware

Explore the tangible components of computers with our Computer Hardware MCQs. Learn...

Hadoop

Dive into the world of big data with our Hadoop MCQs. Cover key concepts including...

Compiler Design

Unravel the process of translating source code into executable programs with our...

Digital Image Processing (DIP)

Delve into the techniques of enhancing digital images with our Digital Image...