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

Explore more Topics under UGC CBSE NET Exam

Q31.
A certain tree has two vertices of degree 4, one vertex of degree 3 and one vertex of degree 2. If the other vertices have degree 1, how many vertices are there in the graph?

a.

5

b.

n-3

c.

20

d.

11

Discuss
Answer: (d).11
Q32.
Consider a set A {1, 2, 3,……… 1000}. How many members of A shall be divisible by 3 or by 5 or by both 3 and 5?

a.

533

b.

599

c.

467

d.

66

Discuss
Answer: (c).467
Q33.
A computer program selects an integer in the set {k : 1 < k < 10,00,000} at random and prints out the result. This process is repeated 1 million times. What is the probability that the value k = 1 appears in the printout at least once?

a.

0.5

b.

0.704

c.

0.632121

d.

0.68

Discuss
Answer: (c).0.632121
Q34.
Which one of the following is used to compute cyclomatic complexity?

a.

The number of regions - 1

b.

E - N + 1, where E is the number of flow graph edges and N is the number of flow graph nodes

c.

P – 1, where P is the number of predicate nodes in the flow graph G

d.

P + 1, where P is the number of predicate nodes in the flow graph G

Discuss
Answer: (d).P + 1, where P is the number of predicate nodes in the flow graph G
Q35.
If we define the functions f, g and h that map R into R by :

f(x) = x4, g(x) = √x2 + 1, h(x) = x2 + 72,  then the value of the composite functions ho(gof) and (hog)of are given as

a.

x^8 - 71 and x^8 - 71

b.

x^8 - 73 and x^8 - 73

c.

x^8 + 71 and x^8 + 71

d.

x^8 + 73 and x^8 + 73

Discuss
Answer: (d).x^8 + 73 and x^8 + 73
Q36.
Dijkstra algorithm, which solves the single-source shortest-paths problem, is a_______________, and the Floyd-Warshall algorithm, which finds shortest paths between all pairs of vertices, is a _____________.

a.

Greedy algorithm, Divide-conquer algorithm

b.

Divide-conquer algorithm, Greedy algorithm

c.

Greedy algorithm, Dynamic programming algorithm

d.

Dynamic programming algorithm, Greedy algorithm

Discuss
Answer: (d).Dynamic programming algorithm, Greedy algorithm
Q37.
Equivalent logical expression for the Well Formed Formula (WFF), ~(∀ x)F[x] is

a.

(∀ x) ~F[x]

b.

~( ∃ x) F[x]

c.

( ∃ x)~ ( F[x])

d.

(∀ x)F[x]

Discuss
Answer: (c).( ∃ x)~ ( F[x])
Q38.
An A * algorithm is a heuristic search technique which

a.

is like a depth-first search where most promising child is selected for expansion

b.

generates all successor nodes and computes an estimate of distance (cost) from start node to a goal node through each of the successors. It then chooses the successor with shortest cost

c.

saves all path lengths (costs) from start node to all generated nodes and chooses shortest path for further expansion

d.

None of the above

Discuss
Answer: (b).generates all successor nodes and computes an estimate of distance (cost) from start node to a goal node through each of the successors. It then chooses the successor with shortest cost
Q39.
The resolvent of the set of clauses (A v B, ~ A v D, C v ~B) is

a.

A v B

b.

C v D

c.

A v C

d.

A v D

Discuss
Answer: (b).C v D
Q40.
How many strings of 5 digits have the property that the sum of their digits is 7 ?

a.

66

b.

330

c.

495

d.

99

Discuss
Answer: (b).330
Page 4 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!

Data Structures and Algorithms

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

Hadoop

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

Cyber Security

Understand the fundamentals of safeguarding digital assets with our Cyber Security...

Systems Analysis and Design Methods

Get familiar with the process of designing and improving business systems with our...

Neural Networks

Dive into the world of Artificial Intelligence with our Neural Networks MCQs. Uncover...

Software Engineering

Learn about the systematic approach to developing software with our Software...

CSS

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

Reverse Engineering

Strengthen your understanding of Reverse Engineering with our curated set of MCQs....

Cryptography and Network Security

Secure your knowledge of information security with our Cryptography and Network...