MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 1331 Mcqs, each offering curated multiple-choice questions to sharpen your Technical Programming knowledge and support exam preparation. Choose a topic below to get started.
| 451. |
The alternative method to find transitive closure of R* is-------. |
| A. | R* |
| B. | RR |
| C. | Warshall’s Algorithm |
| D. | R |
| Answer» D. R | |
| 452. |
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 | |
| 453. |
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. | |
| 454. |
The power set of the set {ϕ} is |
| A. | {ϕ} |
| B. | {ϕ, {ϕ}} |
| C. | {0} |
| D. | None |
| Answer» C. {0} | |
| 455. |
If p= It is hot, and q= It is sultry, which of the following sentences in the appropriate version for the symbolic expression: -p٨ q |
| A. | If it is sultry then it is hot |
| B. | It is sultry only if it is hot |
| C. | It is sultry and it is not hot |
| D. | None |
| Answer» E. | |
| 456. |
Let A be a finite set. If f : A → A is injective then it is surjective. |
| A. | T |
| B. | F |
| Answer» B. F | |
| 457. |
If U = {1, 2, 3, . . . 20 } and S = set of prime numbers , then S = |
| A. | { 3, 5, 7, 11, 13,17 } |
| B. | { 2, 3, 5, 7, 11,13, 17, 19 } |
| C. | {1, 3, 5, 7, 9,11, 13, 15,17, 19 } |
| D. | {1, 2, 3, 5, 7,11, 13, 17 } |
| Answer» C. {1, 3, 5, 7, 9,11, 13, 15,17, 19 } | |
| 458. |
A proof that begins by asserting a claim and proceeds to show that the claim cannot be true is by |
| A. | Induction |
| B. | Contradiction |
| C. | prevarication |
| D. | construction |
| Answer» C. prevarication | |
| 459. |
{3}Є{1,3,5} |
| A. | TRUE |
| B. | FALSE |
| C. | Both |
| D. | None |
| Answer» C. Both | |
| 460. |
If A,B and C are non empty sets then AX(BUC) is-----. |
| A. | (AXB)U(AXC) |
| B. | (AXB)∩(AXC) |
| C. | (AXB)UC |
| D. | (AXC)UB |
| Answer» B. (AXB)∩(AXC) | |
| 461. |
anya is older than Eric. Cliff is older than Tanya. Eric is older than Cliff. If the first two statements are true, the third statement is |
| A. | TRUE |
| B. | FALSE |
| C. | Both |
| D. | None |
| Answer» C. Both | |
| 462. |
In q.97. How many know exactly 1 language? |
| A. | 6 |
| B. | 16 |
| C. | 7 |
| D. | 10 |
| Answer» D. 10 | |
| 463. |
Let P(S) denotes the powerset of set S. Which of the following is always true? |
| A. | P(P(S)) = P(S) |
| B. | P(S) IS = P(S) |
| C. | P(S) I P(P(S)) = {ø} |
| D. | S € P(S) |
| Answer» E. | |
| 464. |
A partial ordered relation is transitive, reflexive and |
| A. | Anti-symmetric |
| B. | Bisymmetric |
| C. | Anti-reflexive. |
| D. | Asymmetric |
| Answer» B. Bisymmetric | |
| 465. |
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 | |
| 466. |
A prepostition that is true under all circumstances is referred to as a …. |
| A. | Tautology |
| B. | Contradiction |
| C. | Negation |
| D. | Sentence |
| Answer» B. Contradiction | |
| 467. |
An argument is valid if, whenever the conclusion is true, thenthe premises are also true. |
| A. | TRUE |
| B. | FALSE |
| C. | both a and b |
| D. | none |
| Answer» C. both a and b | |
| 468. |
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 | |
| 469. |
The statement ( p^q) _ p is a |
| A. | Contingency |
| B. | contradiction |
| C. | tautology |
| D. | None |
| Answer» D. None | |
| 470. |
Determine the total number of subsets of the following set: {h,i, j, k, l, m, n} |
| A. | 128 |
| B. | 64 |
| C. | 32 |
| D. | 14 |
| Answer» B. 64 | |
| 471. |
Quantifiers variables |
| A. | Negate |
| B. | Change |
| C. | give values to |
| D. | bind |
| Answer» D. bind | |
| 472. |
In a room containing 28 females, there are 18 females who speak English, 15 females speak french and 22 speak german. 9 females speak both english and french, 11 females speak both french and german where as 13 speak both german and english. How many females speak all 3 languages? |
| A. | 9 |
| B. | 8 |
| C. | 7 |
| D. | 6 |
| Answer» E. | |
| 473. |
How many relations are there on a set with n elements that are symmetric and a set with n elements that are reflexive and symmetric? |
| A. | 2n(n+1)/2 and 2n.3n(n–1)/2 |
| B. | 3n(n–1)/2 and 2n(n–1) |
| C. | 2n(n+1)/2 and 3n(n–1)/2 |
| D. | 2n(n+1)/2 and 2n(n–1)/2 |
| Answer» E. | |
| 474. |
Number of proper subsets of a set of order three |
| A. | 3 |
| B. | 6 |
| C. | 8 |
| D. | 9 |
| Answer» C. 8 | |
| 475. |
Digraph can be represented by----- |
| A. | Hasse diagrams |
| B. | Digraph |
| C. | Graph |
| D. | None |
| Answer» B. Digraph | |
| 476. |
dual of (p V q)٨ r is.. |
| A. | p Vq |
| B. | (p٨q) Vr |
| C. | p ٨r |
| D. | (p Vq) Vr |
| Answer» C. p ٨r | |
| 477. |
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. | |
| 478. |
Let A={a, b, {c, d}, e}. How many elements does A contain? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» E. | |
| 479. |
Determine the validity of the argument s1: If I stay up late at night , then I will be tired in the morning. S2: I stayed up last last night s: I am tired this morning. |
| A. | Valid |
| B. | Invalid |
| C. | Both a and b |
| D. | none |
| Answer» B. Invalid | |
| 480. |
Types of function Mappings are----- |
| A. | One to one |
| B. | Many to one |
| C. | Into, Onto |
| D. | All |
| Answer» E. | |
| 481. |
Which statement is true about the relation shown at the right? |
| A. | It is a function because there exists one y- coordinate for each x- coordinate. |
| B. | It is a function because there exists one x- coordinate for each y-coordinate. |
| C. | It is not a function because there are multiple x-values for a given y-value. |
| D. | It is not a function because there are multiple y-values for a given x- value. |
| Answer» D. It is not a function because there are multiple y-values for a given x- value. | |
| 482. |
In the class of 55 students the number ofstudying different subjects are as given below: Maths 23, Physics 24, chemistry 19, maths+physics 12, maths+chemistry 9, Physics +chemistry 7, all three subjects 4. Find the number of students who have taken atleast 1 subject? |
| A. | 22 |
| B. | 45 |
| C. | 42 |
| D. | 14 |
| Answer» D. 14 | |
| 483. |
Consider the binary relation R = {(x,y), (x,z), (z,x), (z,y)} on the set {x,y,z}. Which one of the following is TRUE? |
| A. | R is symmetric but NOT antisymmetric |
| B. | R is NOT symmetric but antisymmetric |
| C. | R is both symmetric and antisymmetric |
| D. | R is neither symmetric nor antisymmetric |
| Answer» E. | |
| 484. |
A relation that is reflexive, anti-symmetric and transitive is a |
| A. | Function |
| B. | equivalence relation |
| C. | partial order |
| D. | None of these |
| Answer» D. None of these | |
| 485. |
Consider the recurrence relation ak = -8ak-1 - 15ak-2 with initial conditions a0 = 0 and a1 = 2. Which of the following is an explicit solution to this recurrence relation? |
| A. | ak = (-3)k - (-5)k |
| B. | ak = k(-3)k - k(- 5)k |
| C. | ak = k(-3)k - (-5)k |
| D. | ak = (-5)k - (-3)k |
| Answer» B. ak = k(-3)k - k(- 5)k | |
| 486. |
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. | |
| 487. |
Which among the statements given in Q.70 is contradiction |
| A. | A |
| B. | B |
| C. | C |
| D. | D |
| Answer» E. | |
| 488. |
Which of the following proposition is a tautology? |
| A. | (p v q)→p |
| B. | p v (q→p) |
| C. | p v (p→q) |
| D. | p→(p→q) |
| Answer» D. p→(p→q) | |
| 489. |
Write the negation in good english sentence : Mary lost her lamb or the wolf ate the lamb. |
| A. | Mary did loss her lamb and the wolf eat the lamb. |
| B. | Mary did loss her lamb and the wolf did not eat the lamb. |
| C. | Mary did not loss her lamb and the wolf did not eat the lamb. |
| D. | None |
| Answer» D. None | |
| 490. |
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)} | |
| 491. |
A relation R is defined on Z by xRy if 2x +5y = 0(mod7). Then the equivalence class[10] is equal to the equivalence class… |
| A. | 3 |
| B. | 4 |
| C. | 5 |
| D. | 6 |
| Answer» B. 4 | |
| 492. |
In above Ex. 196 how many players play exactly 2 of the games? |
| A. | 29 |
| B. | 79 |
| C. | 19 |
| D. | 39 |
| Answer» D. 39 | |
| 493. |
Which one of the following is the example of nonlinear data structure? |
| A. | Graph |
| B. | Binary Tree |
| C. | Queue |
| D. | Link List |
| Answer» B. Binary Tree | |
| 494. |
Given the relation D = {(6,4), (8,-1), (x,7), (-3,-6)}. Which of the following values for x will make relation D a function? |
| A. | -3 |
| B. | -6 |
| C. | 8 |
| D. | 6 |
| Answer» B. -6 | |
| 495. |
[(PVQ)^(P→R)^(Q→S)] → (SVR). Is a…. |
| A. | absurdity |
| B. | contadiction |
| C. | tautology |
| D. | none |
| Answer» D. none | |
| 496. |
Induction is a |
| A. | algorithm |
| B. | program |
| C. | Proof |
| D. | Proof method |
| Answer» E. | |
| 497. |
~(x vy) = ~x ^ ~y |
| A. | FALSE |
| B. | TRUE |
| C. | Both a and b |
| D. | None |
| Answer» C. Both a and b | |
| 498. |
[~ q ^ (p→q)]→~ p is, |
| A. | Satisfiable |
| B. | tautology |
| C. | unsatisfiable |
| D. | contradiction |
| Answer» C. unsatisfiable | |
| 499. |
The number of distinct relations on a set of 3 elements is |
| A. | 8 |
| B. | 9 |
| C. | 18 |
| D. | 512 |
| Answer» D. 512 | |
| 500. |
6. Consider the statement, “Either −2 ≤ x ≤ −1 or 1 ≤ x ≤2.” The negation of this statement is |
| A. | x < −2 or 2 < xor −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 | |