CS 1332 Exam 1 Big O Complexities Questions With Correct Answers

CS 1332 Exam 1 Big O Complexities
Questions With Correct Answers

ArrayList |remove/addAtIndex |- |CORRECT |ANSWER✔✔-O(n)



ArrayList |removeFromFront |- |CORRECT |ANSWER✔✔-O(n)



ArrayList |removeFromBack |- |CORRECT |ANSWER✔✔-O(1)



ArrayList |get |- |CORRECT |ANSWER✔✔-O(1)



ArrayList |addToFront |- |CORRECT |ANSWER✔✔-O(n)



ArrayList |addToBack |- |CORRECT |ANSWER✔✔-O(1)



ArrayList |accessing |by |index |- |CORRECT |ANSWER✔✔-O(1)



SLL |addToFront |- |CORRECT |ANSWER✔✔-O(1)



SLL |addToBack |- |CORRECT |ANSWER✔✔-O(n)



SLL |removeFromFront |- |CORRECT |ANSWER✔✔-O(1)



SLL |removeFromBack |(no |tail) |- |CORRECT |ANSWER✔✔-O(n)

, SLL |add/removeAtIndex |- |CORRECT |ANSWER✔✔-O(n)



DLL |add/removeAtIndex |- |CORRECT |ANSWER✔✔-O(n)



DLL |addToFront |- |CORRECT |ANSWER✔✔-O(1)



DLL |addToBack |- |CORRECT |ANSWER✔✔-O(1)



DLL |removeFromFront |- |CORRECT |ANSWER✔✔-O(1)



DLL |removeFromBack |- |CORRECT |ANSWER✔✔-O(1)



DLL |lastOccurrence |- |CORRECT |ANSWER✔✔-O(n)



DLL |get |- |CORRECT |ANSWER✔✔-O(n)



DLL |toArray |- |CORRECT |ANSWER✔✔-O(n)



Array-backed |Stack |access |- |CORRECT |ANSWER✔✔-O(1)



Array-backed |Stack |search |- |CORRECT |ANSWER✔✔-O(n)



Array-backed |Stack |adding |- |CORRECT |ANSWER✔✔-O(n)



Array-backed |Stack |removing |- |CORRECT |ANSWER✔✔-O(n)