MCQ
upsc-p1-science-tech-blockchain-quantum MCQ - Practice Questions with Answers
Solve 10 upsc-p1-science-tech-blockchain-quantum questions for RAS/RPSC preparation.
Practice questions
Q1Match List I with List II and select the correct answer using the code given below. List I (Concept) A. Shor's algorithm B. Grover's algorithm C. Quantum key distribution D. Post-quantum cryptography List II (Principal association) 1. Classical cryptography designed to resist quantum attacks 2. Communication-security method based on quantum principles 3. Threat to widely used public-key cryptography from a sufficiently capable fault-tolerant quantum computer 4. Quadratic speed-up for unstructured search
Shor's algorithm is relevant to the future vulnerability of widely used public-key cryptography; Grover's algorithm offers a quadratic speed-up for unstructured search; quantum key distribution is a quantum communication-security method; and post-quantum cryptography remains classical cryptography designed to resist quantum attacks. Only option B preserves all four distinctions.
Q2Match List I with List II: List I (Concept) A. Proof of work B. Proof of stake C. Smart contract D. Off-chain input List II (Feature or limitation) 1. Uses locked stake and is less energy-intensive 2. A false original input remains false after recording 3. Uses computational effort and is energy-heavy 4. Executes code-based instructions when pre-set conditions are met Select the correct answer using the code given below.
Option D is correct. Proof of work uses energy-heavy computation, whereas proof of stake uses locked stake and is less energy-intensive. A smart contract runs specified code when its conditions are met. Blockchain can preserve tamper evidence, but it cannot correct false information supplied from outside the chain.
Q3With reference to security and privacy in frontier technologies, consider the following statements: 1. Hashing personal data removes every possibility of re-identification when that data is combined with other datasets. 2. Encryption, authentication, key management and incident response remain necessary even when a system uses blockchain or artificial intelligence. 3. A cyber attack on a cyber-physical system can cause physical harm. Which of the statements given above are correct? Select the correct answer using the code given below.
Statements 2 and 3 are correct. A technology label does not replace basic security controls, and attacks on systems linked to physical processes can produce physical harm. Statement 1 is incorrect because hashed or anonymised data may still create re-identification risk when combined with other datasets.
Q4With reference to quantum security, consider the following statements: 1. Quantum key distribution uses quantum states to detect eavesdropping during key exchange and needs specialised quantum communication hardware. 2. Post-quantum cryptography uses classical algorithms designed to resist quantum attacks and can often run on conventional digital systems after migration. Which one of the following is correct?
Both statements are correct and distinguish the two approaches. Quantum key distribution relies on quantum states and specialised communication hardware. Post-quantum cryptography remains classical cryptography; its algorithms are designed for quantum resistance and can generally be deployed on conventional digital infrastructure after migration.
Q5With reference to quantum computing, consider the following statements: 1. A qubit may be represented as a superposition of basis states before measurement. 2. Measuring a qubit leaves its superposition unchanged and always gives a deterministic result. 3. Grover's algorithm provides a quadratic speed-up for unstructured search. Which of the statements given above are correct? Select the correct answer using the code given below.
Statements 1 and 3 are correct. Superposition describes a combination of basis states, and Grover's algorithm gives a quadratic speed-up for unstructured search. Statement 2 is incorrect because measurement collapses the qubit state probabilistically; it does not preserve the superposition or guarantee a deterministic result.
You've seen 5 of 10 sample questions
Unlimited practice on upsc-p1-science-tech-blockchain-quantum comes with the RAS Test Series + Practice pack or Gate Pass.
More questions
6The following stages describe the simplified logic of obtaining a useful result from a quantum algorithm: A. Measure the qubit, causing the state to collapse probabilistically. B. Use interference to amplify useful probabilities and suppress wrong paths. C. Repeat runs so that the intended answer is obtained with high probability. D. Represent the quantum system in a superposition of basis states. Arrange the stages in the correct sequence. Select the correct answer using the code given below.
7The following events describe how hash-linking makes tampering with an old blockchain record evident: A. Tampering becomes detectable. B. Transactions are grouped into blocks. C. Altering an old record changes the hash chain. D. Each block carries the cryptographic hash of the previous block. Arrange the events in the correct causal sequence. Select the correct answer using the code given below.
8With reference to blockchain architecture, consider the following statements: 1. Each block may carry a cryptographic hash of the previous block, making retrospective tampering detectable. 2. Blockchain immutability guarantees that the original off-chain input was true and makes unilateral alteration impossible in every situation. 3. Permissioned chains with identified participants may use lighter consensus mechanisms than permissionless proof-of-work systems. Which of the statements given above are correct?
9Consider the following statements about quantum computation: Statement I: Measuring a qubit collapses its state probabilistically. Statement II: Quantum algorithms can use interference so that repeated runs make a desired answer more likely while suppressing wrong paths. Which one of the following is correct?
10With reference to blockchain architecture, consider the following statements: 1. Each block carries a cryptographic hash of the previous block. 2. Every blockchain is necessarily permissionless. 3. Proof of stake uses locked stake and is less energy-intensive than proof of work. Which of the statements given above are correct? Select the correct answer using the code given below.