Bihar STET Computer Science Previous Year Questions with Answers (2019–2025)

756 real questions from the Bihar STET Computer Science papers of 2019, 2020, 2023, 2024 and 2025, sorted unit by unit. Each PYQ shows the paper and question number, the correct option and an explanation. Where the official key was wrong, the corrected answer is given with the reason.

Unit / sectionPYQs
Unit 1 · Digital Logic33 (2023, 2024, 2025)Open
Unit 2 · Computer Organization & Architecture27 (2023, 2024, 2025)Open
Unit 3 · Programming & Data Structures29 (2025)Open
Unit 4 · Algorithms27 (2023, 2025)Open
Unit 5 · Operating System27 (2023, 2025)Open
Unit 6 · Database Management System43 (2023, 2024, 2025)Open
Unit 7 · Computer Network48 (2019, 2025)Open
Unit 8 · Software Engineering25 (2023, 2025)Open
Unit 9 · Object Oriented Programming33 (2023, 2025)Open
Unit 10 · Web-Based Application Development68 (2023, 2024, 2025)Open
Unit 11 · Theory of Computation31 (2023, 2025)Open
Unit 12 · Internet of Things27 (2023, 2025)Open
Unit 13 · Artificial Intelligence28 (2023, 2025)Open
Unit 14 · Fundamentals of E-Commerce39 (2023, 2024, 2025)Open
Unit 15 · Multimedia28 (2023, 2025)Open
Section B · Art of Teaching138 (2023, 2025)Open
Section C · Other Skills (GK, Reasoning, Maths)105 (2023, 2025)Open

Sample PYQs with answers

Q1PYQ · 2023-S2 Q11 · 2025-B Q33

The hexadecimal number F4 is equivalent to which binary number?

  1. (A) 11111001
  2. (B) 11110100
  3. (C) 11111100
  4. (D) 11111010

Answer: (B) 11110100. F = 1111, 4 = 0100.

Q2PYQ · 2023-S1 Q12 · 2025-A Q83

How is the width of the data bus typically measured in a microcomputer system?

  1. (A) In kilobytes (KB)
  2. (B) In megahertz (MHz)
  3. (C) In bits
  4. (D) In address lines

Answer: (C) In bits. Data-bus width = number of bits transferred at once (8, 16, 32, 64).

Q3PYQ · 2025 · 7 Nov S1

What is the time complexity of the Floyd–Warshall algorithm for a graph with n vertices?

  1. (A) O(n³)
  2. (B) O(n log n)
  3. (C) O(n²)
  4. (D) O(2ⁿ)

Answer: (A) O(n³). Three nested loops over all vertices. It solves the all-pairs shortest path problem using Dynamic Programming.

Q4PYQ · 2023-S1 Q17 · 2025-B Q36

If an algorithm's behaviour is bounded by o(f(n)) if g(n), what notation does it become when the condition is removed?

  1. (A) o(f(n))
  2. (B) o(g(n))
  3. (C) o(f(n) + g(n))
  4. (D) o(f(n) × g(n))

Answer: (A) o(f(n)). Under the smoothness rule the bound itself is unchanged; only the condition is dropped.

Q5PYQ · 2025 · 7 Nov S1

The term 'multi-user' in an OS context refers to:

  1. (A) An OS that can execute multiple programs simultaneously
  2. (B) An OS that supports multiple users working on the same machine
  3. (C) An OS that can only run on multiple computers
  4. (D) An OS with a graphical user interface

Answer: (B) An OS that supports multiple users working on the same machine. Multi-user OS = many users share one machine at the same time.

Q6PYQ · 2023-S1 Q34 · 2025-A Q76

What is DBMS?

  1. (A) A collection of queries
  2. (B) A high-level language
  3. (C) A programming language
  4. (D) Software that stores, modifies and retrieves data

Answer: (D) Software that stores, modifies and retrieves data. A DBMS is system software that creates, stores, modifies and retrieves data in a database.

Attempt the PYQ tests

Free account: 5 questions in every test and the first 5 pages of every notes PDF. Unlock everything for ₹199.