With C: Data Structures

: Define a pointer to a pointer. How is it used to manipulate a 2D array dynamically?

Answer any three questions. Each carries 10 marks. 5. : Write a C function to insert a node at a specific position in a Singly Linked List . Include the node structure definition.6. Stacks : Implement the push() and pop() operations for a stack using an array. Describe a scenario where a stack is used in system programming (e.g., function calls).7. Queues : Explain the "Circular Queue" and how it solves the limitation of a standard linear queue. Provide the condition for "Queue Full" in a circular implementation.8. Applications : Show the step-by-step conversion of the infix expression to its Postfix equivalent using a stack. Section C: Non-Linear Data Structures (30 Marks) Expert Data Structures with C | Request PDF - ResearchGate Data Structures with C

: Define an Abstract Data Type (ADT). Provide the ADT for a Stack . Complexity : Briefly explain Big-O notation. Why is preferred over for large datasets? Section B: Linear Data Structures (30 Marks) : Define a pointer to a pointer

: Contrast malloc() and calloc() with their respective C syntax. Explain the role of free() in preventing memory leaks. Each carries 10 marks