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)

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)
by

1 Answer

Answer :

(3) O(n log log n) 
by

Related questions

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)

Description : 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)

Last Answer : (D) O(logn log logn)

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

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) 

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

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

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 )

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) 

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

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 

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

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 

Consider the formula in image processing RD = 1 - (1/CR) Where CR = n1/n2 CR is called as compression ratio n1 and n2 denotes the number of information carrying units in two datasets that represent the same information. In this situation RD is called as relative ................ of the first data set. (A) Data Compression (B) Data Redundancy (C) Data Relation (D) Data Representation

Description : Consider the formula in image processing RD = 1 - (1/CR) Where CR = n1/n2 CR is called as compression ratio n1 and n2 denotes the number of information carrying units in two datasets that represent ... . (A) Data Compression (B) Data Redundancy (C) Data Relation (D) Data Representation

Last Answer : (B) Data Redundancy

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)

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)

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)

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) 

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)

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)

Which of the following arguments are not valid? (a) “If Gora gets the job and works hard, then he will be promoted. If Gora gets promotion, then he will be happy. He will not be happy, therefore, either he will not get the job or he will not work hard”. (b) “Either Puneet is not guilty or Pankaj is telling the truth. Pankaj is not telling the truth, therefore, Puneet is not guilty”. (c) If n is a real number such that n>1, then n2>1. Suppose that n2>1, then n>1. Codes: (A) (a) and (c) (B) (b) and (c) (C) (a), (b) and (c) (D) (a) and (b)

Description : Which of the following arguments are not valid? (a) If Gora gets the job and works hard, then he will be promoted. If Gora gets promotion, then he will be happy. He will not be happy, therefore, either he will not get the job or he ... and (c) (B) (b) and (c) (C) (a), (b) and (c) (D) (a) and (b)

Last Answer : Answer: B Explanation: (a) P: Gora gets the job  Q: Gora works hard  R: Gora gets promotion  S: Gora will be happy The argument can bet written as  (P˄Q)→R  R→S  ¬S ... also be written as: ((P˅Q)˄¬P)→Q where P, and Q are propositions expressed in some formal system.

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

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

The assumed yield line pattern is to be correct when the lower bound solution ---------the upper bound solution [ A ] May be greater than [ B ] May be less than [ C ] Will coincide with [ D ] Must be less than

Description : The assumed yield line pattern is to be correct when the lower bound solution ---------the upper bound solution [ A ] May be greater than [ B ] May be less than [ C ] Will coincide with [ D ] Must be less than

Last Answer : [ C ] Will coincide with

Yield line theory results in [ A ] Elastic solution [ B ] Lower bound solution [ C ] Upper bound solution [ D ] Unique solution

Description : Yield line theory results in [ A ] Elastic solution [ B ] Lower bound solution [ C ] Upper bound solution [ D ] Unique solution

Last Answer : [ B ] Lower bound solution

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

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

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

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

Which of the following is used to determine the specificity of requirements ? (A) n1/n2 (B) n2/n1 (C) n1+n2 (D) n1–n2 Where n1 is the number of requirements for which all reviewers have identical interpretations, n2 is number of requirements in a specification.

Description : Which of the following is used to determine the specificity of requirements ? (A) n1/n2 (B) n2/n1 (C) n1+n2 (D) n1–n2 Where n1 is the number of requirements for which all reviewers have identical interpretations, n2 is number of requirements in a specification.

Last Answer : (A) n1/n2 

The traveling salesman problem involves n cities with paths connecting the cities. The time taken for traversing through all the cities, without knowing in advance the length of a minimum tour, is ___________ a) O(n) b) O(n2) c) O(n!) d) O(n/2)

Description : The traveling salesman problem involves n cities with paths connecting the cities. The time taken for traversing through all the cities, without knowing in advance the length of a minimum tour, is ___________ a) O(n) b) O(n2) c) O(n!) d) O(n/2)

Last Answer : c) O(n!)

Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper righthand corner at (3,7). Consider the following three lines for clipping with the given end point co-ordinates: Line AB: A(-6,2) and B(-1,8) Line CD: C(-1,5) and D(4,8) Line EF: E(-2,3) and F(1,2) Which of the following line(s) is/are candidate for clipping? (A) AB (B) CD (C) EF (D) AB and CD

Description : Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper righthand corner at (3,7). ... s) is/are candidate for clipping? (A) AB (B) CD (C) EF (D) AB and CD

Last Answer : (D) AB and CD

Suppose ORACLE relation R(A, B) currently has tuples {(1, 2), (1, 3), (3, 4)} and relation S(B, C) currently has {(2, 5), (4, 6), (7, 8)}. Consider the following two SQL queries SQ1 and SQ2 : SQ1 : Select * From R Full Join S On R.B=S.B; SQ2 : Select * From R Inner Join S On R.B=S.B; The numbers of tuples in the result of the SQL query SQ1 and the SQL query SQ2 are given by : (A) 2 and 6 respectively (B) 6 and 2 respectively (C) 2 and 4 respectively (D) 4 and 2 respectively

Description : Suppose ORACLE relation R(A, B) currently has tuples {(1, 2), (1, 3), (3, 4)} and relation S(B, C) currently has {(2, 5), (4, 6), (7, 8)}. Consider the following two SQL queries SQ1 and SQ2 ... (A) 2 and 6 respectively (B) 6 and 2 respectively (C) 2 and 4 respectively (D) 4 and 2 respectively

Last Answer : (D) 4 and 2 respectively

A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies: F={AD→E, BE→F, B→C, AF→G} Which of the following is a candidate key? (A) A (B) AB (C) ABC (D) ABD

Description : A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies: F={AD→E, BE→F, B→C, AF→G} Which of the following is a candidate key? (A) A (B) AB (C) ABC (D) ABD

Last Answer : Answer: D

Which of the following statements is true for Branch-and-Bound search? (A) Underestimates of remaining distance may cause deviation from optimal path. (B) Overestimates can’t cause right path to be overlooked. (C) Dynamic programming principle can be used to discard redundant partial paths. (D) All of the above

Description : Which of the following statements is true for Branch-and-Bound search? (A) Underestimates of remaining distance may cause deviation from optimal path. (B) Overestimates can't cause right path to be ... Dynamic programming principle can be used to discard redundant partial paths. (D) All of the above

Last Answer : (C) Dynamic programming principle can be used to discard redundant partial paths.

The travelling salesman problem can be solved in: (A) Polynomial time using dynamic programming algorithm (B) Polynomial time using branch-and-bound algorithm (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm. (D) Polynomial time using backtracking algorithm.

Description : The travelling salesman problem can be solved in: (A) Polynomial time using dynamic programming algorithm (B) Polynomial time using branch-and-bound algorithm (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm. (D) Polynomial time using backtracking algorithm.

Last Answer : (C) Exponential time using dynamic programming algorithm or branch-andbound algorithm.

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'

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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 )

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

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

Last Answer : a. Tw

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

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

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 units and decides next process to be scheduled. If the process have no I/O operations and all arrive at time zero, then the scheduler implements .............. criteria. (A) Priority scheduling (B) Round Robin Scheduling (C) Shortest Job First (D) FCFS

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

Do you know anyone who had covid and was completely asymptotic?

Description : Do you know anyone who had covid and was completely asymptotic?

Last Answer : JLeslie: I have been extremely skeptical this entire time that there are asymptomatic cases. I know dozens of people who have tested positive despite being asymptomatic - including my two kids. The ... been completely asymptomatic, and many adults as well. What is it you're so skeptical about?

Asymptotic conditions is reached, when for a fluid flowing in laminar flow through a long tube (A) Exit-fluid temperature > wall temperature (B) Exit fluid temperature < wall temperature (C) Exit fluid temperature = wall temperature (D) Graetz number > 100

Description : Asymptotic conditions is reached, when for a fluid flowing in laminar flow through a long tube (A) Exit-fluid temperature > wall temperature (B) Exit fluid temperature < wall temperature (C) Exit fluid temperature = wall temperature (D) Graetz number > 100

Last Answer : (C) Exit fluid temperature = wall temperature

Heat exchangers operating, when the asymptotic range is reached, (A) Provide very large heat transfer co-efficient (B) Results in making part of the heating surface inactive (C) Results in abruptly increased velocity (D) None of these

Description : Heat exchangers operating, when the asymptotic range is reached, (A) Provide very large heat transfer co-efficient (B) Results in making part of the heating surface inactive (C) Results in abruptly increased velocity (D) None of these

Last Answer : (B) Results in making part of the heating surface inactive

Temperature profile in steady state heat transfer is (A) Asymptotic (B) Hyperbolic (C) Parabolic (D) Linear

Description : Temperature profile in steady state heat transfer is (A) Asymptotic (B) Hyperbolic (C) Parabolic (D) Linear

Last Answer : (D) Linear

Asymptotic stability is connected with: (a) A system under influence of input. (b)A system not under influence of input. (c) A system under influence of input. (d)A system not under influence out.

Description : Asymptotic stability is connected with: (a) A system under influence of input. (b)A system not under influence of input. (c) A system under influence of input. (d)A system not under influence out.

Last Answer : (b)A system not under influence of input.

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

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

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)

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)

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))

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))

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)

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