Download INF 308 Computational Thinking Exam Questions and Answers and more Exams Technology in PDF only on Docsity!
Question 1. Which of the following best defines abstraction in computational thinking? A) Removing all details from a problem B) Focusing on the most important information by ignoring unnecessary details C) Adding more details to a simple problem D) Rearranging data randomly Answer: B Explanation: Abstraction involves simplifying complexity by ignoring irrelevant details and emphasizing essential features, making problems easier to manage. Question 2. Which is an example of a high-level abstraction? A) Writing machine code
B) Creating a flowchart to represent a system C) Using a calculator D) Plugging in hardware components Answer: B Explanation: Flowcharts provide a conceptual overview, hiding lower- level details, making them a high-level abstraction. Question 3. In computational thinking, what is the main purpose of decomposition? A) Making problems more complex B) Breaking down complex problems into smaller, manageable parts C) Combining sub-problems into one large problem D) Removing all details
Question 5. What is a key benefit of modularization in problem-solving? A) Increased complexity B) Reduced maintainability C) Easier collaboration and debugging D) Lower reliability Answer: C Explanation: Modularization allows teams to work on separate, smaller components, making systems easier to understand and debug. Question 6. What does top-down design refer to in decomposition? A) Starting with detailed implementation B) Starting with the main problem and breaking it down recursively C) Ignoring the main problem
D) Programming without a plan Answer: B Explanation: Top-down design starts by identifying the main problem and breaking it into sub-problems until each part is manageable. Question 7. Which data structure is most suitable for implementing undo functionality in software? A) Queue B) Stack C) Array D) Linked List Answer: B Explanation: Stack (LIFO) allows the last action to be undone first, which is ideal for undo features.
B) Formulating general rules or models from specific examples C) Ignoring exceptions D) Memorizing data Answer: B Explanation: Generalization involves deriving broad principles from observed patterns, making solutions applicable to multiple cases. Question 10. Which of the following is NOT a characteristic of a well- defined algorithm? A) Finite B) Unambiguous C) Ineffective D) Produces output
Answer: C Explanation: An algorithm must be effective, finite, unambiguous, and produce an output. Question 11. What is the main function of selection (conditionals) in algorithms? A) Repeating instructions B) Making decisions based on conditions C) Storing data D) Increasing code size Answer: B Explanation: Selection uses logic (e.g., IF/THEN/ELSE) to choose different actions based on conditions.
C) A and B D) True and False only, with no numeric value Answer: A Explanation: Boolean values are typically represented as 0 (false) and 1 (true) in binary. Question 14. What does the Boolean operator AND require for its output to be true? A) At least one input true B) All inputs true C) All inputs false D) Inputs don’t matter Answer: B
Explanation: AND returns true only if all its inputs are true. Question 15. Which is the result of NOT(True) in Boolean logic? A) True B) False C) Unknown D) 1 Answer: B Explanation: The NOT operator inverts its input; NOT(True) is False. Question 16. What kind of circuit is created by combining multiple AND, OR, and NOT gates? A) Arithmetic circuit
Answer: C Explanation: Hexadecimal is base 16, using digits 0-9 and letters A-F. Question 18. Convert the binary number 1011 to decimal. A) 9 B) 10 C) 11 D) 13 Answer: C Explanation: 1×8 + 0×4 + 1×2 + 1×1 = 8 + 0 + 2 + 1 = 11. Question 19. What is the decimal representation of the hexadecimal number 1A?
A) 16
B) 26
C) 21
D) 31
Answer: B Explanation: 1×16 + 10×1 = 16 + 10 = 26. Question 20. Which data type uses the ASCII encoding standard? A) Integer B) Boolean C) Character/Text D) Floating-point Answer: C
A) Enqueue B) Dequeue C) Push D) Sort Answer: C Explanation: 'Push' adds an item to the top of the stack (LIFO structure). Question 23. What is the primary advantage of using key-value pairs (maps/dictionaries)? A) Data is always sorted B) Fast retrieval using unique keys C) Fixed size D) Only numbers can be stored
Answer: B Explanation: Key-value pairs allow efficient data retrieval using unique identifiers (keys). Question 24. Which searching algorithm requires the data to be sorted? A) Linear search B) Binary search C) Hash search D) Depth-first search Answer: B Explanation: Binary search works only on sorted data by repeatedly dividing the search interval in half.
C) Selection sort D) Bubble sort Answer: C Explanation: Selection sort works by finding the smallest element and swapping it into place. Question 27. What is the main requirement for binary search to operate correctly? A) Data must be unsorted B) Data must be sorted C) Data must be in reverse order D) Data must be in pairs Answer: B
Explanation: Binary search only works on sorted data. Question 28. Which of the following best describes time complexity? A) The amount of data stored B) The number of operations as input size grows C) The size of the program D) The time it takes to write code Answer: B Explanation: Time complexity measures how the number of steps taken by an algorithm grows with input size. Question 29. What does O(1) complexity mean? A) Constant time regardless of input size
