Remember
Register
Algorithms Q&A
Nobel Prize in Economics
Algorithms Textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
User SasmiP
Wall
Recent activity
All questions
All answers
Categories
All categories
Math Basics
(5)
Asymptotic Analysis
(37)
Divide & Conquer
(18)
Greedy Algorithms
(10)
Dynamic Programming
(19)
Backtracking/DFS/BFS
(2)
Branch & Bound
(6)
Graph Theory
(11)
NP-Completeness
(8)
Artificial Intelligence
(28)
Randomized Algorithms
(1)
Answers by SasmiP
0
votes
Solve the recurrence relation: T(n) = 3 T(n/2) + n^1.5 log n
answered
Dec 10, 2023
in
Divide & Conquer
recurrence-relations
time-complexity
asymptotic-analysis
+2
votes
“Discovery of the Sun”
answered
Dec 10, 2023
0
votes
How can we solve the 8 puzzle problem using Branch & Bound approach?
answered
Dec 10, 2023
in
Branch & Bound
n-puzzle
a-star
0
votes
Solve the recurrence Relation: T(n) = T(n/3) + T(2n/3) + n
answered
Nov 21, 2023
in
Divide & Conquer
recurrence-relations
substitution-method
asymptotic-analysis
+1
vote
Randomized Algorithm - Basics (4 Questions in 1)
answered
Nov 20, 2023
in
Randomized Algorithms
randomized
asymptotic-analysis
+2
votes
Given jobs, resources and cost matrix, what assignment minimizes the overall cost?
answered
Nov 19, 2023
in
Branch & Bound
job-assignment
+2
votes
Give an example of a graph without an articulation point, a Hamiltonian cycle, or a 2-coloring
answered
Nov 19, 2023
in
Graph Theory
graph
vertex-coloring
graph-coloring
+2
votes
Example of a graph that is connected, has articulation point, needs 4 colors, and does not have a 4-clique
answered
Nov 19, 2023
in
Graph Theory
graph-coloring
graph
articulation-point
exam
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...
| Presentations on Slideshare | Lecture Notes, etc