MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 315 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science Engineering (CSE) knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
For m = 1, 2, , 4m+2 is a multiple of is known as |
| A. | lemma |
| B. | corollary |
| C. | conjecture |
| D. | none of the mentioned |
| Answer» B. corollary | |
| 2. |
For any integer m>=3, the series 2+4+6+ +(4m) can be equivalent to |
| A. | m2+3 |
| B. | m+1 |
| C. | mm |
| D. | 3m2+4 |
| Answer» B. m+1 | |
| 3. |
Let domain of m includes all students, P (m) be the statement m spends more than 2 hours in playing polo . Express m P (m) quantification in English. |
| A. | a student is there who spends more than 2 hours in playing polo |
| B. | there is a student who does not spend more than 2 hours in playing polo |
| C. | all students spends more than 2 hours in playing polo |
| D. | no student spends more than 2 hours in playing polo |
| Answer» E. | |
| 4. |
What rules of inference are used in this argument? All students in this science class has taken a course in physics and Marry is a student in this class imply the conclusion Marry has taken a course in physics. |
| A. | universal instantiation |
| B. | universal generalization |
| C. | existential instantiation |
| D. | existential generalization |
| Answer» B. universal generalization | |
| 5. |
What rules of inference are used in this argument? It is either colder than Himalaya today or the pollution is harmful. It is hotter than Himalaya today. Therefore, the pollution is harmful. |
| A. | conjunction |
| B. | modus ponens |
| C. | disjunctive syllogism |
| D. | hypothetical syllogism |
| Answer» D. hypothetical syllogism | |
| 6. |
What rules of inference are used in this argument? Jay is an awesome student. Jay is also a good dancer. Therefore, Jay is an awesome student and a good dancer. |
| A. | conjunction |
| B. | modus ponens |
| C. | disjunctive syllogism |
| D. | simplification |
| Answer» B. modus ponens | |
| 7. |
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)} | |
| 8. |
A partial order is defined on the set S = {x, b1, b2, bn, y} as x bi for all i and bi y for all i, where n 1. The number of total orders on the set S which contain the partial order is |
| A. | n+4 |
| B. | n2 |
| C. | n! |
| D. | 3 |
| Answer» D. 3 | |
| 9. |
Let P: We should be honest., Q: We should be dedicated., R: We should be overconfident. Then We should 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. | |
| 10. |
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» D. R is an equivalence relation having three equivalence classes | |
| 11. |
he set of positive integers is _________ . |
| A. | infinite |
| B. | finite |
| C. | subset |
| D. | empty |
| Answer» B. finite | |
| 12. |
The elements of a vector space form a/an under vector addition. |
| A. | abelian group |
| B. | commutative group |
| C. | associative group |
| D. | semigroup |
| Answer» B. commutative group | |
| 13. |
Matrix multiplication is a/an property. |
| A. | commutative |
| B. | associative |
| C. | additive |
| D. | disjunctive |
| Answer» C. additive | |
| 14. |
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» D. equivalence relation | |
| 15. |
If each non-empty subset of a lattice has a least upper bound and greatest lower bound then the lattice is called ________. |
| A. | complete |
| B. | associative |
| C. | absorption |
| D. | commutative |
| Answer» B. associative | |
| 16. |
For converting NDFA to DFA we should __________ all the states which have no incoming. |
| A. | add |
| B. | subtract |
| C. | multiply |
| D. | delete |
| Answer» E. | |
| 17. |
Which of the following traversal techniques lists the nodes of binary search in ascending order? |
| A. | pre order |
| B. | post order |
| C. | in order |
| D. | root order |
| Answer» D. root order | |
| 18. |
_________relations are useful in solving certain minimization problems of switching theory. |
| A. | Void |
| B. | Universal |
| C. | Compatibility |
| D. | Equivalence |
| Answer» D. Equivalence | |
| 19. |
B1: ({0, 1, 2 .(n-1)}, xm) where xn stands for multiplication-modulo-n and B2: ({0, 1, 2 .n}, xn) where xn stands for multiplication-modulo-m are the two statements. Both B1 and B2 are considered to be |
| A. | groups |
| B. | semigroups |
| C. | subgroups |
| D. | associative subgroup |
| Answer» C. subgroups | |
| 20. |
Simplify the expression XZ + (Y + Y Z) + XY. TOPIC 5.5 MINIMIZATION OF BOOLEAN ALGEBRA |
| A. | (1+xy ) |
| B. | yz + xy + z |
| C. | (x + y +z) |
| D. | xy + z |
| Answer» D. xy + z | |
| 21. |
Evaluate the expression: (X + Z)(X + XZ ) + XY + Y. |
| A. | xy+z |
| B. | y+xz +y z |
| C. | x z+y |
| D. | x+y |
| Answer» E. | |
| 22. |
What is the simplification value of MN(M + N ) + M(N + N )? |
| A. | m |
| B. | mn+m n c) (1+m) |
| C. | d |
| D. | m+n |
| Answer» C. d | |
| 23. |
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» C. {(4,b),(2,5),(3,a)} | |
| 24. |
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. | 0 |
| D. | 2 |
| Answer» D. 2 | |
| 25. |
If there are n distinct components in a statement then there are _______ combinations of values in the truth table. |
| A. | 2^n |
| B. | n+1 |
| C. | n |
| D. | n+2 |
| Answer» B. n+1 | |
| 26. |
Two groups are isomorphic if and only if is existed between them. |
| A. | homomorphism |
| B. | endomorphism |
| C. | isomorphism |
| D. | association |
| Answer» D. association | |
| 27. |
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» C. P biconditional is a contradiction | |
| 28. |
Let R={(1, 3), (4, 2), (2, 2), (3, 3), (1, 1),(4,4)} be a relation on the set A={1, 2, 3, 4}. The relation R is ____. |
| A. | transitive |
| B. | reflexive |
| C. | not symmetric |
| D. | function |
| Answer» D. function | |
| 29. |
The statements that we consider initially are simple statements called _________statements. |
| A. | molecular |
| B. | compound |
| C. | atomic |
| D. | simple |
| Answer» D. simple | |
| 30. |
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» E. | |
| 31. |
Every Isomorphic graph must have representation. |
| A. | cyclic |
| B. | adjacency list |
| C. | tree |
| D. | adjacency matrix |
| Answer» E. | |
| 32. |
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» E. | |
| 33. |
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 | |
| 34. |
The relation R defined on the set A = {1, 2, 3, 4, 5} by R = {(x, y) :x2 y2< 16} is given by |
| A. | {(1, 1), (2, 1), (3, 1), (4, 1), (2, 3)} |
| B. | {(2, 2), (3, 2), (4, 2), (2, 4)} |
| C. | {(3, 3), (4, 3), (5, 4), (3, 4)} |
| D. | none of the above |
| Answer» E. | |
| 35. |
If all the productions have single non-terminal in the left hand side then the grammar defined is ________grammar. |
| A. | context free |
| B. | context sensitive |
| C. | regular |
| D. | phrase structure |
| Answer» B. context sensitive | |
| 36. |
A free semilattice has the property. |
| A. | intersection |
| B. | commutative and associative |
| C. | identity |
| D. | universal |
| Answer» E. | |
| 37. |
A relation (34 78) 57 = 57 (78 34) can have property. |
| A. | distributive |
| B. | associative |
| C. | commutative |
| D. | closure |
| Answer» C. commutative | |
| 38. |
The relation R defined in A = {1, 2, 3} by aRb, ifa2 b2 5. Which of the following is false? |
| A. | r = {(1, 1), (2, 2), (3, 3), (2, 1), (1, 2), (2, 3), (3, 2)} |
| B. | r 1 = r |
| C. | domain of r = {1, 2, 3} |
| D. | range of r = {5} |
| Answer» E. | |
| 39. |
Let S be a start symbol and S -> aA, A -> BA, A -> a, B -> b be the productions in a grammar then one of the string derived form the grammar is _____. |
| A. | baba |
| B. | bbaa |
| C. | abba |
| D. | aabb |
| Answer» D. aabb | |
| 40. |
If S is a start symbol and S -> AB, A -> aB, B -> b are the productions then a string generated by the grammar is _______. |
| A. | baa |
| B. | aba |
| C. | abb |
| D. | bab |
| Answer» D. bab | |
| 41. |
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» B. starting symbol | |
| 42. |
Two vertices which are incident with the common edge are called ______________vertices. |
| A. | distinct |
| B. | directed |
| C. | adjacent |
| D. | loops |
| Answer» D. loops | |
| 43. |
Let (A7, 7)=({1, 2, 3, 4, 5, 6}, 7) is a group. It has two sub groups X and Y. X={1, 3, 6}, Y={2, 3, 5}. What is the order of union of subgroups? |
| A. | 65 |
| B. | 5 |
| C. | 32 |
| D. | 18 |
| Answer» C. 32 | |
| 44. |
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» E. | |
| 45. |
In FSA ,the notation for M being in state S0, reading the input symbol a, moving one cell right and reaching the state S1 is given by ________. |
| A. | f(Si , x) = Sj |
| B. | f(S0 , a) = S1 |
| C. | f(Si , a) = Sj |
| D. | f(S0 , x) = S1 |
| Answer» C. f(Si , a) = Sj | |
| 46. |
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 | |
| 47. |
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» E. | |
| 48. |
Let P: If Sahil bowls, Saurabh hits a century.; Q: If Raju bowls, Sahil gets out on first ball. Now if P is true and Q is false then which of the following can be true? |
| A. | Raju bowled and Sahil got out on first ball |
| B. | Raju did not bowled |
| C. | Sahil bowled and Saurabh hits a century |
| D. | Sahil bowled and Saurabh got out |
| Answer» D. Sahil bowled and Saurabh got out | |
| 49. |
In a bounded lattice, an element b belongs to L is called a complement of an element a belongs to L if ______. |
| A. | a*b=0 |
| B. | a+b=1 |
| C. | both a and b |
| D. | none |
| Answer» D. none | |
| 50. |
Minimize the following Boolean expression using Boolean identities. F(A,B,C) = (A+BC’)(AB’+C) |
| A. | a + b + c’ |
| B. | ac’ + b |
| C. | b + ac |
| D. | a(b’ + c) |
| Answer» E. | |