• Placement Questions

Placement Papers with Solutions

(#M40029694) GATE QUESTION GATE-CS Keep an EYE

One of the header fields in an IP datagram is the Time to Live (TTL) field. Which
of the following statements best explains the need for this field?
(A) It can be used to prioritize packets
(B) It can be used to reduce delays
(C) It can be used to optimize throughput
(D) It can be used to prevent packet looping

Asked In Gate Rats (12 years ago)

Unsolved

Is this Puzzle helpful?   (3)   (3) Submit Your Solution

(#M40029693) GATE QUESTION GATE-CS Keep an EYE

Which languages necessarily need heap allocation in the runtime environment?
(A) Those that support recursion
(B) Those that use dynamic scoping
(C) Those that allow dynamic data structures
(D) Those that use global variables

Asked In Gate Rats (12 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (14)   (4) Submit Your Solution

(#M40029692) GATE QUESTION GATE-CS Keep an EYE

Which data structure in a compiler is used for managing information about variables and their attributes?
(A) Abstract syntax tree
(B) Symbol table
(C) Semantic stack
(D) Parse table

Asked In Gate Rats (12 years ago)

Unsolved Read Solution (2)

Is this Puzzle helpful?   (21)   (15) Submit Your Solution

(#M40029691) GATE QUESTION GATE-CS Keep an EYE

In a binary tree with n nodes, every node has an odd number of descendants. Every node is considered to be its own descendant. What is the number of nodes in the tree that have exactly one child?
option
(A) 0
(B) 1
(C) (n-1)/2
(D) n-1

Asked In Gate Rats (12 years ago)

Unsolved

Is this Puzzle helpful?   (0)   (1) Submit Your Solution

(#M40029690) GATE QUESTION GATE-CS Keep an EYE

Consider the following table of arrival time and burst time for three processes P0, P1 and P2. Process Arrival time Burst Time
P0 0 ms 9 ms
P1 1 ms 4ms
P2 2 ms 9ms
The pre-emptive shortest job first scheduling algorithm is used. Scheduling is carried out only at arrival or completion of processes. What is the average waiting time for the three processes?
option
(A) 5.0 ms
(B) 4.33 ms
(C) 6.33 ms
(D) 7.33 ms

Asked In Gate Rats (12 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (7)   (1) Submit Your Solution

(#M40029689) GATE QUESTION GATE-CS Keep an EYE

Consider a database table T containing two columns X and Y each of type integer. After the creation of the table, one record (X= 1, Y=l) is inserted in the table. Let MX and MY denote the respective maximum values of X and Y among all records in the table at any point in time. Using MX and MY, new records are inserted in the table 128 times with X and Y values being MX+1, 2*MY+1 respectively. It may be noted that each time after the insertion, values of MX and MY change. What will be the output of the following SQL query after the steps mentioned above are carried out? SELECT Y FROM T WHERE X=7;
option
(A) 127
(B) 255
(C) 129
(D) 257

Asked In Gate Rats (12 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (6)   (3) Submit Your Solution

(#M40029688) GATE QUESTION GATE-CS Keep an EYE

On a non-pipe lined sequential processor, a program segment, which is a part of the interrupt service routine, is given to transfer 500 bytes from an I/O device to memory.
Initialize the address register
Initialize the count to 500 LOOP:
Load a byte from device Store in memory at address given by address register
Increment the address register Decrement the count
If count != 0 go to LOOP
Assume that each statement in this program is equivalent to a machine
instruction which takes one clock cycle to execute if it is a non-load/store
instruction. The load-store instructions take two clock cycles to execute.
The designer of the system also has an alternate approach of using the DMA
controller to implement the same transfer. The DMA controller requires 20 clock
cycles for initialization and other overheads. Each DMA transfer cycle takes two
clock cycles to transfer one byte of data from the device to the memory.
What is the approximate speedup when the DMA controller based design is used
in place of the interrupt driven program based input-output?
option
(A) 3.4
(B) 4.4
(C) 5.1
(D) 6.7

Asked In Gate Rats (12 years ago)

Unsolved

Is this Puzzle helpful?   (2)   (2) Submit Your Solution

(#M40029687) GATE QUESTION GATE-CS Keep an EYE

An application loads 100 libraries at startup. Loading each library requires exactly
one disk access. The seek time of the disk to a random location is given as 10ms.
Rotational speed of disk is 6000rpm. If all 100 libraries are loaded from random
locations on the disk, how long does it take to load all libraries? (The time to
transfer data from the disk block once the head has been positioned at the start
of the block may be neglected)

option
(A) 0.50s
(B) 1.50s
(C) 1.25s
(D) 1.00s

Asked In Gate Rats (12 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (3)   (1) Submit Your Solution

(#M40029686) GATE QUESTION GATE-CS Keep an EYE

An 8KB direct mapped write-back cache is organized as multiple blocks, each of
size 32-bytes. The processor generates 32-bit addresses. The cache controller
maintains the tag information for each cache block comprising of the following.
1 Valid bit
1 Modified bit
As many bits as the minimum needed to identify the memory block mapped in
the cache.
What is the total size of memory needed at the cache controller to store metadata
(tags) for the cache?

option
(A) 4864 bits
(B) 6144 bits
(C) 6656 bits
(D) 5376 bits

Asked In Gate Rats (12 years ago)

Unsolved

Is this Puzzle helpful?   (0)   (0) Submit Your Solution

(#M40029685) GATE QUESTION GATE-CS Keep an EYE

A computer handles several interrupt sources of which the following are relevant
for this question.
Interrupt from CPU temperature sensor
Interrupt from Mouse
Interrupt from Keyboard
Interrupt from Hard Disk
option
(A) Interrupt from Hard Disk
(B) Interrupt from Mouse
(C) Interrupt from Keyboard
(D) Interrupt from CPU temp sensor

Asked In Gate Rats (12 years ago)

Unsolved

Is this Puzzle helpful?   (0)   (0) Submit Your Solution