Computer Science and Information Technology
GATE CSE topic:computing PYQs
Build your understanding with focused practice from past exam papers.
Questions 761–770 of 975. Imported answers require independent review unless marked reviewed.
Question 36
Open questionCSMCQ2 marksNeeds review
Consider the following grammar and the semantic actions to support the inherited type declaration attributes. Let
,
,
,
,
, and
be the placeholders for the non-terminals D, T, L or
in the following table:Production rule | Semantic action |
|---|---|
D → T L | .type = .type |
T → int | T.type = int |
T → float | T.type = float |
L → , id | .type = .type; addType(id.entry, .type) |
L → id | addType(id.entry, .type) |
Which one of the following are the appropriate choices for
,
,
and
?Your answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 37
Open questionCSMCQ2 marksNeeds review
There are
unsorted arrays:
. Assume that
is odd. Each of
contains
distinct elements. There are no common elements between any two arrays. The worst-case time complexity of computing the median of the medians of
isYour answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 38
Open questionCSMCQ2 marksNeeds review
Let
be any connected, weighted, undirected graph.
I.
has a unique minimum spanning tree, if no two edges of
have the same weight.
II.
has a unique minimum spanning tree, if, for every cut of
, there is a unique minimum-weight edge crossing the cut.
Which of the above two statements is/are TRUE?Your answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 39
Open questionCSMCQ2 marksNeeds review
Consider the following snapshot of a system running
concurrent processes. Process
is holding
instances of a resource R,
. Assume that all instances of R are currently in use. Further, for all
, process
can place a request for at most
additional instances of R while holding the
instances it already has. Of the
processes, there are exactly two processes
and
such that
. Which one of the following conditions guarantees that no other process apart from
and
can complete execution?Your answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 40
Open questionCSMCQ2 marksNeeds review
Consider the following statements:
I. The smallest element in a max-heap is always at a leaf node
II. The second largest element in a max-heap is always a child of the root node
III. A max-heap can be constructed from a binary search tree in
time
IV. A binary search tree can be constructed from a max-heap in
time
Which of the above statements are TRUE?Your answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 41
Open questionCSNAT2 marksNeeds review
Consider the following for four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below:
Process | P1 | P2 | P3 | P4 |
|---|---|---|---|---|
Arrival time | 0 | 1 | 3 | 4 |
CPU burst time | 3 | 1 | 3 | Z |
These processes are run on a single processor using preemptive Shortest Remaining Time First scheduling algorithm. If the average waiting time of the processes is 1 millisecond, then the value of Z is ________.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 42
Open questionCSNAT2 marksNeeds review
The index node (inode) of a Unix-like file system has 12 direct, one single-indirect and one double-indirect pointers. The disk block size is 4 kB, and the disk block address is 32-bits long. The maximum possible file size is (rounded off to 1 decimal place) ______ GB.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 43
Open questionCSNAT2 marksNeeds review
Consider the augmented grammar given below:
S' → •S
S → ⟨L⟩ | id
L → L,S | S
Let I₀ = CLOSURE ({[S' → •S]}). The number of items in the set GOTO (I₀, ⟨) is: ________.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 44
Open questionCSNAT2 marksNeeds review
Consider the following matrix:
The absolute value of the product of Eigen values of R is ________.Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 45
Open questionCSNAT2 marksNeeds review
A certain processor deploys a single-level cache. The cache block size is 8 words and the word size is 4 bytes. The memory system uses a 60-MHz clock. To service a cache miss, the memory controller first takes 1 cycle to accept the starting address of the block, it then takes 3 cycles to fetch all the eight words of the block, and finally transmits the words of the requested block at the rate of 1 word per cycle. The maximum bandwidth for the memory system when the program running on the processor issues a series of read operations is ________ × 10⁶ bytes/sec.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer