Exam (elaborations)
DSA 1. Data Structures Questions and Answers
- Course
- Institution
DSA 1. Data Structures
[Show more]
Content preview
DSA 1. Data Structures• It is a linear ordered collection of values called elements.
• It has a variable size.
• It supports direct access by index. - answerSelect all of the statements that are true
regarding the structure of an *Array List*.
• The key of any node has a value >= all key values in its sub-trees
• It is a linear ordered collection of values called elements.
• The underlying structure is often a heap.
• It has a fixed size.
• The key at the root node has the minimum key value among all nodes.
• It has a variable size.
• It includes a set of edges that connect pairs of nodes.
• It supports direct access by index.
• Each node contains a pair of pointers (or references) to two other nodes.
• All of the elements are located contiguously in memory.
• It supports direct access by index.
• All of the elements are of the same type. - answerSelect all of the statements that are
true regarding the structure of an *Array*.
• It has a variable size.
• Each value has an associated "priority" value.
• The values are stored and removed to satisfy last-in-first-out (LIFO) access property.
• All of the elements are located contiguously in memory.
• It supports direct access by index.
• Each node contains a pair of pointers or references to two other nodes.
• The last node in the sequence contains a pointer (or reference) to the first node in the
sequence.
• The values are stored and removed to satisfy the property that an element with high
priority is served before an element with low priority.
• All of the elements are of the same type.
• It is a collection of nodes called vertices.
• Its edges are one-directional.
• It includes a set of edges that connect pairs of nodes. - answerSelect all of the
statements that are true regarding the structure of a *Directed Graph*.
• Each node has an extra bit of data that is used to ensure the structure remains
approximately balanced during insertions and deletions.
• It is a collection of nodes called vertices.
, • The keys are always stored to satisfy the Binary Search Tree (BST) property.
• The key of any node has a value <= all key values in its sub-trees
• The underlying structure is often a heap.
• Its edges are one-directional.
• It uses a hash function to compute an index into an array of buckets or slots, from
which the desired value can be found or stored.
• The keys are always stored to satisfy the Min Heap property.
• It includes a set of edges that connect pairs of nodes.
• It is a collection of nodes called vertices.
• There may be cycles (circular references) in the structure.
• It includes a set of edges that connect pairs of nodes. - answerSelect all of the
statements that are true regarding the structure of a *Graph*.
• It is a collection of nodes called vertices.
• The key of any node has a value <= all key values in its sub-trees
• Each node has an extra bit of data that is used to ensure the structure remains
approximately balanced during insertions and deletions.
• The keys are always stored to satisfy the Binary Search Tree (BST) property.
• The last node in the sequence contains a pointer (or reference) to the first node in the
sequence.
• There may be cycles (circular references) in the structure.
• It includes a set of edges that connect pairs of nodes.
• Its edges each include a weight value.
• The values are stored and removed to satisfy first-in-first-out (FIFO) access property.
• Its edges each include a weight value.
• It includes a set of edges that connect pairs of nodes.
• It is a collection of nodes called vertices. - answerSelect all of the statements that are
true regarding the structure of a *Weighted Graph*.
• The key at the root node has the minimum key value among all nodes.
• It supports direct access by index.
• Its edges each include a weight value.
• All of the elements are located contiguously in memory.
• It includes a set of edges that connect pairs of nodes.
• The key of any node has a value <= all key values in its sub-trees
• The values are stored and removed to satisfy first-in-first-out (FIFO) access property.
• It is a collection of nodes called vertices.
• The key of any node has a value >= all key values in its sub-trees
• It is a collection of values mapped to keys.
• The underlying data structure is often an array.
• It uses a hash function to compute an index into an array of buckets or slots, from
which the desired value can be found or stored. - answerSelect all of the statements
that are true regarding the structure of a *Hash Table*.
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 $14.99. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
77254 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now