2019 – Bihar STET Computer Science
Q1. In Data Structure, data may be of how many types?
A. 1
B. 2
C. 3
D. 4
Answer: B. 2
The two broad categories are Primitive Data Structures and Non-Primitive Data Structures. The question is identified with Bihar STET Computer Science 2019, Shift-II.
Q2. Stack, Queue and Linked List can be implemented using:
A. Numeric variable
B. String variable
C. Logical function
D. Array
Answer: D. Array
This is identified as a Bihar STET Computer Science 2019 Shift-II question.
Q3. Which one is a non-linear data structure?
A. Stack
B. Queue
C. Linked List
D. Tree
Answer: D. Tree
Explanation: Stack, queue and linked list are linear data structures, whereas a tree represents hierarchical/non-linear relationships.
Q4. Term "Data Structure" refers to ______ and interrelationship between them.
A. Organization of data
B. Programming standard
C. Coding
D. Program design
Answer: A. Organization of data
The question appears in the 2019 Bihar STET Computer Science paper as question 141 in the source.
2020 – Bihar STET Computer Science
The available solved-paper compilation identifies a 18 September 2020 Shift-I Computer Science paper and another 2020 Computer Science paper.
Q5. Which traversal algorithm is typically implemented using a stack data structure?
A. DFS
B. BFS
C. Both DFS and BFS
D. Neither DFS nor BFS
Answer: A. DFS
Explanation: Depth First Search can be implemented using a stack. BFS normally uses a queue.
Q6. In the Tower of Hanoi problem with n disks, how many moves are required?
A. n
B. 2n
C. 2ⁿ − 1
D. 2ⁿ
Answer: C. 2ⁿ − 1
Formula:
T(n) = 2ⁿ − 1
This is one of the recursion/algorithm questions appearing in the Bihar STET Computer Science material.
Q7. Which technique is used for resolving collisions by checking the next available position in a hash table?
A. Linear probing
B. Quadratic probing
C. Separate chaining
D. Double hashing
Answer: A. Linear probing
Explanation: Linear probing checks successive slots until an available slot is found.
Q8. Separate chaining stores collided elements typically in:
A. Linked Lists
B. Arrays
C. Stacks
D. Queues
Answer: A. Linked Lists
Explanation: In separate chaining, each hash-table bucket can maintain a linked list of elements having the same hash index.
Q9. Which of the following is a common application of a stack?
A. Breadth First Search
B. Depth First Search
C. Level-order traversal
D. Printer queue
Answer: B. Depth First Search
Note: This follows the same DFS/stack concept explicitly tested in the Bihar STET material.
2023 – Bihar STET Computer Science
The 2023 Computer Science Paper-II was held on 12 September 2023, Shift-I, and the paper source identifies the subject as Computer Science, Code 226.
Q10. Which data structure often results in a time-space tradeoff by using extra memory to speed up operations?
A. Arrays
B. Linked Lists
C. Hash Tables
D. Stacks
Answer: C. Hash Tables
Hash tables use additional memory to provide fast average-case lookup.
Q11. Which term refers to optimizing an algorithm's use of resources by making a sacrifice in one aspect for improvement in another?
A. Greedy Algorithm
B. Divide and Conquer
C. Dynamic Programming
D. Tradeoff
Answer: D. Tradeoff
Q12. Conditional asymptotic notation is particularly useful when:
A. Analyzing algorithms with constant time complexity
B. Input size is fixed
C. Input data is random
D. Algorithm behavior varies based on certain input characteristics
Answer: D. Algorithm behavior varies based on certain input characteristics
Q13. If an algorithm's behavior is bounded by o(f(n)) if g(n), what notation does it become when the condition is removed?
A. o(f(n))
B. o(g(n))
C. o(f(n) + g(n))
D. o(f(n) × g(n))
Answer: A. o(f(n))
Q14. In a directed graph, an edge that points from vertex A to vertex B is denoted by:
A. (A, B)
B. [A, B]
C.
D. {A, B}
Answer: A. (A, B)
A directed edge can be represented as the ordered pair (A,B), indicating direction from A to B.
Q15. Which data structure is used to store collided elements in separate chaining?
A. Linked List
B. Array
C. Stack
D. Queue
Answer: A. Linked List
Q16. Which collision-resolution technique places a collided element in the next available empty slot?
A. Linear Probing
B. Quadratic Probing
C. Separate Chaining
D. Double Hashing
Answer: A. Linear Probing
Q17. In the Tower of Hanoi problem with n disks, how many moves are required?
A. n
B. 2n
C. 2ⁿ − 1
D. 2ⁿ
Answer: C. 2ⁿ − 1
Q18. The process of removing recursion involves replacing recursive function calls with:
A. More recursive function calls
B. Loops
C. Additional memory allocation
D. Non-recursive function calls
Answer: B. Loops
2024 – Bihar STET Computer Science
The available Bihar STET 2024 Data Structures paper contains a dedicated 25-question Data Structures section.
Q19. Which of the following is NOT a type of Queue?
A. Priority Queue
B. Single-ended Queue
C. Ordinary Queue
D. Circular Queue
Answer: B. Single-ended Queue
Q20. What is the disadvantage of an array data structure?
A. Memory to be allocated should be known beforehand
B. Elements can be accessed in constant time
C. Elements are stored in contiguous memory
D. Other data structures can be implemented using arrays
Answer: A. Memory to be allocated should be known beforehand
Q21. Which data structure finds its use in recursion?
A. Arrays
B. Linked List
C. Queues
D. Stacks
Answer: D. Stacks
Q22. What is the maximum number of swaps that can be performed in Selection Sort?
A. N − 1
B. N
C. 1
D. N − 2
Answer: A. N − 1
Q23. Which is a Divide and Conquer algorithm?
A. Bubble Sort
B. Selection Sort
C. Heap Sort
D. Merge Sort
Answer: D. Merge Sort
Q24. What is the time complexity of Binary Search?
A. O(n)
B. O(1)
C. O(log₂ n)
D. O(n²)
Answer: C. O(log₂ n)
Q25. What is the time complexity to insert an element at the front of a Linked List?
A. O(n)
B. O(1)
C. O(log n)
D. O(n log n)
Answer: B. O(1)
Q26. Which represents Postorder Traversal of a Binary Tree?
A. Left → Right → Root
B. Left → Root → Right
C. Right → Left → Root
D. Right → Root → Left
Answer: A. Left → Right → Root
Q27. In a graph of n nodes and n edges, how many cycles will be present?
A. Exactly 1
B. At most 1
C. At most 2
D. Depends on the graph
Answer: D. Depends on the graph
Q28. What is the time complexity to insert an element at the rear of a Linked List?
A. O(n²)
B. O(1)
C. O(n)
D. O(log n)
Answer: C. O(n)
Important: This assumes a singly linked list without a maintained tail pointer.
Q29. Which is NOT an advantage/application of trees?
A. Hierarchical structure
B. Faster Search
C. Router algorithms
D. Undo/Redo operations in Notepad
Answer: D. Undo/Redo operations in Notepad
Q30. Which data structure is best suited for efficient implementation of a Priority Queue?
A. Array
B. Linked List
C. Heap
D. Stack
Answer: C. Heap
Q31. What is the famous mathematical example of a 2-D array?
A. Cube
B. Dice
C. Matrix
D. None of these
Answer: C. Matrix
Q32. Which traversal method does NOT use a stack to hold nodes waiting to be processed?
A. Depth First
B. D-Search
C. Breadth First
D. Backtracking
Answer: C. Breadth First
Q33. In Linked Lists, there are no NULL links in:
A. Singly Linked List
B. Circular Linked List
C. Linear Doubly Linked List
D. None of these
Answer: B. Circular Linked List
Q34. The amount of time needed to run an algorithm to completion is known as:
A. Space Complexity
B. Worst Case
C. Best Case
D. Time Complexity
Answer: D. Time Complexity
Q35. Which represents the graphical representation of an algorithm?
A. Pseudocode
B. Graph Coloring
C. Flowchart
D. Dynamic Programming
Answer: C. Flowchart
Q36. Which data structure is used for level-order traversal of a binary tree?
A. Queue
B. Stack
C. Hash Table
D. Linked List
Answer: A. Queue
Q37. Which of the following is an application of data structures?
A. Image Processing
B. Decision Making
C. Blockchain
D. All of the above
Answer: D. All of the above
Q38. Which matrix contains a large number of zero elements?
A. Identity Matrix
B. Zero Matrix
C. Unit Matrix
D. Sparse Matrix
Answer: D. Sparse Matrix
Q39. If a tree has n nodes, how many edges does it have?
A. 1
B. n(n−1)/2
C. n(n−1)
D. n−1
Answer: D. n − 1
Q40. Which data structure follows Last In First Out (LIFO)?
A. Queue
B. Stack
C. Vector
D. Array List
Answer: B. Stack
Q41. In which traversal do we process all descendants of a vertex before moving to an adjacent vertex?
A. Depth Limited
B. Width First
C. Breadth First
D. Depth First
Answer: D. Depth First
Q42. Inorder traversal of a tree gives a sorted listing of elements in:
A. Merging
B. AVL Trees
C. Binary Trees
D. Binary Search Trees
Answer: D. Binary Search Trees
Q43. Which analysis refers to computing the running time of an operation in mathematical units of computation?
A. Asymptotic
B. Symptotic
C. Regular
D. Notational
Answer: A. Asymptotic
The 25-question 2024 Data Structures set is directly traceable to the Bihar STET 2024 Computer Science Data Structures source.
