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

Question

MCQ▾

What is the worst case complexity of the Insertion Sort algorithm?

Choices

Choice (4)Response

a.

O (n log n)

b.

O (n2)

c.

O (n)

d.

O (log n)

Question 1458

Question

MCQ▾

There is single processor system where new processes arrive at an average of 3 processes per minute and each of these processes need an average of 4 seconds of service time. What will be the CPU utilization in such a scenario?

Choices

Choice (4)Response

a.

b.

c.

d.

Question 1459

Question

MCQ▾

We have been given a disk with 200 cylinders numbered from 0 to 199. In this system, there are 8 pending requests currently, given by the disk sequence,

The read/write head is currently positioned at cylinder number 53. The number of arm motions using the Shortest seek first algorithm will be?

Choices

Choice (4)Response

a.

230

b.

232

c.

236

d.

234

Question 1460

Question

MCQ▾

For managing the extent of risk in the software, we define a ratio as,

Where RE = Risk exposure,

This ratio is called as?

Choices

Choice (4)Response

a.

Risk address ratio

b.

Risk reduction leverage

c.

Risk mitigation leverage

d.

Risk restructuring ratio

Question 1461

Question

MCQ▾

What is the output of the following program,

  1. #include<stdio.h>
  2. intmain() {
  3.     inta[]={1,2,3,4,5};
  4.     intptr=(int⚹)(&a+1);
  5.     printf("%d",⚹(ptr-1));
  6.     return0;
  7. }

Choices

Choice (4)Response

a.

Runtime error

b.

5

c.

1

d.

2

Developed by: