Exam (elaborations)
DSA 3. Algorithms & Strategies Questions with Accurate Answers
- Course
- Institution
DSA 3. Algorithms & Strategies
[Show more]
Content preview
DSA 3. Algorithms & StrategiesBrute-force - answer Algorithm strategy consisting of systematically enumerating and
testing every possible candidate solution.
Greedy - answer Algorithm strategy that finds the locally optimal solution at each step in
an attempt to find the globally optimal solution.
Divide-and-conquer - answer Algorithm strategy that divides the main problem into
smaller/similar subproblems, recursively solves them, and combines them into a main
solution.
Dynamic programming - answer Algorithm strategy that divides the main problem into
smaller/similar subproblems but also memoizes the solutions to overlapping
subproblems and applies stored solutions to subsequent repeat subproblems.
Linear search - answerFinds an element in a list by sequentially checking each item
until a match is found.
Binary search - answerFinds an element in a sorted list by dividing it in half and
comparing the target value with the middle value. If not equal, repeat recursively on the
left/right half, until a match or null is found.
Hash search - answerFinds an element in a collection by producing a unique index
based on the element key and retrieving the element at the produced index of the
collection.
Breadth-first search - answerFinds an element in a tree or graph by starting at a root
and exploring elements at the same level before moving to another depth level.
Depth-first search - answerFinds an element in a tree or graph by starting at a root and
exploring elements as far as possible along each branch before backtracking.
Kruskal's MST algorithm - answerA greedy algorithm for producing a minimum-spanning
tree from an undirected weighted graph by repeatedly picking the smallest weight edge
without creating a cycle until all vertices are connected.
Prim's MST algorithm - answerA greedy algorithm for producing a minimum-spanning
tree from an undirected weighted graph by picking an arbitrary vertex, then repeatedly
picking the subsequent smallest weight edge to the next unvisited vertex until all
vertices are connected.
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller Dreamer252. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $13.99. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
77988 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now
