Explore topic-wise MCQs in Technical Programming.

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.

501.

~ denotes

A. union
B. AND
C. set membership
D. negation
Answer» E.
502.

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
503.

In a survey of 85 people it is found that 31 like to drink milk 43 like coffee and 39 like tea.Also 13 like both milk and tea, 15 like milk and coffee, 20 like tea and coffee and 12 like none of the three drinks. Find the number of people who like all the three drinks.

A. 9
B. 8
C. 10
D. 11
Answer» C. 10
504.

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
505.

Domain and Range of the function Y = –v(–2x + 3) is

A. x=3/2, y=0
B. x>3/2, y=0
C. x<3/2, y=0
D. x=3/2, y=0
Answer» E.
506.

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
507.

The number of proper subset of {1,2,3,4} is

A. 16
B. 15
C. 10
D. 12
Answer» B. 15
508.

which sets are equal ? 1.{r,s,t} 2.{s,s,t,r} 3.{t,r,t,s}

A. 1 and 2
B. 2 and 3
C. 1 and 3
D. all are equal
Answer» E.
509.

1. Let m = “Juan is a math major,” c = “Juan is a computer science major,” g = “Juan’s girlfriend is a literature major,” h = “Juan’s girlfriend has read Hamlet,” and t = “Juan’s girlfriend has read The Tempest.” Which of the following expresses the statement “Juan is a computer science major and a math major, but his girlfriend is a literature major who hasn’t read both The Tempest and Hamlet.”

A. c ∧ m ∧ (g ∨(∼h ∨ ∼t))
B. c ∧ m ∧ g ∧(∼h ∧ ∼t)
C. c ∧ m ∧ g ∧(∼h ∨ ∼t)
D. c ∧ m ∧ (g ∨(∼h ∧ ∼t))
Answer» D. c ∧ m ∧ (g ∨(∼h ∧ ∼t))
510.

Transitivity and irreflexive imply:

A. Symmetric
B. Reflexive
C. Irreflexive
D. Asymmetric
Answer» E.
511.

If f (x) = -3x - 5, what is the value of f (2)?

A. -11
B. -1
C. 1
D. 11
Answer» B. -1
512.

In a survey of 60 people , it was found that: 25 read Newsweek magzine. 26 read Time 26 read Fortune 9 read both newsweek and fortune 11 read both Newsweek and Time 8 read both Time and Fortune 3 read all 3 magzines. 1. Find the number of people who read at least one of the three magzines

A. 30
B. 52
C. 40
D. 68
Answer» C. 40
513.

Which of these sets is finite?

A. {x | x is even}
B. ) {1, 2, 3,...}
C. {1, 2,3,...,999,1000}
D. none
Answer» D. none
514.

Multiset is an unordered collection of elemnts where an element can occur a a member more than once

A. TRUE
B. FALSE
C. Both
D. None
Answer» B. FALSE
515.

Consider the recurrence relation ak = 6ak-1 - 9ak-2 with initial conditions a0 = 0 and a1 = 2. Which of the following is an explicit solution to this recurrence relation, provided the constants A and B are chosen correctly?

A. an = A3n + B3n
B. an = A3n + B(-3)n
C. an = A3n + nB3n
D. an = A(-3)n + nB(-3)n
Answer» D. an = A(-3)n + nB(-3)n
516.

In above q.97 How many know exactly 2 languages?

A. 54
B. 16
C. 10
D. 35
Answer» B. 16
517.

if P∩ Q= Ф then P U Q' is

A. P
B. U-P
C. U-Q
D. Ф
Answer» D. Ф
518.

The Transitive Closure of a relation R is denoted by----

A. R*
B. R
C. R+
D. RR
Answer» B. R
519.

Inference rules maintain

A. completeness
B. validity
C. satisfiablity
D. logic
Answer» C. satisfiablity
520.

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» B. Pigeons
521.

Let A = {x, y, z}, B = {v, w, x}. Which of the following statements is correct?

A. A U B ={v, w,x, y, z}
B. A U B = {v, w,y, z}
C. A U B = {v,w, x, y}
D. A U B ={x,w, x, y, z}
Answer» B. A U B = {v, w,y, z}
522.

In a group of athletic teams in a certain institute, 21 are in the basket ball team, 26 in the hockey team, 29 in the foot ball team. If 14 play hockey and basketball, 12 play foot ball and basket ball, 15 play hockey and foot ball, 8 play all the three games. (i) How many players are there in all?

A. 78
B. 98
C. 23
D. 43
Answer» E.
523.

……… is an unordered collection of elements where an element can occur as a member more than once

A. Multiset
B. ordered set
C. set
D. None
Answer» B. ordered set
524.

A logical expression which consist of a product of elementary sum is caleed…..

A. Disjunctive normal form
B. Conjunctive normal form
C. Normal form
D. None
Answer» C. Normal form
525.

Converse of p==>q is

A. ~xp٨q
B. pV~q
C. ~xpVq
D. pV~q
Answer» E.
526.

Represent statement into predicate calculus forms : "Not all birds can fly". Let us assume the following predicates bird(x): “x is bird” fly(x): “x can fly”.

A. ∃x bird(x) Vfly(x)
B. ∃x bird(x) ^ ~fly(x)
C. ∃x bird(x) ^fly(x)
D. None
Answer» C. ∃x bird(x) ^fly(x)
527.

A validity-maintaining procedure for deriving sentences in logic from other sentences is

A. Proof
B. Theorem
C. Inference rule
D. inference chain
Answer» D. inference chain
528.

The sets {a,b,c} and {b,c,a} represnet the same sets.

A. TRUE
B. FALSE
C. Both
D. None
Answer» B. FALSE
529.

In above question which statement is contradiction.

A. A
B. B
C. C
D. D
Answer» B. B
530.

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.
531.

Blueberries cost more than strawberries. Blueberries cost less than raspberries.Raspberries cost more than both strawberries and blueberries. If the first two statements are true, the third statement is

A. TRUE
B. FALSE
C. Both
D. None
Answer» B. FALSE
532.

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
533.

3. The truth table for (p ∨ q) ∨ (p ∧ r) is the same as thetruth table for

A. (p ∨ q) ∧ (p ∨r)
B. (p ∨ q) ∧ r
C. (p ∨ q) ∧ (p∧ r)
D. p V q
Answer» E.
534.

AUB = (A− B)U(B−A)U(AпB).

A. FALSE
B. TRUE
C. Both a and b
D. None
Answer» C. Both a and b
535.

How many onto (or surjective) functions are there from an n-element (n => 2) set to a 2-element set?

A. 2n
B. 2n - 1
C. 2n - 2
D. 2(2n – 2)
Answer» D. 2(2n – 2)
536.

one of the A or B is uncountably infinite and one is countably infinite then | AUB| will be

A. countably infinite
B. uncountably finite
C. countably finite
D. uncountably infinite
Answer» E.
537.

Which of the following is the inverse of the statement: " If I eat a mango than I do not drink milk".

A. I drink milk only if I do not eat a mango
B. If I don’t eat a mango then I drink milk
C. If I do not drink milk then I eat mango
D. None
Answer» C. If I do not drink milk then I eat mango
538.

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
539.

let A={{a,b}} then aЄ A

A. TRUE
B. FALSE
C. Both
D. None
Answer» C. Both
540.

consider the four tsatements: 1.(p→q) ٨(p٨~q) 2.(~p→r)٨(p↔q) 3.p→(~qVr) 4.~(p٨q) V (p↔q) Which one of these four ststements is a tautology.

A. A
B. B
C. C
D. D
Answer» E.
541.

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» B. Symmetric
542.

If A is a set with 3 elements, how many equivalence relations are there on A? Hint: The set of equivalence classes for a given equivalence relation on A is a partition of the set A.

A. 4
B. 5
C. 23
D. 29
Answer» C. 23
543.

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
544.

Find the number of relations from A = {cat, dog, rat} to B = {male , female}

A. 64
B. 6
C. 32
D. 15
Answer» B. 6
545.

Let S be a set of n elements. The number of ordered pairs in the largest and the smallest equivalence relations on S are:

A. n and n
B. 2 n and n
C. 2 n and 0
D. n and 1
Answer» B. 2 n and n
546.

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» D. All of the above.
547.

Which of the following is equivalent to p==>q

A. ~xp٨q
B. pV~q
C. ~xpVq
D. pV~q
Answer» D. pV~q
548.

Which relation is not a function?

A. {(2,5), (3,6),(4,7), (5,8)}
B. {(6,-2), (-4,6), (-2,4), (1,0)}
C. {(-1, 5), (-2,5), (-3,5), (-4,5)}
D. {(0,-2), (1,0), (-1,-3), (0,-1)}
Answer» E.
549.

8. 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) isequal to [(P∨ ∼P) ∧ Q] ∨(P ∧ ∼Q)
Answer» B. (P ∧ Q) ∨ (∼P∧ Q) ∨ (P ∧∼Q) is equal to Q ∨ P
550.

A theory of sets was firstly introduced by….

A. Tim berners lee
B. Franklin
C. G.Canter
D. c.panther
Answer» D. c.panther