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

Explore more Topics under UGC CBSE NET Exam

Q21.
How many edges are there in a forest of t-trees containing a total of n vertices?

a.

n + t

b.

n -t

c.

n * t

d.

n^t

Discuss
Answer: (b).n -t
Q22.
Let f and g be the functions from the set of integers to the set integers defined by

f(x) = 2x + 3 and g(x) = 3x + 2

Then the composition  of f and g and g and f is given as

a.

6x+7,  6x+11

b.

6x + 11, 6x + 7

c.

5x + 5, 5x + 5

d.

None of the above

Discuss
Answer: (a).6x+7,  6x+11
Q23.
A graph is non-planar if and only if it contains a subgraph homomorphic to

a.

K3, 2 or K5

b.

K3,3 and K6

c.

K3,3 or K5

d.

k2,3 and K5

Discuss
Answer: (c).K3,3 or K5
Q24.
If the primal Linear Programming problem has unbounded  solution, then it's dual problem will  have

a.

feasible solution

b.

alternative solution

c.

no feasible solution at all

d.

no bounded solution at all

Discuss
Answer: (c).no feasible solution at all
Q25.
Given the problem to maximize
            f(x), X =(x1, x2 ,..... .xn)
subject to m number of inequality constraints
  gi(x) ≤ bi  , i = 1, 2 ...... m
including the non-negativity constraints x ≥ 0
Which of the following conditions is a Kuhn-Tucker necessary condition for a local maxima at x  ?

a.

∂L(X ' , λ' , S') / ∂xj = 0 , j= 1,2.....m

b.

λ[gi(X') -bi]= 0, i =1,2,3...m

c.

gi (X ') ≤ bi , i = 1,2....m

d.

All of these

Discuss
Answer: (b).λ[gi(X') -bi]= 0, i =1,2,3...m
Q26.
The following Linear Programming problem has :
Max                                   Z =x1 +x2
Subject to                         = x1-x2 ≥ 0                                  
                                             3x1 -x2 ≤ -3                                
      and                              xI , x2  ≥ 0

a.

Feasible solution

b.

No feasible solution

c.

Unbounded solution

d.

Single point as solution

Discuss
Answer: (c).Unbounded solution
Q27.
Given a flow graph with 10 nodes,13 edges and one connected components, the number of regions and the number  of predicate (decision) nodes in the flow graph will be

a.

4, 5

b.

5, 4

c.

3, 1

d.

13, 8

Discuss
Answer: (b).5, 4
Q28.
If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from the current node to the goal node, then A*algorithm gives an optimal solution if

a.

h* is equal to h

b.

h* overestimates h

c.

h* underestimates h

d.

none of these

Discuss
Answer: (c).h* underestimates h
Q29.
The recurrence relation T(n) = m T(n/2) tan2 is satisfied by

a.

O(n^2)

b.

O(n^logm)

c.

O(n^2 log n)

d.

O(n log n)

Discuss
Answer: (b).O(n^logm)
Q30.
A ___________ complete subgraph and a __________ subset of vertices of a graph G = (V, E) are a clique and a vertex cover respectively.

a.

minimal, maximal

b.

minimal, minimal

c.

maximal, maximal

d.

maximal, minimal

Discuss
Answer: (d).maximal, minimal
Page 3 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!

Embedded Systems

Dive into the world of specialized computing systems with our Embedded Systems MCQs....

Web Technologies

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

C# programming

Hone your skills in the C# language with our MCQs. Understand data types, operators,...

Reverse Engineering

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

Computer Graphics

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

MySQL Database

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

R Programming

Unleash the power of statistical computing with our R Programming MCQs. Topics cover...

Hadoop

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

Java Spring Framework

Enhance your Java development skills with our Spring Framework MCQs. Learn about...