Which coupling type is considered most undesirable in structured programming ?
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
- The recurrence T(n) = 2T(n/2) + n log n, solved using the Master Theorem, gives
- In Dijkstra’s shortest path algorithm, which data structure gives O((V + E) log V) overall time complexity ?
- Which of the following problems is NP-complete ?
- In dynamic programming, the 0/1 Knapsack problem with n items and capacity W has time complexity
- 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 ?
- Which asymptotic notation represents a tight bound — both upper and lower ?
- The Bellman-Ford algorithm detects negative weight cycles by
- In the Divide-and-Conquer approach, Strassen’s matrix multiplication reduces the number of recursive multiplications per 2×2 matrix from 8 to