Scribd
Upload
41 views3 pages

Repeated Questions List DSA

The document is a list of questions related to Data Structures and Algorithms (DSA) in C, categorized by marks. It includes 2 marks questions covering definitions and basic concepts, 5 marks questions involving explanations, programs, and comparisons, and 5 or 10 marks questions focusing on practical implementations and operations. The questions encompass topics such as pointers, memory allocation, recursion, stacks, queues, linked lists, and expression conversions.

Uploaded by

gajananchinchali5
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
41 views3 pages

Repeated Questions List DSA

The document is a list of questions related to Data Structures and Algorithms (DSA) in C, categorized by marks. It includes 2 marks questions covering definitions and basic concepts, 5 marks questions involving explanations, programs, and comparisons, and 5 or 10 marks questions focusing on practical implementations and operations. The questions encompass topics such as pointers, memory allocation, recursion, stacks, queues, linked lists, and expression conversions.

Uploaded by

gajananchinchali5
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Repeated Questions List with Marks (DSA in C)

2 Marks Questions

- Define Data structures.

- List the operation on data structures.

- Define Pointer.

- How is pointer declared? Give Example.

- What is a pointer to a pointer?

- List the operators used with the pointer & state its uses.

- What is calloc function? Write a syntax of calloc?

- What is malloc function? Write a syntax of malloc?

- What is realloc function? Write a syntax of realloc?

- What is free function? Write a syntax of free?

- Differentiate between: Calloc and malloc, Calloc and realloc, Malloc and free

- What is recursion? Explain with an example.

- Explain types of recursion with example.

- Define Stack.

- Define push and pop operations.

- Define postfix, prefix and infix notations (any one).

- What is queue?

- What is the disadvantage of a linear queue?

- Define circular queue.

- State the difference between stacks and queues.

- What is linked list?

- Define a node in a singly linked list.

- List the operations performed on linked list.

- Define Tree? Give an example.


- Define binary tree? Give an example.

- Define tree terms: node, root, parent, siblings, level, etc.

5 Marks Questions

- Explain the classification of Data structure.

- What is primitive & non-primitive Data structure?

- Write a program to demonstrate accessing elements of an array using base address.

- Pointers & structures / Pointers & functions / Pointers & arrays / Pointers & strings.

- What is dynamic memory allocation explain.

- State the difference between static & dynamic memory allocation.

- Explain malloc(), calloc(), realloc(), free() with syntax and example.

- Compare and contrast recursion & iteration.

- Write a program for: Factorial using recursion, nth Fibonacci, GCD, Binomial coefficient, Tower of

Hanoi

- Explain any sorting technique (bubble, quick, selection, insertion, merge).

- Write a program for linear/binary search, sorting (any technique).

- What is Stack? Write applications.

- Explain stack creation with syntax & example.

- Explain PUSH(), POP(), DISPLAY() operations.

- Conversion of infix to postfix.

- Evaluation of postfix using stack.

- Write a C program: Stack, Postfix evaluation, Infix to postfix

- Explain queue creation / circular queue / double-ended queue (Dqueue).

- Program for simple/circular queue.

- What is the drawback of linear queue? How to overcome it?

- Explain singly/doubly/circular linked lists.

- Program to insert/delete/display in linked list.


- Explain preorder, postorder, inorder traversal.

5 or 10 Marks Questions

- Programs based on: Pointer operations (array, structure, string)

- Dynamic memory allocation functions

- Recursion programs (Factorial, Fibonacci, GCD, etc.)

- Stack implementation

- Queue (Simple, Circular, Dqueue) implementation

- Linked List operations (insert, delete, display)

- Expression conversion (Infix <-> Postfix/Prefix)

- Evaluation of expressions using stack

- Lab programs noted under each chapter may be asked for either 5 or 10 marks.

You might also like