# GATE 1996 Question - Mark 1

Total 16 questions

GateQuestions

ALL GATE QUESTIONS SUBJECTWISE

×
## Asymptotic Notations

1 Mark Questions
2 Marks Questions
5 Marks Questions

## Divide and Conquer

1 Mark Questions
2 Marks Questions
5 Marks Questions

## Greedy Method

1 Mark Questions
2 Marks Questions
5 Marks Questions

## Dymnamic

Programming

1 Mark Questions
2 Marks Questions
5 Marks Questions

## P and NP Concepts

1 Mark Questions
2 Marks Questions

Programming

Total 16 questions

×
## Correct Option is :

## Explanation

B

Option (a):

100nlogn = O(nlogn) = O(nlogn/100)(As 100 is a constant so multiplication or division does not change the order).

This is True.

Option (b):

?logn = log^{1/2}n = 1/2(logn) = O(logn)

Which is not O(loglogn).So,this is True.

Option (c):

0 < x < y

Let x = 3, y = 5

n^{3} = O(n^{5}) = lower = O(higher)

This is True.

Option (d):

2^{n} != O(n^{k})

Here,2^{n} is higher growth rate function than n^{k}.So,This option is True.

×
## Send Error Report:

Divide & Conquer

Greedy Method

Dynamic Programming

P & NP Concepts

GateQuestions.Com is For Serve The Gate Questions For GATE Students at Free Of Cost..
While using this site, you agree to have read and accepted our terms of use,
cookie and privacy policy.
Copyright 2015 - 2018 by GATEQuestions.Com All Rights Reserved.

## Connect with Us: