GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

673.

Fill in the blanks in the following template of an algorithm to compute all pairs shortest path lengths in a directed graph G with n*n adjacency matrix A. A[i,j]equals if there is an edge in G from i to j, and 0 otherwise. Your aim in filling in the blanks is to ensure that the algorithm is correct.
INITIALIZATION:
For i = 1 … n
{For j = 1 … n
{ if A[i,j]=0 then P[i,j] = _______ else P[i,j] =____;}
ALGORITHM:
For i = 1 …n
{ For j = 1 …n
{For k = 1 …n
{P[__,___]=min{_______,_______};}
}
}
(a) Copy the complete line containing the blanks in the Initialization step and fill in the blanks.
(b) Copy the complete line containing the blanks in the Algorithm step and fill in the blanks.
(c) Fill in the blank: The running time of the Algorithm is O(____).
[5 marks]

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]
674.

The following recursive function in C is a solution to the Towers of Hanoi problem.
Void move (int n, char A, char B, char C)
{
if (………………………………….) {
move (………………………………….);
printf(“Move disk %d from pole %c to pole %c\n”, n, A,C);
move (………………………………….);
Fill in the dotted parts of the solution.
[5 marks]

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]
675.

In a C program, an array is declared as float A[2048]. Each array element is 4
Bytes in size, and the starting address of the array is 0×00000000. This program is run on a computer that has a direct mapped data cache of size 8 Kbytes, with block (line) size of 16 Bytes.
(a) Which elements of the array conflict with element A[0] in the data cache?
Justify your answer briefly.
(b) If the program accesses the elements of this array one by one in reverse order i.e., starting with the last element and ending with the first element, how many data cache misses would occur? Justify your answer briefly. Assume that the data cache is initially empty and that no other data or instruction accesses are to be considered.
[5 marks]

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]
676.

Consider the following 32-bit floating-point representation scheme as shown in the formal below. A value is specified by 3 fields, a one bit sign field (with 0 for positive and 1 for negative values), a 24 bit fraction field (with the binary point being at the left end of the fraction bits), and a 7 bit exponent field (in excess-64 signed integer representation, with 16 being the base of exponentiation). The sign bit is the most significant bit.

(a) It is required to represent the decimal value –7.5 as a normalized floating point number in the given format. Derive the values of the various fields. Express your final answer in the hexadecimal.
(b) What is the largest values that can be represented using this format? Express your answer as the nearest power of 10.
[5 marks]

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]
677.

(a) Express the function f (x,y, z) = xy' + yz' with only one complement operation and one or more AND/OR operations. Draw the logic circuit implementing the expression obtained, using a single NOT gate and one or more AND/OR gates.
(b) Transform the following logic circuit (without expressing its switching function) into an equivalent logic circuit that employs only 6 NAND gates each with 2-inputs.

[5 marks]

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]
678.

Draw all binary trees having exactly three nodes labeled A, B and C on which Preorder traversal gives the sequence C,B,A. [5 marks]

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]

801 1 ...‹‹111 112113 114 115 ›› ... 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