Boolean Algebra MCQ2

Download as pdf or txt
Download as pdf or txt
You are on page 1of 19

Home DMS DBMS DS DAA Graph Theory Control System Aptitude Selenium Kotlin C# HTML

ADVERTISEMENT

Discrete Mathematics MCQ


1) If x is a set and the set contains an integer which is neither positive nor
negative then the set x is ____________.

a. Set is Empty

b. Set is Non-empty

c. Set is Finite.

d. Set is both Non- empty and Finite.

Show Answer Workspace

2) If x ∈ N and x is prime, then x is ________ set.

a. Infinite set

b. Finite set

c. Empty set

d. Not a set

Show Answer Workspace

3) If x is a set and the set contains the real number between 1 and 2, then
the set is ________.

a. Empty set

b. Finite set

c. Infinite set

d. None of the mentioned

Show Answer Workspace

4) Which of the following is a subset of set {1, 2, 3, 4}?


a. {1, 2}

b. {1, 2, 3}

c. {1}

d. All of the mentioned

Show Answer Workspace

5) Convert the set x in roster form if set x contains the positive prime
number, which divides 72.

a. {∅}

b. {2, 3}

c. {2, 3, 7}

d. {3, 5, 7}

Show Answer Workspace

6) Power set of empty or Null set has exactly _________ subset.

a. One

b. Two

c. Zero

d. Three

Show Answer Workspace

7) What is the Cartesian product of set A and set B, if the set A = {1, 2} and
set B = {a, b}?

a. { (1, a), (1, b), (2, a), (b, b) }

b. { (1, 1), (2, 2), (a, a), (b, b) }

c. { (1, a), (2, a), (1, b), (2, b) }

d. { (1, 1), (a, a), (2, a), (1, b) }

Show Answer Workspace


8) The members of the set S = {x | x is the square of an integer and x < 100}
is ________________

a. {0, 2, 4, 5, 9, 55, 46, 49, 99, 81}

b. {1, 4, 9, 16}

c. {0, 1, 4, 9, 16, 25, 36, 49, 64, 81}

d. {0, 1, 4, 9, 25, 36, 49, 123}

Show Answer Workspace

9) The intersection of the sets {1, 2, 8, 9, 10, 5} and {1, 2, 6, 10, 12, 15} is the
set _____________

a. {1, 2, 10}

b. {5, 6, 12, 15}

c. {2, 5, 10, 9}

d. sd) {1, 6, 12, 9, 8}

Show Answer Workspace

10) The difference of {1, 2, 3, 6, 8} and {1, 2, 5, 6} is the set ____________

ADVERTISEMENT

a. {1, 3}

b. {5, 6, 8}

c. {3, 8}

d. {2, 6, 5}

Show Answer Workspace

11) If n(A) = 20 and n(B) = 30 and n(A U B) = 40 then n(A ∩ B) is?

a. 20

b. 30

c. 40
d. 10

Show Answer Workspace

12) Let the players who play cricket be 12, the ones who play football 10,
those who play only cricket are 6, then the number of players who play only
football are ___________, assuming there is a total of 16 players.

a. 16

b. 8

c. 4

d. 10

Show Answer Workspace

13) Which among the following can be taken as the discrete object?

a. People

b. Rational numbers

c. Integers

d. All of the mentioned

Show Answer Workspace

14) Which option contains two equal sets?

a. X = {5, 6} and Y = {6}

b. X = {5, 6, 8, 9} and Y = {6, 8, 5, 9}

c. X = {5, 6, 9} and Y = {5, 6}

d. X = {5, 6} and Y = {5, 6, 3}

Show Answer Workspace

15) The cardinality of the Power set of the set {1, 5, 6} is______________.

a. 5

b. 6

c. 8

d. 10

Show Answer Workspace

16) The Cartesian product of the (Set Y) x (Set X) is equal to the Cartesian
product of (Set X) x (Set Y) or Not?
a. Yes

b. No

c. None of the above

d. I Don't know

Show Answer Workspace

17) How many elements in the Power set of set A= {{Φ}, {Φ, {Φ}}}?

a. 4 elements

b. 2 elements

c. 6 elements

d. 5 elements

Show Answer Workspace

18) Mathematics can be broadly categorized into how many types?

a. 3 types

b. 2 types

c. 5 types

d. 4 types

Show Answer Workspace

19) Which of the following function is not a mathematics function?

a. many to one

b. one-to-many

c. one to one

d. All of the mentioned


Show Answer Workspace

20) Which of the following function is also referred to as an injective


function?

a. Many-to-one

b. Onto

c. One-to-One

d. None of the mentioned

Show Answer Workspace

21) How many injections are defined from set A to set B if set A has 4
elements and set B has 5 elements?

a. 24

b. 64

c. 144

d. 120

Show Answer Workspace

22) The function (gof) is _________ , if the function f and g are onto function?

a. Into function

b. one to one function

c. onto function

d. one-to-many function

Show Answer Workspace


23) How many bytes are needed for encoding 2000 bits of data?

a. 5 Byte

b. 2 bytes

c. 4 bytes

d. 8 bytes

Show Answer Workspace

24) The cardinality of the set of even positive integers less than 20
is__________?

a. 8

b. 10

c. 9

d. 12

Show Answer Workspace

25) If X = {2, 8, 12, 15, 16} and Y= {8, 16, 15, 18, 9} then union of X and Y
is___________.

a. {2, 8, 12, 15, 16}

b. { 8, 16, 15}

c. {8, 16, 15, 18, 9}

d. {2, 8, 9, 12, 15, 16, 18}

Show Answer Workspace

26) What is Floor function?

a. It maps the real number to the greatest previous integer

b. It maps the real number to the smallest previous integer

c. It maps the real number to the smallest following integer

d. None of the mentioned

Show Answer Workspace


27) What is Ceil function?

a. It maps the real number to the greatest previous integer

b. It maps the real number to the smallest previous integer

c. It maps the real number to the smallest following integer

d. None of the mentioned

Show Answer Workspace

28) What is the value of Floor(8.4) + Ceil(9.9)?

a. 18

b. 19

c. 20

d. 17

Show Answer Workspace

29) If a and b are two positive numbers that are less than one, then the
maximum value of Floor(a+b) and Ceil(a+b) is?

a. Floor(a+b) is 0 and Ceil(a+b) is 1.

b. Floor(a+b) is 1 and Ceil(a+b) is 0.

c. Floor(a+b) is 1 and Ceil(a+b) is 2.

d. Floor(a+b) is 2 and Ceil(a+b) is 1

Show Answer Workspace

30) How many relations exist from set X to set Y if the set X and set Y has 7
and 8 elements?

a. 256

b. 272

c. 356
d. 56

Show Answer Workspace

31) The number of reflexive closure of the relation {(0,1), (1,1), (1,3), (2,1),
(2,2), (3,0)} on the set {0, 1, 2, 3} is________.

a. 36

b. 8

c. 6

d. 26

Show Answer Workspace

32) The number of transitive closure exists in the relation R = {(0,1), (1,2),
(2,2), (3,4), (5,3), (5,4)} where {1, 2, 3, 4, 5} ∈ A is__________.

a. {(0,1), (0,2), (1,2), (2,2), (3,4), (5,3), (5,4)}

b. {(0,0), (4,4), (5,5), (1,1), (2,2), (3,3)}

c. {(0,1), (1,2), (2,2), (3,4)}

d. {(0,1), (5,3), (5,4), (1,1), (2,2)}

Show Answer Workspace

33) Which statement is incorrect if X and Y are the two non-empty relations
on the set S.

a. If X and Y are transitive, then the intersection of X and Y is also


transitive.

b. If X and Y are reflexive, then the intersection of X and Y is also


reflexive.

c. If X and Y are symmetric, then the union of X and Y is not


symmetric.

d. If X and Y are transitive, then the union of X and Y is not


transitive.

Show Answer Workspace

34) Which option is the negation of the bits "1001011"?

a. 11011011

b. 10110100

c. 0110100

d. 1100100
Show Answer Workspace

35) What is the output of X (Ex-or) Y, if the bits of X is 001101 and the bits of
Y is 100110?

a. Output of X (Ex-or) Y is 101011

b. Output of X (Ex-or) Y is 1101010

c. Output of X (Ex-or) Y is 101000

d. Output of X (Ex-or) Y is 0010101

Show Answer Workspace

36) Boolean algebra deals with how many values.

a. It deals with only four discrete values.

b. It deals with only five discrete values.

c. It deals with only three discrete values.

d. It deals with only two discrete values.

Show Answer Workspace

37) Which of the following Law of Boolean proofs the X.X=X?

a. Identity Law

b. Double Complement Law

c. Complement Law

d. Idempotent Law

Show Answer Workspace

38) According to the symmetric matrix, which of the following statement is


correct?

a. A = AT
b. All the diagonal elements of a symmetric matrix are One.

c. A = -AT

d. All the diagonal elements of a symmetric matrix are Zero.

Show Answer Workspace

39) Which of the following matrix having only one row and multiple
columns?

a. Diagonal Matrix

b. Row Matrix

c. Column Matrix

d. None of the mentioned

Show Answer Workspace

40) Which of the following matrix having only one column and multiple
rows?

a. Diagonal Matrix

b. Row Matrix

c. Column Matrix

d. None of the mentioned

Show Answer Workspace

41) Which of the following condition is correct if we want to add two


matrices?

a. Both rows and columns of both the matrices which we want to


add are the same

b. Columns of both the matrices which we want to add are equal

c. Rows of both the matrices which we want to add are the same
d. a number of the first matrix's rows should be equal to the
number of the second matrix's column, which we want to add.

Show Answer Workspace

42) A+B = B+A is a true or false statement if the order of A matrix and B
matrix is the same.

a. False

b. True

Show Answer Workspace

43) XY = YX is a true or false statement if the order of A matrix and B matrix


is the same.

a. False

b. True

Show Answer Workspace

44) Universal logic gate is__________.

a. OR

b. NOT

c. NAND

d. AND

Show Answer Workspace

45) In which year Maurice Karnaughin introduced the Karnaugh map?

a. 1953

b. 1956

c. 1952

d. 1950

Show Answer Workspace

46) Canonical forms for a boolean expression has _______ types.

a. Three types

b. Four types

c. Two types

d. Five types
Show Answer Workspace

47) The use of Boolean algebra is ____________.

a. in building the algebraic functions.

b. in building logic symbols.

c. in circuit theory.

d. in designing the digital computers.

Show Answer Workspace

48) Boolean algebra deals with how many values.

a. It deals with only four discrete values.

b. It deals with only five discrete values.

c. It deals with only three discrete values.

d. It deals with only two discrete values.

Show Answer Workspace

49) Which search compares each element with the searching element till not
found?

a. Merge search

b. Sequential Search

c. Binary search

d. none of the mentioned

Show Answer Workspace

50) If a user wants to sort the unsorted list of n elements, then the insertion
sort starts with which element of the list.

a. First element of the list

b. the second element of the list

c. the Third element of the list

d. the Fourth element of the list

Show Answer Workspace

51) What is the complexity of the bubble sort algorithm?

a. O(n2)

b. O(n)
c. O(log n)

d. O(n log n)

Show Answer Workspace

52) What is the worst case of a linear search algorithm?

a. When the searching item is present in the middle of the list.

b. When the searching item is the last element in the list.

c. When the searching is not available in the list.

d. When the searching item is the last element in the list or is not
present in the list.

Show Answer Workspace

53) Which algorithm uses the previous outputs for finding the new outputs?

a. Dynamic Programming algorithms

b. Divide and Conquer algorithm

c. Brute Force algorithm

d. None of them

Show Answer Workspace

54) Which option is correct for representing an algorithm?

a. Pseudo codes

b. Flow charts

c. Statements in the common language

d. All of them

Show Answer Workspace

55) Which case does not exist in complexity theory?

a. Average case

b. Null case

c. Best case

d. Worst Case

Show Answer Workspace


← Prev Next →

For Videos Join Our Youtube Channel: Join Now

Feedback

Send your Feedback to [email protected]

Help Others, Please Share

Learn Latest Tutorials

Splunk SPSS Swagger

Transact-SQL Tumblr ReactJS

Regex Reinforcement R Programming


Learning
RxJS React Native Python Design
Patterns

Python Pillow Python Turtle Keras

Preparation

Aptitude Reasoning Verbal Ability

Interview Questions Company Questions

Trending Technologies

Artificial AWS Selenium


Intelligence

Cloud Computing Hadoop ReactJS

Data Science Angular 7 Blockchain

Git Machine Learning DevOps


B.Tech / MCA

DBMS Data Structures DAA

Operating System Computer Network Compiler Design

Computer Discrete Ethical Hacking


Organization Mathematics

Computer Graphics Software Web Technology


Engineering

Cyber Security Automata C Programming

C++ Java .Net

Python Programs Control System

Data Mining Data Warehouse

You might also like