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
Questions 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
votes
0
answers
1
recurrence relation
T(n)=5 T ($\frac{n}{2}$+16) + n2 please tell the solution as i m getting confused
asked
Nov 18, 2018
in
Algorithms

137
views
relations
recurrence
algorithms
timecomplexity
recurrenceeqation
0
votes
0
answers
2
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

43
views
computerarchitecture
pipelining
0
votes
0
answers
3
# 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

109
views
algorithms
heap
sorting
datastructure
binomial
tree
btree
0
votes
0
answers
4
# 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

50
views
algorithms
datastructure
backtracking
0
votes
0
answers
5
# 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

42
views
btree
datastructure
algorithms
0
votes
1
answer
6
# 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

116
views
algorithms
heap
heapsort
sorting
0
votes
0
answers
7
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

72
views
engineeringmathematics
0
votes
0
answers
8
#artificial Intelligence # Using Resolution what will be the result
asked
Oct 28, 2017
in
Knowledge Representation

102
views
artificial
intelligence
knowledgerepresentation
0
votes
1
answer
9
A* algorithm Heuristic cost
asked
Oct 17, 2017
in
Knowledge Representation

202
views
artificial
0
votes
0
answers
10
Artificial Intelligence Heuristic problem Confusion
asked
Sep 27, 2017
in
Machine Language

213
views
artificial
intelligence
+1
vote
1
answer
11
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?
asked
Sep 12, 2017
in
Programming

588
views
algorithms
programminginc
timecomplexity
sorting
0
votes
1
answer
12
if an array has 1000 elements which sorting to be used
if an array has 1000 elements which sorting to be used ?
asked
Sep 12, 2017
in
Programming

123
views
datastructure
programminginc
badquestion
+2
votes
1
answer
13
How many address lines are needed to address each memory locations in a 2048 x 4 memory chip
asked
Sep 6, 2017
in
CO and Architecture

1.3k
views
coandarchitecture
0
votes
1
answer
14
how many triangles are there total in figure ?
First Figure ......... Also tell in the second figure ?
asked
May 22, 2017
in
Numerical Ability

204
views
+3
votes
1
answer
15
Solve using Recursion Tree method when both parts are unequal
T(n) = T$(\frac{n}{3})$ + T$(\frac{2n}{3})$ + O(n)
asked
May 7, 2017
in
Algorithms

689
views
algorithms
timecomplexity
asymptoticnotations
recurrence
+1
vote
1
answer
16
Solve the Recurrence using Master Total Confusion as fraction part is there
T(n) =3T($n^{_{3}^{1}}$) + log 3n
asked
May 7, 2017
in
Algorithms

215
views
algorithms
timecomplexity
asymptoticnotations
recurrence
+2
votes
2
answers
17
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

322
views
algorithms
timecomplexity
asymptoticnotations
recurrence
0
votes
0
answers
18
what will be fuzzy set ?
asked
Apr 21, 2017
in
Mathematical Logic

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

63
views
alpha
cut
0
votes
0
answers
20
Fuzzy doubt
asked
Apr 21, 2017
in
Mathematical Logic

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

114
views
fuzzysets
settheory&algebra
engineeringmathematics
+1
vote
1
answer
22
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

685
views
queenproblem
backtracking
algorithms
–1
vote
0
answers
23
matrix parallel projection totally confused # Computer Graphics
asked
Apr 19, 2017
in
Computer Graphics

205
views
parallel
projection
+1
vote
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,
asked
Apr 17, 2017
in
Algorithms

4.5k
views
divideandconquer
algorithms
dynamicprogramming
programming
+3
votes
4
answers
25
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
asked
Apr 17, 2017
in
Algorithms

486
views
algorithms
timecomplexity
asymptoticnotations
recurrence
+2
votes
3
answers
26
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.
asked
Apr 15, 2017
in
Algorithms

249
views
algorithms
quicksort
timecomplexity
sorting
0
votes
2
answers
27
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 .
asked
Apr 15, 2017
in
Algorithms

443
views
algorithms
quicksort
0
votes
1
answer
28
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.
asked
Apr 15, 2017
in
Algorithms

527
views
algorithms
knapsack
greedyalgorithm
0
votes
1
answer
29
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.
asked
Apr 15, 2017
in
Algorithms

408
views
algorithms
0
votes
0
answers
30
what is the difference between Vertical and Horizontal fragmentations.If Data objects replicas are stored
asked
Apr 14, 2017
in
Databases

838
views
databases
Page:
1
2
3
4
5
6
...
9
next »
50,647
questions
56,497
answers
195,495
comments
100,827
users