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

Appeared in Year: 2014 (UGC-NET)

Question

MCQ▾

Consider an imaginary disk with 40 cylinders. A request come to read a block on cylinder 11. While the seek to cylinder 11 is in progress, new requests come in for cylinders 1, 36, 16,34, 9 and 12 in that order. The number of arm motions using shortest seek first algorithm is (December Paper III)

Choices

Choice (4)Response

a.

60

b.

111

c.

61

d.

112

Question 1032

Appeared in Year: 2014 (UGC-NET)

Question

MCQ▾

What kind of mechanism is to be taken into account for converting a weak entity set into strong entity set in entity-relationship diagram? (December Paper II)

Choices

Choice (4)Response

a.

Generalization

b.

Aggregation

c.

Specialization

d.

Adding suitable attributes

Question 1033

Appeared in Year: 2014 (UGC-NET)

Question

MCQ▾

Specialization Lattice stands for (June paper III)

Choices

Choice (4)Response

a.

An entity type that can participate in 1 specialization.

b.

An entity type can participate as a subclass in more than 1 specialization.

c.

An entity type can participate as a subclass in only 1 specialization.

d.

An entity type that can participate in 1 generalization.

Question 1034

Appeared in Year: 2017 (UGC-NET)

Question

MCQ▾

________ do not take their decisions on measurements or estimates of the current traffic and topology. (November Paper II)

Choices

Choice (4)Response

a.

Adaptive algorithms

b.

Recursive algorithms

c.

Non - adaptive algorithms

d.

Static algorithms

Developed by: