The solution of recurrence relation, T(n) = 2T(floor (√n)) + logn is (A) O(n log log logn) (B) O(n log logn) (C) O(log logn) (D) O(logn log logn)

1 Answer

Answer :

(D) O(logn log logn)

Related questions

Description : The asymptotic upper bound solution of the recurrence relation given by T(n)= 2T(n/2)+n/log n is: (1) O(n2) (2) O(n log n) (3) O(n log log n) (4) O(log log n)

Last Answer : (3) O(n log log n) 

Description : The number of disk pages access in B-tree search, where h is height, n is the number of keys, and t is the minimum degree, is: (A) θ(logn h*t) (B) θ(logt n*h) (C) θ(logh n) (D) θ(logt n)

Last Answer : Answer: D

Description : State True or False. i) Binary search is used for searching in a sorted array. ii) The time complexity of binary search is O(logn). A) True, False B) False, True C) False, False D) True, True

Last Answer : D) True, True

Description : In general, the binary search method needs no more than ……………. comparisons. A) [log2n]-1 B) [logn]+1 C) [log2n] D) [log2n]+1

Last Answer : D) [log2n]+1

Description : For any B-tree of minimum degree t ≥2, every node other than the root must have atleast ............... keys and every node can have at most .............. keys. (A) t-1, 2t+1 (B) t+1, 2t+1 (C) t-1, 2t-1 (D) t+1, 2t-1

Last Answer : (C) t-1, 2t-1 

Description : Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto ............bits of error. (1) t + 1 (2) t (3) t - 2 (4) t/2

Last Answer : (2) t 

Description : For a B-tree of height h and degree t, the total CPU time used to insert a node is (A) O(h log t) (B) O(t log h) (C) O(t2h) (D) O(th)

Last Answer : (D) O(th)

Description : Red-black trees are one of many Search tree schemes that are "balanced” in order to guarantee that basic dynamic-set operations take ............. time in the worst case. (1) O(1) (2) O(log n) (3) O(n) (4) O(n log n)

Last Answer : (2) O(log n) 

Description : According to six-tenths-factor rule, if the cost of a given unit at one capacity is known, then the cost of similar unit with '' times the capacity of the first unit is approximately equal to __________ times the cost of the initial unit. (A) n (B) n0.6 (C) n0.4 (D) √n

Last Answer : (B) n0.6

Description : Big - O estimate for f(x) = (x + 1) log(x2 + 1) + 3x2 is given as (A) O(xlogx) (B) O(x2) (C) O(x3) (D) O(x2logx)

Last Answer : (B) O(x2)

Description : Any decision tree that sorts n elements has height .............. (1) Ω(log n) (2) Ω(n) (3) Ω(n log n) (4) Ω(n2)

Last Answer : (3) Ω(n log n) 

Description : Let R and S be two fuzzy relations defined as: Then, the resulting relation, T, which relates elements of universe x to elements of universe z using max-min composition is given by

Last Answer : Answer: C

Description : ................... comparisons are necessary in the worst case to find both the maximum and minimum of n numbers. (A) 2n-2 (B) n + floor(lg n) - 2 (C) floor(3n/2) - 2 (D) 2 lg n – 2

Last Answer : (C) floor(3n/2) - 2

Description : When the master switch for the winch shown in the illustration is in the 'off' position, and the line & safe switches are closed, which of the listed relays should be energized? EL-0102 A. 'DB' & '2T' B. 'DB' & '4M' C. 'FR-B.O.' & 'LV' D. '1M' & '1A'

Last Answer : Answer: C

Description : Find the equation of normal to the curves `x=t^2, y=2t+1` at point

Last Answer : Find the equation of normal to the curves `x=t^2, y=2t+1` at point

Description : If q(10 - 10e-2t)mc find the current at t 1s?

Last Answer : i=dq/dti=d(10)/dt - d(10e^-2t)/dtd(10)/dt=0i= - d(10e^-2t)/dti=-((0 X e^-2t) +(-2 X 10X e^-2t) ) {by uv methord }i=20e^-2tt=1si=20 e^-2 {e^-2=0.135335 }i=2.707Ans:2.707mA

Description : What is the average life of a radioactive atom having a 'half life period' of T? (A) 1.44 T (B) 0.144 T (C) 14.4 T (D) 2T

Last Answer : (A) 1.44 T

Description : Calculate the emf of a material having a flux linkage of 2t 2 at time t = 1second. a) 2 b) 4 c) 8 d) 16

Last Answer : b) 4

Description : To guarantee correction of upto t errors, the minimum Hamming distance d min in a block code must be ________. a. t+1 b. t−2 c. 2t−1 d. 2t+1

Last Answer : d. 2t+1

Description : Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto _____ bits of error. a. t + 1 b. t c. t - 2 d. t / 2

Last Answer : b. t

Description : A shaft is subjected to bending moment M and a torque T simultaneously. The ratio of the  maximum bending stress to maximum shear stress developed in the shaft, is  (A) M/T (B) T/M (C) 2M/T (D) 2T/M

Last Answer : (C) 2M/T

Description : If is the internal pressure in a thin cylinder of diameter and thickness , the developed hoop stress, is (A) pd/2t (B) pd/4t (C) pd/t (D) 2pd/t

Last Answer : (A) pd/2t

Description : If a shaft is simultaneously subjected to a toque T and a bending moment M, the ratio of maximum bending stress and maximum shearing stress is (A) M/T (B) T/M (C) 2M/T (D) 2T/M

Last Answer : (C) 2M/T

Description : If T and R are tread and rise respectively of a stair, then (A) 2R + T = 60 (B) R + 2T = 60 (C) 2R + T = 30 (D) R + 2T = 30

Last Answer : Answer: Option A

Description : The difference of pressure between the inside and outside of a liquid drop is (A) p = T × r (B) p = T/r (C) p = T/2r (D) p = 2T/r

Last Answer : Answer: Option D

Description : The wavelength is computed by Bertin's formula (where T is the period in seconds). (A) L = (T g (B) L = (T²/2 ) g (C) L = (2T/ ) g (D) L = (2T²/2 ) g

Last Answer : (B) L = (T²/2 )

Description : Longitudinal stress in a cylinder is given by [symbols have their usual meanings]. a) PD/2t b) 2PD/t c) PD/4t d) 4PD/t

Last Answer : c) PD/4t

Description : Tangential stress in a cylinder is given by [symbols have their usual meanings]. a) PD/2t b) 2PD/t c) PD/4t d) 4PD/t

Last Answer : a) PD/2t

Description : Power transmitted by shaft is equal to a. Tw b. T/w c. w/T d. 2T/w

Last Answer : a. Tw

Description : The ratio of maximum bending stress to maximum shear stress on the cross section when a shaft is simultaneously subjected to a torque T and bending moment M, a. T/M b. M/T c. 2T/M d. 2M/T

Last Answer : d. 2M/T

Description : A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates the process priority for every 'T' time ... (A) Priority scheduling (B) Round Robin Scheduling (C) Shortest Job First (D) FCFS

Last Answer : (B) Round Robin Scheduling

Description : A string of linear mass density 0.005 kg/m is stretched by a force F=2t^2 N

Last Answer : A string of linear mass density 0.005 kg/m is stretched by a force F=2t^2 N ( t is in sec) as shown in figure. ... 24.5 m/s C) 32 m/s D) 40 m/s

Description : Assuming there are n keys and each keys is in the range [0, m-1]. The run time of bucket sort is (A) O(n) (B) O(n lgn) (C) O(n lgm) (D) O(n+m)

Last Answer : (D) O(n+m)

Description : Which of the following algorithms sort n integers, having the range 0 to (n2 -1), in ascending order in O(n) time ? (A) Selection sort (B) Bubble sort (C) Radix sort (D) Insertion sort

Last Answer : (C) Radix sort

Description : If there are n integers to sort, each integer has d digits and each digit is in the set {1,2, ..., k}, radix sort can sort the numbers in: (A) O(d n k) (B) O(d nk) (C) O((d+n)k) (D) O(d(n+k))

Last Answer : (D) O(d(n+k))

Description : An ideal sort is an in-place-sort whose additional space requirement is ............... (A) O(log2n) (B) O(nlog2n) (C) O(1) (D) O(n)

Last Answer : Answer: C

Description : The runtime for traversing all the nodes of a binary search tree with n nodes and printing them in an order is (A) O(lg n) (B) O(n lg n) (C) O(n) (D) O(n2 ) 

Last Answer : (C) O(n) 

Description : Which of the following is true for computation time in insertion, deletion and finding maximum and minimum element in a sorted array? (1) Insertion-O(1), Deletion-O(1), Maximum-O(1), Minimum-O(1) (2) Insertion-O(1), ... (1), Minimum-O(1) (4) Insertion-O(n), Deletion-O(n), Maximum-O(n), Minimum-O(n)

Last Answer : Answer: 3

Description : The Servlet Response interface enables a servlet to formulate a response for a client using the method ............... (A) void log(Exception e, String s) (B) void destroy() (C) int getServerPort() (D) void setContextType(String Type)

Last Answer : (D) void setContextType(String Type)

Description : A triangulation of a polygon is a set of T chords that divide the polygon into disjoint triangles. Every triangulation of n-vertex convex polygon has ................ chords and divides the polygon into ............... triangles. (A) n-2, n-1 (B) n-3, n-2 (C) n-1, n (D) n-2, n-2

Last Answer : (B) n-3, n-2

Description : A t-error correcting q-nary linear code must satisfy:  Where M is the number of code words and X is (1) qn (2) qt (3) q-n (4) q-t

Last Answer : (1) qn 

Description : A basic feasible solution to a m-origin, n-destination transportation problem is said to be ................... if the number of positive allocations are less than m + n – 1. (A) degenerate (B) non-degenerate (C) unbounded (D) unbalanced 

Last Answer : (A) degenerate

Description : If h* represents an estimate of the cost of getting from the current node N to the goal node and h represents actual cost of getting from current node to the goal node, then A* algorithm gives an optimal solution ... h* us equal to h (B) h* overestimates h (C) h* underestimates h (D) none of these

Last Answer : (C) h* underestimates h

Description : The rate of ……………. Is always an important factor for management especially in relation to the rate of return A) Cost B) Benefit C) Sales D) Investment

Last Answer : D) Investment

Description : ………………….. operator is basically a join followed by a project on the attributes of first relation. A) Join B) Semi-Join C) Full Join D) Inner Join

Last Answer : B) Semi-Join

Description : Select operator is not a unary operator. ii) Project operator chooses subset of attributes or columns of a relation. A) i-True, ii-False B) i-True, ii-True C) i-False, ii-True D) i-False, ii-False

Last Answer : C) i-False, ii-True

Description : A .................. normal form normalization will be needed where all attributes in a relation tuple are not functionally dependent only on the key attribute. A) First B) Second C) Third D) Fourth

Last Answer : C) Third