STETSTET Practice CBT
Start free

Unit 4 · Bihar STET Paper-II Computer Science

Algorithms MCQ for Bihar STET with Answers, PYQs & Notes

118 questions with explanations, including 27 previous year questions from 2023, 2025 and a 30-question mock paper. Practise them in a CBT exam screen and read the 41-page notes PDF.

118
MCQs
27
PYQs
30
mock-paper questions
41
pages of notes

Tests in this unit

  • Mock TestThe 30-question Unit 4 mock paper from the notes, in book order.30 Q
  • PYQ OnlyQuestions asked in the 2023 and 2025 STET papers.27 Q
  • Practice BankTopic-wise questions: asymptotics, recurrences, divide and conquer, DP, backtracking, graphs and NP.61 Q
  • Full TestPYQs and the practice bank together.88 Q
  • Quick Test30 questions picked at random.30 Q
Try 5 questions free Unlock all for ₹199

Unit 4 syllabus: Algorithms

  1. Algorithm analysis, time space tradeoff, asymptotic notations, conditional asymptotic notation, removing condition from the conditional asymptotic notation, properties of big-Oh notation.
  2. Recurrence equations, solving recurrence equations, analysis of linear search.
  3. Divide and conquer: general method, binary search, finding maximum and minimum, merge sort.
  4. Dynamic programming: general method, multistage graphs, all-pair shortest paths, optimal binary search trees.
  5. Backtracking: general method, 8-queens problem, Hamiltonian problem.
  6. Connected components, spanning trees, biconnected components; introduction to NP-hard and NP-completeness.

Sample Algorithms previous year questions with answers

Q1PYQ · 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.

Q2PYQ · 2023-S1 Q14

Which data structure often results in a time–space tradeoff by using extra memory to speed up operations?

  1. (A) Arrays
  2. (B) Linked lists
  3. (C) Hash tables
  4. (D) Stacks

Answer: (C) Hash tables. Hash tables spend extra space for O(1) average lookup.

Q3PYQ · 2023-S1 Q15

Which term refers to the strategy of optimizing an algorithm's use of resources, often by sacrificing one aspect to improve another?

  1. (A) Greedy algorithm
  2. (B) Divide and conquer
  3. (C) Dynamic programming
  4. (D) Tradeoff

Answer: (D) Tradeoff. e.g. time–space tradeoff.

Practise all 118 Algorithms questions

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

Create free account ₹199 full access

Other Bihar STET Computer Science units

Digital LogicComputer Organization & ArchitectureProgramming & Data StructuresOperating SystemDatabase Management SystemComputer NetworkSoftware EngineeringObject Oriented ProgrammingWeb-Based Application DevelopmentTheory of ComputationInternet of ThingsArtificial IntelligenceFundamentals of E-CommerceMultimediaArt of TeachingOther Skills (GK, Reasoning, Maths)