GATE-CS-2001

Last Updated :

Discuss

Comments

Question 1

Which of the following does not interrupt a running process?

A
A device
B
Timer
C
Scheduler process
D
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?

A
O(n)
B
O(n*log(n))
C
O(n²)
D
O(n!)

Question 3

Where does the swap space reside?

A
RAM
B
Disk
C
ROM
D
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

A
Assembly
B
Parsing
C
Relocation
D
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

A
always decrease the number of page faults
B
always increase the number of page faults
C
sometimes increase the number of page faults
D
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?

A
16 MB
B
8 MB
C
2 MB
D
24 MB

Question 7

Which of the following statements is false?

A
Virtual memory implements the translation of a program‘s address space into physical memory address space
B
Virtual memory allows each program to exceed the size of the primary memory
C
Virtual memory increases the degree of multiprogramming
D
Virtual memory reduces the context switching overhead

Question 8

Which of the following requires a device driver?

A
Register
B
Cache
C
Main memory
D
Disk

Question 9

Consider the following graph:

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

Options: a) b) c) d)

A
AB, BD, DE, EF, FC
B
AC, CD, DE, EB, BF
C
AB, BD, DE, EC, CF
D
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
A tuple (z,w) with z > y is deleted
B
A tuple (z,w) with z > x is deleted
C
A tuple (z,w) with w < x is deleted
D
The deletion of (x,y) is prohibited

Tags:

GATE

There are 50 questions to complete.

Take a part in the ongoing discussion