1. What is the time complexity of inserting an element at the end of an array, assuming the array has n elements?

2. Explain the difference between a stack and a queue data structure.

3. What is the purpose of a hash table, and how does it achieve efficient key-value lookup?

4. Describe the concept of recursion and provide an example of a recursive algorithm.

5. Compare and contrast the efficiency of bubble sort and quicksort algorithms.

6. What is the difference between a binary tree and a binary search tree?

7. Explain the concept of dynamic programming and provide an example problem that can be solved using this technique.

8. What is the difference between breadth-first search (BFS) and depth-first search (DFS) algorithms? In which scenarios would you prefer to use each?

9. What is the purpose of a heap data structure, and how does it differ from a binary search tree?

10. What is the difference between a linked list and an array, and what are the advantages and disadvantages of each?

Answer rating: 100% (QA)

The detailed answer for the above question is provided below 1 The time complexity of inserting an element at the end of an array is O1 constant time It does not depend on the size of the array since ... View the full answer