Exam (elaborations)
Data Structures Final Set: CH 18, 19, 20 Questions and Answers 2024
- Course
- Institution
Data Structures Final Set: CH 18, 19, 20
[Show more]
Content preview
Data Structures Final Set: CH 18, 19, 20The ADT dictionary is appropriate for problems that must manage data by
a. value
b. order
c. priority
d. importance - answerA
What does the ADT dictionary use to identify its entries?
a. it's position in the list
b. a search key
c. its priority
d. what group it belongs to - answerB
Which of the following is not an ADT dictionary operation?
a. add a new entry
b. retrieve an entry
c. sort the entries
d. traverse the entries in sorted search-key order - answerC
Which of the following is the better choice when attempting to add a new entry to a
dictionary where the search key already exists?
a. replace the existing entry with a new entry
b. crash the program
c. throw an exception
d. deny the attempt - answerD
In the header file for the class ArrayDictionary, the text declares which of the following
methods as private?
a. destroyDictionary()
b. isEmpty()
c. getNumberOfEntries()
d. clear() - answerA
In the class ArrayDictionary declared by the text, which of the following methods bears
the responsibility for keeping the array items sorted?
a. remove
b. add
c. getValue
d. traverse - answerB
, According to the text, for the ADT dictionary, in which of the following situations would a
sorted array-based implementation be appropriate for frequent retrievals?
a. when the maximum size is unknown
b. when the maximum size is known
c. when you have duplicate search keys
d. when search keys are all similar. - answerC
According to the text, for the ADT dictionary, what implementation should be used when
you do not know the maximum size of the dictionary?
a. link-based
b. array-based
c. max-heap
d. binary search tree - answerD
According to the text, for the ADT dictionary, a sorted array-based implementation will
shift data during what two operations?
a. additions and removals
b. additions and traversals
c. removals and traversals
d. searches and gets - answerA
Which of the following dictionary operations has efficiency O(n) no matter what
implementation if the ADT dictionary is chosen?
a. retrieval
b. traversal
c. removal
d. addition - answerB
What is the implementation of the ADT dictionary which has efficiency O(log n) for
addition?
a. unsorted link-based
b. sorted array-based
c. binary search tree
d. sorted link-based - answerC
. What is the implementation of the ADT dictionary which has efficiency O(1) for
addition?
a. sorted link-based
b. sorted array-based
c. binary search tree
d. unsorted link-based - answerD
What kind of function tells you where a dictionary entry is currently or will be placed if it
is new?
a. hash function
b. logarithmic function
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.99. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
81531 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now