GATE CSE topic:computing PYQs & Answers — Page 82

Questions 811–820 of 975. Imported answers require independent review unless marked reviewed.

Consider the following C program:

#include <stdio.h>

int counter = 0;

int calc (int a, int b) {

int c;

counter++;

if (b==3) return (a*a*a);

else {

c = calc(a, b/3);

return (c*c*c);

}

int main () {

calc(4, 81);

printf("%d", counter);

}

The output of this program is ____.

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

Consider the sequential circuit shown in the figure, where both flip-flops used are positive edge-triggered D flip-flops.

Diagram for Computer Science and Information Technology question 22

The number of states in the state transition diagram of this circuit that have a transition back to the same state on some value of “in” is ____.

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

A 32-bit wide main memory unit with a capacity of 1 GB is built using 256 M × 4-bit DRAM chips. The number of rows of memory cells in the DRAM chip is

. The time taken to perform one refresh operation is 50 nanoseconds. The refresh period is 2 milliseconds. The percentage (rounded to the closest integer) of the time available for performing the memory read/write operations in the main memory unit is ________.

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

Consider a system with 3 processes that share 4 instances of the same resource type. Each process can request a maximum of K instances. Resource instances can be requested and released only one at a time. The largest value of K that will always avoid deadlock is ____.

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

Consider a long-lived TCP session with an end-to-end bandwidth of 1 Gbps (=

bits-per-second). The session starts with a sequence number of 1234. The minimum time (in seconds, rounded to the closest integer) before this sequence number can be used again is ________.

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

Consider a matrix P whose only eigenvectors are the multiples of

Consider the following statements.

(I) P does not have an inverse (II) P has a repeated eigenvalue (III) P cannot be diagonalized

Which one of the following options is correct?

Your answerChoose one option.

Only I and III are necessarily true

Only II is necessarily true

Only I and II are necessarily true

Only II and III are necessarily true

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

Let N be the set of natural numbers. Consider the following sets. P: Set of Rational numbers (positive and negative) Q: Set of functions from to N R: Set of functions from N to S: Set of finite subsets of N. Which of the sets above are countable?

Your answerChoose one option.

Q and S only

P and S only

P and R only

P, Q and S only

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

Consider the first-order logic sentence

where

is a quantifier-free first-order logic formula using only predicate symbols, and possibly equality, but no function symbols. Suppose

has a model with a universe containing 7 elements. Which one of the following statements is necessarily true?

Your answerChoose one option.

There exists at least one model of

with universe of size less than or equal to 3.

There exists no model of

with universe of size less than or equal to 3.

There exists no model of

with universe of size greater than 7.

Every model of

has a universe of size equal to 7.

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 program:

#include<stdio.h>

void fun1(char *s1, char *s2){

char *tmp;

tmp = s1;

s1 = s2;

s2 = tmp;

}

void fun2(char **s1, char **s2){

char *tmp;

tmp = *s1;

*s1 = *s2;

*s2 = tmp;

}

int main(){

char *str1 = "Hi", *str2 = "Bye";

fun1(str1, str2); printf("%s %s", str1, str2);

fun2(&str1, &str2); printf("%s %s", str1, str2);

return 0;

}

The output of the program above is

Your answerChoose one option.

Hi Bye Bye Hi

Hi Bye Hi Bye

Bye Hi Hi Bye

Bye Hi Bye Hi

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

Let G be a simple undirected graph. Let T_D be a depth first search tree of G. Let T_B be a breadth first search tree of G. Consider the following statements. (I) No edge of G is a cross edge with respect to T_D. (A cross edge in G is between two nodes neither of which is an ancestor of the other in T_D.) (II) For every edge (u,v) of G, if u is at depth i and v is at depth j in T_B, then

. Which of the statements above must necessarily be true?

Your answerChoose one option.

I only

II only

Both I and II

Neither I nor II

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 21

Question 22

Question 23

Question 24

Question 25

Question 26

Question 27

Question 28

Question 29

Question 30