GATE CS 1998

Question 41

Formatting of a floppy disk refers to

• arranging the data on the disk in contiguous fashion
• writing the directory
• erasing the system area
• writing identification information on all tracks and sectors.

Question 42

The address space of 8086 CPU is

• One Megabyte
• 256 Kilobytes
• 1 K Megabytes
• 64 Kilobytes

Question 43

A complete n-ary tree is one in which every node has 0 or n sons. If x is the number of internal nodes of a complete n-ary tree, the number of leaves in it is given by

• x(n-1)+1
• xn-1
• xn+1
• x(n+1)

Question 44

What value would the following function return for the input x=95 ?

function fun (x:integer):integer;
Begin
  If x >100 then fun = x-10
  Else fun = fun(fun( x+11))
End;

• 89
• 90
• 91
• 92

Question 45

Let A be a two dimensional array declared as follows:

A: array [1 ... 10] [1 ... 15] of integer;

Assuming that each integer takes one memory location, the array is stored in row-major order and the first element of the array is stored at location 100, what is the address of the element a[i][j] ?

• 15i+ j+ 84
• 15j+ i+ 84
• 10i+ j+ 89
• 10j+ i+ 89

Question 46

Faster access to non-local variables is achieved using an array of pointers to activation records, called a

• stack
• heap
• display
• activation tree

Question 47

The overlay tree for a program is as shown below: What will be the size of the partition (in physical memory) required to load (and run)  this program?  

• 12 KB
• 14 KB
• 10 KB
• 8 KB

Question 48

Consider n processes sharing the CPU in a round-robin fashion. Assuming that each process switch takes s seconds, what must be the quantum size q such that the overhead resulting from process switching is minimized but, at the same time, each process is guaranteed to get its turn at the CPU at least every t seconds ?

• a
• b
• c
• d

Question 49

If an instruction takes i microseconds and a page fault takes an additional j microseconds, the effective instruction time if on the average a  page fault occurs every k instructions is:

• i + j/k
• i + j* k
• (i + j)/ k
• (i + j)* k

Question 50

Which of the following query transformations (i.e., replacing the l.h.s. expression by the r.h.s. expression) is incorrect? R₁ and R₂ are relations. C₁, C₂ are selection conditions and A₁, A₂ are attributes of R₁. a.  σC₁( σC₂R1)) → σC₂(σC₁(R1)) b.  σC₁( π_A1R1)) → π_A1(σC₁(R1)) c.  σC₁( R₁ ∪ R₂ ) → σC₁(R₁) ∪ σC₁(R₂) d.  π_A1(σC₁(R₁)) → σC₁ (πA₁ (R₁))

• a
• b
• c
• d