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

Question

MCQ▾

An operating system uses Shortest Remaining Time first (SRT) process scheduling algorithm. Consider the arrival times and execution times for the following processes:

Shortest Remaining Time First
ProcessBurst timeArrival time
P180
P241
P322
P413
P534
P625

What is the average waiting time across all process is________ millisecond?

Choices

Choice (4)Response

a.

4

b.

5

c.

4.5

d.

5.5

Question 1941

Question

MCQ▾

The network 221.98. 41.0

Choices

Choice (4)Response

a.

Class D Network

b.

Class C Network

c.

Class A Network

d.

Class B Network

Question 1942

Question

MCQ▾

If the frame buffer has 10 bits per pixel and 8 bits are allocated for each of the R, G, B component, then what would be the size of the color loop up table?

Choices

Choice (4)Response

a.

Byte

b.

Byte

c.

() byte

d.

Question does not provide sufficient data or is vague

Question 1943

Question

MCQ▾

Let f and g be two functions that take nonnegative values, and suppose that . Which of the following is correct?

Choices

Choice (4)Response

a.

b.

c.

d.

All of the above

Question 1944

Question

MCQ▾

What would be the output of the following program, if the array begins at 65486?

  1. main()
  2. {
  3. intarr[] ={12,14,15,23,54};
  4.  printf(“%u%u”, arr+1, &arr+1);
  5. }

Choices

Choice (4)Response

a.

b.

c.

d.

All of the above

Developed by: