UNIT – I: Basic Concepts and Arrays
Short Answer
1. Define pointer and dynamic memory allocation.
2. What is an algorithm? State its characteristics.
3. Define space complexity and time complexity.
4. What is asymptotic notation?
5. Define data structure and list its types.
6. What is an Abstract Data Type (ADT)?
7. Differentiate between Data Type, ADT, and Data Structure.
8. Define an array.
9. Write an algorithm for traversing an array.
10. What is the difference between single and two-dimensional arrays?
Long Answer
1. Explain the concept of pointers and dynamic memory allocation with examples.
2. Explain algorithm analysis and discuss space and time complexity with examples.
3. Describe different types of data structures with suitable examples.
4. Discuss the differences between data types, abstract data types, and data structures.
5. Explain the representation of single and two-dimensional arrays in memory.
6. Write algorithms for array operations — searching, inserting, deleting, and traversing.
7. Write a program to search an element in an array using linear search.
UNIT – II: Linked Lists
Short Answer Questions
1. Define a linked list.
2. Compare linked lists and arrays.
3. List the types of linked lists.
4. What is a singly linked list?
5. Define a doubly linked list.
6. What is a circular linked list?
7. Write an algorithm to traverse a linked list.
8. What are the advantages of linked lists over arrays?
9. Write the applications of linked lists.
10. What are the steps for inserting a node at the beginning of a singly linked list?
Long Answer Questions
1. Explain the memory representation of linked lists.
2. Describe singly, doubly, circular singly, and circular doubly linked lists.
3. Write algorithms for insertion and deletion in a linked list at various positions.
4. Write an algorithm to search for an element in a linked list.
5. Compare different types of linked lists with examples.
6. Discuss real-world applications of linked lists.
UNIT – III: Stacks, Queues, and Recursion
Short Answer Questions
1. Define stack ADT.
2. What are the applications of stacks?
3. Differentiate between array and linked list representations of stacks.
4. Define prefix, infix, and postfix notations.
5. Write an algorithm to convert infix to postfix expression.
6. Define recursion and give an example.
7. Differentiate between recursion and iteration.
8. Define a queue ADT.
9. What is a circular queue?
10. Define priority queue.
Long Answer Questions
1. Explain stack operations with array and linked list representation.
2. Write algorithms to convert infix expression to postfix and evaluate postfix expression.
3. Explain the Tower of Hanoi problem using recursion.
4. Describe queue operations with algorithms.
5. Explain different types of queues (circular, dequeues, priority queues).
6. Compare stack and queue data structures.
7. Write a recursive program for factorial or Fibonacci sequence.
UNIT – IV: Searching and Sorting
Short Answer Questions
1. Define searching.
2. What is linear search?
3. Define binary search.
4. What is sorting?
5. Define selection sort.
6. Write the time complexity of bubble sort.
7. What is quick sort?
8. What is merge sort?
Long Answer Questions
1. Explain linear search and binary search algorithms with examples.
2. Compare linear search and binary search.
3. Write and explain algorithms for selection, bubble, and insertion sorts.
4. Explain the working of quick sort with example and complexity analysis.
5. Explain merge sort with a neat diagram and algorithm.
6. Compare various sorting algorithms based on time complexity and stability.
UNIT – V: Trees and Graphs
Short Answer Questions
1. Define a binary tree.
2. List the properties of binary trees.
3. Define Binary Search Tree (BST).
4. What are the types of trees?
5. What are tree traversals?
6. Define preorder, inorder, and postorder traversal.
7. What is the difference between tree and graph?
8. Define BFS and DFS.
9. List the applications of graphs.
Long Answer Questions
1. Explain different types of binary trees with examples.
2. Write algorithms for insertion and deletion in a Binary Search Tree.
3. Explain binary tree traversals (preorder, inorder, postorder) with algorithms.
4. Explain sequential and linked representations of graphs.
5. Write algorithms for BFS and DFS traversal.
6. Discuss applications of binary trees and graphs in real life.
7. Compare tree and graph data structures.
