GATE (Graduate Aptitude Test in Engineering) Computer Science: Questions 1861 - 1865 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 1861

Question

MCQ▾

Any set of Boolean operators that is sufficient to represent all Boolean expressions is said to be complete. Which of the following is not complete?

Choices

Choice (4)Response

a.

{NOR}

b.

{NOT, OR}

c.

{AND, OR}

d.

{AND, NOT}

Question 1862

Question

MCQ▾

Which of the following page replacement algorithms suffers from Belady՚s anomaly?

Choices

Choice (4)Response

a.

LRU

b.

FIFO

c.

Optimal Page Replacement

d.

Question does not provide sufficient data or is vague

Question 1863

Question

MCQ▾

Consider the following language:

{}

{}

Which one of the following is correct?

Choices

Choice (4)Response

a.

Only L2 is context free language

b.

Only L1 is context free language

c.

All of the above

d.

None of the above

Question 1864

Question

MCQ▾

A LRU page replacement is used with 4 page frames. How many page faults will occur with the reference string 70120304230323 if the four frames are initially empty?

Choices

Choice (4)Response

a.

6

b.

7

c.

8

d.

5

Question 1865

Question

MCQ▾

Consider the following learning algorithms:

(i) Logistic regression

(ii) Back propagation

(iii) Linear regression

Which of the following option represents classification algorithms?

Choices

Choice (4)Response

a.

(i) , (ii) and (iii)

b.

(ii) and (iii) only

c.

(i) and (iii) only

d.

(i) and (ii) only

Developed by: