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.
| 151. |
If two edges have same vertices as its terminal vertices those edges are called ____. |
| A. | parallel |
| B. | adjacent |
| C. | incident |
| D. | distinct |
| Answer» B. adjacent | |
| 152. |
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» C. sum canonical form | |
| 153. |
Kn denotes _______graph. |
| A. | regular |
| B. | simple |
| C. | complete |
| Answer» D. | |
| 154. |
The eccentricity of a center in a tree is defined as ______ of the tree. |
| A. | radius |
| B. | diameter |
| C. | length |
| D. | path |
| Answer» B. diameter | |
| 155. |
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» E. | |
| 156. |
There are only five distinct Hasse diagrams for partially ordered sets that contain_______elements. |
| A. | 2 |
| B. | 3 |
| C. | 4 |
| D. | 6 |
| Answer» C. 4 | |
| 157. |
The NOR statement is a combination of ________. |
| A. | NOT and AND |
| B. | NOT and OR |
| C. | AND and OR |
| D. | NOT or OR |
| Answer» C. AND and OR | |
| 158. |
What is the value of x after this statement, assuming the initial value of x is 5?‘If x equals to one then x=x+2 else x=0’. |
| A. | 1 |
| B. | 3 |
| C. | 2 |
| Answer» D. | |
| 159. |
The members of the set S = {x x is the square of an integer and x < 100} is _________________. |
| A. | {0, 2, 4, 5, 9, 58, 49, 56, 99, 12} |
| B. | {0, 1, 4, 9, 16, 25, 36, 49, 64, 81} |
| C. | {1, 4, 9, 16, 25, 36, 64, 81, 85, 99} |
| D. | {0, 1, 4, 9, 16, 25, 36, 49, 64, 121} |
| Answer» C. {1, 4, 9, 16, 25, 36, 64, 81, 85, 99} | |
| 160. |
The statements formed from atomic statements are called _________statements. |
| A. | molecular |
| B. | compound |
| C. | atomic |
| D. | simple |
| Answer» B. compound | |
| 161. |
Accepting states are denoted by ________. |
| A. | circle |
| B. | an arrow mark |
| C. | double circle |
| D. | straight line |
| Answer» D. straight line | |
| 162. |
The rank of the incidence matrix of any connected graph G with n vertices is ______. |
| A. | n |
| B. | n+1 |
| C. | n-1 |
| D. | n-2 |
| Answer» D. n-2 | |
| 163. |
Edges intersect only at their ends are called ________. |
| A. | planar |
| B. | loop |
| C. | link |
| D. | non plannar |
| Answer» B. loop | |
| 164. |
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» C. n+1 | |
| 165. |
If p ˄ (p → q) is T, then |
| A. | p is t |
| B. | p is f, q is t |
| C. | p is t, q is t |
| D. | p is f, q is f |
| Answer» D. p is f, q is f | |
| 166. |
A graph is bipartite if and only if its chromatic number is ________. |
| A. | 1 |
| B. | 2 |
| C. | odd |
| D. | even |
| Answer» C. odd | |
| 167. |
A graph is Eulerian if it contains __________. |
| A. | Euler tour |
| B. | Euler trail |
| C. | Hamiltonian path |
| D. | Euler path |
| Answer» B. Euler trail | |
| 168. |
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» E. | |
| 169. |
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» B. {(1,5),(3,6),(2,5)} | |
| 170. |
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» E. | |
| 171. |
If A is the set of students who play crocket, B is the set of students who play football then the set of students who play either football or cricket, but not both, can be symbolically depicted as the set |
| A. | a ⊕ b |
| B. | a ∪ b |
| C. | a – b |
| D. | a ∩ b |
| Answer» B. a ∪ b | |
| 172. |
If there are n distinct components in a statement then there are _______ combinations ofvalues in the truth table. |
| A. | 2^n |
| B. | n+1 |
| C. | n |
| D. | n+2 |
| Answer» B. n+1 | |
| 173. |
The number of distinct simple graphs with up to three nodes is _________. |
| A. | 7 |
| B. | 9 |
| C. | 15 |
| D. | 25 |
| Answer» B. 9 | |
| 174. |
Let R={(1,b),(3,d),(2,b)} and S={(b,4),(2,5),(d,a)} be a relation then R compositionS=____. |
| 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» C. {(4,b),(2,5),(3,a)} | |
| 175. |
The number of relations from A = {a,b,c} to B = {1,2} are __________. |
| A. | 6 |
| B. | 8 |
| C. | 32 |
| D. | 64 |
| Answer» E. | |
| 176. |
The negation of the statement is formed by introducing ___________. |
| A. | not |
| B. | and |
| C. | or |
| D. | if |
| Answer» B. and | |
| 177. |
Let R = {(3, 3), (6, 6), (9, 9), (12,12), (3,6), (6,3), (3, 9), (9, 3), (9, 12),(12,9)} be a relationon 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» E. | |
| 178. |
A relation R in a set X is symmetric if ________. |
| A. | xRy, yRz => xRz. |
| B. | xRy |
| C. | xRy=>yRx |
| D. | xRx |
| Answer» D. xRx | |
| 179. |
A formula consisting of conjunctions of max-terms is called _________. |
| A. | DNF |
| B. | CNF |
| C. | PCNF |
| D. | PDNF |
| Answer» D. PDNF | |
| 180. |
The set of positive integers is ________. |
| A. | infinite |
| B. | finite |
| C. | subset |
| D. | empty |
| Answer» B. finite | |
| 181. |
The total number of degrees of an isolated node is _______. |
| A. | 0 |
| B. | 1 |
| C. | 2 |
| D. | 3 |
| Answer» B. 1 | |
| 182. |
A binary tree with 2k vertices of level k has at least _______ vertices. |
| A. | 2 power k |
| B. | 2 power (k-1) |
| C. | 2 power (k-1)-1) |
| D. | 2 power (k+1)-1 |
| Answer» E. | |
| 183. |
P -> Q , Q ->R then________. |
| A. | P -> R |
| B. | R -> P |
| C. | Q |
| D. | R |
| Answer» B. R -> P | |
| 184. |
The union of the sets {1, 2, 5} and {1, 2, 6} is the set _______________. |
| A. | {1, 2, 6, 1} |
| B. | {1, 2, 5, 6} |
| C. | {1, 2, 1, 2} |
| D. | {1, 5, 6, 3} |
| Answer» C. {1, 2, 1, 2} | |
| 185. |
Which of the proposition is p ^ (~p v q) is |
| A. | tautulogy |
| B. | contradiction |
| C. | logically equivalent to p ^ q |
| D. | all of above |
| Answer» D. all of above | |
| 186. |
If S is a start symbol and S -> AB, A -> aB, B -> b are the productions then a stringgenerated by the grammar is _______. |
| A. | baa |
| B. | aba |
| C. | abb |
| D. | bab |
| Answer» D. bab | |
| 187. |
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» B. set V of vertices & set E of edges are finite | |
| 188. |
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» B. finite set | |
| 189. |
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» B. equivalence relation | |
| 190. |
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» B. simple | |
| 191. |
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} | |
| 192. |
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» D. {(a,9a+c)} | |
| 193. |
Let p: Mohan is rich, q : Mohan is happy, then the statement: Mohan is rich, but Mohan is not happy in symbolic form is |
| A. | p ˄ q |
| B. | ∼ p˄ q |
| C. | p ˅ q |
| D. | p ˄ ∼ q |
| Answer» E. | |
| 194. |
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» B. n-1 | |
| 195. |
The number of 1's in each row of an incidence matrix of a graph G is equal to _____. |
| A. | the degree of the corresponding vertices |
| B. | the sum of degrees of all vertices |
| C. | the degree of the initial vertex |
| D. | the degree of the terminal vertex |
| Answer» B. the sum of degrees of all vertices | |
| 196. |
If all the productions have single non-terminal in the left hand side then the grammardefined is ________grammar. |
| A. | context free |
| B. | context sensitive |
| C. | regular |
| D. | phrase structure |
| Answer» B. context sensitive | |
| 197. |
For a symmetric digraph, the adjacency matrix is _________. |
| A. | symmetric |
| B. | antisymmetric |
| C. | asymmetric |
| D. | symmetric and asymmetric |
| Answer» B. antisymmetric | |
| 198. |
For converting NDFA to DFA we should __________ all the states which have noincoming. |
| A. | add |
| B. | subtract |
| C. | multiply |
| D. | delete |
| Answer» E. | |
| 199. |
_________relations are useful in solving certain minimization problems of switchingtheory. |
| A. | Void |
| B. | Universal |
| C. | Compatibility |
| D. | Equivalence |
| Answer» D. Equivalence | |
| 200. |
The graph defined by the vertices and edges of a __________ is bipartite. |
| A. | square |
| B. | cube |
| C. | single |
| D. | both square and cube |
| Answer» C. single | |