Exam (elaborations)
Data Structures and algorithms Questions with correct Answers
- Course
- Institution
Data Structures and algorithms
[Show more]
Content preview
Data Structures and algorithmsClass - answerWhat term refers to a template for creating an object?
A. Application
B. Class
C. Method
D. Algorithm
Uses an agnostic code repository - answerWhich characteristic of an algorithm is
independent in nature?
A. Uses Python to implement the algorithm
B. uses MySQL for the database needs of the algorithm's application
C. Uses Windows to install the application
D. Uses an agnostic code repository
Record - answerWhat is referred to as a data structure that stores subitems?
A. Array
B. Matrix
C. Record
D. Graph
Maintainability - answerWhich factor takes the ability to easily update an algorithm into
consideration?
A. Scalability
B. Feasability
C. Maintainability
D. Modularity
Finiteness - answerWhat is a component of an algorithm that specifies a stopping point?
A. Sequencing
B. Finiteness
C. Iteration
D. Looping
Linear - answerWhich term refers to a type of search algorithm?
A. Linear
B. Divide-and-conquer
C. Greedy
D. Quicksort
Simplicity - answerWhat is a high-level consideration in an algorithm's design?
, A. Simplicity
B. Database type
C. Finiteness
D. Browser Type
Binary Search - answerWhat is the primary method used to search for an item in a
sorted array?
A. Binary search
B. Jump Search
C. Exponential search
D. Linear Search
A posteriori analysis - answerWhich review of an algorithm happens after
implementation?
* Binary search
* A posteriori analysis
* A priori analysis
* Linear search
Extensibility - answerWhich factor helps measure the reusability of an algorithm?
* User adoption
* Correctness
* Extensibility
* Flowchart
Binary Search - answerWhich search algorithm utilizes the divide-and-conquer
strategy?
* Insertion search
* Bubble search
* Linear search
* Binary search
Binary - answerWhich algorithm requires data sorting as its first step?
* Recursive
* Linear
* Binary
* Merge
Worst case - answerWhat does a time complexity analysis of an algorithm include?
* Memory usage
* Efficiency analysis
* Screen load times
* Worst case
Tree-based data structure - answerWhich data type do heap sorts work with?
* Tree-based data structure
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 $15.49. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
73773 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now