Programming & Data Structures MCQ for Bihar STET with Answers, PYQs & Notes

Tests in this unit

• PYQ OnlyQuestions asked in the 2025 STET papers, including Python code-output questions.29 Q
• Practice BankTopic-wise questions: complexity, arrays, lists, stacks, queues, sorting, graphs and trees.105 Q
• Full TestEvery question in the Unit 3 bank.134 Q
• Quick Test30 questions picked at random.30 Q

Unit 3 syllabus: Programming and Data Structure

1. Data, entity, information; difference between data and information; data type, built-in data type, abstract data type; definition and types of data structures: linear and non-linear. Introduction to algorithms: definition, difference between algorithm and program, properties of algorithm, algorithm design techniques, performance analysis, complexity of various code structures, order of growth, asymptotic notations.
2. Arrays: definition, single and multidimensional arrays; representation of arrays: row major order and column major order; derivation of index formulae for 1-D and 2-D arrays; applications of arrays; sparse matrices and their representations. Recursion: recursion in C, examples of recursion, Tower of Hanoi problem, simulating recursion, backtracking, recursive algorithms, principles of recursion.
3. Array implementation and pointer implementation of singly linked lists, doubly linked list, circularly linked list; operations on a linked list: insertion, deletion, traversal; polynomial representation and addition, subtraction and multiplication of single variable polynomials.
4. Stack: abstract data type, primitive stack operations push and pop, array and linked implementation of stack in C; applications of stack: prefix and postfix expressions, evaluation of postfix expression; iteration and recursion: principles of recursion, tail recursion, removal of recursion; problem solving using iteration and recursion with examples such as binary search, Fibonacci numbers and Hanoi towers.
5. Queue: create, add, delete, full and empty; circular queues; array and linked implementation of queues in C; dequeue and priority queue.
6. Concept of searching: sequential search, index sequential search, binary search; concept of hashing and collision resolution techniques used in hashing.
7. Sorting: insertion sort, selection sort, bubble sort, heap sort; comparison of sorting algorithms; sorting in linear time: counting sort and bucket sort.
8. Graphs: terminology; data structures for graph representation: adjacency matrices, adjacency list; graph traversal: depth first search and breadth first search; connected component.
9. Trees: basic terminology, binary trees; binary tree representation: array and pointer (linked list) representation; binary search tree, complete binary tree, extended binary trees; tree traversal algorithms: inorder, preorder and postorder; constructing binary tree from given traversals; insertion, deletion, searching and modification of data in binary search tree; threaded binary trees; Huffman coding using binary tree; AVL tree and B tree.