Ask
Login

satishmanje93

gravatar for satishmanje93
Reputation:
Level 0
Status:
Active


Last seen:
7 years, 2 months ago
Joined:
7 years, 5 months ago

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

Top contributions by satishmanje93

5
votes
1
answer
31k
views
1
answer
Write a short note on 8-queen problem
analysis of algorithms updated 3.4 years ago by pedsangini276 • 4.8k
0
votes
1
answer
22k
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 3.4 years ago by pedsangini276 • 4.8k
0
votes
1
answer
17k
views
1
answer
Explain the advantages of dynamic programming . How it differs from divide and conquer
analysis of algorithms updated 3.4 years ago by pedsangini276 • 4.8k
0
votes
1
answer
9.5k
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 3.4 years ago by pedsangini276 • 4.8k
3
votes
1
answer
8.7k
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 3.2 years ago by binitamayekar ★ 6.7k
0
votes
1
answer
5.2k
views
1
answer
Explain graph coloring with backtracking.
analysis of algorithms updated 3.4 years ago by pedsangini276 • 4.8k
0
votes
1
answer
4.8k
views
1
answer
Write in brief about divide and conquer strategy.
analysis of algorithms updated 3.4 years ago by pedsangini276 • 4.8k
2
votes
1
answer
4.5k
views
1
answer
Explain the quick sort algorithm. Evaluate complexity with suitable example.
analysis of algorithms updated 3.4 years ago by sagarkolekar ★ 11k
0
votes
2
answers
4.1k
views
2
answers
State the application for the graph theory
analysis of algorithms updated 3.4 years ago by pedsangini276 • 4.8k
0
votes
1
answer
4.0k
views
1
answer
Explain Big-oh, Omega and theta notation with the help of digram. How do we analyze and measure time complexity algorithm?
analysis of algorithms updated 3.4 years ago by sagarkolekar ★ 11k
0
votes
4.7k
views
0
votes
A: An algorithm takes 0.5 ms for input size 100. How long it will take for input si
updated 7.2 years ago by satishmanje93 • 250
5
votes
1.5k
views
5
votes
A: Write a short note on 8-queen problem
updated 7.2 years ago by satishmanje93 • 250
0
votes
714
views
0
votes
A: Solve the following sum of subset problem using backtracking: w= {1, 3, 4, 5},
updated 7.2 years ago by satishmanje93 • 250
0
votes
433
views
0
votes
A: Explain the advantages of dynamic programming . How it differs from divide and c
updated 7.2 years ago by satishmanje93 • 250
0
votes
62
views
0
votes
A: Write in brief about divide and conquer strategy.
updated 7.2 years ago by satishmanje93 • 250
0
votes
56
views
0
votes
A: State the application for the graph theory
updated 7.3 years ago by satishmanje93 • 250
0
votes
49
views
0
votes
A: Explain graph coloring with backtracking.
updated 7.3 years ago by satishmanje93 • 250
0
votes
23
views
0
votes
A: State the application for the graph theory
updated 7.3 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