(A) may
(B) may be not
(C) will
(D) none
Author:
For n = 1, 000, 000, if plane-sweep takes 1 second, the bruteforce will take about __.
(A) 14 hours
(B) 14 minutes
(C) 14 second
(D) none
The runtime of entire plane-sweep algorithm is O(n log n)__.
(A) True
(B) False
(C) NA
(D) NA
Plane-sweep Algorithm, the inner while-loop __ execute more than n times over the entire course of the algorithm.
(A) can
(B) cannot
(C) NA
(D) NA
Sorting takes __ time.
(A) O(n)
(B) O(n^2)
(C) O(n log n)
(D) none
Preliminary version of IP was called __.
(A) IP – New Generation (IPng)
(B) IP – Next Generation (IPng)
(C) IP – Net Generation (IPng)
(D) None of the given
OSPF does’nt allows a router to introduce routes learned from another means?
(A) True
(B) False
(C) NA
(D) NA
__ is a current version of BGP.
(A) 2
(B) 3
(C) 4
(D) None of these