search
Log In

Recent activity by LavTheRawkstar

1 answer
1
1 answer
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)
answered Nov 17, 2018 in DS 1.2k views
0 answers
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
asked Oct 31, 2018 in CO and Architecture 92 views
0 answers
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.
asked Sep 10, 2018 in Algorithms 220 views
0 answers
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.
asked Sep 10, 2018 in Algorithms 188 views
0 answers
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
asked Sep 10, 2018 in Algorithms 66 views
1 answer
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.
asked Sep 9, 2018 in Algorithms 215 views
0 answers
8
Please show the steps how to differentiate u function equation and obtain this answer after differentating .please tell totally confused.
asked Feb 21, 2018 in Calculus 120 views
1 answer
9
2 answers
14
How many address lines are needed to address each memory locations in a 2048 x 4 memory chip
commented Sep 6, 2017 in CO and Architecture 1.8k views
1 answer
15
2 answers
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.
commented May 9, 2017 in Computer Networks 459 views
8 answers
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$
commented May 7, 2017 in Algorithms 6.7k views
2 answers
20
How to get complexity of recurrence: $T(n) = \sqrt{n} .T(\sqrt{n}) + n$
commented May 7, 2017 in Algorithms 238 views
2 answers
21
4 answers
22
0 answers
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
commented May 3, 2017 in Databases 1.1k views
0 answers
26
...