Algorithms-Notions of Space and Time Complexity (GATE Computer Science): Questions 1 - 5 of 5

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: 1

» Algorithms » Notions of Space and Time Complexity

MCQ▾

Question

Which of the following is useful in implementation quick sort?

Choices

Choice (4) Response

a.

Queue

b.

List

c.

Stack

d.

Question does not provide sufficient data or is vague

Question number: 2

» Algorithms » Notions of Space and Time Complexity

MCQ▾

Question

Stack is useful for implementing

Choices

Choice (4) Response

a.

Depth first search

b.

Breadth first search

c.

Radix sort

d.

None of the above

Question number: 3

» Algorithms » Notions of Space and Time Complexity

MCQ▾

Question

An algorithm must have the which properties-

Choices

Choice (4) Response

a.

Input & output

b.

Effectiveness

c.

Finiteness & definiteness

d.

All a. , b. and c. are correct

Question number: 4

» Algorithms » Notions of Space and Time Complexity

MCQ▾

Question

The list of coded instructions is called -

Choices

Choice (4) Response

a.

Utility programs

b.

Computer program

c.

Algorithm

d.

Question does not provide sufficient data or is vague

Question number: 5

» Algorithms » Notions of Space and Time Complexity

MCQ▾

Question

Which sorting algorithm also known as partition exchange sort

Choices

Choice (4) Response

a.

Selection sort

b.

Quick sort

c.

Merge sort

d.

None of the above

Sign In