. |
Addressing structure
| |||||||||
|
This blog is made especially for thos students who want to appear for gate and want to crack gate with IITs so i will give u total info and study material for achieving ur goal. thanks...... for well to me pl give comments/posts sothat i will give u as u wants thanks
Thursday, December 27, 2012
32 GATE Question of the Day – Computer Science
Tuesday, December 25, 2012
Sunday, December 23, 2012
Friday, December 21, 2012
Wednesday, December 19, 2012
Monday, December 17, 2012
27 GATE Question of the Day – Computer Science Gate 2013
1.
The part of machine level instruction, which tells the central processor what has to be done, is
A. Operation code
B. Address
C. Locator
D. Flip-Flop
E. None of the above
Saturday, December 15, 2012
26 GATE Question of the Day – Computer Science
1. What is the complement of the language accepted by the NFA shown below? Assume Σ = {a} and is the
empty string
A) ∅
(B) {ε}
(C) a
(D) {a, ε}
2. The protocol data unit (PDU) for the application layer in the Internet stack is
(A) Segment
(B) Datagram
(C) Message
(D) Frame
3. A process executes the code
Fork ();
Fork ();
Fork ();
The total number of child processes created is
(A) 3
(B) 4
(C) 7
(D) 8
4. The decimal value 0.5 in IEEE single precision floating point representation has
(A) Fraction bits of 000…000 and exponent value of 0
(B) Fraction bits of 000…000 and exponents value of -1
(C) Fraction bits of 000…000 and exponents value of -1
(D) No exact representation
5. The worst case running time to search for an element in a balanced in a binary search tree with v2”
elements is
(A) Θ(n log n)
(B) Θ (n2n)
(C) Θ (n)
(D) Θ (log n)
All the Best!!!
empty string
A) ∅
(B) {ε}
(C) a
(D) {a, ε}
2. The protocol data unit (PDU) for the application layer in the Internet stack is
(A) Segment
(B) Datagram
(C) Message
(D) Frame
3. A process executes the code
Fork ();
Fork ();
Fork ();
The total number of child processes created is
(A) 3
(B) 4
(C) 7
(D) 8
4. The decimal value 0.5 in IEEE single precision floating point representation has
(A) Fraction bits of 000…000 and exponent value of 0
(B) Fraction bits of 000…000 and exponents value of -1
(C) Fraction bits of 000…000 and exponents value of -1
(D) No exact representation
5. The worst case running time to search for an element in a balanced in a binary search tree with v2”
elements is
(A) Θ(n log n)
(B) Θ (n2n)
(C) Θ (n)
(D) Θ (log n)
All the Best!!!
Friday, December 14, 2012
Thursday, December 13, 2012
25 GATE Question Of The Day – Electromagnetics
The modes in a rectangular waveguide are denoted by TEmn/TMmn where
m and n are the eigen numbers along the larger and smaller dimensions
of the waveguide respectively. Which one of the following statements is
TRUE?
(A) The TM10 mode of the wave does not exist
(B) The TE10 mode of the wave does not exist
(C) The TM10 and the TE10 modes both exist and have the same cut-off
frequencies
(D) The TM10 and TM10 modes both exist and have the same cut-off frequencies
Tuesday, December 11, 2012
23 GATE Question Of The Day – Digital Electronics
Two identical NMOS transistors M1 and M2 are connected as shown below. Vbias is chosen so that both transistors are in saturation. The equivalent gm of the pair is defined to be
at constant Vout.

The equivalent gm‘s of the pair is
(A) The sum of individual gm‘s of the transistors
(B) The product of individual gm‘s of the transistors
(C) Nearly equal to the gm of M1
(D) Nearly equal to gm /g0 of M2
Sunday, December 9, 2012
Friday, December 7, 2012
Wednesday, December 5, 2012
20 GATE Question Of The Day – Digital Electronics
For the circuit shown in the figure, D has a transition from 0 to 1 after CLK changes from 1 to 0. Assume gate delays to be negligible

Which of the following statements is true?
(A) Q goes to 1 at the CLK transition and stays at 1
(B) Q goes to 0 at the CLK transition and stays at 0
(C) Q goes to 1 at the CLK transition and goes to 0 when D goes to 1
(D) Q goes to 0 at the CLK transition and goes to 1 when D goes to 1
Pick up the correct options guys just a simple thing for my well wished friend(s)!
Monday, December 3, 2012
Saturday, December 1, 2012
Subscribe to:
Posts (Atom)