CPS 181 FINAL EXAM REVIEW WITH ALL CORRECT &
100% VERIFIED ANSWERS|LATEST UPDATE|ALREADY
GRADED A+
A data type describes by predefined user operations. ✔Correct Answer-Abstract data type (ADT)
A common ADT for holding ordered data. ✔Correct Answer-List
Each item in a list ADT is referred to as a node. ✔Correct Answer-Node
A way of organizing data, commonly used to implement an ADT and often involving arrays or
pointers. ✔Correct Answer-Data structure
A data structure for implementing a list ADT, where each node has data and a pointer to the next
node. ✔Correct Answer-Singly-linked list
A singly-linked lists' first node. ✔Correct Answer-Head
A singly-linked lists' last node. ✔Correct Answer-Tail
Inserts the new node after a provided existing list node. ✔Correct Answer-InsertAfter(singly-linked
list)
Removes the node after the specified node. ✔Correct Answer-RemoveAfter(singly-linked list)
A data structure for implementing a list ADT, where each node ✔Correct Answer-Doubly-linked list
An algorithm that visits all the nodes in the once and performs an operation on each node.
✔Correct Answer-List traversal
Visits all nodes starting with the list's tail node and ending after visiting the list's head node.
✔Correct Answer-Reverse traversal
An algorithm that returns the first node whose data matches the key. ✔Correct Answer-Search
An ADT in which items are only inserted on or removed form the top of the stack. ✔Correct
Answer-Stack
Inserts an item on the top of the stack. ✔Correct Answer-Push (stack)
Removes and returns the item on the top of the stack. ✔Correct Answer-Pop (stack)
A stack is referred to as a last in first out ADT. ✔Correct Answer-Last in First out
An ADT in which items are inserted at the end of the queue and removed from the front of the
queue. ✔Correct Answer-Queue
Inserts an item at the end of the queue. ✔Correct Answer-Push (queue)
100% VERIFIED ANSWERS|LATEST UPDATE|ALREADY
GRADED A+
A data type describes by predefined user operations. ✔Correct Answer-Abstract data type (ADT)
A common ADT for holding ordered data. ✔Correct Answer-List
Each item in a list ADT is referred to as a node. ✔Correct Answer-Node
A way of organizing data, commonly used to implement an ADT and often involving arrays or
pointers. ✔Correct Answer-Data structure
A data structure for implementing a list ADT, where each node has data and a pointer to the next
node. ✔Correct Answer-Singly-linked list
A singly-linked lists' first node. ✔Correct Answer-Head
A singly-linked lists' last node. ✔Correct Answer-Tail
Inserts the new node after a provided existing list node. ✔Correct Answer-InsertAfter(singly-linked
list)
Removes the node after the specified node. ✔Correct Answer-RemoveAfter(singly-linked list)
A data structure for implementing a list ADT, where each node ✔Correct Answer-Doubly-linked list
An algorithm that visits all the nodes in the once and performs an operation on each node.
✔Correct Answer-List traversal
Visits all nodes starting with the list's tail node and ending after visiting the list's head node.
✔Correct Answer-Reverse traversal
An algorithm that returns the first node whose data matches the key. ✔Correct Answer-Search
An ADT in which items are only inserted on or removed form the top of the stack. ✔Correct
Answer-Stack
Inserts an item on the top of the stack. ✔Correct Answer-Push (stack)
Removes and returns the item on the top of the stack. ✔Correct Answer-Pop (stack)
A stack is referred to as a last in first out ADT. ✔Correct Answer-Last in First out
An ADT in which items are inserted at the end of the queue and removed from the front of the
queue. ✔Correct Answer-Queue
Inserts an item at the end of the queue. ✔Correct Answer-Push (queue)
