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

Explore more Topics under UGC CBSE NET Exam

Q51.
The cyclomatic complexity of a flow graph V(G), in terms of predicate nodes is:
(Where P is number of predicate nodes in flow graph V(G)

a.

P + 1

b.

P + 2

c.

P - 2

d.

P + 3

Discuss
Answer: (a).P + 1
Q52.
How many multiples of 6 are there between the following pairs of numbers?
0 and 100 and -6 and 34

a.

16 and 6

b.

17 and 6

c.

17 and 7

d.

16 and 7

Discuss
Answer: (c).17 and 7
Q53.
Consider a Hamiltonian Graph G with no loops or parallel edges and with |V(G)|=n≥3. Then which of the following is true?

a.

deg(v) ≥ n/2 for each vertex v

b.

|E(G)| ≥ 1/2(n-1)(n-2)+2

c.

deg(v)+deg(w) ≥ n whenever v and w are not connected by an edge

d.

All of the above

Discuss
Answer: (d).All of the above
Q54.
Which of the following statements is false?
(A) Optimal binary search tree construction can be performed efficiently using dynamic programming.
(B) Breadth-first search cannot be used to find connected components of a graph.
(C) Given the prefix and postfix walks of a binary tree, the tree cannot be re-constructed uniquely.
(D) Depth-first-search can be used to find the components of a graph.

a.

A

b.

B

c.

C

d.

D

Discuss
Answer: (b).B
Q55.
Which of the following strings would match the regular expression: p+[3-5]*[xyz] ?

I. p443y
Il. p6y
III. 3xyz
IV. p35z
V. p353535x
Vl. ppp5

a.

I, III and Vl only

b.

IV, V and VI only

c.

II, IV and V only

d.

I, IV and V only

Discuss
Answer: (d).I, IV and V only
Q56.
Consider a sequence F00 defined as follows. Then what shall be the set of values of the sequence F00?

a.

(1, 110, 1200)

b.

(1, 110, 600, 1200)

c.

(1, 2, 55, 110, 600, 1200)

d.

(1, 55, 110, 600, 1200)

Discuss
Answer: (a).(1, 110, 1200)
Q57.
Match the following:
List-I                  List-II
a. Absurd          i. Clearly impossible being
contrary to some evident truth.
b. Ambiguous   ii. Capable of more than one
interpretation or meaning.
c. Axiom            iii. An assertion that is accepted
and used without a proof.
d. Conjecture    iv. An opinion Preferably based
on some experience or wisdom.

Code:
     a   b   c    d

a.

i    ii   iii   iv

b.

i    iii  iv   ii

c.

ii   iii  iv   i

d.

ii   i    iii   iv

Discuss
Answer: (a).i    ii   iii   iv
Q58.
The functions mapping R into R are defined as:

f(x) = x^3-4x, g(x)=1/(x^2+1) and h(x)=x^4

Then find the value of the following composite functions:
hog(x) and hogof(x)

a.

(x^2+1)^4 and [(x^3-4x)^2+1]^4

b.

(x^2+1)^4 and [(x^3-4x)^2+1]^-4

c.

(x^2+1)^-4 and [(x^3-4x)^2+1]^4

d.

(x^2+1)^-4 and [(x^3-4x)^2+1]^-4

Discuss
Answer: (d).(x^2+1)^-4 and [(x^3-4x)^2+1]^-4
Q59.
How many multiples of 6 are there between the following pairs of numbers?

0 and 100   and     -6 and 34

a.

16 and 6

b.

17 and 6

c.

17 and 7

d.

16 and 7

Discuss
Answer: (c).17 and 7
Q60.
In propositional logic if (P→Q)˄(R→S) and (P˅R) are two premises as follows. Y is the premise:

a.

P˅R

b.

P˅S

c.

Q˅R

d.

Q˅S

Discuss
Answer: (d).Q˅S
Page 6 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!

SQL Server

Master Microsoft's database server with our SQL Server MCQs. Topics cover database...

DBMS

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

Java Programming

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

Computer Graphics

Step into the visual side of computing with our Computer Graphics MCQs. Cover topics...

Management Information Systems

Discover how businesses leverage technology with our Management Information Systems...

MySQL Database

Enhance your knowledge of relational databases with our MySQL MCQs. Understand...

Hadoop

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

MS Office

Master the suite of productivity tools with our MS Office MCQs. From Word and Excel...

CSS

Polish your web design skills with our CSS MCQs. Learn about selectors, properties,...