Ask
Login

satishmanje93

gravatar for satishmanje93
Reputation:
Level 0
Status:
Active


Last seen:
4 years, 1 month ago
Joined:
4 years, 4 months ago

Profile Strength:
20%
  • 30
    Questions
  • 8
    Answers
  • 19
    Awards
'Computer Engineering'
Mumbai University (MU)

Top contributions by satishmanje93

4
votes
1
answer
17k
views
1
answer
Write a short note on 8-queen problem
analysis of algorithms updated 4 months ago by pedsangini276 • 4.1k
0
votes
1
answer
13k
views
1
answer
Explain the advantages of dynamic programming . How it differs from divide and conquer
analysis of algorithms updated 4 months ago by pedsangini276 • 4.1k
0
votes
1
answer
9.3k
views
1
answer
An algorithm takes 0.5 ms for input size 100. How long it will take for input size 500 if running time is i) Quadratic ii) NLog N
analysis of algorithms updated 4 months ago by pedsangini276 • 4.1k
0
votes
1
answer
3.7k
views
1
answer
Solve the following sum of subset problem using backtracking: w= {1, 3, 4, 5}, m=8. Find the possible subsets of 'w' that sum to 'm'.
analysis of algorithms updated 4 months ago by pedsangini276 • 4.1k
0
votes
1
answer
3.3k
views
1
answer
Explain graph coloring with backtracking.
analysis of algorithms updated 4 months ago by pedsangini276 • 4.1k
0
votes
1
answer
2.9k
views
1
answer
Write in brief about divide and conquer strategy.
analysis of algorithms updated 4 months ago by pedsangini276 • 4.1k
1
vote
1
answer
1.9k
views
1
answer
Write a program for knapsack problem
analysis of algorithms updated 7 weeks ago by teamques10 ★ 26k
0
votes
2
answers
1.8k
views
2
answers
State the application for the graph theory
analysis of algorithms updated 4 months ago by pedsangini276 • 4.1k
0
votes
0
answers
1.5k
views
0
answers
Explain general method of dynamic programming. List different examples of it. For the following graph find all pairs shortest path using dynamic programming.
analysis of algorithms updated 5 weeks ago by sagarkolekar ★ 10k
2
votes
1
answer
1.2k
views
1
answer
Sort the following numbers using Quick sort algorithm. Show all passes of execution also state the following state the time complexity.
analysis of algorithms updated 5 weeks ago by binitamayekar ★ 5.1k
0
votes
1.6k
views
0
votes
A: An algorithm takes 0.5 ms for input size 100. How long it will take for input si
updated 4.2 years ago by satishmanje93 • 240
4
votes
743
views
4
votes
A: Write a short note on 8-queen problem
updated 4.2 years ago by satishmanje93 • 240
0
votes
331
views
0
votes
A: Explain the advantages of dynamic programming . How it differs from divide and c
updated 4.1 years ago by satishmanje93 • 240
0
votes
145
views
0
votes
A: Solve the following sum of subset problem using backtracking: w= {1, 3, 4, 5},
updated 4.2 years ago by satishmanje93 • 240
0
votes
30
views
0
votes
A: Write in brief about divide and conquer strategy.
updated 4.2 years ago by satishmanje93 • 240
0
votes
29
views
0
votes
A: State the application for the graph theory
updated 4.2 years ago by satishmanje93 • 240
0
votes
16
views
0
votes
A: Explain graph coloring with backtracking.
updated 4.2 years ago by satishmanje93 • 240
0
votes
8
views
0
votes
A: State the application for the graph theory
updated 4.2 years ago by sanketshingote • 100

Latest awards to satishmanje93


created 50 posts within first three months of joining

created a question with more than 1,000 views

created a question with more than 10,000 views

created a question with more than 5,000 views