Save
Upgrade to remove ads
Busy. Please wait.
Log in with Clever
or
show password
Forgot Password?
Don't have an account?  Sign up 
Sign up using Clever
or
Username is available taken
show password


Make sure to remember your password. If you forget it there is no way for StudyStack to send you a reset link. You would need to create a new account. Your email address is only used to allow you to reset your password. See our Privacy Policy and Terms of Service.

Already a StudyStack user? Log In

Reset Password
Enter the associated with your account, and we'll email you a link to reset your password.
focusNode
Didn't know it?
click below
 
Knew it?
click below
Don't Know
Remaining cards (0)
Know
0:00
edit
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.

  Normal Size     Small Size show me how

SA4-ALG

QuestionAnswer
Prim's algorithm resembles Dijkstra's algorithm. TRUE
The Selection function is a component of greedy algorithm the chooses the best candidate to be added to the solution. TRUE
There are 5 components of the greedy algorithm TRUE
Dijkstra Algorithm is use for finding the shortest paths between nodes in a graph. TRUE
Greedy Algorithm is optimally solve combinatorial problems having the properties of matroids, and give constant-factor approximations to optimization problems with submodular structure. TRUE
It was Edsger W. Dijkstra who formulated the shortest paths between nodes in a graph. TRUE
It was Edsger S. Dikstra who formulated the shortest paths between nodes in a graph. FALSE
It was in 1959 that Edsger Dijkstra invented the Dijkstra algorithm TRUE
It was 1957 that Robert Prims republished the work of Jarnik TRUE
Greedy algorithm follows the problem-solving heuristic of making the locally optimal choice at each stage with the intent of finding a global optimum. TRUE
Prims algorithm is also known as Jarník’s algorithm TRUE
The Candidate set function is use to create solutions in Greedy Algorithm TRUE
The Solution function of the greedy algorithm is used to indicate when we have discovered a complete solution TRUE
It was Edsger Dijkstra who invented the semaphore mechanism that allows concurrent programs to share a single resource TRUE
It was Edsger W. Dijkstra who formulated the shortest paths between nodes in a graph. TRUE
Kruskal algorithm operates by building this tree one vertex at a time, from an arbitrary starting vertex, at each step adding the cheapest possible connection from the tree to another vertex FALSE
It was Vojtěch Jarník who rediscover the works of Kruskal in 1956 TRUE
The time complexity of the prims algorithm is O(n^2). TRUE
Prims algorithm finds a minimum spanning tree for a weighted undirected graph TRUE
It was Edsger Dijkstra kick started the structured programming movement TRUE
The feasibility function of the greedy algorithm is used to determine if a candidate can be used to contribute to a solution TRUE
The Object function of the greedy algorithm is used to assigns a value to a solution, or a partial solution TRUE
-------------------------------------------------------- ---------------------------------------------------------
Memoization is a technique in dynamic programming that remember the output of already solved sub-problems. TRUE
Dynamic programming refers to simplifying a complicated problem by breaking it down into simpler sub-problems in a recursive manner. TRUE
Knapsack Problem focuses in solving packing the most valuable or useful items without overloading the luggage. TRUE
The tower of Hanoi is also called Tower of Brahma TRUE
Tobias Dantzig is the mathematician who works with the knapsack problem? TRUE
Floyd-Warshall Algorithm is used to find all pair shortest path problem from a given weighted graph. TRUE
The tower of Hanoi is also called Tower of LucaS TRUE
Liber Abaci is a cookbook that laid out Hindu-Arabic arithmetic useful for tracking profits, losses, remaining loan balances. TRUE
The time complexity of the Fibonacci number series is (n) = T(n) = T(n-1) + T(n-2) TRUE
Peter Ingerman Formulated the algorithm that has three nested for loop under the Flody Warsall Algorithm TRUE
Dynamic programing is a method has application to aerospace engineering to economics TRUE
The Knapsack problem ranked 19th place according to Stony Brook University Algorithm Repository. TRUE
34 is the 10th Fibonacci series. (start with the index value) TRUE
Memoization is a dynamic programming optimization technique TRUE
Bellman-Fordman Algorithm is not part of Dynamic Programming TRUE
Dynamic programming method of these smaller sub-problems are remembered and used for similar or overlapping sub-problems. TRUE
Knapsack Problem is use in finding the least wasteful way to cut raw materials, selection of investments and portfolios, selection of assets for asset-backed securitization TRUE
Floyd-Warshall Algorithm is use for finding shortest paths in a weighted graph with positive or negative edge weights TRUE
Leonardo Fibonacci was the mathematician who discovered the Fibonacci number series TRUE
Created by: pingpong00
 

 



Voices

Use these flashcards to help memorize information. Look at the large card and try to recall what is on the other side. Then click the card to flip it. If you knew the answer, click the green Know box. Otherwise, click the red Don't know box.

When you've placed seven or more cards in the Don't know box, click "retry" to try those cards again.

If you've accidentally put the card in the wrong box, just click on the card to take it out of the box.

You can also use your keyboard to move the cards as follows:

If you are logged in to your account, this website will remember which cards you know and don't know so that they are in the same box the next time you log in.

When you need a break, try one of the other activities listed below the flashcards like Matching, Snowman, or Hungry Bug. Although it may feel like you're playing a game, your brain is still making more connections with the information to help you out.

To see how well you know the information, try the Quiz or Test activity.

Pass complete!
"Know" box contains:
Time elapsed:
Retries:
restart all cards