• Placement Questions

Placement Papers with Solutions

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

The line graph L(G) of a simple graph G is defined as follows:
There is exactly one vertex v(e) in L(G) for each edge e in G.
For any two edges e and in G, L(G) has an edge between v(e) and v(), if
and only if e and e- are incident with the same vertex in G.
Which of the following statements is/are TRUE?
(P) The line graph of a cycle is a cycle.
(Q) The line graph of a clique is a clique.
(R) The line graph of a planar graph is planar.
(S) The line graph of a tree is a tree.

Option
(A) P only
(B) P and R only
(C) R only
(D) P, Q and S only

Asked In Gate Rats (12 years ago)

Unsolved

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

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

Consider the following sequence of micro operations MBR

Asked In Gate Rats (12 years ago)

Unsolved

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

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

Consider a hard disk with 16 recording surfaces (0 15) having 16384 cylinders (0 16383) and each cylinder contains 64 sectors (0 63). Data storage capacity in each sector is 512 bytes. Data are organized cylinder wise and the addressing format is . A file of size 42797 KB is stored in the disk and the starting disk location of the file is . What is the cylinder number of the last sector of the file, if it is stored in a contiguous manner?

Option
(A) 1281
(B) 1282
(C) 1283
(D) 1284

Asked In Gate Rats (12 years ago)

Unsolved

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

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

A shared variable x, initialized to zero, is operated on by four concurrent processes W, X, Y, Z as follows. Each of the processes W and X reads x from memory, increments by one, stores it to memory, and then terminates. Each of the processes Y and Z reads x from memory, decrements by two, stores it to memory, and then terminates. Each process before reading x invokes the P operation (i.e., wait) on a counting semaphore S and invokes the V operation (i.e., signal) on the semaphore S after storing x to memory. Semaphore S is initialized to two. What is the maximum possible value of x after all processes complete execution?

Option
(A) -2
(B) -1
(C) 1
(D) 2

Asked In Gate Rats (12 years ago)

Unsolved Read Solution (1)

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

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

Determine the maximum length of cable (in km) for transmitting data at a rate of 500 Mbps in an Ethernet LAN with frames of size 10,000 bits. Assume the signal speed in the cable to be 2,00,000 km/s

Option
(A) 1
(B) 2
(C) 2.5
(D) 5

Asked In Gate Rats (12 years ago)

Unsolved Read Solution (1)

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

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

In an IPv4 datagram, the M bit is 0, the value of HLEN is 10, the value of total length is 400 and the fragment offset value is 300. The position of the datagram, the sequence numbers of the first and the last bytes of the payload, respectively are

Option
(A) Last fragment, 2400 and 2789
(B) First fragment, 2400 and 2759
(C) Last fragment, 2400 and 2759
(D) Middle fragment, 300 and 689

Asked In Gate Rats (12 years ago)

Unsolved

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

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

The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is the postorder traversal sequence of the same tree?

Option
(A) 10,20,15,23,25,35,42,39,30
(B) 15,10,25,23,20,42,35,39,30
(C) 15,20,10,23,25,42,35,39,30
(D) 15,10,23,25,20,35,42,39,30

Asked In Gate Rats (12 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (13)   (10) Submit Your Solution Percentage

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

Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (EI) and Write Operand (WO). The stage delays for FI, DI, FO, EI and WO are 5 ns, 7 ns, 10 ns, 8 ns and 6 ns, respectively. There are intermediate storage buffers after each stage and the delay of each buffer is 1 ns. A program consisting of 12 instructions 1 2 3 12 I , I , I ,......I is executed in this pipelined
processor. Instruction 4 I is the only branch instruction and its branch target is 9 I . If the branch is taken during the execution of this program, the time (in ns) needed to complete the program is

Option
(A) 132
(B) 165
(C) 176
(D) 328

Asked In Gate Rats (12 years ago)

Unsolved Read Solution (1)

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

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

A RAM chip has a capacity of 1024 words of 8 bits each (1K × 8) . The number of 2 × 4 decoders with enable line needed to construct a 16K × 16 RAM from 1K × 8 RAM is

Option
(A) 4
(B) 5
(C) 6
(D) 7

Asked In Gate Rats (12 years ago)

Unsolved

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

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

The smallest integer than can be represented by an 8-bit number in 2's complement form is

Option
(A) -256
(B) -128
(C) -127
(D) 0

Asked In Gate Rats (12 years ago)

Unsolved

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