GATE CSE 2022 Paper 1 — page 13

Questions 37–39 of 65. Imported answers require review unless explicitly marked reviewed.

Consider a simple undirected unweighted graph with at least three vertices. If

is the adjacency matrix of the graph, then the number of 3-cycles in the graph is given by the trace of

Your answerChoose one option.

divided by 2

divided by 3

divided by 6

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 following statements is FALSE?

Your answerChoose one option.

The TLB performs an associative search in parallel on all its valid entries using page number of incoming virtual address.

If the virtual address of a word given by CPU has a TLB hit, but the subsequent search for the word results in a cache miss, then the word will always be present in the main memory.

The memory access time using a given inverted page table is always same for all incoming virtual addresses.

In a system that uses hashed page tables, if two distinct virtual addresses V1 and V2 map to the same value while hashing, then the memory access time of these addresses will not be the same.

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

Let

and

denote read and write operations on a data element

by a transaction

, respectively. Consider the schedule

with four transactions.

Which one of the following serial schedules is conflict equivalent to

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

2022 · Paper 1

Question 37

Question 38

Question 39