GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

415.

Let E₁ and E₂ be two entities in an E/R diagram with simple single-valued attributes. R₁ and R₂ are two relationships between E₁ and E₂, where R₁ is one-to-many and R₂ is many-to-many. R₁ and R₂ do not have any attributes of their own. What is the minimum number of tables required to represent this situation in the relational model?
[2 marks]
(a) 2
(b) 3
(c) 4
(d) 5

last reply by CpjJwWHV • 13 years ago • asked in Computer Science And Engineering, 2005

View Comments [1 Reply]
416.

Suppose the round trip propagation delay for a 10 Mbps Ethernet having 48-bit jamming signal is 46.4 µs. The minimum frame size is: [2 marks]
(a) 94
(b) 416
(c) 464
(d) 512

last reply by CpjJwWHV • 14 years ago • asked in Computer Science And Engineering, 2005

View Comments [1 Reply]
417.

In a packet switching network, packets are routed from source to destination along a single path having two intermediate nodes. If the message size is 24 bytes and each packet contains a header of 3 bytes, then the optimum packet size is: [2 marks]
(a) 4
(b) 6
(c) 7
(d) 9

asked in Computer Science And Engineering, 2005

View Comments [0 Reply]
418.

Consider the following code fragment:
if (fork () ==0)
{ a = a + 5; printf(“%d,%d\n”, a, &a); }
else { a = a –5; printf(“%d, %d\n”, a, &a); }
Let u, v be the values printed by the parent process, and x,y be the values printed by the child process. Which one of the following is TRUE? [2 marks]
(a) u = x + 10 and v = y
(b) u = x + 10 and v is ≠ y
(c) u + 10 = x and v = y
(d) u + 10 = x and v ≠ y

asked in Computer Science And Engineering, 2005

View Comments [0 Reply]
419.

Suppose n processes, P₁, …. P_n share m identical resource units, which can be reserved and released one at a time. The maximum resource requirement of process P_i is s_i, where s_i >0. Which one of the following is a sufficient condition for ensuring that deadlock does not occur? [2 marks]
(a) ∀i, s_i < m
(b) ∀i, s_i < n

asked in Computer Science And Engineering, 2005

View Comments [0 Reply]
420.

Consider a disk drive with the following specifications:
16 surfaces, 512 tracks/surface, 512 sectors/track, 1 KB/sector, rotation speed 3000 rpm. The disk is operated in cycle stealing mode whereby whenever one 4 byte word is ready it is sent to memory; similarly, for writing, the disk interface reads a 4 byte word from the memory in each DMA cycle. Memory cycle time is 40 nsec. The maximum percentage of time that the CPU gets blocked during DMA operation is:
[2 marks]
(a) 10
(b) 25
(c) 40
(d) 50

asked in Computer Science And Engineering, 2005

View Comments [0 Reply]

801 1 ...‹‹68 6970 71 72 ›› ... 134

High Frequency Word List with Mnemonics

GPL Dictionary is fast way to learn words with mnemonics.
It contains high frequency word list which are mostly asked in various examinations.
It is dedicated for student appearing for PSUs, GRE, UPSC or any other exams in which vocabulary test is taken.
User can save their own mnemonics (key and link).

Check Now