TPSC Prelims previous year questions
Guiding State PSC aspirants since 2016 50,000+ students · 1,000+ final selections Exam Calendar Results Call 9116926003
pscnotes
Pick your state

TPSC Prelims previous year questions questions with answers

772 multiple-choice questions. Open any question for its answer and explanation.

  1. In C, what is the output of: printf("%d", sizeof(‘A’)) ; ?Asked in TPSC Junior System Engineer 2026
  2. Which of the following is a characteristic of a pure function in functional programming ?Asked in TPSC Junior System Engineer 2026
  3. In Object-Oriented Testing, which technique tests individual methods and classes in isolation ?Asked in TPSC Junior System Engineer 2026
  4. Which coupling type is considered most undesirable in structured programming ?Asked in TPSC Junior System Engineer 2026
  5. The recurrence T(n) = 2T(n/2) + n log n, solved using the Master Theorem, givesAsked in TPSC Junior System Engineer 2026
  6. In Dijkstra’s shortest path algorithm, which data structure gives O((V + E) log V) overall time complexity ?Asked in TPSC Junior System Engineer 2026
  7. Which of the following problems is NP-complete ?Asked in TPSC Junior System Engineer 2026
  8. In dynamic programming, the 0/1 Knapsack problem with n items and capacity W has time complexityAsked in TPSC Junior System Engineer 2026
  9. Kruskal’s algorithm for MST sorts edges by weight and adds them if they don’t form a cycle. What data structure efficiently supports the cycle-detection step ?Asked in TPSC Junior System Engineer 2026
  10. Which asymptotic notation represents a tight bound — both upper and lower ?Asked in TPSC Junior System Engineer 2026
  11. The Bellman-Ford algorithm detects negative weight cycles byAsked in TPSC Junior System Engineer 2026
  12. In the Divide-and-Conquer approach, Strassen’s matrix multiplication reduces the number of recursive multiplications per 2×2 matrix from 8 toAsked in TPSC Junior System Engineer 2026
  13. A problem is said to be NP-hard if :Asked in TPSC Junior System Engineer 2026
  14. Which graph traversal algorithm is used to detect strongly connected components (SCCs) ?Asked in TPSC Junior System Engineer 2026
  15. The Greedy algorithm for Activity Selection Problem works because the problem exhibits which property ?Asked in TPSC Junior System Engineer 2026
  16. What is the time complexity of the Floyd-Warshall all-pairs shortest path algorithm ?Asked in TPSC Junior System Engineer 2026
  17. In Ethernet (IEEE 802.3), the minimum frame size is 64 bytes. This is to ensure collision detection. If the propagation delay is t, the minimum frame transmission time must be at leastAsked in TPSC Junior System Engineer 2026
  18. Which layer of the OSI model is responsible for end-to-end error control and flow control ?Asked in TPSC Junior System Engineer 2026
  19. In TCP’s congestion control, after a timeout event, the congestion window (cwnd) is set to:Asked in TPSC Junior System Engineer 2026
  20. Which routing protocol uses the Bellman-Ford algorithm and suffers from the ‘count-to-infinity’ problem ?Asked in TPSC Junior System Engineer 2026
  21. In IPv4, what is the subnet mask for a /26 network ?Asked in TPSC Junior System Engineer 2026
  22. Which multiplexing technique is used in traditional telephone (PSTN) networks to share bandwidth among multiple voice calls ?Asked in TPSC Junior System Engineer 2026
  23. A public key in RSA encryption is a pair (e, n). To encrypt a message M, the cipher text C is computed asAsked in TPSC Junior System Engineer 2026
  24. A system with 5 processes and 12 resources of one type, where each process holds 2 and needs at most 4. Is deadlock possible ?Asked in TPSC Junior System Engineer 2026
  25. Which layer is responsible for logical addressing (IP addressing) and routing ?Asked in TPSC Junior System Engineer 2026