GATE CSE format:mcq PYQs & Answers — Page 21

Questions 201–210 of 534. Imported answers require independent review unless marked reviewed.

The Lucas sequence

is defined by the recurrence relation:

with

and

Which one of the options given is TRUE?

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

Which one of the options given below refers to the degree (or arity) of a relation in relational database systems?

Your answerChoose one option.

Number of attributes of its relation schema.

Number of tuples stored in the relation.

Number of entries in the relation.

Number of distinct domains of its relation schema.

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

Suppose two hosts are connected by a point-to-point link and they are configured to use Stop-and-Wait protocol for reliable data transfer. Identify in which one of the following scenarios, the utilization of the link is the lowest.

Your answerChoose one option.

Longer link length and lower transmission rate

Longer link length and higher transmission rate

Shorter link length and lower transmission rate

Shorter link length and higher transmission rate

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

Let

and

Let

and

denote the determinants of the matrices

and

, respectively.

Which one of the options given below is TRUE?

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

Consider the following definition of a lexical token id for an identifier in a programming language, using extended regular expressions:

letter

[A–Za–z] digit

[0–9] id

letter (letter

digit)

Which one of the following Non-deterministic Finite-state Automata with

-transitions accepts the set of valid identifiers? (A double-circle denotes a final state)

Your answerChoose one option.

Diagram for Computer Science and Information Technology question 19

Diagram for Computer Science and Information Technology question 19 (figure 2)

Diagram for Computer Science and Information Technology question 19 (figure 3)

Diagram for Computer Science and Information Technology question 19 (figure 4)

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

An algorithm has to store several keys generated by an adversary in a hash table. The adversary is malicious who tries to maximize the number of collisions. Let

be the number of keys,

be the number of slots in the hash table, and

Which one of the following is the best hashing strategy to counteract the adversary?

Your answerChoose one option.

Division method, i.e., use the hash function

Multiplication method, i.e., use the hash function

, where

is a carefully chosen constant.

Universal hashing method.

is a prime number, use Division method. Otherwise, use Multiplication method.

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

The output of a 2-input multiplexer is connected back to one of its inputs as shown in the figure.

Diagram for Computer Science and Information Technology question 21

Match the functional equivalence of this circuit to one of the following options.

Your answerChoose one option.

D Flip-flop

D Latch

Half-adder

Demultiplexer

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

Consider the following program:

int main() int f1() int f2(int x) int f3()

{ { { {

f1(); return(1); f3(); return(5);

f2(2); } if (x==1) }

f3(); return f1();

return(0); else

} return (x*f2(x-1);

}

Which one of the following options represents the activation tree corresponding to the main function?

Your answerChoose one option.

Diagram for Computer Science and Information Technology question 36

Diagram for Computer Science and Information Technology question 36 (figure 2)

Diagram for Computer Science and Information Technology question 36 (figure 3)

Diagram for Computer Science and Information Technology question 36 (figure 4)

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

Consider the control flow graph shown.

Diagram for Computer Science and Information Technology question 37

Which one of the following choices correctly lists the set of live variables at the exit point of each basic block?

Your answerChoose one option.

B1: , B2: , B3: , B4:

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

Consider the two functions inc and dec shown below.

inc(){ dec(){

wait(s); wait(s);

X = X+1; X = X-1;

signal(s); signal(s);

} }

There are 5 threads each invoking inc once, and 3 threads each invoking dec once, on the same shared variable X. The initial value of X is 10.

Suppose there are two implementations of the semaphore s, as follows:

I-1: s is a binary semaphore initialized to 1.

I-2: s is a counting semaphore initialized to 2.

Let V1, V2 be the values of X at the end of execution of all the threads with implementations I-1, I-2, respectively.

Which one of the following choices corresponds to the minimum possible values of V1, V2, respectively?

Your answerChoose one option.

15, 7

7, 7

12, 7

12, 8

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

GATE CSE format:mcq PYQs

Question 15

Question 16

Question 17

Question 18

Question 19

Question 20

Question 21

Question 36

Question 37

Question 38