GATE Computer Science: Questions 261 - 268 of 913

Get 1 year subscription: Access detailed explanations (illustrated with images and videos) to 913 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. View Sample Explanation or View Features.

Rs. 450.00 or

Question number: 261

» Information Systems and Software Engineering » Data Flow Diagrams

MCQ▾

Question

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

Choices

Choice (4) Response

a.

ICNP

b.

ARP

c.

RARP

d.

ICMP

Question number: 262

» Operating System » Concurrency

MCQ▾

Question

The________ of the transactions determines the serializability order.

Choices

Choice (4) Response

a.

Serial schedule

b.

schedule

c.

Timestamps

d.

None of the above

Question number: 263

» Operating System » Deadlock

MCQ▾

Question

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

Choices

Choice (4) Response

a.

banker’s algorithm

b.

Process

c.

banker

d.

None of the above

Question number: 264

» Algorithms » Searching

MCQ▾

Question

Searching is divided how many categories

Choices

Choice (4) Response

a.

Three

b.

Two

c.

Four

d.

All of the above

Question number: 265

» Algorithms » Dynamic Programming

MCQ▾

Question

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

Choices

Choice (4) Response

a.

O (| V| ^3)

b.

O (| V| ^4)

c.

O (| v| ^2)

d.

Question does not provide sufficient data or is vague

Question number: 266

» Algorithms » Tree and Graph Traversals

MCQ▾

Question

A search technique where we keep expanding nodes with least accumulated cost so for is called-

Choices

Choice (4) Response

a.

Best first

b.

Divide and conquer

c.

Branch and bound

d.

None of the above

Question number: 267

» Algorithms » Dynamic Programming

MCQ▾

Question

What is the minimum number edge in a connected cycle graph on ________ vertices?

Choices

Choice (4) Response

a.

n

b.

n + 1

c.

n-1

d.

None of the above

Question number: 268

» Algorithms » Greedy Approach

MCQ▾

Question

Building a spanning tree by finding at each step the minimal edge adjacent to a partial sub tree is an Instance of ________ algorithms

Choices

Choice (4) Response

a.

brute-force

b.

Divide and conquer

c.

Greedy

d.

dynamic-programming

Sign In