T4Tutorials .PK

NSCT – Algorithms & Flow Control MCQs

1. . An algorithm is:

(A) A database backup process


(B) A type of encryption


(C) A data compression method


(D) A step-by-step procedure to solve a problem or perform a task




2. . Characteristics of a good algorithm include:

(A) Only encryption


(B) Finiteness, definiteness, input, output, and effectiveness


(C) Only compression


(D) Backup only




3. . Finiteness in an algorithm means:

(A) Backup only


(B) Encrypting data


(C) Compressing files


(D) The algorithm must terminate after a finite number of steps




4. . Definiteness in an algorithm means:

(A) Compressing files


(B) Encrypting files


(C) Each step of the algorithm must be precisely defined


(D) Backup only




5. . Input in an algorithm refers to:

(A) Backup files


(B) Encryption key


(C) Compressed data


(D) The data supplied to the algorithm to process




6. . Output in an algorithm refers to:

(A) Backup files


(B) Encrypted data


(C) Compressed files


(D) The result produced by the algorithm after processing input




7. . Effectiveness in an algorithm means:

(A) Encrypting data only


(B) Each step is basic enough to be performed correctly in a finite amount of time


(C) Compressing data only


(D) Backup only




8. . Flowchart is:

(A) Backup table


(B) Encrypted table


(C) Compressed file


(D) A graphical representation of an algorithm or process




9. . Symbols used in flowcharts include:

(A) Oval (Start/End), Rectangle (Process), Diamond (Decision), Parallelogram (Input/Output)


(B) Only encryption symbols


(C) Only compression symbols


(D) Backup symbols only




10. . Sequential control in flow control means:

(A) Executing statements one after another in order


(B) Encrypting data sequentially


(C) Compressing files sequentially


(D) Backup only




11. . Selection control in flow control means:

(A) Compressing conditionally


(B) Encrypting conditionally


(C) Making decisions and executing statements based on conditions


(D) Backup only




12. . Iteration (looping) in flow control means:

(A) Encrypting repeatedly


(B) Repeating a set of statements until a condition is met


(C) Compressing repeatedly


(D) Backup only




13. . Types of loops include:

(A) For loop, while loop, and do-while loop


(B) Only encryption loops


(C) Only compression loops


(D) Backup loops only




14. . Nested control structures are:

(A) Backup only


(B) Encryption inside compression


(C) Compression inside encryption


(D) Using one control structure inside another (e.g., loop inside a loop)




15. . Pseudocode is:

(A) Encrypted code


(B) A high-level description of an algorithm using structured language


(C) Compressed code


(D) Backup code




16. . Advantages of using flowcharts include:

(A) Only encryption


(B) Easy understanding, communication, debugging, and documentation of algorithms


(C) Only compression


(D) Backup only




17. . Decision-making in algorithms involves:

(A) Compressing files conditionally


(B) Encrypting files conditionally


(C) Using conditional statements like if-else or switch to choose actions


(D) Backup only




18. . Stepwise refinement in algorithm design means:

(A) Backup only


(B) Encrypting data stepwise


(C) Compressing data stepwise


(D) Breaking a problem into smaller subproblems and solving them step by step




19. . Debugging an algorithm means:

(A) Detecting and correcting errors in the algorithm or flowchart


(B) Encrypting algorithm


(C) Compressing algorithm


(D) Backup only




20. . The main purpose of algorithms and flow control is to:

(A) Encrypt data


(B) Develop structured, efficient, and clear procedures to solve problems computationally


(C) Compress files


(D) Backup tables




Exit mobile version