GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

697.

Consider the following algorithm for searching for a given number x in an unsorted array A[l..n] having n distinct values:
1. Choose an i uniformly at random from l..nl
2. If A[i]=x then Stop else Goto 1;
Assuming that x is present A, what is the expected number of comparisons made by the algorithm before it terminates? [2 marks]
(a) n
(b) n - 1
(c) 2n
(d) n/2

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

View Comments [1 Reply]
698.

The number of leaf nodes in a rooted tree of n nodes, with each node having 0 or 3 children is: [2 marks]
(a) n/2
(b) (n-1)/3
(c) (n-1)/2
(d) (2n+1)/3

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

View Comments [1 Reply]
699.

Consider the following declaration of a two-dimensional array in C:
char a[100][100];
Assuming that the main memory is byte-addressable and that the array is stored starting from memory address 0, the address of a [40][50] is [2 marks]
(a) 4040
(b) 4050
(c) 5040
(d) 5050

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]
700.

Horizontal microprogramming [2 marks]
(a) does not require use of signal decoders
(b) results in larger sized microinstructions than vertical microprogramming
(c) uses one bit for each control signal
(d) all of the above

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]
701.

The performance of a pipelined processor suffers if [2 marks]
(a) the pipeline stages have different delays
(b) consecutive instructions are dependent on each other
(c) the pipeline stages share hardware resources
(d) All of the above

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]
702.

The finite state machine described by the following state diagram with A as starting state, where an arc label is x/y and x stands for 1-bit input and y stands for 2-bit output

[2 marks]
(a) Outputs the sum of the present and the previous bits of the input.
(b) Outputs 01 whenever the input sequence contains 11
(c) Outputs 00 whenever the input sequence contains 10
(d) None of the above

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]

801 1 ...‹‹115 116117 118 119 ›› ... 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