DATA STRUCTURES USING C
UNIT-1: Introduction to Data Structures & Principles of Programming and Analysis of Algorithms
ESSAY QUESTIONS:
1. What is data structure? Explain types of data structures.
2. Explain software development life cycle.
3. What is an algorithm? Explain different approaches to design an algorithm.
4. Explain recursion in functions with an example.
5. Explain Big ‘O’ notation. (or) Explain time and space complexity in data structures.
SHORT ANSWER QUESTIONS:
1. Explain abstract data types.
2. Explain primitive data types.
3. Difference between linear and non-linear data structures.
4. Explain Tips and Techniques for Writing Programs in ‘C’.
5. Explain refinement stages in software development.
UNIT-2: ARRAYS & LINKED LISTS
ESSAY QUESTIONS:
1. What is an array? Explain types of arrays.
2. Explain pointers to arrays in C language.
3. Write a C program to insert and traverse operations in single dimensional arrays.
4. Write a C program to insert and traverse operations in two dimensional arrays.
5. Explain dynamic memory allocation.
6. Explain the operations on single linked list with algorithms and examples.
7. Explain the operations on double linked list with algorithms and examples.
SHORT ANSWER QUESTIONS:
1. Difference between arrays and linked lists.
2. Explain circular linked list.
3. Explain dynamic memory allocation.
4. Difference between single linked list and double linked list.
UNIT-3: STACKS & QUEUES
ESSAY QUESTIONS:
1. What is stack? Explain stack operations using arrays.
2. What is stack? Explain stack operations using linked lists.
3. What is queue? Explain queue operations using arrays.
4. What is queue? Explain queue operations using linked lists.
SHORT ANSWER QUESTIONS:
1. Explain circular queue operations.
2. Explain double ended queue operations.
3. Explain applications of stacks.
4. Explain applications of queues.
UNIT-4: TREES
ESSAY QUESTIONS:
1. What is binary tree? Explain traverse operations on binary trees with algorithms.
2. What is binary search tree? Explain insertion and deletion operations on binary search trees with
algorithms.
3. What is binary tree? Explain the memory representations of binary tree data structure.
4. Difference between B tree and B+ tree.
SHORT ANSWER QUESTIONS:
1. What is binary tree? Explain their properties and applications.
2. Explain the deletion operation on binary search tree.
3. Explain heap tree.
UNIT-5: SEARCHING, SORTING AND GRAPHS
ESSAY QUESTIONS:
1. What is graph? Explain various graph representations.
2. Explain DFS.
3. Explain BFS.
4. Define searching. Explain linear search with algorithm and program.
5. Define searching. Explain binary search with algorithm and program.
6. Define sorting. Explain selection sort with algorithm and program.
7. Define sorting. Explain bubble sort with algorithm and program.
8. Define sorting. Explain insertion sort with algorithm and program.
9. Define sorting. Explain merge sort with algorithm and program.
SHORT ANSWER QUESTIONS:
1. What is spanning tree. Write a short note on graph traversal methods.
2. Write about shortest path algorithms in graph theory.
3. Explain the various applications of graphs.
