GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

127.

A hard disk has 63 sections per track, 10 platters each with 2 recording surfaces and 1000 cylinders. The address of a sector is given as a triple <c,h,s>, where c is the cylinder number, h is the surface number and s is the sector number. Thus, the 0th sector is addressed as <0,0,0>, the 1st sector as <0,0,1>,and so on.

[1] The address <400, 16, 29>corresponds to sector number: [2 marks]
(A) 505035
(B) 505036
(C) 505037
(D) 505038
[2] The address of the 1039^th sector is [2 marks]
(A) <0,15,31>
(B) <0,16,30>
(C) <0,16,31>
(D) <0,17,31>

last reply by CpjJwWHV • 12 years ago • asked in Computer Science And Engineering, 2009

View Comments [2 Reply]
128.

In the RSA public key cryptosystem, the private & public keys are(e, n) & (d, n) respectively, where n=p * q & p & q are large primes. Besides, n is public &p &q are private . Let M be an integer such that 0<M<n & ϕ(n) = (p – 1) (q – 1). Now consider the following equations.
I. M' = M^e mod n
M=(M')^d mod n
II. ed = 1 mod n
III. ed = 1 mod ϕ(n)
IV. M' = M^e mod ϕ(n)
M = (M')^d mod ϕ(n)
Which of the above equations correctly represent RSA cryptosystem? [2 marks]
(A) I and II
(B) I and III
(C) II and IV
(D) III and IV

last reply by CpjJwWHV • 12 years ago • asked in Computer Science And Engineering, 2009

View Comments [1 Reply]
129.

Consider the following statements about the cyclomatic complexity of the control flow graph of a program module. Which of these are TRUE?
I. The cyclomatic complexity of a module is equal to the maximum number of linearly independent circuits in the graph.
II. The cyclomatic complexity of a module is the number of decisions in the module plus one, where a decision is effectively any conditional statement in the module.
III. The cyclomatic complexity can also be used as a number of linearly independent paths that should be tested during path coverage testing
[2 marks]
(A) I and II
(B) II and III
(C) I and III
(D) I,II and III

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

View Comments [1 Reply]
130.

Which of the following statements are TRUE?
I. The context diagram should depict the system as a single bubble.
II. External entities should be identified clearly at all levels of DFDs.
III. Control information should not be represented in a DFD.
IV. A data store can be connected either to another data store or to an external entity.
[2 marks]
(A) II and III
(B) I,II and IV
(C) I and III
(D) I,II and III

asked in Computer Science And Engineering, 2009

View Comments [0 Reply]
131.

Let G(x) be the generator polynomial used for CRC checking. What is the condition that should be satisfied by G(x) to detect odd Number of bits in error ? [2 marks]
(A) G(x) contains more than two terms
(B) G(x) does not divide 1+X^K, for any K not exceeding the frame length
(C) 1 + x is a factor of G(x)
(D) G(x) has an odd number of terms

asked in Computer Science And Engineering, 2009

View Comments [0 Reply]
132.

While opening a TCP connection, the initial sequence number is to be derived using a time of day (TOD) clock that keeps running even when the host is down. The low order 32 bits of the counter of the ToD clock is to be used for the initial sequence number . The clock counter increments once per millisecond. The maximum packet lifetime is given to be 64s.Which one of the choices given below is closest to the minimum permissible rate at which sequence number used for packets of a connection can increase ? [2 marks]
(A) 0.015/s
(B) 0.064/s
(C) 0.135/s
(D) 0.327/s

asked in Computer Science And Engineering, 2009

View Comments [0 Reply]

801 1 ...‹‹20 2122 23 24 ›› ... 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