Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
LavTheRawkstar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by LavTheRawkstar
1
answer
1
recurrence relation
T(n)=5 T ($\frac{n}{2}$+16) + n2 please tell the solution as i m getting confused
T(n)=5 T ($\frac{n}{2}$+16) + n2please tell the solution as i m getting confused
687
views
commented
Nov 18, 2018
Algorithms
recurrence-relation
algorithms
+
–
1
answer
2
binary tree
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)
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 s...
14.3k
views
answered
Nov 17, 2018
0
answers
3
CO & Architecture - Pipelining
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
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.Calcu...
300
views
asked
Oct 31, 2018
CO and Architecture
co-and-architecture
pipelining
numerical-answers
+
–
0
answers
4
# Binomial tree # Binomial Heap
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.
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 o...
1.4k
views
asked
Sep 9, 2018
Algorithms
algorithms
binary-heap
sorting
data-structures
binomial-tree
b-tree
+
–
0
answers
5
# Backtracking
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.
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 ...
644
views
asked
Sep 9, 2018
Algorithms
algorithms
data-structures
backtracking
+
–
0
answers
6
# B Tree
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
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,...
512
views
asked
Sep 9, 2018
Algorithms
b-tree
data-structures
algorithms
+
–
1
answer
7
# Heap sort
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.
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.
1.0k
views
asked
Sep 9, 2018
Algorithms
algorithms
binary-heap
heap-sort
sorting
+
–
0
answers
8
Differentiation confusion
Please show the steps how to differentiate u function equation and obtain this answer after differentating .please tell totally confused.
Please show the steps how to differentiate u function equation and obtain this answer after differentating .please tell totally confused.
343
views
asked
Feb 21, 2018
Calculus
engineering-mathematics
+
–
1
answer
9
arrange the sorting algorithms ascending wise
What is the ascending wise order of sorting algorithms which takes least time and least space to sort the elements?
What is the ascending wise order of sorting algorithms which takes least time and least space to sort the elements?
2.3k
views
commented
Nov 11, 2017
Programming in C
algorithms
programming-in-c
time-complexity
sorting
+
–
0
answers
10
#artificial Intelligence # Using Resolution what will be the result
476
views
asked
Oct 28, 2017
Data Mining and Warehousing
artificial
intelligence
knowledge-representation
+
–
1
answer
11
A* algorithm Heuristic cost
600
views
commented
Oct 22, 2017
Data Mining and Warehousing
artificial
+
–
1
answer
12
Artificial Intelligence Heuristic problem Confusion
530
views
asked
Sep 27, 2017
Artificial Intelligence
artificial
intelligence
+
–
1
answer
13
if an array has 1000 elements which sorting to be used
if an array has 1000 elements which sorting to be used ?
if an array has 1000 elements which sorting to be used ?
1.2k
views
answer selected
Sep 14, 2017
Programming in C
data-structures
programming-in-c
bad-question
+
–
2
answers
14
How many address lines are needed to address each memory locations in a 2048 x 4 memory chip
How many address lines are needed to address each memory locations in a 2048 x 4 memory chip
How many address lines are needed to address each memory locations in a 2048 x 4 memory chip
4.9k
views
commented
Sep 6, 2017
CO and Architecture
co-and-architecture
+
–
1
answer
15
how many triangles are there total in figure ?
First Figure ......... Also tell in the second figure ?
First Figure .........Also tell in the second figure ?
1.3k
views
answer selected
May 22, 2017
2
answers
16
Consider a celluar system having 2023 duplex channels to cover 1925 sq km
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.
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.
1.4k
views
commented
May 9, 2017
Computer Networks
computer-networks
+
–
1
answer
17
Solve the Recurrence using Master Total Confusion as fraction part is there
T(n) =3T($n^{_{3}^{1}}$) + log 3n
T(n) =3T($n^{_{3}^{1}}$) + log 3n
671
views
commented
May 7, 2017
Algorithms
algorithms
time-complexity
asymptotic-notation
recurrence-relation
+
–
2
answers
18
Solve using Recursion Tree method when both parts are unequal
T(n) = T$(\frac{n}{3})$ + T$(\frac{2n}{3})$ + O(n)
T(n) = T$(\frac{n}{3})$ + T$(\frac{2n}{3})$ + O(n)
1.6k
views
commented
May 7, 2017
Algorithms
algorithms
time-complexity
asymptotic-notation
recurrence-relation
+
–
7
answers
19
GATE CSE 1994 | Question: 1.7, ISRO2017-14
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$
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(\fra...
17.9k
views
commented
May 7, 2017
Algorithms
gate1994
algorithms
recurrence-relation
easy
isro2017
+
–
2
answers
20
Doubt
How to get solution of the following recurrence? $T(n) = \sqrt{n} .T(\sqrt{n}) + n$
How to get solution of the following recurrence?$T(n) = \sqrt{n} .T(\sqrt{n}) + n$
536
views
commented
May 7, 2017
Algorithms
recurrence-relation
+
–
2
answers
21
Solve the Recurrence using Iteration Method
Solve the Recurrence using Iteration Method T(n)=3$(\frac{n}{4})$ + n
Solve the Recurrence using Iteration MethodT(n)=3$(\frac{n}{4})$ + n
1.2k
views
asked
May 7, 2017
Algorithms
algorithms
time-complexity
asymptotic-notation
recurrence-relation
+
–
4
answers
22
solve the recurrence using any method just solve it
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
T(n) = 100 T (n/99) + log(n!) Answer is T(n) = θ (n log n)a)answer is justifiedb)answer is not justifiedc)cannot be determinedd)none
4.4k
views
answer selected
May 7, 2017
Algorithms
algorithms
time-complexity
asymptotic-notation
recurrence-relation
+
–
0
answers
23
what is the difference between Vertical and Horizontal fragmentations.If Data objects replicas are stored
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 acquir...
2.2k
views
commented
May 3, 2017
Databases
databases
+
–
4
answers
24
difference between dynamic programming and divide and conquer technique is
What is the difference between dynamic programming and divide and conquer technique,
What is the difference between dynamic programming and divide and conquer technique,
6.1k
views
answer selected
Apr 23, 2017
Algorithms
divide-and-conquer
algorithms
dynamic-programming
programming
+
–
0
answers
25
what will be fuzzy set ?
216
views
asked
Apr 21, 2017
Mathematical Logic
fuzzy-set
engineering-mathematics
set-theory&algebra
alpha
cut
+
–
0
answers
26
what will be closed interval fuzzy alpha cut
326
views
asked
Apr 21, 2017
Mathematical Logic
alpha
cut
+
–
0
answers
27
Fuzzy doubt
207
views
asked
Apr 21, 2017
Mathematical Logic
fuzzy-set
engineering-mathematics
set-theory&algebra
+
–
0
answers
28
Fuzzy sets support and core
677
views
commented
Apr 21, 2017
Set Theory & Algebra
fuzzy-set
engineering-mathematics
set-theory&algebra
+
–
0
answers
29
Which fuzzy set is fuzzy number ?
271
views
asked
Apr 21, 2017
Mathematical Logic
fuzzy-set
set-theory&algebra
engineering-mathematics
+
–
0
answers
30
matrix parallel projection totally confused # Computer Graphics
826
views
commented
Apr 20, 2017
Computer Graphics
parallel
projection
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register