C-Dynamic Memory Allocation and Data Structure Questions and Answers

Take Exam

Data Structure and Algorithms questions with answers are crucial for technical interviews and competitive exams like GATE, Infosys, and TCS. This topic tests understanding of arrays, linked lists, stacks, queues, trees, and sorting algorithms. Programming interview questions with answers in this section focus on time complexity, optimization, and problem-solving efficiency. Practicing DSA MCQs strengthens core programming logic, helping candidates excel in both written tests and coding interviews.

Detailed questions on dynamic memory use. For further practice, try database data models and data structures algorithms

C-Dynamic Memory Allocation and Data Structure

Showing 10 of 104 questions

1. State the incorrect statement.

  • Only user defined functions can be involved in the recursion.
  • Library function can't be involved in the recursion
  • STack data structure can be used to implement recursion.
  • None of these
Show Answer Report

2. Which of the following method is implemented in stack

  • FIFO
  • FILO
  • LILO
  • None of these
Show Answer Report

3. Which of the following is used for dynamic data structure ?

  • Linked list
  • Array
  • Graph
  • Stack
Show Answer Report

4. The different models used to organize data in the secondary memory are collectively called as

  • File structures
  • Data structure
  • Self referential structures
  • Union
Show Answer Report

5. To establish link between elements with different memory address is called as

  • Array
  • Linked list
  • Structure
  • Union
Show Answer Report

6. Which of the following is true about the corruptedlist ?

  • If there is a loop in the list it is called corrupted list.
  • If there is not end in the list it is called corrupted list.
  • If the list doesn't contain any data it is called a corrupted list.
  • Both a & b
Show Answer Report

7. In the linked list implementation of the queue clas, where does the push member function place the new entry on the linked list ?

  • At the head
  • Att the tail
  • After all other entries that are greater than the new entry.
  • After all other entries that are smaller than the new entry
Show Answer Report

8. Which of the following is not a limitation of linked list ?

  • It takes more memory in comparison to array.
  • Linked list can't be visited randomly.
  • Dynamic data structure can be implemented in linked list
  • None of the above.
Show Answer Report

9. Which of the following is not an application o linked list?

  • Polynomial manipulation
  • linked dictionary
  • Addition of long positive integers
  • None of the above
Show Answer Report

10. Which element will be the last to be popped outl if 7,11,9,55 is pushed in to a satck

  • 55
  • 7
  • 9
  • 11
Show Answer Report
Questions and Answers for Competitive Exams Various Entrance Test