GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

19.

Consider an instruction pipeline with four stages (S1, S2, S3 and S4) each with combinational circuit only. The pipeline registers are required between each stage and at the end of the last stage. Delays for the stages and for the pipeline registers are as given in the figure.

What is the approximate speed up of the pipeline in steady state under ideal conditions when compared to the corresponding non-pipeline implementation? [2 marks]
(A) 4.0
(B) 2.5
(C) 1.1
(D) 3.0

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

View Comments [3 Reply]
20.

Definition of a language L with alphabet {a} is given as following
L = {a^nk | k>0 and n is the positive integer constant}
What is the minimum number of states needed in a DFA to recognize L?
[2 marks]
(A) k + 1
(B) n + 1
(C) 2ⁿ⁺¹
(D) 2^k+1

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

View Comments [4 Reply]
21.

An 8KB direct-mapped write-bank 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 meta-data (tags) for the cache? [2 marks]
(A) 4864 bits
(B) 6144 bits
(C) 6656 bits
(D) 5376 bits

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

View Comments [1 Reply]
22.

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 10 ms. Rotational speed of disk is 6000 rpm. 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.)
[2 marks]
(A) 0.50 s
(B) 1.50 s
(C) 1.25 s
(D) 1.00 s

asked in Computer Science And Engineering, 2011

View Comments [0 Reply]
23.

A deterministic finite automata (DFA) D with alphabet ∑{a,b} is given below

Which of the following finite state machines is a valid minimal DFA which accepts the same language as D?[2 marks]

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

View Comments [5 Reply]
24.

The following is the comment written for a C function.
/* This function computes the roots of a quadratic equation ax²+bx+c. The function stores two real roots in *root1 and *root2 and returns the status of validity of roots. It handles for different kinds of cases.
(i) When coefficient a is zero irrespective of discriminant
(ii) When discriminant is positive
(iii)When discriminant is zero
(iv)When discriminant is negative
Only in case (ii) and (iii), the stored roots are valid. Otherwise 0 is stored in the roots. The function returns 0 when the roots are valid and 1 otherwise.
The function also ensures root1 >= root2.
int get_QuadRoots (float a, float b, float c, float *root1, float *root2); */

A software test engineer is assigned the job of doing black box testing. He comes up with the following test cases, many of which are redundant.

Which one of the following options provide the set of non-redundant tests using equivalence class partitioning approach from input perspective for black box testing?
[2 marks]
(A) T1, T2, T3, T6
(B) T1, T3, T4, T5
(C) T2, T4, T5, T6
(D) T2, T3, T4, T5

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

View Comments [1 Reply]

801 1 ...‹‹2 34 5 6 ›› ... 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