# Recent activity by LavTheRawkstar

1
T(n)=5 T ($\frac{n}{2}$+16) + n2 please tell the solution as i m getting confused
2
Given a binary tree with n nodes and assuming size(x) denotes the number of nodes in the subtree rooted at the node x,how long does it take,in the worst case to compute size(x) for every node x of the tree? Choose the tightest upper bound. A-O(height) B-O(n) C-O(nlogn) D-O(n^2)
3
Design a binary multiply pipeline unit for two 4 bit operands.Use minimum number of CSA's and CPA's.Show all interconnections and bus width in the schematic diagram.Calculate the output of each CSA and CPA for A=11111111 and B=11111111
4
What is Binomial tree please explain in easy words. Construct the Binomial heap for the following sequence of numbers 7,2,4,17,1,11,6,8,15,10,20. Also apply the operation of extracting the minimum key in the resulting binomial Heap.
5
Find all the possible solution for sum of subset problem for the instance m=35 and S=<1,2,5,7,8,10,15,20,25> using Backtracking. I am totally confused hence please provide me the solution for it.
6
Please Derive the Relation in between degree and the height of n keys B Tree. Insert the following information into an Empty B Tree with Degree t=3. F,S,Q,K,C,L,H,T,V,W,M,R,N,P,A,B,X,Y,D,Z,E
7
Sort The Following Sequence of input using Heap sort. { 10 , 2 , 1 , 5, 3 ,8 ,11,24 ,7 } Please show the output at every pass because i am getting confused.
8
Please show the steps how to differentiate u function equation and obtain this answer after differentating .please tell totally confused.
9
What is the ascending wise order of sorting algorithms which takes least time and least space to sort the elements?
10
11
12
13
if an array has 1000 elements which sorting to be used ?
14
How many address lines are needed to address each memory locations in a 2048 x 4 memory chip
15
First Figure ......... Also tell in the second figure ?
16
Consider a celluar system having 2023 duplex channels to cover 1925 sq km and each cell area is 5 sq km for 7 cell reuse system.Compute system capacity.
17
T(n) =3T($n^{_{3}^{1}}$) + log 3n
18
T(n) = T$(\frac{n}{3})$ + T$(\frac{2n}{3})$ + O(n)
19
The recurrence relation that arises in relation with the complexity of binary search is: $T(n) = 2T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$ $T(n) = T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$ $T(n) = T\left(\frac{n}{2}\right)+\log n$ $T(n) = T\left(\frac{n}{2}\right)+n$
20
How to get complexity of recurrence: $T(n) = \sqrt{n} .T(\sqrt{n}) + n$
21
Solve the Recurrence using Iteration Method T(n)=3$(\frac{n}{4})$ + n
22
T(n) = 100 T (n/99) + log(n!) Answer is T(n) = θ (n log n) a)answer is justified b)answer is not justified c)cannot be determined d)none
23
what is the difference between Vertical and Horizontal fragmentations. If Data objects replicas are stored at multiple number of sites, Explain how the lock will be acquired by a transaction on data objects
24
What is the difference between dynamic programming and divide and conquer technique,