GATE CSE 2021 Paper 1 — page 9

Questions 25–27 of 65. Imported answers require review unless explicitly marked reviewed.

Consider a linear list based directory implementation in a file system. Each directory is a list of nodes, where each node contains the file name along with the file metadata, such as the list of pointer to the data blocks. Consider a given directory foo. Which of the following operations will necessarily require a full scan of foo for successful completion?

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

Creation of a new file in foo

Deletion of an existing file from foo

Renaming of an existing file in foo

Opening of an existing file in foo

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

In an undirected connected planar graph

, there are eight vertices and five faces. The number of edges in

is ________.

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

Consider the following undirected graph with edge weights as shown:

Diagram for Computer Science and Information Technology question 17

The number of minimum-weight spanning trees of the graph is ________.

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

2021 · Paper 1

Question 15

Question 16

Question 17