questionsBank.title
Algorithmic Excellence: Data Structures & Problem Solving Challenge
إشعار قانوني
questionsBank.legalText
questionsBank.answeredQuestions
What is the time complexity of inserting an element at the end of an ArrayList in Java, assuming the array has sufficient capacity?
- 1O(n)
- 2O(n log n)
- 3O(log n)
- 4O(1)
Which data structure is used by BFS to keep track of the nodes to be visited next?
- 1Stack
- 2Priority Queue
- 3Queue
- 4Dequeue
In a min-heap, what is the complexity of removing the minimum element?
- 1O(n)
- 2O(1)
- 3O(log n)
- 4O(n log n)
Which search algorithm uses the concept of divide and conquer?
- 1Linear Search
- 2Breadth-First Search
- 3Depth-First Search
- 4Binary Search
What is the space complexity of an adjacency matrix used to represent a graph?
- 1O(V+E)
- 2O(V^2+E)
- 3O(V^2)
- 4O(E^2)
Which of the following operations can be implemented in O(1) time in a linked list?
- 1Insertion at the end
- 2Deletion at the end
- 3Insertion at the beginning
- 4Accessing the middle element
In the quicksort algorithm, what is the best-case time complexity?
- 1O(n^2)
- 2O(n log n)
- 3O(n)
- 4O(log n)
What data structure does a HashSet internally use to store elements in Java?
- 1Array
- 2LinkedList
- 3Tree
- 4HashMap
What is the upper bound on the complexity of merging two sorted arrays?
- 1O(log(n+m))
- 2O(n)
- 3O(n + m)
- 4O(n * m)
Which of the following is not a self-balancing binary search tree?
- 1Red-Black Tree
- 2AVL Tree
- 3Binary Search Tree
- 4Splay Tree