Exam (elaborations)
DSA REVIEWER QUESTIONS WITH ACCURATE ANSWERS
- Course
- Institution
Exam of 5 pages for the course DSA at DSA (DSA REVIEWER)
[Show more]
Content preview
DSA REVIEWERproblem - answera statement that asks for a way to obtain output(s)
from input(s) that follows a specific input/output relationship
algorithm - answerAn ____for a problem is the step-by-step procedure that gives
an output for the specified input with respect to the input/output
relation of the given problem
algorithm - answersolves a given problem if it always gives the correct
output for every input(s)
linear search - answersimple iterative algorithm ___ that compares each
elements of 𝐴 with
Sorting - answercommonly used to solve other problems easier and
faster
Selection Sort - answerSearch for the minimum
element and put it in its
correct position
Repeat the process with
the remaining elements
Stop when all elements
are in order
binary search algorithm - answerThe ____ can be used to compute the (positive)
square root of a number 𝑛
base
case(s) and recursive case(s) - answerA recursive process has two main parts:
Base case(s): - answerused when the input is
small enough to perform step(s) directly
Recursive case(s) - answersteps that require
using the smaller instance of the process
being defined
, recursive function - answerfunction that uses recursion
is called a
recursive
call - answerThe function call that causes a
recursion is called a
recursive
function - answerEvery iterative procedure can
be converted to a
recursive - answerSome algorithms are naturally
tail
recursive - answerA recursive function is ____ if the only step after
doing the recursion is to return its
output
helper function - answerperforms partial
computation and passe the result of
this computation as input to the
recursive call, which will continue the
computation to completion
main factorial function - answerwill
initialize the helper function and
returns its result
running time - answeris the total time required by an algorithm to
process its input
0 - answerLinear search will need less time if 𝑥 is stored at/near index
Worst-case analysis - answerAssume the worst possible input to
the algorithm
Big-𝑂 notation - answertells us that the growth rate of 𝑇(𝑛) is the same or
better than 𝑓 𝑛 as 𝑛 increases
recurrence - answera mathematical function defined in terms of
itself
recurrence - answerrunning time of recursive algorithms can be
expressed naturally as a
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 $12.49. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
77764 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now