Algorithms-Upper and Lower Bounds (GATE Computer Science): Questions 1 - 2 of 2

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 » Upper and Lower Bounds

MCQ▾

Question

________ is a memory-management scheme that permits the physical address space of a process to be noncontiguous.

Choices

Choice (4) Response

a.

Process

b.

Paging

c.

Segment

d.

Question does not provide sufficient data or is vague

Question number: 2

» Algorithms » Upper and Lower Bounds

MCQ▾

Question

The complexity of the average case of an algorithm is

Choices

Choice (4) Response

a.

Much more complicated to analyze than that of worst case

b.

Simple to analyze than that of worst case

c.

Sometimes more complicated and some other times simpler than that of worst case

d.

All of the above

Sign In