DSA 1: DATA STRUCTURES EXAM
QUESTIONS WITH CORRECT
ANSWERS
• It is a linear ordered collection of values called elements.
• It has a variable size.
• It supports direct access by index. - Correct Answers -Select 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. - Correct Answers -Select 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. - Correct Answers -Select 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. - Correct Answers -Select 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. - Correct Answers -Select 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
QUESTIONS WITH CORRECT
ANSWERS
• It is a linear ordered collection of values called elements.
• It has a variable size.
• It supports direct access by index. - Correct Answers -Select 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. - Correct Answers -Select 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. - Correct Answers -Select 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. - Correct Answers -Select 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. - Correct Answers -Select 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
