CSE 310 ARIZONA STATE UNIVERSITY -
FOR DATA STRUCTURE AND ALGORITHM -
ASU CERTIFICATION SCRIPT 2026
QUESTIONS WITH SOLUTIONS GRADED A+
◍ When something is retrieved from a stack, does it come from the top or
bottom of the stack?.
Answer: Top
◍ Anne.
Answer: What is the root node for this tree? Anne / \ Peter Zara | Savannah
◍ Grows and shrinks as needed.
Answer: What is the advantage that a linked list has over an array?* Grows
and shrinks as needed* Allows for random access* Less memory needed for
each element* Faster search time
◍ Record.
Answer: Which term refers to a data structure that groups related items of
data together?* Pointer* Graph* Record* Hash table
◍ Hash Table.
Answer: Which data structure is used to store unordered items by mapping
each item to a location in an array?* Stack* List* Dictionary* Hash table
◍ Collections.
Answer: Which tool in Python is used to implement a deque ADT?*
Abstraction* String* Collections* Robust
◍ An example of this type of function is doubly nested loop.
Answer: O(n^2)
,◍ Which method removes all keys from a dictionary?.
Answer: keys();
◍ 6.
Answer: How many elements in a list of size 64 would be visited when
using a binary search for a number that is smaller than all the values in the
list?
◍ What are in-order traversals useful for?.
Answer: Sorting trees from least to greatest
◍ A data structure that stores unordered items by mapping (or hashing) each
item to a location in an array..
Answer: hash table
◍ Give a coded example on how to create a 3 chained linked list of nodes..
Answer: Node head = new Node(1);head.Next = new
Node(2);head.Next.Next = new Node(3);
◍ 1,8,9,3,5.
Answer: What is the resulting stack when the push(1) function is
implemented on this stack yield?8,9,3,5(top is 8)* 8,9,3,5,1* 8,9,3,5*
1,8,9,3,5* 8,9,3,1
◍ It consists of variables and methods.
Answer: Which characteristic of a class allows it to be used as an abstract
data type (ADT)?* Overloading* Instantiation* It consists of variables and
methods* Overriding
◍ What two things do nodes contain?.
Answer: 1. the value2. reference to next item in the list
◍ At most how many children can each node have in a binary tree?.
Answer: two
◍ A secure hashing algorithm cannot be inverted (the input derived from the
output hash).
Answer: Security
, ◍ How can a node with One Child be removed from a tree?.
Answer: Promote the child
◍ Interval Search.
Answer: Which search algorithm has the best performance when the data set
is sorted?* Sequential search* List search* Interval search* Linear search
◍ A modulo hash function for a 50 entry hash table is: key % _____.
Answer: 50
◍ stack.
Answer: Which abstract data type (ADT) allows operations at one end
only?* Stack* List* Queue* String
◍ Do While.
Answer: Which loop type will always be done at least once?* For* Do
while* While* Foreach
◍ A Last-in, First-out (LIFO) data container.
Answer: Stack
◍ Each node in a Tree has at least ______ parent, but the number of children
depends on the type of tree.
Answer: one
◍ Adds the specified item to the linked list in the sort order of the item type.
Answer: Add
◍ Recursive.
Answer: Which function is used in conjunction with a merge sort
algorithm?* For loop* If statement* Do while loop* Recursive
◍ 8.
Answer: What will the peek() operation from this stack return? 8,9,3,5(top is
8)* 4* 1* 3* 8
◍ 2.
Answer: How many leaf nodes does this tree have? Anne / \ Peter Zara |
FOR DATA STRUCTURE AND ALGORITHM -
ASU CERTIFICATION SCRIPT 2026
QUESTIONS WITH SOLUTIONS GRADED A+
◍ When something is retrieved from a stack, does it come from the top or
bottom of the stack?.
Answer: Top
◍ Anne.
Answer: What is the root node for this tree? Anne / \ Peter Zara | Savannah
◍ Grows and shrinks as needed.
Answer: What is the advantage that a linked list has over an array?* Grows
and shrinks as needed* Allows for random access* Less memory needed for
each element* Faster search time
◍ Record.
Answer: Which term refers to a data structure that groups related items of
data together?* Pointer* Graph* Record* Hash table
◍ Hash Table.
Answer: Which data structure is used to store unordered items by mapping
each item to a location in an array?* Stack* List* Dictionary* Hash table
◍ Collections.
Answer: Which tool in Python is used to implement a deque ADT?*
Abstraction* String* Collections* Robust
◍ An example of this type of function is doubly nested loop.
Answer: O(n^2)
,◍ Which method removes all keys from a dictionary?.
Answer: keys();
◍ 6.
Answer: How many elements in a list of size 64 would be visited when
using a binary search for a number that is smaller than all the values in the
list?
◍ What are in-order traversals useful for?.
Answer: Sorting trees from least to greatest
◍ A data structure that stores unordered items by mapping (or hashing) each
item to a location in an array..
Answer: hash table
◍ Give a coded example on how to create a 3 chained linked list of nodes..
Answer: Node head = new Node(1);head.Next = new
Node(2);head.Next.Next = new Node(3);
◍ 1,8,9,3,5.
Answer: What is the resulting stack when the push(1) function is
implemented on this stack yield?8,9,3,5(top is 8)* 8,9,3,5,1* 8,9,3,5*
1,8,9,3,5* 8,9,3,1
◍ It consists of variables and methods.
Answer: Which characteristic of a class allows it to be used as an abstract
data type (ADT)?* Overloading* Instantiation* It consists of variables and
methods* Overriding
◍ What two things do nodes contain?.
Answer: 1. the value2. reference to next item in the list
◍ At most how many children can each node have in a binary tree?.
Answer: two
◍ A secure hashing algorithm cannot be inverted (the input derived from the
output hash).
Answer: Security
, ◍ How can a node with One Child be removed from a tree?.
Answer: Promote the child
◍ Interval Search.
Answer: Which search algorithm has the best performance when the data set
is sorted?* Sequential search* List search* Interval search* Linear search
◍ A modulo hash function for a 50 entry hash table is: key % _____.
Answer: 50
◍ stack.
Answer: Which abstract data type (ADT) allows operations at one end
only?* Stack* List* Queue* String
◍ Do While.
Answer: Which loop type will always be done at least once?* For* Do
while* While* Foreach
◍ A Last-in, First-out (LIFO) data container.
Answer: Stack
◍ Each node in a Tree has at least ______ parent, but the number of children
depends on the type of tree.
Answer: one
◍ Adds the specified item to the linked list in the sort order of the item type.
Answer: Add
◍ Recursive.
Answer: Which function is used in conjunction with a merge sort
algorithm?* For loop* If statement* Do while loop* Recursive
◍ 8.
Answer: What will the peek() operation from this stack return? 8,9,3,5(top is
8)* 4* 1* 3* 8
◍ 2.
Answer: How many leaf nodes does this tree have? Anne / \ Peter Zara |
