A problem is said to be NP-hard if :
Asked in TPSC Junior System Engineer 2026
Answer under review: our editors are checking this question. Try the other TPSC Prelims previous year questions questions meanwhile.
More TPSC Prelims previous year questions questions
- Which graph traversal algorithm is used to detect strongly connected components (SCCs) ?
- The Greedy algorithm for Activity Selection Problem works because the problem exhibits which property ?
- What is the time complexity of the Floyd-Warshall all-pairs shortest path algorithm ?
- 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 least
- Which layer of the OSI model is responsible for end-to-end error control and flow control ?
- In TCP’s congestion control, after a timeout event, the congestion window (cwnd) is set to:
- Which routing protocol uses the Bellman-Ford algorithm and suffers from the ‘count-to-infinity’ problem ?
- In IPv4, what is the subnet mask for a /26 network ?