GATE CSE topic:computing PYQs & Answers — Page 88

Questions 871–880 of 975. Imported answers require independent review unless marked reviewed.

A circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly two external pointers FRONT and REAR pointing to the front node and the rear node of the queue, respectively. Which of the following statements is/are CORRECT for such a circular queue, so that insertion and deletion operations can be performed in

time?

I. Next pointer of front node points to the rear node. II. Next pointer of rear node points to the front node.

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

Consider a TCP client and a TCP server running on two different machines. After completing data transfer, the TCP client calls close to terminate the connection and a FIN segment is sent to the TCP server. Server-side TCP responds by sending an ACK, which is received by the client-side TCP. As per the TCP connection state diagram (RFC 793), in which state does the client-side TCP connection wait for the FIN from the server-side TCP?

Your answerChoose one option.

LAST-ACK

TIME-WAIT

FIN-WAIT-1

FIN-WAIT-2

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

Consider the following function implemented in C:

void printxy(int x, int y) {

int *ptr;

x = 0;

ptr = &x;

y = *ptr;

*ptr = 1;

printf("%d,%d", x, y);

}

The output of invoking printxy(1,1) is

Your answerChoose one option.

0,0

0,1

1,0

1,1

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

A sender S sends a message m to receiver R, which is digitally signed by S with its private key. In this scenario, one or more of the following security violations can take place.

(I) S can launch a birthday attack to replace m with a fraudulent message. (II) A third party attacker can launch a birthday attack to replace m with a fraudulent message. (III) R can launch a birthday attack to replace m with a fraudulent message.

Which of the following are possible security violations?

Your answerChoose one option.

(I) and (II) only

(I) only

(II) only

(II) and (III) only

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

The Breadth First Search (BFS) algorithm has been implemented using the queue data structure. Which one of the following is a possible order of visiting the nodes in the graph below?

Diagram for Computer Science and Information Technology question 15

Your answerChoose one option.

MNOPQR

NQMPOR

QMNROP

OQNMR

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

The following functional dependencies hold true for the relational schema R:

V → W VW → X Y → VX Y → Z

Which of the following is irreducible equivalent for this set of functional dependencies?

Your answerChoose one option.

V → W V → X Y → V Y → Z

V → W W → X Y → V Y → Z

V → W V → X Y → V Y → X Y → Z

V → W W → X Y → V Y → X Y → Z

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

Identify the language generated by the following grammar, where S is the start variable.

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

P → xQRS Q → yZ | z R → w | ε S → y

What is FOLLOW(Q)?

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

An ER model of a database consists of entity types A and B. These are connected by a relationship R which does not have its own attribute. Under which one of the following conditions, can the relational table for R be merged with that of A?

Your answerChoose one option.

Relationship R is one-to-many and the participation of A in R is total.

Relationship R is one-to-many and the participation of A in R is partial.

Relationship R is many-to-one and the participation of A in R is total.

Relationship R is many-to-one and the participation of A in R is partial.

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

Threads of a process share

Your answerChoose one option.

global variables but not heap.

heap but not global variables.

neither global variables nor heap.

both heap and global variables.

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 13

Question 14

Question 14

Question 15

Question 15

Question 16

Question 16

Question 17

Question 17

Question 18