Computer Arithmetic-Propositional Boolean Logic [NTA-NET (Based on NTA-UGC) Computer Science (Paper-II)]: Questions 1 - 3 of 25

Access detailed explanations (illustrated with images and videos) to 2202 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. Unlimited Access for Unlimited Time!

View Sample Explanation or View Features.

Rs. 550.00 or

How to register?

Question number: 1

» Computer Arithmetic » Propositional Boolean Logic

Edit
MCQ▾

Question

Which of the following arguments are not valid?

(1) “If Gora gets the job and works hard, then he will be promoted. If Gora gets promotion, then he will be happy. He will not be happy, therefore, either he will not get the job or he will not work hard”.

(2) “Either Puneet is not guilty or Pankaj is telling the truth. Pankaj is not telling the truth, therefore, Puneet is not guilty”.

(3) If n is a real number such that n > 1, then n2 > 1. Suppose that n2 > 1, then n > 1. (December)

Choices

Choice (4)Response

a.

(1) and (2)

b.

Only (3)

c.

(1), (2) and (3)

d.

Only (2)

Question number: 2

» Computer Arithmetic » Propositional Boolean Logic

Edit

Appeared in Year: 2015

MCQ▾

Question

Let P (m, n) be the statement “m divides n” where the Universe of discourse for both the variables is the set of positive integers. Determine the truth values of the following propositions.

(December)

Choices

Choice (4)Response

a.

(1) -True; (2) -True; (3) -True

b.

(1) -True; (2) -False; (3) -False

c.

(1) -True; (2) -True; (3) -False

d.

(1) -False; (2) -False; (3) -False

Question number: 3

» Computer Arithmetic » Propositional Boolean Logic

Edit

Appeared in Year: 2016

MCQ▾

Question

The simplified form of a Boolean equation is:

Choices

Choice (4)Response

a.

AB’

b.

ABC

c.

AB’C

d.

A’B

Developed by: