Data Structure and Algorithms

What is the time complexity of accessing an element in an array?

• O(1)

• O(n^2)

• O(n)

• O(log n)

What is the optimal Time complexity of finding number of nodes in a linked list?

• O(1)

• O(n)

• O(log n)

• none of the above

Explain the concept of bubble sort and its time complexity.

• Bubble sort is a sorting technique with a time complexity of O(n)

• Bubble sort is a complex sorting algorithm with a time complexity of O(log n)

• Bubble sort is a simple sorting algorithm with a time complexity of O(n^2) in the worst-case scenario.

• Bubble sort is an algorithm that guarantees sorting in linear time

How do you insert a node at the beginning of a linked list?

• Insert the new node at the end of the linked list

• Do nothing and keep the linked list as is

• Delete the current head node and set the new node as the head

• Create a new node, set its next pointer to the current head, and update the head to the new node.

What is the difference between linear search and binary search?

• Binary search is a sequential search algorithm.

• Linear search has a time complexity of O(n), while binary search has a time complexity of O(log n).

• Linear search has a time complexity of O(log n), while binary search has a time complexity of O(n).

• Linear search is more efficient than binary search.

How does a stack differ from a queue?

• In a stack, elements are added and removed from the same end (top), while in a queue, elements are added at the rear and removed from the front.

• A queue is a LIFO (Last In First Out) data structure, unlike a stack.

• A stack allows elements to be accessed randomly, while a queue follows a first-in-first-out order.

• In a stack, elements are added at the front and removed from the rear.

Explain the concept of recursion with an example.

• Recursion is a programming technique where a function calls a built-in library function to solve a problem.

• Recursion is a programming technique where a function calls another function to solve a problem.

• Recursion is a programming technique where a function calls a variable to solve a problem.

• Recursion is a programming technique where a function calls itself to solve a problem. An example is the factorial function.

What is the process of reversing an array in-place?

• Reverse the array by creating a new array and copying elements in reverse order

• Swap the first element with the last, the second with the second-to-last, and so on until the middle of the array is reached.

• Sort the array in descending order to achieve reversal

• Use a stack data structure to reverse the array

Describe the working of the merge sort algorithm.

• Merge sort algorithm works by selecting the largest element in the array and moving it to the end

• Merge sort algorithm works by randomly shuffling the input array before sorting

• Merge sort algorithm works by sorting the array in reverse order

• Merge sort algorithm works by recursively dividing the input array into two halves, sorting each half, and then merging the sorted halves back together.

How do you delete a node from a singly linked list?

• Update the 'next' pointer of the previous node to point to the node after the one to be deleted.

• Update the 'previous' pointer of the next node to point to the node before the one to be deleted

• Change the data value of the node to null

• Delete the node directly without updating any pointers