Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by LavTheRawkstar
0
votes
3
answers
91
Solve the Recurrence using any method which can solve it quickly in less steps
Solve the Recurrence using any method T(n)=2 T ($\frac{n}{4}$ ) - n2
Solve the Recurrence using any methodT(n)=2 T ($\frac{n}{4}$ ) - n2
555
views
asked
Mar 27, 2017
Algorithms
algorithms
recurrence-relation
+
–
0
votes
2
answers
92
having confusion in P ,Np,NP hard and Np completness
what i have tried to get out the conslusion for P problem is that P problem These are set of those yes/no problems which can solved using polynomic time complexity algroithms. For example if are asked to Compare or sort then numbers.Then using loop we ... .hence this Np problem is now P problem Am i correct with these two terms ????????????????
what i have tried to get out the conslusion for P problem is that P problemThese are set of those yes/no problems which can solved using polynomic time complexity algroi...
2.3k
views
asked
Mar 26, 2017
Algorithms
p-np-npc-nph
+
–
0
votes
0
answers
93
Calculate the shortest path using TSP Greedy Appraoch
Calculate the shortest path using TSP Greedy Appraoch
Calculate the shortest path using TSP Greedy Appraoch
420
views
asked
Mar 26, 2017
Algorithms
algorithms
shortest-path
+
–
1
votes
1
answer
94
#Confusion Is it necessary to arrange the weights in Ascending order while solving 0/1 Knapsack problem using Dynamic
Number of Cateogires are 5, Thier total weights are w1,w2,w3,w4,w5={7,2,4,8,6}b1,b2,b3,b4,b5={5,6,4,3,2}M=6=Maximum Capacity= WI am having confusion How to solve using dy...
2.6k
views
asked
Mar 25, 2017
Algorithms
knapsack-problem
algorithms
+
–
1
votes
1
answer
95
An ISP is granted a block of addresses starting with 195.200.0.0/16 (65,536 addresses).
An ISP is granted a block of addresses starting with 195.200.0.0/16 (65,536 addresses). The ISP needs to distribute these addresses to three groups of customers as follows: a. The first group has 64 ... has 128 customers; each needs 64 addresses. c. The third group has 128 customers; each needs 32 addresses.
An ISP is granted a block of addresses starting with 195.200.0.0/16 (65,536 addresses). The ISP needs to distribute these addresses to three groups of customers as follow...
10.8k
views
asked
Mar 22, 2017
Computer Networks
computer-networks
+
–
0
votes
1
answer
96
Needham Schroeder and Millicent
What is this Needham Schroeder and what is this Millicent ?
What is this Needham Schroeder and what is this Millicent ?
1.0k
views
asked
Mar 18, 2017
Computer Networks
computer-networks
+
–
0
votes
1
answer
97
what is Kerberos?
somebody please tell what is this Kerberos ?
somebody please tell what is this Kerberos ?
588
views
asked
Mar 17, 2017
1
votes
1
answer
98
Pessimistic time stamp ordering vs optimistic time stamp ordering
What is the difference between Pessimistic time stamp ordering and optimistic time stamp ordering.
What is the difference between Pessimistic time stamp ordering and optimistic time stamp ordering.
2.5k
views
asked
Mar 17, 2017
Databases
databases
transaction-and-concurrency
+
–
0
votes
1
answer
99
Multiversion Timestamp ordering vs time stamp ordering
What is the advantage and drawback of Multiversion Timestamp ordering in comparison with ordering Time stamp ordering? anyone please also explain what is this multiversion Timestamp ordering and what is the Timestamp ordering in simple words please?
What is the advantage and drawback of Multiversion Timestamp ordering in comparison with ordering Time stamp ordering? anyone please also explain what is this multiversio...
1.9k
views
asked
Mar 17, 2017
Databases
databases
transaction-and-concurrency
+
–
0
votes
0
answers
100
Doubt in two phase Commit Protocol
In two phase Commit Protocol,why can blocking be completely eliminated even when participants elect a new Coordinator ?
In two phase Commit Protocol,why can blocking be completely eliminated even when participants elect a new Coordinator ?
561
views
asked
Mar 17, 2017
Databases
databases
transaction-and-concurrency
+
–
1
votes
2
answers
101
Essential differences in the Lock based Protocols and Time-stamp based proctols?
Essential differences in the Lock based Protocols and Time-stamp based proctols?
Essential differences in the Lock based Protocols and Time-stamp based proctols?
3.1k
views
asked
Mar 17, 2017
Databases
databases
transaction-and-concurrency
+
–
0
votes
2
answers
102
eliminate unit production
S -> AA | B A-> BB | S B-> c | ab
S - AA | BA- BB | S B- c | ab
1.2k
views
asked
Mar 16, 2017
Theory of Computation
theory-of-computation
+
–
1
votes
2
answers
103
write locks are released after last operation of transaction but before its commit ! explain
Somebody please explain this i am not able to understand please given an example of transaction or explain in hindi what the question and answer is please explain somebody please Here i am posting the Entire ... please explain which choice is correct and which is wrong I am not able to understand it.
Somebody please explain this i am not able to understand please given an example of transaction or explain in hindi what the question and answer is please explain somebod...
1.7k
views
asked
Mar 16, 2017
Databases
databases
transaction-and-concurrency
+
–
1
votes
1
answer
104
difference between mounting and caching is
What is the difference between mounting and caching ?
What is the difference between mounting and caching ?
332
views
asked
Mar 16, 2017
Databases
operating-system
databases
distributed-computing
+
–
0
votes
0
answers
105
Fuzzy sets support and core
701
views
asked
Mar 5, 2017
Set Theory & Algebra
fuzzy-set
engineering-mathematics
set-theory&algebra
+
–
1
votes
1
answer
106
Fuzzy Sets
2.4k
views
asked
Mar 5, 2017
Set Theory & Algebra
fuzzy-set
engineering-mathematics
set-theory&algebra
+
–
0
votes
0
answers
107
Consider the fuzzy set Sweet,
Consider the fuzzy set Sweet, where "Sweet" = {(1,0),(2,0),(3,0.2),(4,0.4),(5,0.6),(6,0.8),(7,1)(1,0),(2,0),(3,0.2),(4,0.4),(5,0.6),(6,0.8),(7,1)}. Find the corresponding "Very Sweet" and "Somewhat Sweet" fuzzy sets.
Consider the fuzzy set Sweet,where "Sweet" = {(1,0),(2,0),(3,0.2),(4,0.4),(5,0.6),(6,0.8),(7,1)(1,0),(2,0),(3,0.2),(4,0.4),(5,0.6),(6,0.8),(7,1)}.Find the corresponding "...
382
views
asked
Mar 5, 2017
Mathematical Logic
engineering-mathematics
fuzzy-set
+
–
1
votes
1
answer
108
Find the shortest tour for given graph using greedy approach
... directed graph as forward /backward distances are not same. But how to solve using Greedy Approach using TravelSalesman Problem(TSP) ?
$\begin{bmatrix} 0& 29& 19& 25& 22\\ 20& 0& 21& 23& 21\\ 19& 21& 0& 21& 20\\ 25& 23& 21& 0& 32\\ 22& 21& 20& 22& 0 \end{bmatrix}$Find the shortest tour for given graph us...
1.7k
views
asked
Feb 28, 2017
Algorithms
algorithms
greedy-algorithm
travelling-salesman-problem
+
–
1
votes
1
answer
109
Find the Optimal Solution of Fractional Knapsack where W=15
Item Total Weight Total Profit 1 2 10 2 3 5 3 5 15 4 7 7 5 1 6 6 4 18 7 1 3 Answer is 55.33 but how?
ItemTotal WeightTotal Profit121023535154775166418713Answer is 55.33 but how?
7.4k
views
asked
Feb 28, 2017
Algorithms
algorithms
knapsack-problem
+
–
1
votes
1
answer
110
Consider the Knapsack incidence with n=3(items) with weights {w1,w2,w3}={2,3,4} and profits are {p1,p2,p3}={1,2,5}
Consider the Knapsack incidence with n=3(items) with weights {w1,w2,w3}={2,3,4} and profits are {p1,p2,p3}={1,2,5}Given the capacity is 5,{W/M = 5 } Find the optimal solu...
13.1k
views
asked
Feb 28, 2017
Algorithms
knapsack-problem
greedy-algorithm
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
...
14
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register