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

Explore more Topics under UGC CBSE NET Exam

Q151.
A full joint distribution for the Toothache, Cavity and Catch is given in the table below. What is the probability of Cavity, given evidence of Toothache?

a.

<0.2,0.8>

b.

<0.4,0.8>

c.

<0.6,0.8>

d.

<0.6,0.4>

Discuss
Answer: (d).<0.6,0.4>
Q152.
E is the number of edges in the graph and f is maximum flow in the graph. When the capacities are integers, the runtime of Ford-Fulberson algorithm is bounded by:

a.

O (E∗f)

b.

O (E^2∗f)

c.

O (E∗f^2)

d.

O (E^2∗f^2)

Discuss
Answer: (a).O (E∗f)
Q153.
Which of the following statements is false about convex minimization problem?

a.

If a local minimum exists, then it is a global minimum

b.

The set of all global minima is convex set

c.

The set of all global minima is concave set

d.

For each strictly convex function, if the function has a minimum, then the minimum is unique

Discuss
Answer: (c).The set of all global minima is concave set
Q154.
The following LPP
Maximize z = 100x1+2x2+5x3
Subject to

14x1+x2−6x3+3x4 = 7
32x1+x2−12x3 ≤ 10
3x1−x2−x3 ≤ 0
x1, x2, x3, x4 ≥ 0

has

a.

Solution: x1=100, x2=0, x3=0

b.

Unbounded solution

c.

No solution

d.

Solution: x1=50, x2=70, x3=60

Discuss
Answer: (b).Unbounded solution
Q155.
Digital data received from a sensor can fill up 0 to 32 buffers. Let the sample space be S={0, 1, 2, .........., 32} where the sample j denote that j of the buffers are full and
p(i) =1/561 (33 - i). Let A denote the event that the even number of buffers are full. Then p(A) is:

a.

0.515

b.

0.785

c.

0.758

d.

0.485

Discuss
Answer: (a).0.515
Q156.
The equivalence of

¬ ∃x Q(x) is:

a.

∃ x ¬ Q(x)

b.

∀x ¬ Q(x)

c.

¬ ∃x ¬ Q(x)

d.

∀x Q(x)

Discuss
Answer: (b).∀x ¬ Q(x)
Q157.
If Ai = {−i, ... −2,−1, 0, 1, 2, . . . . . i}

a.

Z

b.

Q

c.

R

d.

C

Discuss
Answer: (a). Z
Q158.
Match the following in List - I and List - II, for a function f:

List - I
(a) ∀x ∀y (f (x)=f (y) → x=y)
(b) ∀y ∃ x (f (x)=y)
(c) ∀x f (x)=k

List - II
(i) Constant
(ii) Injective
(iii) Surjective

Code:
(a) (b) (c)

a.

(i) (ii) (iii)

b.

(iii) (ii) (i)

c.

(ii) (i) (iii)

d.

(ii) (iii) (i)

Discuss
Answer: (d).(ii) (iii) (i)
Q159.
Which of the relations on {0, 1, 2, 3} is an equivalence relation?

a.

{ (0, 0) (0, 2) (2, 0) (2, 2) (2, 3) (3, 2) (3, 3) }

b.

{ (0, 0) (1, 1) (2, 2) (3, 3) }

c.

{ (0, 0) (0, 1) (0, 2) (1, 0) (1, 1) (1, 2) (2, 0) }

d.

{ (0, 0) (0, 2) (2, 3) (1, 1) (2, 2) }

Discuss
Answer: (b).{ (0, 0) (1, 1) (2, 2) (3, 3) }
Q160.
Which of the following is an equivalence relation on the set of all functions from Z to Z?

a.

{ (f, g) | f(x)−g(x)=1 ∀x e Z }

b.

{ (f, g) | f(0)=g(0) or f (1)=g(1) }

c.

{ (f, g) | f(0)=g(1) and f (1)=g(0) }

d.

{ (f, g) | f(x)−g(x)=k for some k ∈ Z }

Discuss
Answer: (d). { (f, g) | f(x)−g(x)=k for some k ∈ Z }
Page 16 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!

Artificial Intelligence

Get started on the path to the future with our Artificial Intelligence MCQs. Covering...

Data Science

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

CompTIA PenTest+ Certification Exam PT0 002

Prepare for the CompTIA PenTest+ PT0-002 exam with our targeted MCQs. Covering...

Cryptography and Network Security

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

CSS

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

Digital Image Processing (DIP)

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

Object Oriented Programming

Enhance your coding skills with our Object Oriented Programming MCQs. Understand...

SQL Server

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

Reverse Engineering

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