GATE CSE year:2022 PYQs & Answers — Page 3

Questions 21–30 of 65. Imported answers require independent review unless marked reviewed.

What is printed by the following ANSI C program?

#include<stdio.h>

int main(int argc, char *argv[])

{

int x = 1, z[2] = {10, 11};

int *p = NULL;

p = &x;

*p = 10;

p = &z[1];

*(&z[0] + 1) += 3;

printf("%d, %d, %d\n", x, z[0], z[1]);

return 0;

Your answerChoose one option.

1, 10, 11

1, 10, 14

10, 14, 11

10, 10, 14

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

Consider an enterprise network with two Ethernet segments, a web server and a firewall, connected via three routers as shown below.

Diagram for Computer Science and Information Technology question 22

What is the number of subnets inside the enterprise network?

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 of the following statements is/are TRUE?

Your answerSelect all correct options. You can choose more than one.

Every subset of a recursively enumerable language is recursive.

If a language

and its complement

are both recursively enumerable, then

must be recursive.

Complement of a context-free language must be recursive.

and

are regular, then

is deterministic context-free.

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

Let WB and WT be two set associative cache organizations that use LRU algorithm for cache block replacement. WB is a write back cache and WT is a write through cache. Which of the following statements is/are FALSE?

Your answerSelect all correct options. You can choose more than one.

Each cache block in WB and WT has a dirty bit.

Every write hit in WB leads to a data transfer from cache to main memory.

Eviction of a block from WT will not lead to data transfer from cache to main memory.

A read miss in WB will never lead to eviction of a dirt block from WB.

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

Consider the following three relations in a relational database.

Which of the following relational algebra expressions return the set of eIds who own all the brands?

Your answerSelect all correct options. You can choose more than one.

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

Which of the following statements is/are TRUE with respect to deadlocks?

Your answerSelect all correct options. You can choose more than one.

Circular wait is a necessary condition for the formation of deadlock.

In a system where each resource has more than one instance, a cycle in its wait-for graph indicates the presence of a deadlock.

If the current allocation of resources to processes leads the system to unsafe state, then deadlock will necessarily occur.

In the resource-allocation graph of a system, if every edge is an assignment edge, then the system is not in deadlock state.

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

Which of the following statements is/are TRUE for a group

Your answerSelect all correct options. You can choose more than one.

If for all

, then

is commutative.

If for all

, then

is commutative. Here, 1 is the identity element of

If the order of

is 2, then

is commutative.

is commutative, then a subgroup of

need not be commutative.

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

Suppose a binary search tree with 100 distinct elements is also a complete binary tree. The tree is stored using the array representation of binary heap trees. Assuming that the array indices start with 0, the 3rd largest element of the tree is stored at index ____________.

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

Consider the augmented grammar with

as the set of terminals.

is the set of two LR(0) items

, then

contains exactly __________ items.

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

Consider a simple undirected graph of 10 vertices. If the graph is disconnected, then the maximum number of edges it can have is ____________.

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

GATE CSE year:2022 PYQs

Question 21

Question 22

Question 23

Question 24

Question 25

Question 26

Question 27

Question 28

Question 29

Question 30