نشامى
وضع الدراسة · Algorithmic Excellence: Data Structures & Problem Solving Challenge
بنك الأسئلة
Algorithmic Excellence: Data Structures & Problem Solving Challenge
ملخص الإنجاز0/25 · 0%
الأسئلة وإجاباتها
25 questionsBank.questionsCount
1
What is the time complexity of inserting an element at the end of an ArrayList in Java, assuming the array has sufficient capacity?
- أO(n)
- بO(n log n)
- تO(log n)
- O(1)
2
Which data structure is used by BFS to keep track of the nodes to be visited next?
- أStack
- بPriority Queue
- Queue
- ثDequeue
3
In a min-heap, what is the complexity of removing the minimum element?
- أO(n)
- بO(1)
- O(log n)
- ثO(n log n)
4
Which search algorithm uses the concept of divide and conquer?
- أLinear Search
- بBreadth-First Search
- تDepth-First Search
- Binary Search
5
What is the space complexity of an adjacency matrix used to represent a graph?
- أO(V+E)
- بO(V^2+E)
- O(V^2)
- ثO(E^2)
6
Which of the following operations can be implemented in O(1) time in a linked list?
- أInsertion at the end
- بDeletion at the end
- Insertion at the beginning
- ثAccessing the middle element
7
In the quicksort algorithm, what is the best-case time complexity?
- أO(n^2)
- بO(n log n)
- O(n)
- ثO(log n)
8
What data structure does a HashSet internally use to store elements in Java?
- أArray
- بLinkedList
- تTree
- HashMap
9
What is the upper bound on the complexity of merging two sorted arrays?
- أO(log(n+m))
- بO(n)
- O(n + m)
- ثO(n * m)
10
Which of the following is not a self-balancing binary search tree?
- أRed-Black Tree
- بAVL Tree
- Binary Search Tree
- ثSplay Tree