1. Placement Question
2. C Interview Questions
3. C Multiple Choice Questions

C Multiple Choice Questions

1. The best data structure to check whether an arithmetic expression has balanced parenthesis is a
   1. Queue
   2. Stack
   3. Tree
   4. List

---

2. Which of the following data structures is useful in traversing a given graph by Depth first search(DFS)?
   1. Stack
   2. Queue
   3. List
   4. None of the above

---

---

3. Which of the following data structures is useful in traversing a given graph by Breadth first search(BFS)?
   1. Stack
   2. Queue
   3. List
   4. Tree

---

4. Which one of the following in-place sorting algorithms needs the minimum number of swaps?
   1. Insertion Sort
   2. Quick Sort
   3. Heap Sort
   4. Selection Sort

---

5. Why we use malloc and calloc for
   1. Dynamic memory allocation
   2. Static memory allocation
   3. Both dynamic and static memory allocation
   4. None of the above

---

6. An array is
   1. Probably the most widely used data structure
   2. a homogeneous structure
   3. a random access structure
   4. All of the above

---

---

7. The ________ operator is true only when both the operands are true.
   1. or
   2. and
   3. boolean
   4. bitwiseor

---

8. ________ function is used to move the file position to desired location within the file.
   1. fread
   2. fwrite
   3. fseek
   4. fscanf

---