Description : If input frequency of a full wave rectifier be n, then output frequency would be - (1) n/2 (2) n (3) 3n/2 (4) 2n
Last Answer : (4) 2n Explanation: The frequency of a full-wave rectifier is double that of the input, if the input is a sine wave. A full-wave rectifier converts the whole of the input waveform to one ... both polarities of the input waveform to DC (direct current), and yields a higher mean output voltage.
Description : Overlap in a leaf spring is (a) L/n (b) L/2n (c) L/3n (d) None
Last Answer : (b) L/2n
Description : The number of comparisons done by sequential search is ……………… A) (N/2)+1 B) (N+1)/2 C) (N-1)/2 D) (N+2)/2
Last Answer : B) (N+1)/2
Description : What is 2n times 3n?
Last Answer : 6n²example if n=5(2x5) x (3x5) = 10 x 15 = 1506 x 5² = 6 x 25 = 150
Description : A concentric spring consists of 2 sprigs of diameter 10mm and 4mm. The net force acting on the composite spring is 5000N. Find the force acting on each of the two springs. (a) 1232.2N and 3767.8N (b) 786.4N and 4213.6N (c) 689.7N and 4310.3N (d) 645.3N and 4354.7N
Last Answer : (c) 689.7N and 4310.3N
Description : In a fully connected mesh network with n devices, there are ................ physical channels to link all devices. (A) n(n–1)/2 (B) n(n+1)/2 (C) 2n (D) 2n+1
Last Answer : (A) n(n–1)/2
Description : A full binary tree with n leaves contains (A) n nodes (B) log2 n nodes (C) 2n –1 nodes (D) 2n nodes
Last Answer : (C) 2n –1 nodes
Description : If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n ≤ m, the expected number of collisions involving a particular key K is (A) less than 1 (B) less than lg n (C) greater than 1 (D) greater than lg n
Last Answer : (A) less than 1
Description : Which of the following is asymptotically smaller? (A) lg(lg*n) (B) lg*(lg n) (C) lg(n!) (D) lg*(n!)
Last Answer : (A) lg(lg*n)
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 : Given two sorted list of size 'm' and 'n' respectively. The number of comparison needed in the worst case by the merge sort algorithm will be (A) m x n (B) max (m, n) (C) min (m, n) (D) m + n – 1
Last Answer : (D) m + n – 1
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 : If `X""=""{4^n-3n-1"":""n in N}""a n d""Y""=""{9(n-1)"": n in N}` , where N is the set of natural numbers, then `XuuY` is equal to (1) N (2) Y - X (3)
Last Answer : If `X""=""{4^n-3n-1"":""n in N}""a n d""Y""=""{9(n-1)"": n in N}` , where N is the set of natural numbers ... 3) X (4) Y A. `X` B. `Y` C. `N` D. `Y-X`
Description : State true or false. i) comparisons precede logical operations in java ii) assignment operations succeed increment operations iii) arithmetic operations succeed comparisons iv) x precede + A) i-true, ii-true, iii-false, ... false, ii-true, iii-false, iv-false D) i-true, ii-false, iii-false, iv-true
Last Answer : A) i-true, ii-true, iii-false, iv-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 : 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 : In the case of parallelization, Amdahl's law states that if P is the proportion of a program that can be made parallel and (1-P) is the proportion that cannot be parallelized, then the maximum speed-up that can be achieved by using N processors is ... ((N-1)P+P) (C) 1/((1-P)+P/N) (D) 1/(P+(1-P)/N)
Last Answer : (C) 1/((1-P)+P/N)
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)
Description : Which of the following algorithms has lowest worst case time complexity? a) Insertion sort b) Selection sort c) Quick sort d) Heap sort
Last Answer : d) Heap sort
Description : A Multicomputer with 256 CPUs is organized as 16x16 grid. What is the worst case delay (in hops) that a message might have to take? (A) 16 (B) 15 (C) 32 (D) 30
Last Answer : (D) 30
Description : Out of 3n consecutive natural numbers 3 natural numbers are chosen at random without replacement. -Maths 9th
Last Answer : (c) \(rac{3n^2-3n+2}{(3n-1)(3n-2)}\)In 3n consecutive natural numbers, (i) n numbers are of the form 3p (ii) n numbers are of the form 3p + 1 (iii) n numbers are of the form 3p + 2 For the ... ) We can select one number from each set.∴ Favourable number of cases = nC3 + nC3 + nC3 + (nC1 nC1 nC1)
Description : If `A=(x : x=4n+1,nle5,n in N}` and `B={3n : n le 8, n in N}`, then find `(A-(A-B))`.
Last Answer : If `A=(x : x=4n+1,nle5,n in N}` and `B={3n : n le 8, n in N}`, then find `(A-(A-B))`.
Description : If 5M=3N, then M:N is____
Last Answer : If 5M=3N, then M:N is____
Description : Prove using mathematical induction that for all n≥1. 1+4+7+....+(3n-2)=n(3n-1)÷2
Last Answer : Prove using mathematical induction that for all n≥1. 1+4+7+....+(3n-2)=n(3n-1)÷2
Description : What is -3n plus n 2?
Last Answer : Unfortunately, the browser used for posting questions is hopelessly inadequate for mathematics: it strips away most symbols. We cannot see what operator comes before the last 2. It makes little sense for me to try and guess - I may as well make up my own questions and answer them!
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 : Consider the following ER diagram: The minimum number of tables required to represent M, N, P, R1, R2 is (A) 2 (B) 3 (C) 4 (D) 5
Last Answer : (A) 2
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 : At which of the following stage(s), the degeneracy do not occur in transportation problem? (m, n represents number of sources and destinations respectively) (a) While the values of dual variables ui and vj cannot be computed. (b) While ... and (d) (3) (a) and (d) (4) (a), (b), (c) and (d)
Last Answer : (3) (a) and (d)
Description : Let M and N be two entities in an E-R diagram with simple single vale attributes. R1 and R2 are two relationship between M and N, whereas R1 is one-to-many and R2 is many-to-many. The minimum number of tables required to ... and R2 in the relational model are .......... (1) 4 (2) 6 (3) 7 (4) 3
Last Answer : Answer: 4
Description : A bag contains 2n + 1 coins. It is known that n of these coins have a head on both sides, whereas the remaining (n + 1) coins are fair. -Maths 9th
Last Answer : (a) 10As (n + 1) coins are fair P (Tossing a tail) = \(rac{rac{n+1}{2}}{2n+1}\) = \(rac{n+1}{2(2n+1)}\)∴ P (Tossing a head) = 1 - \(rac{n+1}{2(2n+1)}\) = \(rac{4n+2-n-1}{2(2n+1)}\) = \(rac{3n+1}{4n+2}\)Given, \(rac{3n+1}{4n+2}\) = \(rac{31}{42}\)⇒ 126n + 42 = 124n + 62 ⇒ 2n = 20 ⇒ n = 10.
Description : Consider a 32 - bit microprocessor, with a 16 - bit external data bus, driven by an 8 MHz input clock. Assume that the microprocessor has a bus cycle whose minimum duration equals four input clock cycles. What ... (A) 8x106 bytes/sec (B) 4x106 bytes/sec (C) 16x106 bytes/sec (D) 4x109 bytes/sec
Last Answer : (B) 4x106 bytes/sec
Description : The degree of the Bezier curve with n control points is a.n + 1 b.n - 1 c.n d.2n
Last Answer : a.n + 1
Description : In the third system of pulleys, if there are n number of pulleys then the velocity ratio of the system will be a.2n - 2 b.n c.107 dynes d.2n-1 e.2n
Last Answer : d. 2n-1
Description : A framed structure is perfect if it contains members equal to a.n - 3 b.2n - 3 c.2n - 2 d.n - 2 e.2n - 1
Last Answer : b. 2n - 3
Description : find the value of n in the equation 6.2n – 3.7n = 85 + 45. -General Knowledge
Last Answer : 6.2n - 3.7n = 85 + 45; 2.5n = 130; n = 130/2.5; n = 52
Description : If (log x)/(l + m - 2n) = (log y)/(m + n - 2l) = (log z)/(n + l - 2m), then xyz is equal to : -Maths 9th
Last Answer : Let l+m−2nlogx=m+n−2llogy=n+l−2mlogz=k(say) So, we get logx=k(l+m−2n) ....... (i) logy=k(m+n−2l) ....... (ii) logz=k(n+l−2m) ....... (iii) ∴logx+logy+logz=k(l+m−2n)+k(m+n−2l)+k(n+l−2m) ⇒logx+logy+logz=kl+km−2kn+km+kn−2kl+kn+kl−2km ⇒log(xyz)=0 ⇒logxyz=log1 ⇒xyz=1
Last Answer : (b) 1Let \(rac{ ext{log}\,x}{l+m-2n}\) = \(rac{ ext{log}\,y}{m+n-2l}\) = \(rac{ ext{log}\,z}{n+l-2m}\) = k. Thenlog x = k(l + m – 2n), log y = k(m + n – 2l); log z = k(n + l – 2m) ⇒ log x + log y + log z = k(l + m – 2n) + k(m + n – 2l) + k(n + l – 2m)⇒ log(xyz) = 0 ⇒ log(xyz) = log 1 ⇒ xyz = 1.
Description : If C(2n, 3) : C(n, 2) = 12 : 1 find n. -Maths 9th
Last Answer : answer:
Description : Prove that 2.4.6 ........... (2n) < (n + 1)^n. -Maths 9th
Description : If ((n+1)/2)^n ((2n+1)/3)^n > (n!)^k, then k = -Maths 9th
Description : Let ABCD be a parallellogram. Let m and n be positive integers such that n < m < 2n. Let AC = 2 mn -Maths 9th
Description : Simplify : `p^(n+1)xxp^(2n+1)xxp^(3-n)`
Last Answer : Simplify : `p^(n+1)xxp^(2n+1)xxp^(3-n)`
Description : The hydrocarbon having the general formula C n H 2n is
Last Answer : alkene.
Description : Hydrocarbons having the general formula C n H 2n+2 are called
Last Answer : alkanes.
Description : Give the general name of the class of compounds having the general formula C n H 2n-2 . Write the first member of this homologous series.
Last Answer : Alkynes. The first member is Ethyne.
Description : The general formula of a homologous series of carbon compounds is C n H 2n . Write the molecular formula of the second and fourth member of the series.
Last Answer : Second member is n=3, C 3 H 2x3 = C 3 H 6 Fourth member is n=5, C 5 H 2x5 = C 5 H 10
Description : Write the molecular formulae of the third and fifth member of homologous series of carbon compounds represented by the general formula C n H 2n+2
Last Answer : Third member n = 3, C 3 H 2x3+2 = C 3 H 8 Fifth member n = 5, C 5 H 2x5+2 = C 5 H 12
Description : What is the possible number of optical isomers for a compound containing n dissimilar asymmetric carbon atoms? (a) n2 (b) 2n (c) n + 1 (d) n + 2
Last Answer : 2n
Description : If E, N, K and 1/m are modulus of elasticity, modulus of rigidity. Bulk modulus and Poisson ratio of the material, the following relationship holds good (A) E = 3K (1 - 2/m) (B) E = 2N (1 + 1/m) (C) (3/2)K (1 - 2/m) = N (1 + 1/m) (D) All the above
Last Answer : (D) All the above