GATE Computer Science: Questions 331 - 337 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: 331

» Operating System » File Systems

MCQ▾

Question

The page table contains the ________ of each page in physical memory

Choices

Choice (4) Response

a.

Base address

b.

memory

c.

Virtual memory

d.

All of the above

Question number: 332

» Algorithms » Searching

MCQ▾

Question

A hash function f defined as f (key) =key mod 7 with linear probing, insert the key 37, 38, 72, 48, 98, 11, 56 into a table indexed from 11 will be stored in the location-

Choices

Choice (4) Response

a.

5

b.

3

c.

6

d.

9

Question number: 333

» Algorithms » Greedy Approach

MCQ▾

Question

The Kruskal, Prim, and Dijkstra algorithms have what approach to algorithm design in common?

Choices

Choice (4) Response

a.

Divide and conquer

b.

Greedy

c.

Brute force

d.

Dynamic programming

Question number: 334

» Information Systems and Software Engineering » Information Gathering

MCQ▾

Question

Which operation is not performed by computer?

Choices

Choice (4) Response

a.

Inputting

b.

Understanding

c.

Processing

d.

Controlling

Question number: 335

» Operating System » File Systems

MCQ▾

Question

A file is a collection of related ________

Choices

Choice (4) Response

a.

Information

b.

Data

c.

Database

d.

All of the above

Question number: 336

» Operating System » Concurrency

MCQ▾

Question

When a collection of instructions (or operations) that performs a single logical function is called a ________.

Choices

Choice (4) Response

a.

section

b.

Transaction

c.

Execution

d.

All of the above

Question number: 337

» Algorithms » Dynamic Programming

MCQ▾

Question

what is a complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing n vertices and m edge if the edge are sorted is-

Choices

Choice (4) Response

a.

0 (m + n)

b.

0 (m)

c.

0 (n)

d.

All of the above

Sign In