Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into

Gate Question Papers:

Gate Select Another Category Select Another Topic

Exam

Gate Question Topics

Category (172)

General Ability (20)

General Knowledge(5)

HR Interview (166)

Interview(7)

Logical Reasoning (36)

Numerical Ability (131)

Programming (13)

Verbal Ability (13)

Advertisements

Previous Question: A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero(the lowest priority). The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero? Option (A) This algorithm is equivalent to the first-come-first-serve algorithm. (B) This algorithm is equivalent to the round-robin algorithm. (C) This algorithm is equivalent to the shortest-job-first algorithm. (D) This algorithm is equivalent to the shortest-remaining-time-first algorithm. Next Question: The smallest integer than can be represented by an 8-bit number in 2's complement form is Option (A) -256 (B) -128 (C) -127 (D) 0

(#M40029624) GATE question GATE - CS Keep an EYE

Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes?

Option
(A) O(1)
(B) O(log n)
(C) O(n)
(D) O(n log n): Asked In Gate Rats (10 years ago); Unsolved; Is this Puzzle helpful? (5) (1) Submit Your Solution

Dimple

India

Punjab

Time: 00:01:33

Points

Maths Quotes

Can you do Division? Divide a loaf by a knife - what's the answer to that?

Lewis Carroll, Through the Looking Glass

without maths no can't live in this world

k ravikumar

Placed User Comments

M4Math helped me a lot.

Vipul Chavan 3 years ago

Thanks m4 maths for helping to get placed in several companies.
I must recommend this website for placement preparations.

yash mittal 4 years ago

Latest Gate Aptitude Question SOLUTION: Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes? Option (A) O(1) (B) O(log

Gate Question Papers:

Exam

Gate Question Topics

Category (172)

General Ability (20)

HR Interview (166)

Logical Reasoning (36)

Numerical Ability (131)

Programming (13)

Verbal Ability (13)

(#M40029624) GATE question GATE - CS Keep an EYE

Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes?

Option
(A) O(1)
(B) O(log n)
(C) O(n)
(D) O(n log n)

Sponsored Links

Challenger of the Day

Maths Quotes

Placed User Comments

Site Links

Useful Info

Placement papers

Latest Gate Aptitude Question SOLUTION: Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes? Option (A) O(1) (B) O(log

Gate Question Papers:

Exam

Gate Question Topics

Category (172)

General Ability (20)

HR Interview (166)

Logical Reasoning (36)

Numerical Ability (131)

Programming (13)

Verbal Ability (13)

(#M40029624) GATE question GATE - CS Keep an EYE

Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes? Option (A) O(1) (B) O(log n) (C) O(n) (D) O(n log n)

Sponsored Links

Challenger of the Day

Maths Quotes

Placed User Comments

Site Links

Useful Info

Placement papers

Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes?

Option
(A) O(1)
(B) O(log n)
(C) O(n)
(D) O(n log n)