# Algorithms-Asymptotic Notation (GATE Computer Science): Questions 1 - 4 of 4

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 » Asymptotic Notation

MCQ▾

### Question

Find the value of T (n) =9T (n/3) +n

### Choices

Choice (4) Response

a.

Θ (n)

b.

Θ (n^2)

c.

Θ (n^3)

d.

None of the above

## Question number: 2

» Algorithms » Asymptotic Notation

MCQ▾

### Question

For the function f (n) =7n + 5. Find out the order of this function in Big theta notation.

### Choices

Choice (4) Response

a.

θ (n^2)

b.

θ (n)

c.

θ (n^3)

d.

All of the above

## Question number: 3

» Algorithms » Asymptotic Notation

MCQ▾

### Question

The master method does not apply to the-

### Choices

Choice (4) Response

a.

Recurrence

b.

Iteration

c.

Substitution method

d.

All of the above

## Question number: 4

» Algorithms » Asymptotic Notation

MCQ▾

### Question

What is the value of T (n) =T (2n/3) +1.

### Choices

Choice (4) Response

a.

Θ (log1)

b.

Θ (logn)

c.

Θ (log2n)

d.

All of the above

f Page