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

Explore more Topics under UGC CBSE NET Exam

Q171.
An undirected graph G (V, E) contains n (n > 2) nodes named v1, v2,...,vn. Two nodes vi and vj are connected if and only if 0 < | i – j | ≤ 2. Each edge (vi, vj) is assigned a weight i+j.
The cost of the minimum spanning tree of such a graph with 10 nodes is :

a.

88

b.

91

c.

49

d.

21

Discuss
Answer: (b).91
Q172.
A 4×4 DFT matrix is given in the figure below.
(j2=−1)
Where values of x and y are ..........., ............. respectively.

a.

1, −1

b.

−1, 1

c.

−j, j

d.

j, −j

Discuss
Answer: (d). j, −j
Q173.
Entropy of a discrete random variable with possible values {x1, x2, ..., xn} and probability density function P(X) is given below. The value of b gives the units of entropy. The unit for b=10 is :

a.

bits

b.

bann

c.

nats

d.

deca

Discuss
Answer: (d).deca
Q174.
For any binary (n, h) linear code with minimum distance (2t+1) or greater

a.

2t+1

b.

t+1

c.

t−1

d.

t

Discuss
Answer: (d).t
Q175.
Which of the following is a valid reason for causing degeneracy in a transportation problem? Here m is no. of rows and n is no. of columns in transportation table.

a.

When the number of allocations is m+n−1.

b.

When two or more occupied cells become unoccupied simultaneously.

c.

When the number of allocations is less than m+n−1.

d.

When a loop cannot be drawn without using unoccupied cells, except the starting cell of the loop.

Discuss
Answer: (c).When the number of allocations is less than m+n−1.
Q176.
Consider the following LPP :

Max Z=15x1+10x2
Subject to the constraints
4x1+6x2 ≤ 360
3x1+0x2 ≤ 180
0x1+5x2 ≤ 200
x1, x2 ≥ 0

The solution of the LPP using Graphical solution technique is :

a.

x1=60, x2=0 and Z=900

b.

x1=60, x2=20 and Z=1100

c.

x1=60, x2=30 and Z=1200

d.

x1=50, x2=40 and Z=1150

Discuss
Answer: (b).x1=60, x2=20 and Z=1100
Q177.
Consider the following LPP :

Min Z=2x1+x2+3x3
Subject to :
x1−2x2+x3 ≥ 4
2x1+x2+x3 ≤ 8
x1−x3 ≥ 0
x1, x2, x3 ≥ 0

The solution of this LPP using Dual Simplex Method is :

a.

x1=0, x2=0, x3=3 and Z=9

b.

x1=0, x2=6, x3=0 and Z=6

c.

x1=4, x2=0, x3=0 and Z=8

d.

x1=2, x2=0, x3=2 and Z=10

Discuss
Answer: (c).x1=4, x2=0, x3=0 and Z=8
Q178.
Consider a Takagi - Sugeno - Kang (TSK) Model consisting of rules of the form :
If x1 is Ai1 and ... and xr is Air
THEN y =fi(x1, x2, ..., xr) = bi0+bi1 x1+...+bir xr
assume, αi is the matching degree of rule i, then the total output of the model is given by:

a.

1

b.

2

c.

3

d.

4

Discuss
Answer: (b).2
Q179.
Consider a single perceptron with sign activation function. The perceptron is represented by weight vector [0.4 −0.3 0.1]^t and a bias θ=0. If the input vector to the perceptron is X=[0.2 0.6 0.5] then the output of the perceptron is :

a.

1

b.

0

c.

−0.05

d.

−1

Discuss
Answer: (d).−1
Q180.
The Sigmoid activation function f(t) is defined as :

a.

1

b.

2

c.

3

d.

4

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

Cryptography and Network Security

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

Artificial Intelligence

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

Neural Networks

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

Software Architecture and Design

Get a strong hold on the blueprint of software systems with our Software Architecture...

Microprocessor

Understand the heart of your computer with our Microprocessor MCQs. Topics include...

Data Structures and Algorithms

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

Operating System

Dive deep into the core of computers with our Operating System MCQs. Learn about...

DBMS

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

MS Office

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