The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by LavTheRawkstar
User LavTheRawkstar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User LavTheRawkstar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
answers
1
recurrence relation
T(n)=5 T ($\frac{n}{2}$+16) + n2 please tell the solution as i m getting confused
commented
Nov 18, 2018
in
Algorithms

149
views
relations
recurrence
algorithms
timecomplexity
recurrenceeqation
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. AO(height) BO(n) CO(nlogn) DO(n^2)
answered
Nov 17, 2018
in
DS

787
views
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
asked
Oct 31, 2018
in
CO and Architecture

45
views
computerarchitecture
pipelining
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.
asked
Sep 10, 2018
in
Algorithms

123
views
algorithms
heap
sorting
datastructures
binomial
tree
btree
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.
asked
Sep 10, 2018
in
Algorithms

54
views
algorithms
datastructures
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
asked
Sep 10, 2018
in
Algorithms

46
views
btree
datastructures
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.
asked
Sep 9, 2018
in
Algorithms

122
views
algorithms
heap
heapsort
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.
asked
Feb 21, 2018
in
Calculus

77
views
engineeringmathematics
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?
commented
Nov 11, 2017
in
Programming

593
views
algorithms
programminginc
timecomplexity
sorting
0
answers
10
#artificial Intelligence # Using Resolution what will be the result
asked
Oct 28, 2017
in
Knowledge Representation

103
views
artificial
intelligence
knowledgerepresentation
1
answer
11
A* algorithm Heuristic cost
commented
Oct 22, 2017
in
Knowledge Representation

204
views
artificial
0
answers
12
Artificial Intelligence Heuristic problem Confusion
asked
Sep 27, 2017
in
Machine Language

216
views
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 ?
answer selected
Sep 15, 2017
in
Programming

124
views
datastructures
programminginc
badquestion
1
answer
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.4k
views
coandarchitecture
1
answer
15
how many triangles are there total in figure ?
First Figure ......... Also tell in the second figure ?
answer selected
May 22, 2017
in
Numerical Ability

207
views
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.
commented
May 9, 2017
in
Computer Networks

379
views
computernetworks
1
answer
17
Solve the Recurrence using Master Total Confusion as fraction part is there
T(n) =3T($n^{_{3}^{1}}$) + log 3n
commented
May 7, 2017
in
Algorithms

219
views
algorithms
timecomplexity
asymptoticnotations
recurrence
1
answer
18
Solve using Recursion Tree method when both parts are unequal
T(n) = T$(\frac{n}{3})$ + T$(\frac{2n}{3})$ + O(n)
commented
May 7, 2017
in
Algorithms

706
views
algorithms
timecomplexity
asymptoticnotations
recurrence
7
answers
19
GATE19941.7, ISRO201714
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

5k
views
gate1994
algorithms
recurrence
easy
isro2017
2
answers
20
Doubt
How to get complexity of recurrence: $T(n) = \sqrt{n} .T(\sqrt{n}) + n$
commented
May 7, 2017
in
Algorithms

183
views
recurrence
asymptoticnotations
2
answers
21
Solve the Recurrence using Iteration Method
Solve the Recurrence using Iteration Method T(n)=3$(\frac{n}{4})$ + n
asked
May 7, 2017
in
Algorithms

329
views
algorithms
timecomplexity
asymptoticnotations
recurrence
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
answer selected
May 7, 2017
in
Algorithms

500
views
algorithms
timecomplexity
asymptoticnotations
recurrence
0
answers
23
what is the difference between Vertical and Horizontal fragmentations.If Data objects replicas are stored
commented
May 3, 2017
in
Databases

877
views
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,
answer selected
Apr 23, 2017
in
Algorithms

4.6k
views
divideandconquer
algorithms
dynamicprogramming
programming
0
answers
25
what will be fuzzy set ?
asked
Apr 21, 2017
in
Mathematical Logic

78
views
fuzzysets
engineeringmathematics
settheory&algebra
alpha
cut
0
answers
26
what will be closed interval fuzzy alpha cut
asked
Apr 21, 2017
in
Mathematical Logic

64
views
alpha
cut
0
answers
27
Fuzzy doubt
asked
Apr 21, 2017
in
Mathematical Logic

48
views
fuzzysets
engineeringmathematics
settheory&algebra
0
answers
28
Fuzzy sets support and core
commented
Apr 21, 2017
in
Set Theory & Algebra

135
views
fuzzysets
engineeringmathematics
settheory&algebra
0
answers
29
Which fuzzy set is fuzzy number ?
asked
Apr 21, 2017
in
Mathematical Logic

115
views
fuzzysets
settheory&algebra
engineeringmathematics
0
answers
30
matrix parallel projection totally confused # Computer Graphics
commented
Apr 20, 2017
in
Computer Graphics

206
views
parallel
projection
1
answer
31
Generate atleast 3 solutions for 5 x 5 queen problem
Genearate atleast 3 solutions for 5 x 5 queen problem
asked
Apr 19, 2017
in
Algorithms

730
views
queenproblem
backtracking
algorithms
3
answers
32
T(n)=16T(n/4)+n! using the Master Theorem
how do i apply master theorem to this? https://s17.postimg.org/x7xld2nf3/Screenshot_82.png what is P and K here?
commented
Apr 18, 2017
in
Algorithms

2.5k
views
algorithms
mastertheorem
0
answers
33
Consider a cellular system having 2023 Duplex channels
Consider a cellular system having 2023 Duplex channels to cover 1925 km2 for 7 cell reuse system. Compute System capacity.
commented
Apr 16, 2017
in
Computer Networks

158
views
computernetworks
2
answers
34
A list of elements are given A  <3,1,4,1,5,9,2,6,5,3,5,8,9 >
A list of elements are given A  <3,1,4,1,5,9,2,6,5,3,5,8,9 > Show Howw the "Pivot" and quick sort algorithm work. finally show the Best Case analysis for quick sort .
answer selected
Apr 15, 2017
in
Algorithms

450
views
algorithms
quicksort
3
answers
35
With quick sort The results after first partioning of the given array
With quick sort The results after first partioning of the given array. A = (2,8,7,1,3,5,6,4,9). Analysis the time complexity of Quick sort in the best case.
answer selected
Apr 15, 2017
in
Algorithms

258
views
algorithms
quicksort
timecomplexity
sorting
1
answer
36
Travelling Salesman problem considering the triangle inequality
Travelling Salesman problem considering the triangle inequality ,tell the procedure of finding the approximate solution in polynomial time using a suitable example.
commented
Apr 15, 2017
in
Algorithms

418
views
algorithms
1
answer
37
Fractional Knapsack(Greedy Method)
Consider the following instance of the knapsack problem: n=3 , W=50 , (v1,v2,v3) = (60,100,120) and weight (w1,w2,w3) = (10,20,30) . solve the given knapsack problem applying greedy algorithm.
answer selected
Apr 15, 2017
in
Algorithms

550
views
algorithms
knapsack
greedyalgorithm
0
answers
38
what is the difference between WCDMA and CDMA 2000
what is the difference between WCDMA and CDMA 2000
asked
Apr 14, 2017
in
Computer Networks

45
views
computernetworks
0
answers
39
If Bluetooth is a commercial success what the remaining reasons for use of infra red transmissions?
asked
Apr 14, 2017
in
Computer Networks

93
views
computernetworks
0
answers
40
why CDMA is better than GSM ?
why CDMA is better than GSM ?
asked
Apr 14, 2017
in
Computer Networks

37
views
computernetworks
50,737
questions
57,284
answers
198,182
comments
104,862
users