GATE-CS-2001

Question 11

Given the following Karnaugh map, which one of the following represents the minimal Sum-Of-Products of the map?  

[caption width="800"] [/caption]

• xy + y\'z

• wx\'y\' + xy + xz

• w\'x + y\'z + xy

• xz + y

Question 12

A processor needs software interrupt to

• test the interrupt system of the processor
• implement co-routines
• obtain system services which need execution of privileged instructions
• return from subroutine

Question 13

A CPU has two modes-privileged and non-privileged. In order to change the mode from privileged to non-privileged

• a hardware interrupt is needed
• a software interrupt is needed
• a privileged instruction (which does not generate an interrupt) is needed
• a non-privileged instruction (which does not generate an interrupt is needed

Question 14

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(n²)

• O(n!)

Question 15

Consider any array representation of an n element binary heap where the elements are stored from index 1 to index n of the array. For the element stored at index i of the array (i <= n), the index of the parent is

• i - 1

• floor(i/2)

• ceiling(i/2)

• (i+1)/2

Question 16

Let f(n) = n²Logn and g(n) = n (logn)¹⁰ be two positive functions of n. Which of the following statements is correct?

• f(n) = O(g(n)) and g(n) != O(f(n))
• f(n) != O(g(n)) and g(n) = O(f(n))
• f(n) = O(g(n)) but g(n) = O(f(n))
• f(n) != O(g(n)) but g(n) != O(f(n))

Question 17

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 18

Which of the following statements is false?

• An unambiguous grammar has same leftmost and rightmost derivation
• An LL(1) parser is a top-down parser
• LALR is more powerful than SLR
• An ambiguous grammar can never be LR(k) for any k

Question 19

Consider a set of n tasks with known runtimes r₁, r₂, .... r_n to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput?

• Round-Robin

• Shortest-Job-First

• Highest-Response-Ratio-Next

• First-Come-First-Served

Question 20

Where does the swap space reside?

• RAM
• Disk
• ROM
• On-chip cache