GATE CSE topic:computing PYQs & Answers — Page 19

Questions 181–190 of 975. Imported answers require independent review unless marked reviewed.

Which of the following statement(s) is/are TRUE for any binary search tree (BST) having

distinct integers?

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

The maximum length of a path from the root node to any other node is

An inorder traversal will always produce a sorted sequence of elements.

Finding an element takes

time in the worst case.

Every BST is also a Min-Heap.

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

Processes

arrive in that order at times 0, 1, 2, and 8 milliseconds respectively, and have execution times of 10, 13, 6, and 9 milliseconds respectively. Shortest Remaining Time First (SRTF) algorithm is used as the CPU scheduling policy. Ignore context switching times.

Which ONE of the following correctly gives the average turnaround time of the four processes in milliseconds?

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

A partial data path of a processor is given in the figure, where RA, RB, and RZ are 32-bit registers. Which option(s) is/are CORRECT related to arithmetic operations using the data path as shown?

Diagram for Computer Science and Information Technology question 27

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

The data path can implement arithmetic operations involving two registers.

The data path can implement arithmetic operations involving one register and one immediate value.

The data path can implement arithmetic operations involving two immediate values.

The data path can only implement arithmetic operations involving one register and one immediate value.

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

An audit of a banking transactions system has found that on an earlier occasion, two joint holders of account

attempted simultaneous transfers of Rs. 1000 each from account

to account

. Both transactions read the same value, Rs. 1000, as the initial balance in

and were allowed to go through.

was credited Rs. 1000 twice.

was debited only once and ended up with a balance of Rs. 1000.

Which of the following properties is/are certain to have been violated by the system?

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

Atomicity

Consistency

Isolation

Durability

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

A regular language

is accepted by a non-deterministic finite automaton (NFA) with

states. Which of the following statement(s) is/are FALSE?

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

may have an accepting NFA with

states.

may have an accepting DFA with

states.

There exists a DFA with

states that accepts

Every DFA that accepts

has

states.

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 is/are part of an Instruction Set Architecture of a processor?

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

The size of the cache memory

The clock frequency of the processor

The number of cache memory levels

The total number of registers

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

Suppose in a multiprogramming environment, the following C program segment is executed. A process goes into I/O queue whenever an I/O related operation is performed. Assume that there will always be a context switch whenever a process requests for an I/O, and also whenever the process returns from an I/O. The number of times the process will enter the ready queue during its life time (not counting the time the process enters the ready queue when it is run initially) is ______. (Answer in integer)

int main()

{

int x=0,i=0;

scanf("%d",&x);

for(i=0; i<20; i++)

{

x = x+20;

printf("%d\n",x);

}

return 0;

}

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 regarding Breadth First Search (BFS) and Depth First Search (DFS) on an undirected simple graph G is/are TRUE?

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

A DFS tree of

is a Shortest Path tree of

Every non-tree edge of

with respect to a DFS tree is a forward/back edge.

is a non-tree edge of

with respect to a BFS tree, then the distances from the source vertex

and

in the BFS tree are within

of each other.

Both BFS and DFS can be used to find the connected components of

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

Let

be the set of all ternary strings defined over the alphabet

. Consider all strings in

that contain at least one occurrence of two consecutive symbols, that is, “aa”, “bb” or “cc”. The number of such strings of length 5 that are possible is ______. (Answer in integer)

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

Consider the two lists List I and List II given below:

List I	List II
(i) Context free languages	(a) Closed under union
(ii) Recursive languages	(b) Not closed under complementation
(iii) Regular languages	(c) Closed under intersection

For matching of items in List I with those in List II, which of the following option(s) is/are CORRECT?

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

(i) – (a), (ii) – (b), and (iii) – (c)

(i) – (b), (ii) – (a), and (iii) – (c)

(i) – (b), (ii) – (c), and (iii) – (a)

(i) – (a), (ii) – (c), and (iii) – (b)

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

GATE CSE topic:computing PYQs

Question 26

Question 26

Question 27

Question 27

Question 28

Question 28

Question 29

Question 29

Question 30

Question 30