NSCT – Algorithmic Thinking MCQs 20 min Score: 0 Attempted: 0/20 Subscribe 1. . Algorithmic thinking is: (A) Encrypting data (B) The ability to solve problems by defining a step-by-step procedure or algorithm (C) Compressing files (D) Backup onlyShow All Answers 2. . The main goal of algorithmic thinking is: (A) To break down complex problems into manageable steps (B) Encrypt files (C) Compress files (D) Backup only 3. . Stepwise refinement in algorithmic thinking means: (A) Compressing files stepwise (B) Encrypting data stepwise (C) Breaking a problem into smaller subproblems and solving each step by step (D) Backup only 4. . Pseudocode is: (A) Backup only (B) Encrypting code (C) Compressing code (D) A high-level description of an algorithm using structured language 5. . Flowchart is used in algorithmic thinking to: (A) Backup only (B) Encrypt files (C) Compress data (D) Graphically represent the sequence of steps in an algorithm 6. . Sequential control in algorithms refers to: (A) Compressing sequentially (B) Encrypting sequentially (C) Executing steps one after another in order (D) Backup only 7. . Selection control in algorithms involves: (A) Backup only (B) Encrypting conditionally (C) Compressing conditionally (D) Making decisions using conditional statements (if-else, switch) 8. . Iteration (looping) in algorithms refers to: (A) Repeating a set of steps until a condition is met (B) Encrypting repeatedly (C) Compressing repeatedly (D) Backup only 9. . Algorithmic thinking helps in: (A) Backup only (B) Encrypting data (C) Compressing files (D) Designing efficient, logical, and structured solutions 10. . Algorithm complexity refers to: (A) Backup only (B) Encrypting complexity (C) Compressing complexity (D) The measure of resources (time and space) required by an algorithm 11. . Divide and conquer strategy in algorithmic thinking involves: (A) Breaking a problem into smaller subproblems, solving them independently, and combining results (B) Encrypting subproblems (C) Compressing subproblems (D) Backup only 12. . Greedy method in algorithmic thinking means: (A) Encrypting choices (B) Making the locally optimal choice at each step with the hope of finding a global optimum (C) Compressing choices (D) Backup only 13. . Dynamic programming is used to: (A) Backup only (B) Encrypt data (C) Compress files (D) Solve complex problems by breaking them into overlapping subproblems and storing results 14. . Recursive algorithms solve problems by: (A) Calling themselves on smaller instances of the same problem (B) Encrypting recursively (C) Compressing recursively (D) Backup only 15. . Algorithm correctness means: (A) An algorithm produces the correct output for all valid inputs (B) Encrypting output (C) Compressing output (D) Backup only 16. . Efficiency of an algorithm is measured in terms of: (A) Time complexity and space complexity (B) Encryption speed (C) Compression ratio (D) Backup time 17. . Algorithmic thinking is essential in: (A) Only compressing files (B) Only encrypting data (C) Programming, problem-solving, and software development (D) Backup only 18. . Advantages of algorithmic thinking include: (A) Structured problem solving, efficiency, and error reduction (B) Encrypting data only (C) Compressing files only (D) Backup only 19. . Decision-making in algorithms involves: (A) Encrypting decisions (B) Choosing appropriate steps or actions based on conditions and constraints (C) Compressing decisions (D) Backup only 20. . The main purpose of algorithmic thinking is to: (A) Backup tables (B) Encrypt data (C) Compress files (D) Develop logical, structured, and efficient approaches to solve complex problems
