GATE-CS-2001

Last Updated :
Discuss
Comments

Question 1

Which of the following does not interrupt a running process?

  • A device

  • Timer

  • Scheduler process

  • Power failure

Question 2

Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using randomized quicksort?

  • O(n)

  • O(n*log(n))

  • O(n2)

  • O(n!)

Question 3

Where does the swap space reside?

  • RAM

  • Disk

  • ROM

  • On-chip cache

Question 4

The process of assigning load addresses to the various parts of the program and adjusting the code and date in the program to reflect the assigned addresses is called

  • Assembly

  • Parsing

  • Relocation

  • Symbol resolution

Question 5

Consider a virtual memory system with FIFO page replacement policy. For an arbitrary page access pattern, increasing the number of page frames in main memory will

  • always decrease the number of page faults

  • always increase the number of page faults

  • sometimes increase the number of page faults

  • never affect the number of page faults

Question 6

Consider a machine with 64 MB physical memory and a 32-bit virtual address space. If the page size is 4KB, what is the approximate size of the page table?

  • 16 MB

  • 8 MB

  • 2 MB

  • 24 MB

Question 7

Which of the following statements is false?

  • Virtual memory implements the translation of a program‘s address space into physical memory address space

  • Virtual memory allows each program to exceed the size of the primary memory

  • Virtual memory increases the degree of multiprogramming

  • Virtual memory reduces the context switching overhead

Question 8

Which of the following requires a device driver?

  • Register

  • Cache

  • Main memory

  • Disk

Question 9

Consider the following graph:

Graph

Which edges would be included in the minimum spanning tree using Prim's algorithm starting from vertex A?

Options: a)  b)  c)  d) 

  • AB, BD, DE, EF, FC

  • AC, CD, DE, EB, BF

  • AB, BD, DE, EC, CF

  • AC, CD, DE, EB, FE

Question 10

Consider a relation geq which represents “greater than or equal to”, that is, (x,y) ∈ geq only if y >= x.

create table geq
(
ib integer not null
ub integer not null
primary key 1b
foreign key (ub) references geq on delete cascade
)

Which of the following is possible if a tuple (x,y) is deleted?

  • A tuple (z,w) with z > y is deleted

  • A tuple (z,w) with z > x is deleted

  • A tuple (z,w) with w < x is deleted

  • The deletion of (x,y) is prohibited

Tags:

There are 50 questions to complete.

Take a part in the ongoing discussion