Technical Quiz
Authored by Srijha Srijha
Engineering
Professional Development
Used 1+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
5 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
45 sec • 2 pts
What is the amortized time complexity of inserting an element into a dynamic array (resizable array)
when doubling its size?
O(1)
O(n)
O(log n)
O(n log n)
2.
MULTIPLE CHOICE QUESTION
45 sec • 2 pts
Which of the following tree data structures provides the most optimal search time complexity in
a dynamic environment with frequent insertions and deletions?
AVL Tree
Red-Black Tree
Splay Tree
B-Tree
3.
MULTIPLE CHOICE QUESTION
45 sec • 2 pts
Which of the following statements about NP-Complete problems is TRUE?
All NP problems are NP-Complete
If any NP-Complete problem is solved in polynomial time, P = NP
NP-Complete problems have known polynomial-time solutions
All NP problems are harder than NP-Complete problems
4.
MULTIPLE CHOICE QUESTION
45 sec • 2 pts
Which of the following memory allocation techniques suffers from internal fragmentation?
Paging
Segmentation
Buddy System
Best Fit Allocation
5.
MULTIPLE CHOICE QUESTION
45 sec • 2 pts
In a multi-threaded program, which of the following statements is TRUE about mutex
and semaphore?
A mutex can be used for multiple resource access, while a semaphore is for single resource access
A semaphore allows multiple threads to enter a critical section, while a mutex allows only one
A mutex allows multiple threads to enter a critical section simultaneously
A semaphore provides stronger mutual exclusion than a mutex
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Microsoft
or continue with
%20(1).png)
Apple
Others
Already have an account?
