McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) .
| 401. |
The number of elements in a square matrix of order n is _____. |
| A. | n power 3 |
| B. | n power 4 |
| C. | n power 5 |
| D. | n power 2 |
| Answer» D. n power 2 | |
| 402. |
Every non-trivial tree has at least _____ vertices of degree one. |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» B. 2 | |
| 403. |
A ____ is an edge e such that w(G-e)>w(G). |
| A. | cut vertex of G |
| B. | cut edge of G |
| C. | ends of G |
| D. | path of G |
| Answer» B. cut edge of G | |
| 404. |
Every connected graph contains a ________. |
| A. | tree |
| B. | sub tree |
| C. | spanning tree |
| D. | spanning subtree |
| Answer» C. spanning tree | |
| 405. |
A minimal non-empty edge cut of G is called a _________. |
| A. | bond |
| B. | cycle |
| C. | path |
| D. | tour |
| Answer» A. bond | |
| 406. |
A connected graph that has no cut vertices is called a ________. |
| A. | block |
| B. | bond |
| C. | cycle |
| D. | tour |
| Answer» A. block | |
| 407. |
Every block with at least three vertices are __________connected. |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» B. 2 | |
| 408. |
A graph is Eulerian if it contains __________. |
| A. | Euler tour |
| B. | Euler trail |
| C. | Hamiltonian path |
| D. | Euler path |
| Answer» A. Euler tour | |
| 409. |
Hamilton cycle is a cycle that contains every ________of G. |
| A. | path |
| B. | cycle |
| C. | vertex |
| D. | edge |
| Answer» C. vertex | |
| 410. |
Collection of human beings with 4 heads, 2 legs and two hands is a ________. |
| A. | null set |
| B. | finite set |
| C. | infinite set |
| D. | equal set |
| Answer» A. null set | |
| 411. |
A set containing no element is called ____________. |
| A. | null set |
| B. | finite set |
| C. | infinite set |
| D. | equal set |
| Answer» A. null set | |
| 412. |
A = {1,3,5,7,9} is a __________. |
| A. | null set |
| B. | finite set |
| C. | singleton set |
| D. | infinite set |
| Answer» B. finite set | |
| 413. |
The number of Indians in the world is _________. |
| A. | finite set |
| B. | universal set |
| C. | infinite set |
| D. | equal set |
| Answer» A. finite set | |
| 414. |
If in the truth table the answer column has the truth values both TRUE and FALSE then it is said to be ________. |
| A. | tautology |
| B. | contradiction |
| C. | contingency |
| D. | equivalence relation |
| Answer» C. contingency | |
| 415. |
To prove the statement P tautologically implies the statement Q, it is enough to prove that _________. |
| A. | P conditional Q is a contradiction |
| B. | P conditional Q is a tautology |
| C. | P biconditional is a contradiction |
| D. | P biconditional Q is a tautology |
| Answer» B. P conditional Q is a tautology | |
| 416. |
To prove the statement P is tautologically equivalent to the statement Q, it is enough to prove that _______. |
| A. | P conditional Q is a contradiction |
| B. | P conditional Q is a tautology |
| C. | P biconditional Q is a contradiction |
| D. | P biconditional Q is a tautology |
| Answer» D. P biconditional Q is a tautology | |
| 417. |
Let R={(1,2),(3,4),(2,6.} and S={(4,3),(2,5),(6,6)} be a relation then R composite S=____. |
| A. | {(1,5),(3,3),(2,6)} |
| B. | {(1,5),(3,6),(2,5)} |
| C. | {(4,4),(2,5),(3,3)} |
| D. | {(1,1),(3,3),(2,2)} |
| Answer» A. {(1,5),(3,3),(2,6)} | |
| 418. |
The binary relation R = {(0, 0), (1, a)} on A = {0, 1, 2, 3, } is _______. |
| A. | reflexive, not symmetric, transitive |
| B. | not reflexive, symmetric, transitive |
| C. | reflexive, symmetric, not transitive |
| D. | reflexive, not symmetric, not transitive |
| Answer» B. not reflexive, symmetric, transitive | |
| 419. |
There are only five distinct Hasse diagrams for partially ordered sets that contain _______elements. |
| A. | 2 |
| B. | 3 |
| C. | 4 |
| D. | 6 |
| Answer» B. 3 | |
| 420. |
The production S tends to aB is of the type ________grammar. |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | all the above |
| Answer» D. all the above | |
| 421. |
The production S tends to A is of the type _____grammar. |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | all the above |
| Answer» A. 0 | |
| 422. |
A regular grammar contain rules of the form is _____. |
| A. | A tends to AB |
| B. | AB tends to a |
| C. | A tends to aB |
| D. | AB tends to CD |
| Answer» C. A tends to aB | |
| 423. |
If an edge e is said to join the vertices u and v then the vertices u and v are called __. |
| A. | initial vertices |
| B. | terminal vertices |
| C. | ends of e |
| D. | all the above |
| Answer» B. terminal vertices | |
| 424. |
Edges intersect only at their ends are called ________. |
| A. | planar |
| B. | loop |
| C. | link |
| D. | non plannar |
| Answer» A. planar | |
| 425. |
Two vertices which are incident with the common edge are called ______________vertices. |
| A. | distinct |
| B. | directed |
| C. | adjacent |
| D. | loops |
| Answer» C. adjacent | |
| 426. |
An edge with identical ends is called _________. |
| A. | complete graph |
| B. | bipartite graph |
| C. | loops |
| D. | link |
| Answer» C. loops | |
| 427. |
An edge with same ends is called ___________. |
| A. | complete graph |
| B. | bipartite graph |
| C. | loops |
| D. | link |
| Answer» D. link | |
| 428. |
In a graph if few edges have directions and few do not have directions then the graph is called _________. |
| A. | multi graph |
| B. | directed graph |
| C. | undirected graph |
| D. | mixed graph |
| Answer» D. mixed graph | |
| 429. |
If two edges have same vertices as its terminal vertices those edges are called ____. |
| A. | parallel |
| B. | adjacent |
| C. | incident |
| D. | distinct |
| Answer» A. parallel | |
| 430. |
Each edge has one end in set X and one end in set Y then the graph (X, Y) is called _____graph. |
| A. | bipartite |
| B. | simple |
| C. | complete |
| D. | trivial |
| Answer» A. bipartite | |
| 431. |
The graph defined by the vertices and edges of a __________ is bipartite. |
| A. | square |
| B. | cube |
| C. | single |
| D. | both square and cube |
| Answer» B. cube | |
| 432. |
To any graph G there corresponds a vertex in a matrix called ________matrix. |
| A. | incidence |
| B. | adjacency |
| C. | square |
| D. | null |
| Answer» A. incidence | |
| 433. |
If H is a sub graph of G then G is a ______ of H. |
| A. | proper sub grapth |
| B. | inducted sub graph |
| C. | spanning subgraph |
| D. | super graph |
| Answer» D. super graph | |
| 434. |
If the graph G1 and G2 has no vertex in common then it is said to be ______. |
| A. | disjoint |
| B. | edge disjoint |
| C. | union |
| D. | intersection |
| Answer» A. disjoint | |
| 435. |
The degree of vertex v in G is __________. |
| A. | number of edges of G incident with v |
| B. | number of loops in G |
| C. | number of links in G |
| D. | number of sub graph in G |
| Answer» A. number of edges of G incident with v | |
| 436. |
If the edges of a walk W are distinct then W is called _________. |
| A. | path |
| B. | trial |
| C. | walk |
| D. | tour |
| Answer» D. tour | |
| 437. |
If the vertices of a walk W are distinct then W is called __________. |
| A. | path |
| B. | trial |
| C. | walk |
| D. | tour |
| Answer» A. path | |
| 438. |
Each loop counting has _________ edges. |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» B. 2 | |
| 439. |
The statements that we consider initially are simple statements called _________statements. |
| A. | molecular |
| B. | compound |
| C. | atomic |
| D. | simple |
| Answer» C. atomic | |
| 440. |
The statements formed from atomic statements are called _________statements. |
| A. | molecular |
| B. | compound |
| C. | atomic |
| D. | simple |
| Answer» A. molecular | |
| 441. |
The negation of the statement is formed by introducing ___________. |
| A. | not |
| B. | and |
| C. | or |
| D. | if |
| Answer» A. not | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.