ITSC 2214 Midterm Review Questions and answers//LATEST UPDATES, 2024/25/ EXAMS PREDICTION PAPER/

ITSC 2214 Midterm Review Questions and answers/ When using a stack, from where are objects always removed? - -From the top of the stack Assuming the most efficient implementation of a Singly Linked List Stack, what is the cost of the Push() operation? - -O(1) Assuming the most efficient implementation of a Singly Linked List Queue, what is the cost of the Enqueue() operation? - -O(1) If an algorithm is expressed using the equation below, write the complexity using "Big Oh" notation? F(n) = 15n2 + 45n - -O(n^2) Assuming the most efficient implementation of a Singly Linked List Queue, what is the cost of the Dequeue() operation? - -O(1) When using a queue, where are new objects added? - -To the back of the queue When using a queue, from where are objects always removed? - -From the front of the queue Assuming the most efficient implementation of a Singly Linked List Stack, what is the cost of the Pop() operation? - -O(1) When using a stack, where are new objects added? - -To the top of the stack When analyzing the complexity of an algorithm, what is the dominate term? - -The part of the equation that has the greatest impact on its growth as the input increases. How many times is the basic operation execute? ALGORITHM Range (A [0..n-1]) //Input: An Array A[0..n-1] of n real