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.
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 15 of 19
Explore more Topics under UGC CBSE NET Exam
List I List II
(a) Equivalence (i) p⇒q
(b) Contrapositive (ii) p⇒q : q⇒p
(c) Converse (iii) p⇒q : ∼q⇒∼p
(d) Implication (iv) p⇔q
Bus 30 people; Train 35 people; Automobile 100 people; Bus and Train 15 people; Bus and Automobile 15 people; Train and Automobile 20 people; and all the three methods 5 people. How many people completed the survey form?
(i) deg(v) ≥ n/3 for each vertex v
(ii) deg(v) + deg(w) ≥ n whenever v and w are not connected by an edge
(iii) E(G) ≥ 1/3(n−1)(n−2)+2
X = <0,1,2,1,3,0,1>
Y = <1,3,2,0,1,0>
The length of longest common subsequence between X and Y is
int f(int m, int n, boolean x, boolean y)
{
int res = 0;
if (m<0) {res = n - m;}
else if (x || y)
{
res = -1;
if(n == m){res = 1;}
}
else {res = n;}
return res;
} /*end of f *b = branching factor
d = depth of the shallowest solution
m = maximum depth of the search tree
l = depth limit
List I List II
(Algorithms) (Space Complexity)
(a) BFS search (i) O(bd)
(b) DFS search (ii) O(b^d)
(c) Depth-limited search (iii) O(bm)
(d) Iterative deepening search (iv) O(bl)
S1: A heuristic is admissible if it never overestimates the cost to reach the goal.
S2: A heuristic is monotonous if it follows triangle inequality property.
Which of the following is true referencing the above statements?
¬A ∨ ¬B ∨ ¬C ∨ ¬D
“There is a country that borders both India and Nepal”
Which of the following represents the above sentence correctly?
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!
