GATE CS 1999

Question 31

Consider the schema R= ( S, T, U, V ) and the dependencies S→T, T→U, U→V and V→S. Let R (R1 and R2) be a decomposition such that R1∩R2 ≠ Ø. The decomposition is:

• Not in 2NF
• In 2NF but not in 3NF
• In 3NF but not in 2NF
• In both 2NF and 3NF

Question 32

Consider the circuit shown below . In a certain steady state, the line Y is at \' 1 \'. What are the possible values of A, B and C in this state? a). A=0, B=0, C=1 b). A=0, B=1, C=1 c). A=1, B=0, C=1 d). A=1, B=1, C=1

• b only
• Both a and b
• Both a and c
• a, c and d

Question 33

Which of the following sets of component(s) is/are sufficient to implement any arbitrary boolean function? a) XOR gates, NOT gates b) 2 to 1 multiplexers c)  AND gates, XOR gates d) Three-input gates that output (A.B)+C for the inputs A, B and C.  

• a and d
• b and c
• c only
• All of above

Question 34

A multi-user, multi-processing operating system cannot be implemented on hardware that does not support: a) Address translation b) DMA for disk transfer c) At least two modes of CPU execution (privileged and non-privileged). d) Demand Paging

• Only A
• Both A, B
• A, B and C
• A, B and D

Question 35

Which of the following is/are advantages of virtual memory? a) Faster access to memory on an average. b) Processes can be given protected address spaces. c) Linker can assign addresses independent of where the program will be loaded in physical memory. d) Programs larger than the physical memory size can be run.

• a and b
• b and c
• b and d
• All of the above

Question 36

Which of the following actions is/are typically not performed by the operating system when switching context from process A to process B?

• Saving current register values and restoring saved register values for process B.
• Changing address translation tables.
• Swapping out the memory image of process A to the disk.
• Invalidating the translation look-aside buffer.

Question 37

Consider the following program in a language that has dynamic seeping.

var x: real;
procedure show:
    begin print(x);end;
procedure small;
    var x: real;
        begin x: = 0.125; show; end;
begin x:=0.25
    show; small
    end.

Then the output of the program is:

• 0.125 0.125
• 0.25 0.25
• 0.25 0.125
• 0.125 0.25

Question 38

The number of tokens in the Fortran statement DO 10  I= 1.25 is

• 3
• 4
• 5
• None of above

Question 39

A grammar that is both left and right recursive for a non-terminal is

• Ambiguous
• Unambiguous
• Information is not sufficient to decide whether it is ambiguous or Unambiguous.
• None of the above

Question 40

The number of fill and half-address required to add 16-bit number is:

• 8 half-adders, 8 full-adders
• 1 half-adder, 15 full-adders
• 16 half-adders, 0 full-adders
• 4 half-adders, 12 full-adders