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

Explore more Topics under UGC CBSE NET Exam

Q41.
Consider an experiment of tossing two fair dice, one black and one red. What is the probability that the number on the black die divides the number on red die ?

a.

22 / 36

b.

12 / 36

c.

14 / 36

d.

6 / 36

Discuss
Answer: (c).14 / 36
Q42.
In how many ways can 15 indistinguishable fishes be placed into 5 different ponds, so that each pond contains atleast one fish ?

a.

1001

b.

3876

c.

775

d.

200

Discuss
Answer: (a).1001
Q43.
Consider a Hamiltonian Graph (G) with no loops and parallel edges. Which of the following is true with respect to this Graph (G) ?
(a) deg (v) >= n / 2 for each vertex of G
(b)  | E(G) | >= 1 / 2 (n-1) (n-2) + 2 edges
(c) deg (v) + deg (w) >= n for every v and w not connected by an edge

a.

(a) and (b)

b.

(b) and (c)

c.

(a) and (c)

d.

(a), (b) and (c)

Discuss
Answer: (d).(a), (b) and (c)
Q44.
An all-pairs shortest-paths problem is efficiently solved using :

a.

Dijkstra' algorithm

b.

Bellman-Ford algorithm

c.

Kruskal algorithm

d.

Floyd-Warshall algorithm

Discuss
Answer: (d).Floyd-Warshall algorithm
Q45.
The travelling salesman problem can be solved in :

a.

Polynomial time using dynamic programming algorithm

b.

Polynomial time using branch-and-bound algorithm

c.

Exponential time using dynamic programming algorithm or branch-and-bound algorithm

d.

Polynomial time using backtracking algorithm

Discuss
Answer: (c).Exponential time using dynamic programming algorithm or branch-and-bound algorithm
Q46.
Let f (n) and g(n) be asymptotically non-negative functions. Which of the following is correct?

a.

0(f(n)*g(n)) = min(f(n), g(n))

b.

0(f(n)*g(n)) = max(f(n), g(n))

c.

0(f(n)+g(n)) = min(f(n), g(n))

d.

0(f(n)+g(n)) = max(f(n), g(n))

Discuss
Answer: (d).0(f(n)+g(n)) = max(f(n), g(n))
Q47.
Given the following equalities :

E1 : nK+∈ + nK lg n = Ф(nK+∈) for all fixed K and ∈, K ≥ 0 and ∈ > 0.

E2 : n32n + 6n23n = O(n32n)

Which of the following is true ?

a.

E1 is correct and E2 is correct

b.

E1 is correct and E2 is not correct

c.

E1 is not correct and E2 is correct

d.

E1 is not correct and E2 is not correct

Discuss
Answer: (b).E1 is correct and E2 is not correct
Q48.
How many different equivalence relations with exactly three different equivalence classes are there on a set with five elements

a.

10

b.

15

c.

25

d.

30

Discuss
Answer: (b).15
Q49.
Suppose that R1 and R2 are reflexive relations on a set A.
Which of the following statements is correct ?

a.

R1 ∩R2 is Reflexive and R1 ∪R2 is irreflexive

b.

R1 ∩R2 is irReflexive and R1 ∪R2 is reflexive

c.

Both R1 ∩R2 and R1 ∪R2 are reflexive

d.

Both R1 ∩R2 and R1 ∪R2 are irreflexive

Discuss
Answer: (c).Both R1 ∩R2 and R1 ∪R2 are reflexive
Q50.
There are three cards in a box. Both sides of one card are black, both sides of one card are red, and the third card has one black side and one red side. we pick a card at random and observe only one side. What is the probability that the opposite side is the same colour as the one side we observed ?

a.

3/4

b.

2/3

c.

1/2

d.

1/3

Discuss
Answer: (b).2/3
Page 5 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!

Visual Basic

Enhance your knowledge of Microsoft's event-driven programming language with our...

Cloud Computing

Stay on top of the biggest trend in IT with our Cloud Computing MCQs. These questions...

Web Technologies

Master the building blocks of the web with our Web Technologies MCQs. From HTML and...

Cyber Security

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

Reverse Engineering

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

Compiler Design

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

DBMS

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

MATLAB

Hone your computational mathematics skills with our MATLAB MCQs. Understand...

Systems Programming

Decode low-level programming with our Systems Programming MCQs. These questions delve...