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

Question

MCQ▾

A max – heap is a heap where the value of each parent is greater than or equal to the value of its children. Which of the following is a max – heap?

Choices

Choice (4)Response

a.

Find a Max – Heap: Choice A

b.

Find a Max – Heap: Choice B

c.

Find a Max – Heap: Choice C

d.

Find a Max – Heap: Choice D

Question 1561

Question

MCQ▾

Which Scheduling policy is most suitable for a time – shared operating systems?

Choices

Choice (4)Response

a.

First come first serve

b.

Round Robin

c.

Shortest job first

d.

Elevator

Question 1562

Question

MCQ▾

In which queue elements can be added or removed from either end but not in the middle?

Choices

Choice (4)Response

a.

Priority Queue

b.

Circular Queue

c.

Simple Queue

d.

Double Ended queue

Question 1563

Question

MCQ▾

Four jobs to be executed on a single processor system arrive at time in the order their burst CPU time requirements are time units respectively. The completion time of under round robin scheduling with time slice on one time units is?

Table of the Round Robin Scheduling Algorithm
PIDATBT

Choices

Choice (4)Response

a.

8

b.

4

c.

10

d.

9

Question 1564

Question

MCQ▾

What is the complexity of heap sort?

Choices

Choice (4)Response

a.

b.

c.

d.

Developed by: