Home==>makaut-2007==>Page 6
eduhilfe Latest Questions
f( 1 )=1 f( n )= f(n-1)+ for n > 1 has the complexity O (log n). Define Big-O,
Sayani saha
Asked: March 17, 2021In: MAKAUT
a) queue b) deque c) stack d) tree.
a) identity matrix b) symmetric matrix c) asymmetric matrix d) none of these.
Sayani saha
Asked: March 17, 2021In: MAKAUT
a) successor b) predecessor c) root d) own.
Sayani saha
Asked: March 16, 2021In: MAKAUT
a) balanced factor b) load factor c) item factor d) none of these.
Sayani saha
Asked: March 16, 2021In: MAKAUT
a) articulation point b) sink c) isolated vertex d) root vertex.
a) Sorting records on the basis of multiple keys b) Worst case performances of sorting algorithm c) Sorting alpha numeric keys as they are likely to be the same d) None of these.