Which of the following operations has the WORST time complexity for an array of N elements? Accessing an element by index. Inserting an element at the beginning. Deleting an element from the middle. Searching for an element using linear search.1 pointA singly linked list is most efficient for ____________ operations? Accessing Inserting Searching Traversing1 pointWhat is the main advantage of a doubly linked list over a singly linked list? More efficient memory usage. Faster element insertion and deletion. Ability to traverse the list in both directions. Easier implementation of stacks.1 point______data structure is most suitable for implementing a stack Array Linked list Tree Graph1 pointThe push and pop operations of a stack have a time complexity of____ O(1) for both. O(log n) for both. O(1) for push, O(n) for pop. O(n) for push, O(1) for pop.1 point What happens when you try to pop an element from an empty stack? The program crashes. The top element is returned and removed. An error message is displayed. Nothing happens.1 pointWhich of the following is NOT a common application of stacks? Undo/redo functionality in software. Expression evaluation in compilers. Managing function calls in recursion. Implementing queues efficiently.1 pointCan you implement a stack using a doubly linked list? Yes, by using one pointer as the "top". No, stacks require LIFO order, which is not possible with doubly linked lists. Yes, but it would be less efficient than using an array. No, stacks must be implemented using contiguous memory blocks.1 pointConsider an array A with N elements. Which of the following algorithms has the BEST time complexity for finding the minimum element in A? Bubble sort. Linear search. Selection sort. Insertion sort.1 point__________ is the space complexity of a linked list with N nodes? O(1) O(log N) O(N) O(N^2)1 pointHow can you efficiently reverse the order of the elements in a singly linked list? Iterate through the list and swap elements in pairs. Create a new list and add elements in reverse order. Use recursion to recursively reverse sub-lists. Reverse the pointers of each node in the list.1 point_____ of the following operations cannot be performed efficiently on an array? Accessing an element by index. Searching for an element using binary search. Inserting an element at the end. Deleting an element from the beginning.1 point________ is the difference between a push operation and a peek operation in a stack? push adds an element, peek does not. push removes the top element, peek returns it. push adds an element to the bottom, peek returns the top element. push stores the element temporarily, peek permanently adds it.1 pointWhen might you choose to use a linked list instead of an array? When the size of the data structure is unknown beforehand. When frequent insertions and deletions are needed. When faster random access is required. When you need to store data of different types.1 point_______ is the time complexity of searching for an element in a doubly linked list with N nodes O(1) O(log N) O(N) O(N^2)1 pointWhen implementing a circular buffer using an array, ___ operation has the WORST time complexity enqueuing dequeuing Checking if the buffer is full Checking if the buffer is empty1 point_____ data structure is most efficient for representing a balanced binary tree Array Linked list Doubly linked list Tree1 pointConsider two stacks S1 and S2. How can you efficiently transfer all elements from S1 to S2 without using any additional data structures? Use recursion to repeatedly pop from S1 and push to S2. Create a temporary stack S3, move elements from S1 to S3, then reversely move them to S2. Directly access the internal arrays of both stacks and copy elements. It is impossible to transfer elements directly between stacks with different implementations.1 point________ is the space complexity of a recursive function call stack? O(1) O(log N) O(N) O(N^2)1 pointYou are implementing a cache system with fixed capacity using an array. Which algorithm is best suited for efficiently evicting the least recently used (LRU) element when the cache is full? First-in, first-out (FIFO) policy Last-in, first-out (LIFO) policy Doubly linked list with head and tail pointers Hash table with timestamps for each element