Remember
Register
Algorithms Q&A
Smart HR Software
Get the algorithms textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
User Amrinder Arora
Wall
Recent activity
All questions
All answers
Categories
All categories
Math Basics
(5)
Asymptotic Analysis
(36)
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)
Recent activity by Amrinder Arora
3
answers
Give an example of a graph that has 6 vertices, 9 edges, but does not have a clique on 3 vertices
answer selected
Dec 12, 2023
in
Graph Theory
graph
clique
2
answers
k-degree constrained spanning tree
answer selected
Dec 12, 2023
in
NP-Completeness
np-completeness
spanning-tree
degree-constrained
1
answer
Selecting lowest cost hotel rooms, with no adjacent rooms selected
answer selected
Dec 11, 2023
in
Dynamic Programming
hotel-room
dynamic-programming
9
answers
Solve this recurrence using master theorem: T(n) = 2 T(n/2) + n^0.75
answer selected
Dec 11, 2023
in
Asymptotic Analysis
recurrence-relations
master-theorem
time-complexity
asymptotic-analysis
4
answers
True or False: Every graph of 6 vertices must have either an Independent Set of size >= 3 or a clique of size >= 3.
commented
Dec 11, 2023
graph
clique
independent-set
2
answers
“Discovery of the Sun”
answer selected
Dec 10, 2023
3
answers
Solve a set of inter-related recurrence relations
commented
Dec 10, 2023
in
Branch & Bound
recurrence-relations
asymptotic-analysis
1
answer
Use the limit method to prove the asymptotic relation between these 3 functions
answer selected
Dec 10, 2023
in
Asymptotic Analysis
limit-method
small-oh
small-omega
asymptotic-analysis
5
answers
Graph with no 3-clique that needs at least 4 colors
commented
Dec 9, 2023
in
Graph Theory
graph
vertex-coloring
1
answer
Asymptotically compare 14 T(n/4) + O(n) and 7 R(n/2) + O(n).
answer selected
Dec 9, 2023
in
Asymptotic Analysis
recurrence-relations
4
answers
Solve this recurrence relation: T(n) = T(n/2) + n/log n
answer selected
Dec 9, 2023
recurrence-relations
asymptotic-analysis
time-complexity
2
answers
Analyze the time complexity of this program
answer selected
Dec 9, 2023
asymptotic-analysis
nested-loops
5
answers
Nested loop analysis, outer loop grows by sqrt n, inner randomly
answer selected
Dec 9, 2023
in
Asymptotic Analysis
time-complexity
sqrt
nested-loops
loops
asymptotic-analysis
4
answers
Graph that has 2 long paths
asked
Dec 9, 2023
graph
2
answers
Give an example of a graph without an articulation point, a Hamiltonian cycle, or a 2-coloring
answer selected
Dec 8, 2023
in
Graph Theory
graph
vertex-coloring
graph-coloring
1
answer
Given an array of numbers, find triplets i,j,k such that a[i] + a[j] = a[k]
answer selected
Dec 8, 2023
exam
2
answers
Is there a solution to this PCP instance?
answer selected
Dec 3, 2023
pcp
unsolvable
1
answer
MVCS of Alternating Positive and Negative Numbers - Which Statements are True?
answer selected
Nov 28, 2023
mvcs
dynamic-programming
proof
counter-example
1
answer
Example of a graph that is connected, has articulation point, needs 4 colors, and does not have a 4-clique
retagged
Nov 20, 2023
in
Graph Theory
graph-coloring
graph
articulation-point
exam
3
answers
Solve the recurrence Relation: T(n) = T(n/3) + T(2n/3) + n
answer reshown
Nov 8, 2023
in
Divide & Conquer
recurrence-relations
substitution-method
asymptotic-analysis
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...
| Presentations on Slideshare | Lecture Notes, etc