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

Appeared in Year: 2019

Question

MCQ▾
  1. #include < stdio.h >
  2. intjumble ( intx, inty ) {
  3.  x =2 ⚹x +y;
  4. returnx;
  5. }
  6. intmain ( ) {
  7. intx =2, y =5;
  8.  y =jumble ( y, x ) ;
  9.  x =jumble ( y, x ) ;
  10.  printf ( “ %dn ” , x ) ;
  11. return0;
  12. }

What would be the output of this program?

Choices

Choice (4)Response

a.

26

b.

25

c.

24

d.

23

Question 1777

Appeared in Year: 2019

Question

MCQ▾

Which one of the following is NOT a valid identity?

Choices

Choice (4)Response

a.

b.

c.

d.

Question 1778

Appeared in Year: 2019

Question

MCQ▾

Consider the following four processes with arrival times (in milliseconds) and their length of CPU burst (in milliseconds) as shown below:

Consider the Following Four Processes with Arrival Times

These processes are run on a single processor using preemptive Shortest Remaining Time First scheduling algorithm. If the average waiting time of the processes is 1 millisecond, then the value of Z is ________.

Choices

Choice (4)Response

a.

4

b.

2

c.

3

d.

5

Question 1779

Appeared in Year: 2019 (UGC-NET)

Question

MCQ▾

Which of the following CPU scheduling algorithms is/are supported by LINUX operating system? (December)

Choices

Choice (4)Response

a.

Non-preemptive priority scheduling

b.

Time sharing scheduling only

c.

Priority scheduling only

d.

Preemptive priority scheduling and time sharing CPU scheduling

Developed by: