GATE (Graduate Aptitude Test in Engineering) Computer Science: Questions 1381 - 1386 of 2080

Access detailed explanations (illustrated with images and videos) to 2080 questions. Access all new questions- tracking exam pattern and syllabus. View the complete topic-wise distribution of questions. Unlimited Access, Unlimited Time, on Unlimited Devices!

View Sample Explanation or View Features.

Rs. 550.00 -OR-

How to register? Already Subscribed?

Question 1381

Question

MCQ▾

Which of the following are considered as “Well-formed formulas” in Predicate logic?

Choices

Choice (4)Response

a.

True

b.

False

c.

Atomic formulas

d.

All a., b. and c. are correct

Question 1382

Question

MCQ▾

In UML modeling, the Timing diagram is a special case of the ________ diagram.

Choices

Choice (4)Response

a.

Class diagram

b.

Activity diagram

c.

Sequence diagram

d.

None of the above

Question 1383

Question

MCQ▾

In first order logic, the concept “Universal elimination” is used for?

Choices

Choice (4)Response

a.

Substitute a variable with a constant symbol

b.

Substitute a constant with a variable symbol

c.

To remove the universal quantifier

d.

All of the above

Question 1384

Question

MCQ▾

The “Tree topology” is a combination of ________ and ________ basic topologies.

Choices

Choice (4)Response

a.

Mesh and Ring

b.

Bus and Ring

c.

Bus and Star

d.

Mesh and Star

Question 1385

Question

MCQ▾

With which of these terms is “Busy waiting” associated in an Operating system?

Choices

Choice (4)Response

a.

Semaphore

b.

Binary lock

c.

Mutex

d.

Spinlock

Question 1386

Question

MCQ▾

Convert the following statement into first-order logic.

“You can fool all the people some of the time”

Choices

Choice (4)Response

a.

b.

c.

d.

Developed by: