COMPREHENSIVE PRACTICE QUESTIONS
VERIFIED CORRECT ANSWERS BIG O
NOTATION, ALGORITHM ANALYSIS, TIME
& SPACE COMPLEXITY, DATA
STRUCTURES & COMPUTER SCIENCE
EXAM STUDY GUIDE | GRADE A+ STUDY
RESOURCE
O(n) - CORRECT ANSWER -Add item to the middle of a link-based list
(ADT)
O(1) - CORRECT ANSWER -Add item to the end of a link-based list (ADT)
O(n) - CORRECT ANSWER -Remove item from the beginning of an array-
based list (ADT)
O(n) - CORRECT ANSWER -Remove item from the middle of an array-based
list (ADT)
O(1) - CORRECT ANSWER -Remove item from the end of an array-based list
(ADT)
, O(1) - CORRECT ANSWER -Remove item from the beginning of a (doubly)
link-based list (ADT)
O(n) - CORRECT ANSWER -Remove item from the middle of a link-based
list (ADT)
O(1) - CORRECT ANSWER -Remove item from the end of a link-based list
with sentinel node (ADT)
O(n) - CORRECT ANSWER -Find a value in an array-based list
O(n) - CORRECT ANSWER -Find a value in a link-based list
O(1) - CORRECT ANSWER -Find the size of an array-based list
O(1) - CORRECT ANSWER -Get an item based on index an array-based list
O(1) - CORRECT ANSWER -Set an index to a value in an array-based list
O(1) - CORRECT ANSWER -Find the size of a link-based list
O(n) - CORRECT ANSWER -Get an item based on index a link-based list
O(n) - CORRECT ANSWER -Set an index to a value in a link-based list