Remember
Register
Algorithms Q&A
Nobel Prize in Economics
Algorithms Textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
User Divya_Sree_Vadlamudi
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
(34)
Randomized Algorithms
(1)
Answers by Divya_Sree_Vadlamudi
0
votes
Solve this GridWorld
answered
May 6, 2024
in
Informed Search
grid-world
0
votes
Admissible Heuristic for n-Queens Problem
answered
May 4, 2024
in
Informed Search
n-queens
conflict
ai
0
votes
Give an example of a task environment that is..
answered
May 4, 2024
in
Informed Search
task-environments
0
votes
Disco Fever and Two Kinds of Tests
answered
May 4, 2024
in
Probability
probability
bayes-rule
0
votes
“Teleportation” across astro-haunted galaxies
answered
Dec 13, 2023
in
Dynamic Programming
dynamic-programming
0
votes
Give a Proof by Induction that the sum of squares of first n natural numbers is n. (n+1). (2n + 1) / 6.
answered
Dec 13, 2023
in
Math Basics
sum
pmi
induction
proof
0
votes
Maximize value of coins from k stacks, of n coins each
answered
Dec 12, 2023
in
Dynamic Programming
coins
0
votes
Solve a set of inter-related recurrence relations
answered
Dec 10, 2023
in
Branch & Bound
recurrence-relations
asymptotic-analysis
+1
vote
Selecting lowest cost hotel rooms, with no adjacent rooms selected
answered
Dec 10, 2023
in
Dynamic Programming
hotel-room
dynamic-programming
0
votes
Chromatic Number, Relation to Max Degree
answered
Dec 10, 2023
in
Greedy Algorithms
graph-coloring
graph
greedy
0
votes
Highest sum of tree heights when one recoloring is allowed
answered
Dec 10, 2023
in
Asymptotic Analysis
loops
0
votes
Given f(n) = o(g(n)), prove that 2^f(n) = o(2^g(n))
answered
Dec 10, 2023
in
Asymptotic Analysis
exponent
log
small-oh
asymptotic-notation
+1
vote
Prove Ө(log 1 + log2 + log3 + log4 +... + logn) = Ө(n log n)
answered
Dec 10, 2023
in
Asymptotic Analysis
log
+1
vote
Asymptotically compare 14 T(n/4) + O(n) and 7 R(n/2) + O(n).
answered
Dec 9, 2023
in
Asymptotic Analysis
recurrence-relations
+1
vote
Solve this recurrence relation: T(n) = T(n/2) + n/log n
answered
Dec 9, 2023
recurrence-relations
asymptotic-analysis
time-complexity
0
votes
Solve this recurrence using master theorem: T(n) = 2 T(n/2) + n^0.75
answered
Sep 10, 2023
in
Asymptotic Analysis
recurrence-relations
master-theorem
time-complexity
asymptotic-analysis
...