# Questions by LavTheRawkstar

1
T(n)=5 T ($\frac{n}{2}$+16) + n2 please tell the solution as i m getting confused
2
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
3
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.
4
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.
5
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
6
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.
7
Please show the steps how to differentiate u function equation and obtain this answer after differentating .please tell totally confused.
8
9
10
1 vote
11
What is the ascending wise order of sorting algorithms which takes least time and least space to sort the elements?
12
if an array has 1000 elements which sorting to be used ?
13
How many address lines are needed to address each memory locations in a 2048 x 4 memory chip
14
First Figure ......... Also tell in the second figure ?
15
T(n) = T$(\frac{n}{3})$ + T$(\frac{2n}{3})$ + O(n)
1 vote
16
T(n) =3T($n^{_{3}^{1}}$) + log 3n
Solve the Recurrence using Iteration Method T(n)=3$(\frac{n}{4})$ + n