GATE CSE topic:information-technology PYQs & Answers — Page 70

Questions 691–700 of 975. Imported answers require independent review unless marked reviewed.

Let

be a weighted, undirected graph and let

be a Minimum Spanning Tree (MST) of

maintained using adjacency lists. Suppose a new weighted edge

is added to

. The worst case time complexity of determining if

is still an MST of the resultant graph is

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

Consider the following languages.

. Which one of the following is TRUE?

Your answerChoose one option.

is regular and

is context-free.

is context-free but not regular and

is context-free.

Neither

nor

is context-free.

is context-free but

is not context-free.

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

Consider the productions A → PQ and A → XY. Each of the five non-terminals A, P, Q, X, and Y has two attributes: s is a synthesized attribute, and i is an inherited attribute. Consider the following rules. Rule 1: P.i = A.i + 2, Q.i = P.i + A.i, and A.s = P.s + Q.s. Rule 2: X.i = A.i + Y.s and Y.i = X.s + A.i. Which one of the following is TRUE?

Your answerChoose one option.

Both Rule 1 and Rule 2 are L-attributed.

Only Rule 1 is L-attributed.

Only Rule 2 is L-attributed.

Neither Rule 1 nor Rule 2 is L-attributed.

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

Each of a set of

processes executes the following code using two semaphores a and b initialized to 1 and 0, respectively. Assume that count is a shared variable initialized to 0 and not used in CODE SECTION P.

Diagram for Computer Science and Information Technology question 34

What does the code achieve?

Your answerChoose one option.

It ensures that no process executes CODE SECTION Q before every process has finished CODE SECTION P.

It ensures that at most two processes are in CODE SECTION Q at any time.

It ensures that all process execute CODE SECTION P mutually exclusively.

It ensures that at most

processes are in CODE SECTION P at any time.

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

Consider the following five disk access requests of the form (request id, cylinder number) that are present in the disk scheduler queue at a given time. (P, 155), (Q, 85), (R, 110), (S, 30), (T, 115) Assume the head is positioned at cylinder 100. The scheduler follows Shortest Seek Time First scheduling to service the requests. Which one of the following statements is FALSE?

Your answerChoose one option.

T is serviced before P.

Q is serviced after S, but before T.

The head reverses its direction of movement between servicing of Q and P.

R is serviced before P.

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

Consider a relational table

that is in 3NF, but not in BCNF. Which one of the following statements is TRUE?

Your answerChoose one option.

has a nontrivial functional dependency

, where

is not a superkey and

is a prime attribute.

has a nontrivial functional dependency

, where

is not a superkey and

is a non-prime attribute and

is not a proper subset of any key.

has a nontrivial functional dependency

, where

is not a superkey and

is a non-prime attribute and

is a proper subset of some key.

A cell in

holds a set instead of an atomic value.

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

Consider a schedule of transactions

and

Diagram for Computer Science and Information Technology question 37

Here, RX stands for “Read(X)” and WX stands for “Write(X)”. Which one of the following schedules is conflict equivalent to the above schedule?

Your answerChoose one option.

Diagram for Computer Science and Information Technology question 37 (figure 2)

Diagram for Computer Science and Information Technology question 37 (figure 3)

Diagram for Computer Science and Information Technology question 37 (figure 4)

Diagram for Computer Science and Information Technology question 37 (figure 5)

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

An organization requires a range of IP addresses to assign one to each of its 1500 computers. The organization has approached an Internet Service Provider (ISP) for this task. The ISP uses CIDR and serves the requests from the available IP address space 202.61.0.0/17. The ISP wants to assign an address space to the organization which will minimize the number of routing entries in the ISP’s router using route aggregation. Which of the following address spaces are potential candidates from which the ISP can allot any one to the organization? I. 202.61.84.0/21 II. 202.61.104.0/21 III. 202.61.64.0/21 IV. 202.61.144.0/21

Your answerChoose one option.

I and II only

II and III only

III and IV only

I and IV only

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 predicate formulae is NOT logically valid? Note that

is a predicate formula without any free occurrence of

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

Let

be a directed, weighted graph with weight function

. For some function

, for each edge

, define

. Which one of the options completes the following sentence so that it is TRUE? “The shortest paths in

under

are shortest paths under

too, ________.”

Your answerChoose one option.

for every

if and only if

is positive

if and only if

is negative

if and only if

is the distance from

in the graph obtained by adding a new vertex

and edges of zero weight from

to every vertex of $G

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

GATE CSE topic:information-technology PYQs

Question 31

Question 32

Question 33

Question 34

Question 35

Question 36

Question 37

Question 38

Question 39

Question 40