GATE CSE topic:computing PYQs & Answers — Page 71

Home
GATE
Computer Science and Information Technology
Topics
topic:computing

Questions 701–710 of 975. Imported answers require independent review unless marked reviewed.

Topic practice 975 questionsPage 71 of 98

In a balanced binary search tree with

elements, what is the worst case time complexity of reporting all elements in range

? Assume that the number of reported elements is

Your answerChoose one option.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is ________.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider a non-pipelined processor operating at 2.5 GHz. It takes 5 clock cycles to complete an instruction. You are going to make a 5-stage pipeline out of this processor. Overheads associated with pipelining force you to operate the pipeline processor at 2 GHz. In a given program, assume that 30% are memory instructions, 60% are ALU instructions and the rest are branch instructions. 5% of the memory instructions cause stalls of 50 clock cycles each due to cache misses and 50% of the branch instructions cause stalls of 2 cycles each. Assume that there are no stalls associated with the execution of ALU instructions. For this program, the speedup achieved by the pipelined processor over the non-pipelined processor (round off to 2 decimal places) is ______.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

A processor has 64 registers and uses 16-bit instruction format. It has two types of instructions: I-type and R-type. Each I-type instruction contains an opcode, a register name, and a 4-bit immediate value. Each R-type instruction contains an opcode and two register names. If there are 8 distinct I-type opcodes, then the maximum number of distinct R-type opcodes is ______.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

For

, let

be a non-zero vector. Suppose that

is chosen uniformly at random from

. Then, the probability that

is an odd number is ______.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider the following C functions.

int fun1(int n) {

static int i = 0;

if (n > 0) {

++i;

fun1(n-1);

}

return (i);

}

int fun2(int n) {

static int i = 0;

if (n > 0) {

i = i + fun1(n);

fun2(n-1);

}

return (i);

}

The return value of fun2(5) is ______.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider the array representation of a binary min-heap containing 1023 elements. The minimum number of comparisons required to find the maximum in the heap is ______.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider the following C functions.

int tob(int b, int* arr) {

int i;

for(i=0; b>0; i++) {

if(b%2) arr[i]=1;

else arr[i]=0;

b = b/2;

}

return(i);

}

int pp(int a, int b) {

int arr[20];

int i, tot = 1, ex, len;

ex = a;

len = tob(b,arr);

for(i=0; i<len; i++) {

if(arr[i]==1)

tot = tot * ex;

ex = ex * ex;

}

return(tot);

}

The value returned by pp(3,4) is ______.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider a graph

where

, and weight of the edge

. The weight of minimum spanning tree of

is ______.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Consider the following set of processes, assumed to have arrived at time 0. Consider the CPU scheduling algorithms Shortest Job First (SJF) and Round Robin (RR). For RR, assume that the processes are scheduled in the order

Process
Burst time (in ms)	8	7	2	4

If the time quantum for RR is 4 ms, then the absolute value of the difference between the average turnaround times (in ms) of SJF and RR (round off to 2 decimal places) is ______.

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

GATE CSE topic:computing PYQs

Question 41

Question 42

Question 43

Question 44

Question 45

Question 46

Question 47

Question 48

Question 49

Question 50