McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) .
Chapters
| 51. |
If A and B are two non empty sets then cartesian product of A and B is---------- |
| A. | AΧB={(a,b);a,bϵA } |
| B. | AΧB={(a,b);a,bϵB} |
| C. | AΧB={(a,b);aϵA and bϵB} |
| D. | AΧB={(a,b);aϵB and bϵA} |
| Answer» C. AΧB={(a,b);aϵA and bϵB} | |
| 52. |
If set A contains n elements, set B contains m elements then number of elements in AXB is--- |
| A. | m+n |
| B. | n-m |
| C. | m.n |
| D. | n/m |
| Answer» C. m.n | |
| 53. |
If A,B and C are non empty sets then AX(B∩C) is-----. |
| A. | (AXB)U(AXC) |
| B. | (AXB)∩(AXC) |
| C. | (AXB)∩C |
| D. | (AXC)∩B |
| Answer» B. (AXB)∩(AXC) | |
| 54. |
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» A. (AXB)U(AXC) | |
| 55. |
If R is a relation defined from set A to set B then------ |
| A. | R=AXB |
| B. | RCAXB |
| C. | RCBXA |
| D. | AXBCR |
| Answer» B. RCAXB | |
| 56. |
If A=(1,2,3} and R on A is defined by R={(1,1),(2,2),(3,3)} then R is………… |
| A. | Reflexive |
| B. | Symmetric |
| C. | Transitive |
| D. | All of these |
| Answer» A. Reflexive | |
| 57. |
If A=(1,2,3} and R on A is defined by R={(1,2),(2,1),(1,1),(2,2)} then R is………… |
| A. | Reflexive and symmetric |
| B. | Reflexive and Transitive |
| C. | Symmetric and Transitive |
| D. | All of the above. |
| Answer» C. Symmetric and Transitive | |
| 58. |
Which statement is true? |
| A. | Relation can be of the type one many |
| B. | Function can be of the type one many |
| C. | Both (a) and (b) |
| D. | None of these. |
| Answer» B. Function can be of the type one many | |
| 59. |
Which statement is true? |
| A. | Every function is a relation. |
| B. | Every Relation is a function. |
| C. | Both A and B. |
| D. | None of these. |
| Answer» A. Every function is a relation. | |
| 60. |
In-----Relation every element is related with itself. |
| A. | Reflexive |
| B. | Symmetric |
| C. | Transitive |
| D. | None |
| Answer» A. Reflexive | |
| 61. |
The Relation is----------if a has relation with b and b has relation with a. |
| A. | Reflexive |
| B. | Symmetric |
| C. | Transitive |
| D. | None |
| Answer» B. Symmetric | |
| 62. |
If a has relation with b and b has relation with c then a has relation with c is………………..Relation. |
| A. | Reflexive |
| B. | Symmetric |
| C. | Transitive |
| D. | None |
| Answer» C. Transitive | |
| 63. |
Types of function Mappings are----- |
| A. | One to one |
| B. | Many to one |
| C. | Into, Onto |
| D. | All |
| Answer» D. All | |
| 64. |
The Transitive Closure of a relation R is denoted by---- |
| A. | R* |
| B. | R |
| C. | R+ |
| D. | RR |
| Answer» A. R* | |
| 65. |
The alternative method to find transitive closure of R* is-------. |
| A. | R* |
| B. | RR |
| C. | Warshall’s Algorithm |
| D. | R |
| Answer» C. Warshall’s Algorithm | |
| 66. |
Poset is a------ |
| A. | Positive set |
| B. | p-set |
| C. | P* |
| D. | Partially Ordered set |
| Answer» D. Partially Ordered set | |
| 67. |
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» A. Poset | |
| 68. |
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» A. Chain | |
| 69. |
The number of elements in the chain is called as------ |
| A. | Chain |
| B. | Antichains |
| C. | None |
| D. | Length of chain |
| Answer» D. Length of chain | |
| 70. |
A ------ is a poset (A, ≤) in which every subset {a, b} of A, has a least upper bound and a greatest lower bound. |
| A. | Chain |
| B. | Lattice. |
| C. | Antichains |
| D. | Group |
| Answer» B. Lattice. | |
| 71. |
Pigeon Hole Principle says that if there are many pigeons and a few pigeon holes, then there must be some pigeon holes occupied by-------------- |
| A. | Two or more pigeons. |
| B. | Pigeons |
| C. | One only |
| D. | None |
| Answer» A. Two or more pigeons. | |
| 72. |
Digraph can be represented by----- |
| A. | Hasse diagrams |
| B. | Digraph |
| C. | Graph |
| D. | None |
| Answer» A. Hasse diagrams | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.