MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 33 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. |
. Which set S does the power set 2S = { ,{1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2, 3}} come from? |
| A. | {{1},{2},{3}} |
| B. | {1, 2, 3} |
| C. | {{1, 2}, {2, 3}, {1, 3}} |
| D. | {{1, 2, 3}} |
| Answer» C. {{1, 2}, {2, 3}, {1, 3}} | |
| 2. |
The relation { (1,2), (1,3), (3,1), (1,1), (3,3), (3,2), (1,4), (4,2), (3,4)} is |
| A. | Reflexive |
| B. | Transitive |
| C. | Symmetric |
| D. | Asymmetric |
| Answer» C. Symmetric | |
| 3. |
The truth table for (p q) (p r) is the same as the truth table for |
| A. | (p q) (p r) |
| B. | (p q) r |
| C. | (p q) (p r) |
| D. | p V q |
| Answer» E. | |
| 4. |
The binary relation R = {(0, 0), (1, 1)} 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» C. Reflexive, Symmetric, Not Transitive | |
| 5. |
Which of the following statements is FALSE: |
| A. | (P Q) ( P Q) (P Q) is equal to Q P |
| B. | (P Q) ( P Q) (P Q) is equal to Q P |
| C. | (P Q) ( P Q) (P Q) is equal to Q (P Q) |
| D. | (P Q) ( P Q) (P Q) is equal to [(P P) Q] (P Q) |
| Answer» B. (P Q) ( P Q) (P Q) is equal to Q P | |
| 6. |
Consider the set A={{1,3,5},{7,9,11},{13,15}} then determine which of the following is/are true. 1.1 A 2.{{1,3,5}} CA 3. subet of A 4. A |
| A. | 2 and 3 is true |
| B. | 1 and 3 is true |
| C. | 3 is true |
| D. | None |
| Answer» B. 1 and 3 is true | |
| 7. |
Consider the statement, Either 2 x 1 or 1 x 2. The negation of this statement is |
| A. | x < 2 or 2 < x or 1 < x < 1 |
| B. | (x < 2 or 2 < x |
| C. | 1 < x < 1 |
| D. | x 2 or 2 x or 1 < x < 1 |
| Answer» B. (x < 2 or 2 < x | |
| 8. |
Which of the following statements is the contrapositive of the statement, You win the game if you know the rules but are not overconfident. |
| A. | If you lose the game then you don t know the rules or you are overconfident. |
| B. | A sufficient condition that you win the game is that you know the rules or you are not over confident |
| C. | If you don t know the rules or are overconfident you lose the game. |
| D. | If you know the rules and are overconfiden t then you win the game. |
| Answer» B. A sufficient condition that you win the game is that you know the rules or you are not over confident | |
| 9. |
If P and Q stands for the statement P : It is hotQ : It is humid,then what does the following mean? P (~ Q): |
| A. | It is got and it is humid |
| B. | It is hot and it is not humid |
| C. | it is not hot and it is humid |
| D. | none |
| Answer» C. it is not hot and it is humid | |
| 10. |
100 sportsmen were asked whether they play which game: Cricket, hockey,Football. The results were : 45 play cricket, 38 play hockey, 21 play football, 18 play cricket and hockey, 9 play cricket and football, 4 play football and hockey and 23 play none of these. Determine the number of sportsmen who play exactly 1game |
| A. | 54 |
| B. | 84 |
| C. | 56 |
| D. | 78 |
| Answer» B. 84 | |
| 11. |
Let S = {1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21}. What is thesmallest integer N > 0 suchthat for any set of N integers, chosen from S, there must be two distinct integers thatdivide each other? IZ |
| A. | 10 |
| B. | 7 |
| C. | 9 |
| D. | 8 |
| Answer» E. | |
| 12. |
Let (A, ) be a poset. A subset of A is known as ------if every pair of elements in the subset are related. |
| A. | Chain |
| B. | Antichains |
| C. | Group |
| D. | Lattice. |
| Answer» B. Antichains | |
| 13. |
If A and B be sets and AC and Bc denote the complements of the sets A and B, then set (A B) (B A) (A B) is equal to |
| A. | Ac Bc |
| B. | Ac Bc |
| C. | A B |
| D. | A B |
| Answer» D. A B | |
| 14. |
is used in predicate calculusto indicate that a predicate is true for at least onemember of a specified set. |
| A. | TRUE |
| B. | FALSE |
| C. | Both a and b |
| D. | None |
| Answer» B. FALSE | |
| 15. |
Represent statement into predicate calculus forms : "Some men are not giants." Let us assume the following predicates man(x): x is Man giant(x): x is giant . |
| A. | x man(x) ^ giant(x) |
| B. | x man(x) ^ ~ giant(x) |
| C. | x man(x) V ~ giant(x) |
| D. | None |
| Answer» C. x man(x) V ~ giant(x) | |
| 16. |
is used in predicate calculusto indicate that a predicate is true for all members of aspecified set. |
| A. | TRUE |
| B. | FALSE |
| C. | Both a and b |
| D. | None |
| Answer» B. FALSE | |
| 17. |
Represent statement into predicate calculus forms : There is a student who likes mathematics but not history. Let us assume the following predicates student(x): x is student. likes(x, y): x likes y . and ~likes(x, y) x does not like y . |
| A. | x [student(x) ^ likes(x, mathematics) ^~ likes(x, history)]Q. |
| B. | x [student(x) ^Vlikes(x, mathematics) V~ likes(x, history)]Q. |
| C. | x [student(x) ^ ~likes(x, mathematics) ^likes(x, history)]Q. |
| D. | None |
| Answer» B. x [student(x) ^Vlikes(x, mathematics) V~ likes(x, history)]Q. | |
| 18. |
Define f(n) = n/2 + 1 ( 1)n/4 for all n 2 Z. Thus, f: Z Z, Z the set of all integers.Which is correct? |
| A. | f is a function and is onto but not one-to-one. |
| B. | f is a function and is onto and one-to- one. |
| C. | f is a function and is not onto but is one-to-one. |
| D. | f is a function and is not onto and not one-to-one |
| Answer» B. f is a function and is onto and one-to- one. | |
| 19. |
Represent statement into predicate calculus forms : "If x is a man, then x is a giant." Let us assume the following predicates man(x): x is Man giant(x): x is giant . |
| A. | (man(x) ~giant(x)) |
| B. | man(x) giant(x) |
| C. | (man(x) giant(x)) |
| D. | None |
| Answer» D. None | |
| 20. |
Let f: A B and g: B C be functions where A = {1, 2, 3, 4}, B = {1, 2, 3, 4, 5}, and C = {1, 2, 3, 4, 5, 6}, f ={(1, 2), (2, 3), (3, 2), (4, 5)} and g = {(1, 3), (2, 4), (3,5), (4, 6), (5, 1)}. Find g o.f (2). |
| A. | 3 |
| B. | 4 |
| C. | 5 |
| D. | 6 |
| Answer» E. | |
| 21. |
If R is a relation Less Than from A = {1,2,3,4} to B = {1,3,5} then RoR-1 is |
| A. | {(3,3), (3,4), (3,5)} |
| B. | {(3,1), (5,1), (3,2), (5,2), (5,3), (5,4)} |
| C. | {(3,3), (3,5), (5,3), (5,5)} |
| D. | {(1,3), (1,5), (2,3), (2,5), (3,5), (4,5)} |
| Answer» D. {(1,3), (1,5), (2,3), (2,5), (3,5), (4,5)} | |
| 22. |
If A is any non-empty set and R is a partial ordered relation on set A, then the ordered pair (A,R) is called ------- |
| A. | Poset |
| B. | p-set |
| C. | Positive set |
| D. | None |
| Answer» B. p-set | |
| 23. |
Check the validity of the following argument :- If the labour market is perfect then the wages of all persons in a particular employmentwill be equal. But it is always the case that wages for such persons are not equaltherefore the labour market is not perfect. |
| A. | Invalid |
| B. | Valid |
| C. | Both a and b |
| D. | None |
| Answer» C. Both a and b | |
| 24. |
A ball is tossed in the air in such a way that the path of the ball is modeled by the equation y = -x + 6x, where y represents the height of the ball in feet and x is the time in seconds. At what time, x, is the ball at its highest point? |
| A. | 6 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
| 25. |
Let R be a relation on a set A = {1, 2, 3, 4} given by R ={(1, 1), (1, 2), (1, 3), (2, 1), (2,2), (2, 3), (3, 1), (3, 2), (3,3)}. Then the relation is: |
| A. | reflexive and symmetric, but not transitive. |
| B. | reflexive and transitive, but not symmetric. |
| C. | symmetric and transitive, but not reflexive. |
| D. | reflexive, but neither symmetric nor transitive. |
| Answer» D. reflexive, but neither symmetric nor transitive. | |
| 26. |
Define a binary relation R = {(0, 1), (1, 2), (2, 3), (3, 2), (2, 0)} on A = {0, 1, 2, 3}. The directed graph (including loops) of the transitive closure of this relation has |
| A. | 16 arrows |
| B. | 12 arrows |
| C. | 8 arrows |
| D. | 6 arrows |
| Answer» B. 12 arrows | |
| 27. |
Let N+ denote the nonzero natural numbers. Define a binary relation R on N+ N+ by (m, n)R(s, t) if gcd(m, n) = gcd(s, t). The binary relation R 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 | |
| 28. |
Let A = {2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16} and consider the divides relation on A. Let C denote the length of the maximal chain, M the number of maximal elements, and m the number of minimal elements. Which is true? |
| A. | C = 3, M = 8, m = 6 |
| B. | C = 4, M = 8, m = 6 |
| C. | C = 3, M = 6, m = 6 |
| D. | C = 4, M = 6, m = 4 |
| Answer» B. C = 4, M = 8, m = 6 | |
| 29. |
Consider the four statements: 1.(q==>p) (~p) 2. p==>(~q) V r 3. ~p==>~(p q) 4.p q ~(pVq) Which one is tautology. |
| A. | A |
| B. | B |
| C. | C |
| D. | D |
| Answer» D. D | |
| 30. |
Fact 1: Jessica has four childrenFact 2: Two of the children have blue eyes and two of the children have brown eyes.Fact 3: Half of the children are girls.If the first three statements are facts, which of the following statements must also be a fact?I: At least one girl has blue eyes. II: Two of the children are boys. III: The boys have brown eyes. |
| A. | I only |
| B. | II only |
| C. | III only |
| D. | All |
| Answer» C. III only | |
| 31. |
Fact 1: All drink mixes are beverages. Fact 2: All beverages are drinkable. Fact 3: Some beverages are red.If the first three statements are facts, which of the following statements must also be a fact?I: Some drink mixes are red.II: All beverages are drink mixes.III: All red drink mixes are drinkable. |
| A. | I only |
| B. | II only |
| C. | III only |
| D. | All |
| Answer» D. All | |
| 32. |
Fact 1: All chickens are birds. Fact 2: Some chickens are hens. Fact 3: Female birds lay eggs.If the first three statements are facts, which of the following statements must also be a fact?I: All birds lay eggs.II: Some Hens are birds.III: Some chickens are not hens. |
| A. | I only |
| B. | II only |
| C. | II and III only |
| D. | All |
| Answer» D. All | |
| 33. |
Consider the statement, If n is divisible by 30 then n is divisible by 2 and by 3 and by 5. Which of the following statements is equivalent to this statement? |
| A. | If n is not divisible by 30 then n is divisible by 2 or divisible by 3 or divisible by 5 |
| B. | If n is not divisible by 30 then n is not divisible by 2 or not divisible by 3 or not divisible by 5 |
| C. | If n is divisible by 2 and divisible by 3 and divisible by 5 then n is divisible by 30. |
| D. | If n is not divisible by 2 or not divisible by 3 or not divisible by 5 then n is not divisible by 30 |
| Answer» E. | |