A public key in RSA encryption is a pair (e, n). To encrypt a message M, the cipher text C is computed as
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
- A system with 5 processes and 12 resources of one type, where each process holds 2 and needs at most 4. Is deadlock possible ?
- Which layer is responsible for logical addressing (IP addressing) and routing ?
- In the sliding window protocol with window size W, bandwidth-delay product B, and a = propagation delay / transmission time. What is the maximum channel utilization achievable ?
- Banker’s algorithm is used to avoid
- Which CPU scheduling algorithm can cause the ‘convoy effect’, where short processes wait behind a long process ?
- In virtual memory, the concept of ‘thrashing’ occurs when
- A semaphore S is initialized to 1. Process P1 executes wait(S) and then signal(S). Process P2 also executes wait(S) then signal(S). This semaphore implements:
- Which page replacement algorithm suffers from Belady’s anomaly (increasing frames can increase page faults) ?