GATE CSE kind:question PYQs & Answers — Page 49

Home
GATE
Computer Science and Information Technology
Topics
kind:question

Questions 481–490 of 975. Imported answers require independent review unless marked reviewed.

Topic practice 975 questionsPage 49 of 98

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

Consider a relation

with the following three functional dependencies.

The number of superkeys in the relation R is ____________.

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

The number of arrangements of six identical balls in three identical bins is _____.

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

A cache memory that has a hit rate of 0.8 has an access latency 10 ns and miss penalty 100 ns. An optimization is done on the cache to reduce the miss rate. However, the optimization results in an increase of cache access latency to 15 ns, whereas the miss penalty is not affected. The minimum hit rate (rounded off to two decimal places) needed after the optimization such that it should not increase the average memory access time is ____________.

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

The value of the following limit is ____________.

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

Consider the resolution of the domain name

by a DNS resolver. Assume that no resource records are cached anywhere across the DNS servers and that iterative query mechanism is used in the resolution. The number of DNS query-response pairs involved in completely resolving the domain name is____________.

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

GATE CSE kind:question PYQs

Question 26

Question 27

Question 28

Question 29

Question 30

Question 31

Question 32

Question 33

Question 34

Question 35