Technical Quiz

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)

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

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

Which of the following memory allocation techniques suffers from internal fragmentation?

• Paging

• Segmentation

• Buddy System

• Best Fit Allocation

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