Unit 1
📌 1 Mark Questions (5)
1. Define data type.
2. What is a data structure?
3. What is an array?
4. What is abstraction?
5. Name any two operations of stack ADT.
📌 2 Marks Questions (5)
1. Differentiate between primitive and non-primitive data types.
2. What is an Abstract Data Type (ADT)? Give one example.
3. Define linear and non-linear data structures with examples.
4. Write any two advantages and two disadvantages of arrays.
5. What is insertion in an array? Explain briefly.
📌 3 Marks Questions (5)
1. Explain classification of data structures with examples.
2. Describe operations of stack ADT.
3. Explain address calculation of a 1D array with formula.
4. Write the algorithm for insertion at the beginning of an array.
5. Explain deletion of an element from an array with steps.
6. given an array A[1…..10][1….15] with base value 100 and the size of each element is 1 byte in memory.
Find the address of A[8][6] with the help of Row-major order.
Unit 2
1-Mark Questions (5)
Short definitions or single facts from Unit 2 syllabus.
1. What is a linked list?
2. Name the two parts of a singly linked list node.
3. What does the NEXT pointer of the last node in a singly linked list point to?
4. State one advantage of linked lists over arrays.
5. What is the first node in a linked list called?
2-Mark Questions (5)
Brief explanations or simple comparisons.
1. Differentiate between singly and doubly linked lists.
2. List two advantages of linked lists.
3. Explain insertion at the beginning of a singly linked list (one step).
4. What is a circular linked list? State one key characteristic.
5. Define array of structures with an example.
3-Mark Questions (5)
Algorithms or short descriptions.
1. Write the algorithm to traverse a singly linked list.
2. Describe the steps to insert a node at the end of a singly linked list.
3. Explain deletion from the beginning in a singly linked list.
4. Differentiate between array of structures and structure of arrays.
5. Outline the two-pointer technique for splitting a singly linked list.
3 Marks Questions (5)
1. Explain types of linked lists with examples.
2. Write the algorithm for insertion at the end in singly linked list.
3. Explain deletion from the beginning in linked list with steps.
4. Describe merging of two singly linked lists.
5. Explain difference between array of structures and structure of arrays.
5 Mark Questions (Linked List)
1. Explain singly linked list with diagram and describe its structure in detail.
2. Write an algorithm for insertion at the beginning, middle, and end in a singly linked list.
3. Explain the deletion operation in a singly linked list (beginning, middle, end) with steps.
4. Describe different types of linked lists (singly, doubly, circular) with examples.
5. Explain the advantages and disadvantages of linked list and compare it with arrays.
Unit 3
1-Mark Questions (5)
Short definitions or basic facts from Unit 3 on stacks, queues, and expressions.
1. What is the principle followed by a stack?
2. Name the insertion operation in a stack.
3. What is the end called where insertion and deletion occur in a queue?
4. Define circular queue.
5. What does LIFO stand for?
2-Mark Questions (5)
Simple operations or types.
1. Differentiate between push and pop operations in a stack.
2. List the basic operations of a queue.
3. State two advantages of linked list representation for queues over arrays.
4. What is a priority queue? Name its two types.
5. Define postfix expression.
3-Mark Questions (5)
Algorithms or short processes.
1. Write the algorithm for enqueue operation in a queue using array.
2. Explain dequeue operation in linked list queue (steps).
3. Describe the steps for evaluating a postfix expression.
4. Outline the algorithm for push operation in stack using linked list.
5. Explain the condition for queue full and empty in circular queue.
6. 50
/ \
30 70
/\ /\
20 40 60 80 Find: Preorder, Inorder , Postorder
Find - Find BFS traversal output./ DFS (Preorder)
Unit 4
Unit 4
1. Define a binary tree.
2. What is a leaf node?
3. What is a complete binary tree?
4. What is BFS?
5. What is a heap tree?
📌 2 Marks Questions (5)
1. Write any two properties of a full binary tree.
2. Differentiate between BFS and DFS.
3. What is array representation of binary tree?
4. Define Binary Search Tree (BST) with rules.
5. What is a threaded binary tree?
📌 5 Marks Questions (5)
1. Explain binary tree traversal methods (preorder, inorder, postorder) with examples.
2. Describe insertion and creation of Binary Search Tree (BST) with algorithm.
3. Explain deletion in BST with all three cases (leaf, one child, two children).
4. Discuss array and linked list representation of binary tree with advantages and disadvantages.
5. Explain Breadth First Search (BFS) and Depth First Search (DFS) with algorithms and examples.