A community for students.
Here's the question you clicked on:
 0 viewing
myininaya
 3 years ago
Anyone interested in talking about dynamic algorithms vs static algorithms. I mean can anyone give me an example of each maybe by drawing a tree or something.
myininaya
 3 years ago
Anyone interested in talking about dynamic algorithms vs static algorithms. I mean can anyone give me an example of each maybe by drawing a tree or something.

This Question is Closed

myininaya
 3 years ago
Best ResponseYou've already chosen the best response.2I would like if you could treat me as if I were dumb.

myininaya
 3 years ago
Best ResponseYou've already chosen the best response.2dw:1329374236354:dw so this is a static algorithm recomputes from scratch in time O(n) we change the max input to 15 but why 15 how is 15 found? is it just a random number I wonder?... I mean does the algorithm choose a random number to replace the max

myininaya
 3 years ago
Best ResponseYou've already chosen the best response.2dynamic algorithm dw:1329374475415:dw

myininaya
 3 years ago
Best ResponseYou've already chosen the best response.2so here we don't have to start from scratch

myininaya
 3 years ago
Best ResponseYou've already chosen the best response.2i think that is what it is saying we don't have to start from scratch anyways

myininaya
 3 years ago
Best ResponseYou've already chosen the best response.2dw:1329374645988:dw then for some reason the inputs are arranged in a different order on the tree

myininaya
 3 years ago
Best ResponseYou've already chosen the best response.2i think it would make sense to say 15 is a random pick

myininaya
 3 years ago
Best ResponseYou've already chosen the best response.2oops and then the inputs are arranged again dw:1329374799217:dw

myininaya
 3 years ago
Best ResponseYou've already chosen the best response.2and we throw 36 back in the mix

myininaya
 3 years ago
Best ResponseYou've already chosen the best response.2i like static better lol it is easier to undertand

myininaya
 3 years ago
Best ResponseYou've already chosen the best response.2do you have any example of dynamic algorithm that you do understand?

myininaya
 3 years ago
Best ResponseYou've already chosen the best response.2I guess I just don't know how he is arranging the inputs of the tree

chris
 3 years ago
Best ResponseYou've already chosen the best response.0ok so yes, 15 is a random number

myininaya
 3 years ago
Best ResponseYou've already chosen the best response.2wait maybe...we go by the max of the next level 31>25 so we move 31 up and 19 up and put 15 on the bottom (the other side remains unchanged)

myininaya
 3 years ago
Best ResponseYou've already chosen the best response.2i wonder why the tree is chosen the way it is too begin with though

chris
 3 years ago
Best ResponseYou've already chosen the best response.0the point is basically that for static algorithms, you don't use the results of previous computations as information for future results. for dynamic algorithms you can do so, and an example of this is a heap (tree by definition, not the memory kind) http://en.wikipedia.org/wiki/Heap_(data_structure)

chris
 3 years ago
Best ResponseYou've already chosen the best response.0now reading about heap trees!

myininaya
 3 years ago
Best ResponseYou've already chosen the best response.2This is a nice little example. It isn't that complicated but I'm sure for inputs it would be ugly

maitre_kaio
 3 years ago
Best ResponseYou've already chosen the best response.3Hello, I'm currently following the OCW Intro Computer Science and Dynamic programming is one of the topics studied. You could try to see those videos: http://ocw.mit.edu/courses/electricalengineeringandcomputerscience/600introductiontocomputerscienceandprogrammingfall2008/videolectures/lecture12 http://ocw.mit.edu/courses/electricalengineeringandcomputerscience/600introductiontocomputerscienceandprogrammingfall2008/videolectures/lecture13 To me, the example that shows clearly what dynamic programmings is about is the Fibonnaci sequence program. There is a good explanation here: http://en.wikipedia.org/wiki/Dynamic_programming#Fibonacci_sequence

chris
 3 years ago
Best ResponseYou've already chosen the best response.0Thanks maitre! Great resource =). myin  also check this out, through at least slide 23 http://www.slideshare.net/TraianRebedea/adc4

chris
 3 years ago
Best ResponseYou've already chosen the best response.0it's dynamic because heap insertion is determined in a bottomup fashion of smaller sub problems, and an optimal state is stored after each run (making it dynamic)

chris
 3 years ago
Best ResponseYou've already chosen the best response.0so yes, 15 is just the random example of changing input, and showing you one algorithm that just goes through the whole list to find the right spot, and another example that has the precomputation stored that in the case of heaps allows you to skip to the end and compare upwards (> or < parent) for a max of O(log n)

chris
 3 years ago
Best ResponseYou've already chosen the best response.0I guess the author is going on to describe why dynamic algorithms are good because they can be distributed  each machine only needs some of the information

myininaya
 3 years ago
Best ResponseYou've already chosen the best response.2Ok thanks for the links you guys and confirming 15 is random. This is my 2nd semester of learning anything "computer sciency" hopefully i can learn enough about clouds and cryptography (definitely including ABE) and secure computation to construct my own cryptoalgorithm i feel so behind the other phd students that my computer science adviser has since they know all of these terms :( but i'm gonna try really hard to learn all that i can so thank you guys so much you guys are the best!

myininaya
 3 years ago
Best ResponseYou've already chosen the best response.2if you guys think of anything else you want to say please feel free to jot it down

chris
 3 years ago
Best ResponseYou've already chosen the best response.0lol, well, only that you'll be a genius once you understand this whole presentation haha

myininaya
 3 years ago
Best ResponseYou've already chosen the best response.2i notice slide 1721 look like a mess to me too lol

myininaya
 3 years ago
Best ResponseYou've already chosen the best response.2i have to look through it some more and just do some searches and hopefully find what i'm looking for

myininaya
 3 years ago
Best ResponseYou've already chosen the best response.2so chris you are rating this presentation as hard?

myininaya
 3 years ago
Best ResponseYou've already chosen the best response.2i honestly don't know if it is considered to be hard by normal computer people lol everything is hard to me

myininaya
 3 years ago
Best ResponseYou've already chosen the best response.2normal meaning people who actually have a bs in computer science (compare to my math degree i know nothing )

chris
 3 years ago
Best ResponseYou've already chosen the best response.0Well good luck myin! I'm off to sleep! This is a tough one  is there a full paper? Combiners are a bit vague to me. "precompute" reduce. Haha, well I think you need to be at least very well versed in algorithms, and at least understand map reduce as exists, and figure out what the combiners exactly are precomputing, the stored computation is the big gain.

myininaya
 3 years ago
Best ResponseYou've already chosen the best response.2yes i have been looking at the full paper also he didn't have these drawings described in there (or if he did I misunderstood ) i will keep rereading

myininaya
 3 years ago
Best ResponseYou've already chosen the best response.2it will be okay if i don't know everything i will just have to lead the discussion it will be okay! :) thank you guys so much again you are the best for helping me

myininaya
 3 years ago
Best ResponseYou've already chosen the best response.2http://www.mpisws.org/~bhatotia/pubs/hotcloud11.pdf this is the paper i'm reading

maitre_kaio
 3 years ago
Best ResponseYou've already chosen the best response.3I just read the link myininaya posted earlier. Finding the max of an array is typically a problem where you can use dynamic programming because it fills the two requirements: 1. Optimal substructure: you can find the optimal solution of the problem by finding the optimal solution of its subproblems. It's easy to see that you can divide the array into subarrays, find the max of each subarrays and combine the solutions until you find the max of the array. 2. Overlapping subproblems. You can walk the tree recursively.

myininaya
 3 years ago
Best ResponseYou've already chosen the best response.2Thanks again you guys. I stayed up all night looking at some stuff posted here and I had a good enough understanding of the paper to give what I would call a pretty good discussion on the topic. You guys rule! :)
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.