Remember
Register
Algorithms Q&A
Nobel Prize in Economics
Macbook Air 2025
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
(38)
Divide & Conquer
(18)
Greedy Algorithms
(10)
Dynamic Programming
(19)
Backtracking/DFS/BFS
(2)
Branch & Bound
(6)
Graph Theory
(11)
NP-Completeness
(8)
Artificial Intelligence
(32)
Randomized Algorithms
(1)
Recent activity by Amrinder Arora
0
answers
Solve this grid world.
asked
May 6, 2025
in
Informed Search
grid-world
mdp
stochastic
0
answers
Admissible Heuristic for Chutes and Ladders
asked
May 6, 2025
in
Informed Search
a-star
heuristic
0
answers
Weird N Puzzle
asked
Mar 4, 2025
in
Informed Search
a-star
0
answers
I have all the (unsorted) cards
asked
Mar 4, 2025
in
Informed Search
a-star
1
answer
Analyze Double Loop - j starts from i*i
answered
Nov 22, 2024
in
Asymptotic Analysis
loops
asymptotic-notation
analysis
asymptotic-analysis
1
answer
Analyze Triple Loop - j and k start with i^2 and j^2 respectively
asked
Nov 4, 2024
in
Asymptotic Analysis
loops
asymptotic-notation
analysis
exam
2
answers
What is the last digit of number: 2^100
answer reshown
Oct 14, 2024
in
Math Basics
algebra
modulus
2
answers
Prove Ө(log 1 + log2 + log3 + log4 +... + logn) = Ө(n log n)
answer selected
Sep 10, 2024
in
Asymptotic Analysis
log
3
answers
The executive time of program in eclipse seems to be randomly when the times are not very large
reshown
Aug 12, 2024
in
Asymptotic Analysis
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
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...
| Presentations on Slideshare | Lecture Notes, etc