MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 379 Mcqs, each offering curated multiple-choice questions to sharpen your VITEEE knowledge and support exam preparation. Choose a topic below to get started.
| 251. |
Boolean expression except 0 expressed in an equivalent form is called _____. |
| A. | canonical |
| B. | sum |
| C. | product |
| D. | standard |
| Answer» B. sum | |
| 252. |
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» E. | |
| 253. |
Surjective function is also called ________. |
| A. | onto |
| B. | into |
| C. | one to one |
| D. | one one onto |
| Answer» B. into | |
| 254. |
The intersection of the sets {1, 2, 5} and {1, 2, 6} is the set ___________. |
| A. | {1, 2} |
| B. | {5, 6} |
| C. | {2, 5} |
| D. | {1, 6} |
| Answer» B. {5, 6} | |
| 255. |
If "S -> aS, S -> a" are the productions in a grammar G, then the grammar is called_____. |
| A. | regular grammar |
| B. | phrase structure grammar |
| C. | context free grammar |
| D. | context sensitive grammar |
| Answer» B. phrase structure grammar | |
| 256. |
The composition of function is associative but not _______. |
| A. | commutative |
| B. | associative |
| C. | distributive |
| D. | idempotent |
| Answer» B. associative | |
| 257. |
The set O of odd positive integers less than 10 can be expressed by ___________ . |
| A. | {1, 2, 3} |
| B. | {1, 3, 5, 7, 9} |
| C. | {1, 2, 5, 9} |
| D. | {1, 5, 7, 9, 11} |
| Answer» C. {1, 2, 5, 9} | |
| 258. |
If each non-empty subset of a lattice has a least upper bound and greatest lower bound thenthe lattice is called ________. |
| A. | complete |
| B. | associative |
| C. | absorption |
| D. | commutative |
| Answer» B. associative | |
| 259. |
The relation R defined on the set of natural numbers as {(a, b): a differs from b by 3} is given |
| A. | {(1, 4), (2, 5), (3, 6), ….} |
| B. | { (4, 1), (5, 2), (6, 3), ….} |
| C. | {(4, 1), (5, 2), (6, 3), ….} |
| D. | none of the above |
| Answer» C. {(4, 1), (5, 2), (6, 3), ….} | |
| 260. |
If R = {x, y) : x, y Î Z, x2 + y2 £ 4} is a relation in z, then domain of R is |
| A. | {0, 1, 2} |
| B. | {– 2, – 1, 0} |
| C. | {– 2, – 1, 0, 1, 2} |
| D. | none of these |
| Answer» D. none of these | |
| 261. |
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» D. AB tends to CD | |
| 262. |
If the vertices of a walk W are distinct then W is called __________. |
| A. | path |
| B. | trial |
| C. | walk |
| D. | tour |
| Answer» B. trial | |
| 263. |
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» B. Rule P and Rule T | |
| 264. |
Each loop counting has _________ edges. |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
| 265. |
The number of Indians in the world is _________. |
| A. | finite set |
| B. | universal set |
| C. | infinite set |
| D. | equal set |
| Answer» B. universal set | |
| 266. |
Let R be the set of real numbers. If f : R → R is a function defined by f ( x ) = x2 , then f is] |
| A. | inject ve but not subjective |
| B. | subjective but not injective |
| C. | bijective |
| D. | none of these |
| Answer» E. | |
| 267. |
The statements that we consider initially are simple statements called_________statements. |
| A. | molecular |
| B. | compound |
| C. | atomic |
| D. | simple |
| Answer» D. simple | |
| 268. |
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» B. edge disjoint | |
| 269. |
A set containing no element is called ____________. |
| A. | null set |
| B. | finite set |
| C. | infinite set |
| D. | equal set |
| Answer» B. finite set | |
| 270. |
An edge with same ends is called ___________. |
| A. | complete graph |
| B. | bipartite graph |
| C. | loops |
| D. | link |
| Answer» E. | |
| 271. |
Power set of empty set has exactly _____ subset. |
| A. | one |
| B. | two |
| C. | zero |
| D. | three |
| Answer» B. two | |
| 272. |
An example for regular grammar is _____. |
| A. | S tends to Ab |
| B. | AB tends to SAB |
| C. | S tends to aB |
| D. | S tends to aBB |
| Answer» D. S tends to aBB | |
| 273. |
If a relation is reflexive, then all the diagonal entries in the relation matrix must be________. |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | -1 |
| Answer» C. 2 | |
| 274. |
If (p ˅ q) ˄ (~ p˅ ~q) is F, then |
| A. | p is t, q is t, or q is f |
| B. | p is f, q is t |
| C. | p is t, q is f |
| D. | p and q must have same truth values |
| Answer» E. | |
| 275. |
Any subset L of A* is called ________ over A. |
| A. | Language |
| B. | Syntax |
| C. | Alphabet |
| D. | Word |
| Answer» B. Syntax | |
| 276. |
The symmetric difference A ⊕ B is the set |
| A. | a – a ∩ b |
| B. | (a∪ b) – (a∩ b) |
| C. | (a – b) ∩ (b – a) |
| D. | a ∪ (b – a) |
| Answer» C. (a – b) ∩ (b – a) | |
| 277. |
Let P: We should be honest., Q: We should be dedicated., R: We should be overconfident. Then ‘Weshould be honest or dedicated but not overconfident.’ Is best represented by? |
| A. | ~P V ~Q V R |
| B. | P ∧ ~Q ∧ R |
| C. | P V Q ∧ R |
| D. | P V Q ∧ ~R |
| Answer» E. | |
| 278. |
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» B. a contradiction | |
| 279. |
Every block with at least three vertices are __________connected. |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
| 280. |
By mathematical Induction 2n> n3 |
| A. | for n ≥ 1 |
| B. | for n ≥ 4 |
| C. | for n ≥ 5 |
| D. | for n ≥ 10 |
| Answer» E. | |
| 281. |
What is the Cardinality of the Power set of the set {0, 1, 2}. |
| A. | 8 |
| B. | 6 |
| C. | 7 |
| D. | 9 |
| Answer» B. 6 | |
| 282. |
Hamilton cycle is a cycle that contains every ________of G. |
| A. | path |
| B. | cycle |
| C. | vertex |
| D. | edge |
| Answer» D. edge | |
| 283. |
A graph in which every vertex has same degree is called _________graph. |
| A. | regular |
| B. | simple |
| C. | complete |
| Answer» B. simple | |
| 284. |
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» C. {(y, a), (1, z), (3, y)} | |
| 285. |
An undirected graph is tripartite if and only if it has no circuits of _______ lengths |
| A. | odd |
| B. | even |
| C. | distinct |
| D. | equal |
| Answer» B. even | |
| 286. |
If p ˄ q is T, then |
| A. | p is t, q is t |
| B. | p is f, q is t |
| C. | p is f, q is f |
| D. | p is t, q is f |
| Answer» C. p is f, q is f | |
| 287. |
Max-terms of two statements are formed by introducing the connective _________. |
| A. | disjunction |
| B. | conjunction |
| C. | negation |
| D. | conditional |
| Answer» B. conjunction | |
| 288. |
Among the integers 1 to 300, the number of integers which are divisible by 3 or 5 is |
| A. | 100 |
| B. | 120 |
| C. | 130 |
| D. | 140 |
| Answer» E. | |
| 289. |
A finite non-empty set of symbols is called _________. |
| A. | alphabet |
| B. | letter |
| C. | string |
| D. | language |
| Answer» B. letter | |
| 290. |
R is a relation defined in Z by aRb if and only if ab ³ 0, then R is |
| A. | reflexive |
| B. | symmetric |
| C. | transitive |
| D. | equivalence |
| Answer» E. | |
| 291. |
If the edges of a walk W are distinct then W is called _________. |
| A. | path |
| B. | trial |
| C. | walk |
| D. | tour |
| Answer» E. | |
| 292. |
The difference of {1, 2, 3} and {1, 2, 5} is the set _________. |
| A. | {1} |
| B. | {5} |
| C. | {3} |
| D. | {2} |
| Answer» D. {2} | |
| 293. |
The set of all finite words over E is denoted by ________. |
| A. | E+ |
| B. | E* |
| C. | E |
| D. | E |
| Answer» B. E* | |
| 294. |
DFSA and NDFSA represent the ________ language. |
| A. | regular |
| B. | context free |
| C. | context sensitive |
| D. | phrase structure |
| Answer» B. context free | |
| 295. |
The number of pendant vertices in a full binary tree with n vertices is ________. |
| A. | (n-a)/2 |
| B. | (n-1)/2 |
| C. | (n+a)/2 |
| D. | n/2 |
| Answer» D. n/2 | |
| 296. |
The set X*X itself defines a relation in X is called a _____relation. |
| A. | void |
| B. | universal |
| C. | partial |
| D. | equivalence |
| Answer» C. partial | |
| 297. |
Which of the following regular expressions identifiers are true? |
| A. | (r*)* = r |
| B. | (r+s)* = r* . s* |
| C. | r*.s* = r* + s* |
| D. | (r.s)* = r*/s* |
| Answer» B. (r+s)* = r* . s* | |
| 298. |
The duality law of (P^Q)vT is ________. |
| A. | (P^Q)^T |
| B. | (PvQ)^T |
| C. | (PvQ)vF |
| D. | (PvQ)^F |
| Answer» E. | |
| 299. |
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» B. hamiltonian | |
| 300. |
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» E. | |