McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) .
| 301. |
A finite non-empty set of symbols is called _________. |
| A. | alphabet |
| B. | letter |
| C. | string |
| D. | language |
| Answer» A. alphabet | |
| 302. |
The specification of proper construction of a sentence is called ______. |
| A. | alphabet |
| B. | letter |
| C. | syntax |
| D. | word |
| Answer» C. syntax | |
| 303. |
Context free grammar is also known as _______ grammar. |
| A. | type 0 |
| B. | type 1 |
| C. | type 2 |
| D. | type 3 |
| Answer» C. type 2 | |
| 304. |
A class of machine which accepts a ________ language is called finite state automata. |
| A. | type 0 |
| B. | type 1 |
| C. | type 2 |
| D. | type 3 |
| Answer» D. type 3 | |
| 305. |
Accepting states are denoted by ________. |
| A. | circle |
| B. | an arrow mark |
| C. | double circle |
| D. | straight line |
| Answer» C. double circle | |
| 306. |
For converting NDFA to DFA we should __________ all the states which have no incoming. |
| A. | add |
| B. | subtract |
| C. | multiply |
| D. | delete |
| Answer» D. delete | |
| 307. |
The set of all finite words over E is denoted by ________. |
| A. | E+ |
| B. | E* |
| C. | E |
| D. | E |
| Answer» A. E+ | |
| 308. |
Surjective function is also called ________. |
| A. | onto |
| B. | into |
| C. | one to one |
| D. | one one onto |
| Answer» A. onto | |
| 309. |
One to one onto function is also called __________. |
| A. | bijective |
| B. | injective |
| C. | surjective |
| D. | composite function |
| Answer» A. bijective | |
| 310. |
The composition of function is associative but not _______. |
| A. | commutative |
| B. | associative |
| C. | distributive |
| D. | idempotent |
| Answer» A. commutative | |
| 311. |
A mapping x into itself is called __________. |
| A. | reflexive |
| B. | symmetric |
| C. | transitive |
| D. | equivalence |
| Answer» A. reflexive | |
| 312. |
The duality law of (P^Q)vT is ________. |
| A. | (P^Q)^T |
| B. | (PvQ)^T |
| C. | (PvQ)vF |
| D. | (PvQ)^F |
| Answer» D. (PvQ)^F | |
| 313. |
A sum of the variables and their negations in a formula is called _________. |
| A. | elementary sum |
| B. | elementary product |
| C. | cnf |
| D. | dnf |
| Answer» A. elementary sum | |
| 314. |
A premise may be introduced at any point in the derivation is called ________. |
| A. | Rule P |
| B. | Rule P and Rule T |
| C. | Rule T |
| D. | Rule CP |
| Answer» A. Rule P | |
| 315. |
A product of the variables and their negations in a formula is called _________. |
| A. | elementary product |
| B. | elementary sum |
| C. | cnf |
| D. | dnf |
| Answer» A. elementary product | |
| 316. |
Min-terms of two statements are formed by introducing the connective _________. |
| A. | Conjunction |
| B. | disjunction |
| C. | Conditional |
| D. | negation |
| Answer» A. Conjunction | |
| 317. |
Any vertex having degree one is called _______. |
| A. | Simple vertex |
| B. | pendent vertex |
| C. | regular vertex |
| D. | complete vertex |
| Answer» B. pendent vertex | |
| 318. |
A graph that has neither self loops nor parallel edges is called_____graph. |
| A. | regular |
| B. | simple |
| C. | complete |
| D. | null |
| Answer» B. simple | |
| 319. |
A graph in which every vertex has same degree is called _________graph. |
| A. | regular |
| B. | simple |
| C. | complete |
| D. | null |
| Answer» A. regular | |
| 320. |
Kn denotes _______graph. |
| A. | regular |
| B. | simple |
| C. | complete |
| D. | null |
| Answer» C. complete | |
| 321. |
The number of vertices of odd degree in a graph is always________. |
| A. | odd |
| B. | even |
| C. | zero |
| D. | one |
| Answer» B. even | |
| 322. |
A path of a graph is said to be ______ if it contains all the edges of the graph. |
| A. | eulerian |
| B. | hamiltonian |
| C. | tournament |
| D. | planar |
| Answer» A. eulerian | |
| 323. |
Traveling salesman problem is example for_______graph. |
| A. | eulerian |
| B. | hamiltonian |
| C. | tournament |
| D. | planar |
| Answer» B. hamiltonian | |
| 324. |
If a node v is reachable from node u then the path of minimum length u to v is called _____. |
| A. | reachability |
| B. | node base |
| C. | geodesic |
| D. | accessibility |
| Answer» C. geodesic | |
| 325. |
The eccentricity of a center in a tree is defined as ______ of the tree. |
| A. | radius |
| B. | diameter |
| C. | length |
| D. | path |
| Answer» A. radius | |
| 326. |
P -> Q , Q ->R then________. |
| A. | P -> R |
| B. | R -> P |
| C. | Q |
| D. | R |
| Answer» A. P -> R | |
| 327. |
If a normal form contains all minterms, then it is ________. |
| A. | a tautology |
| B. | a contradiction |
| C. | a contingency |
| D. | both a and b |
| Answer» A. a tautology | |
| 328. |
PCNF is also called _______. |
| A. | sum of product canonical form. |
| B. | product of sum canonical form |
| C. | sum canonical form |
| D. | product canonical form |
| Answer» B. product of sum canonical form | |
| 329. |
PDNF is also called _____________ |
| A. | sum of product canonical form |
| B. | product of sum canonical form |
| C. | sum canonical form |
| D. | product canonical form |
| Answer» A. sum of product canonical form | |
| 330. |
Max-terms of two statements are formed by introducing the connective _________. |
| A. | disjunction |
| B. | conjunction |
| C. | negation |
| D. | conditional |
| Answer» A. disjunction | |
| 331. |
The Subset relation on a set of sets is ________. |
| A. | partial ordering |
| B. | equivalence relation |
| C. | reflexive and symmetric only |
| D. | symmetric and transitive only |
| Answer» A. partial ordering | |
| 332. |
A relation R is defined on the set of integers as xRy if and only if (x+y) is even. Which of the following statement is TRUE? |
| A. | R is not an equivalence relation. |
| B. | R is an equivalence relation having one equivalence classes |
| C. | R is an equivalence relation having two equivalence classes |
| D. | R is an equivalence relation having three equivalence classes |
| Answer» C. R is an equivalence relation having two equivalence classes | |
| 333. |
If R = {(1, y), (1, z), (3, y)} then R power (-1)= ___________. |
| A. | {(1, a), (y, z)} |
| B. | {(y, 1), (z, 1), (y, 3)} |
| C. | {(y, a), (1, z), (3, y)} |
| D. | {(y, a), (z, a), (3, y)} |
| Answer» B. {(y, 1), (z, 1), (y, 3)} | |
| 334. |
Let R ={ (a,b),(c,d),(b,b)}, S = {(d,b),(c,b),(a,d)} then R composite S = ___________ |
| A. | {(a,e),(c,b),(b,e)} |
| B. | {(d,b),(c,b),(a,d)} |
| C. | {(a,b),(b,b)} |
| D. | {(c,b)} |
| Answer» D. {(c,b)} | |
| 335. |
Let R and S be two relations on a set of positive integers I. If R = {(a, 3a+a)},S = {(a,a+a)} then R composition R composition R = __________. |
| A. | {(a,3a+a)} |
| B. | {(a,9a+a)} |
| C. | {(a,27a+a)} |
| D. | {(a,9a+c)} |
| Answer» C. {(a,27a+a)} | |
| 336. |
The number of relations from A = {a,b,c} to B = {1,2} are __________. |
| A. | 6 |
| B. | 8 |
| C. | 32 |
| D. | 64 |
| Answer» D. 64 | |
| 337. |
The minimum number of edges in a connected graph with n vertices is ___________. |
| A. | n |
| B. | n-1 |
| C. | n+1 |
| D. | n+2 |
| Answer» B. n-1 | |
| 338. |
The number of distinct simple graphs with up to three nodes is _________. |
| A. | 7 |
| B. | 9 |
| C. | 15 |
| D. | 25 |
| Answer» A. 7 | |
| 339. |
A graph is planar if and only if it does not contain ________. |
| A. | subgraphs homeomorphic to k3 & k3,3 |
| B. | subgraphs isomorphic to k5 or k3,3 |
| C. | subgraphs isomorphic to k3 & k3,3 |
| D. | sub graphs homeomorphic to k5 or k3,3 |
| Answer» D. sub graphs homeomorphic to k5 or k3,3 | |
| 340. |
Maximum number of edges in an n-node undirected graph without self loops is ____. |
| A. | [n(n-a)]/2 |
| B. | n-1 |
| C. | n |
| D. | [n(n+a)]/2 |
| Answer» A. [n(n-a)]/2 | |
| 341. |
Number of distinct nodes in any elementary path of length p is ________. |
| A. | p |
| B. | p-1 |
| C. | p+1 |
| D. | p*1 |
| Answer» C. p+1 | |
| 342. |
The total number of edges in a complete graph of n vertices is _________. |
| A. | n |
| B. | n/2 |
| C. | [n(n-a)]/3 |
| D. | [n(n-a)]/2 |
| Answer» D. [n(n-a)]/2 | |
| 343. |
A directed complete graph of n vertices contains __________. |
| A. | one arrow between each pair of distinct vertices |
| B. | two arrows between each pair of distinct vertices |
| C. | n-1 arrows between each pair of distinct vertices |
| D. | path between every two distinct vertices |
| Answer» A. one arrow between each pair of distinct vertices | |
| 344. |
A directed graph G = (V, E) is said to be finite if its ________. |
| A. | set V of vertices is finite |
| B. | set V of vertices & set E of edges are finite |
| C. | set E of edges are finite |
| D. | no vertices & edges are repeated |
| Answer» A. set V of vertices is finite | |
| 345. |
A state from which a deterministic finite state automata can never come out is called a ____________. |
| A. | trape state |
| B. | starting symbol |
| C. | transition table |
| D. | transition diagram |
| Answer» A. trape state | |
| 346. |
If a compound statement is made up of three simple statements then the number of rows in the truth table is _______. |
| A. | 2 |
| B. | 4 |
| C. | 6 |
| D. | 8 |
| Answer» D. 8 | |
| 347. |
Let R = {(3, 3), (6, 6), (9, 9), (12,12), (3,6), (6,3), (3, 9), (9, 3), (9, 12),(12,9)} be a relation on the set A = {3, 6, 9, 12}. The relation is _________ |
| A. | reflexive and transitive |
| B. | reflexive and symmetric |
| C. | symmetric and transitive |
| D. | equivalence relation |
| Answer» D. equivalence relation | |
| 348. |
Let R={(1,b),(3,d),(2,b)} and S={(b,4),(2,5),(d,a)} be a relation then R composition S=____. |
| A. | {(1,b),(3,d),(2,b)} |
| B. | {(1,4),(3,a),(2,4)} |
| C. | {(4,b),(2,5),(3,a)} |
| D. | {(1,d),(3,b),(2,c)} |
| Answer» B. {(1,4),(3,a),(2,4)} | |
| 349. |
If R= {(x, 2x)} and S= {(x, 4x)} then R composition S=____. |
| A. | {(x, 4x)} |
| B. | {(x, 2x)} |
| C. | {(x, 8x)} |
| D. | {(x, 10x)} |
| Answer» C. {(x, 8x)} | |
| 350. |
If R= {(x, 2x)} and S= {(x, 5x)} then R composition S=____. |
| A. | {(x, 4x)} |
| B. | {(x, 2x)} |
| C. | {(x, 8x)} |
| D. | {(x, 10x)} |
| Answer» D. {(x, 10x)} | |
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.