1. Which of the following is NOT a feature of OOP?

• a) Encapsulation

• b) Polymorphism

• c) Recursion

• d) Inheritance

2. Which OOP principle allows different classes to have methods with the same name but different implementations?

• a) Abstraction
  

• b) Encapsulation
  

• c) Inheritance
  

• d) Polymorphism

3. What is the time complexity of searching an element in a balanced binary search tree (BST)?

• a) O(n)
  

• b) O(log n)
  

• c) O(n log n)
  

• d) O(1)

3. 4. What is the primary advantage of using a linked list over an array?
   

• 3. a) Faster access to elements
     

• 3. b) Dynamic size allocation
     

• 3. c) Lower memory usage
     

• 3. d) Constant-time search operation

5. Which CSS property makes an element take up the entire width of its container?

• a) display: block;
  

• b) display: inline;
  

• c) display: flex;
  

• d) display: grid;

6. 6. How much memory does the following structure take?

struct test {

char a;

int b;

char c;

};

• a) 6 bytes
  

• b) 8 bytes
  

• c) 12 bytes
  

• d) 10 bytes

7. Which of the following statements about pointers is correct?

• a) void* pointer cannot be typecasted
  

• b) A pointer can store the address of any variable, regardless of type
  

• c) Dereferencing a NULL pointer is valid
  

• d) Pointer arithmetic is not allowed in C

8. What will happen if you try to free a NULL pointer?

• a) It causes a segmentation fault
  

• b) It causes memory leak
  

• c) It results in undefined behavior
  

• d) It does nothing

9. What is the worst-case time complexity of QuickSort?

• a) O(n)
  

• b) O(n log n)
  

• c) O(n²)
  

• d) O(log n)

10. What is the default display value for a <div> element in HTML?

• a) inline
  

• b) block
  

• c) inline-block
  

• d) grid