GATE (Graduate Aptitude Test in Engineering) Computer Science & IT (CS): Questions 221 - 227 of 3196

Choose Programs:

🎓 Study Material (1190 Notes): 2024-2025 Syllabus

Rs. 1000.00 -OR-

3 Year Validity (Multiple Devices)

Topic-wise Notes & SampleDetails

🎯 302 Numeric, 2894 MCQs (& PYQs) with Full Explanations (2024-2025 Exam)

Rs. 650.00 -OR-

3 Year Validity (Multiple Devices)

CoverageDetailsSample Explanation

Help me Choose & Register (Watch Video) Already Subscribed?

Question 221

Question MCQ▾

A schedule in which each transaction is executed atomically is called a ________.

Choices

Choice (4)Response

a.

Parallel schedule

b.

Combine schedule

c.

Serial schedule

d.

Question does not provide sufficient data or is vague

Edit

Question 222

Question MCQ▾

SJF stands for

Choices

Choice (4)Response

a.

shortest-job-found

b.

shortest-job-first

c.

smallest-job-first

d.

None of the above

Edit

Question 223

Question MCQ▾

If you want to locate the hardware address of a local device, which protocol would you use?

Choices

Choice (4)Response

a.

RARP

b.

ARP

c.

ICMP

d.

ICNP

Edit

Question 224

Question MCQ▾

The________ of the transactions determines the serializability order.

Choices

Choice (4)Response

a.

schedule

b.

Timestamps

c.

Serial schedule

d.

All of the above

Edit

Question 225

Question MCQ▾

The deadlock avoidance algorithm is less efficient than the resource-allocation graph scheme that is called ________.

Choices

Choice (4)Response

a.

banker

b.

Process

c.

Banker՚s algorithm

d.

None of the above

Edit

Question 226

Question MCQ▾

What is a complexity of dynamic programming-based Floyd-Warshall algorithm?

Choices

Choice (4)Response

a.

O (| V |4)

b.

O (| V |3)

c.

O (| V|2)

d.

None of the above

Edit

Question 227

Question MCQ▾

SAN stands for ________

Choices

Choice (4)Response

a.

strong- network

b.

storage-area network

c.

storage-all network

d.

Question does not provide sufficient data or is vague

Edit