Computer Science True/False Questions PDF

Summary

This document contains true or false questions on computer science topics. The questions cover fundamental concepts in computer science, such as algorithms, problem-solving, and computer history. The document also covers various representations of information, like binary numbers.

Full Transcript

# True or False Questions: 1. Theoretical computer science is a part of computer science that focuses on studying real computers ( **False** ). 2. Computer science is limited to learning how to write computer programs ( **False** ). 3. Learning how to use computer software is part of computer scien...

# True or False Questions: 1. Theoretical computer science is a part of computer science that focuses on studying real computers ( **False** ). 2. Computer science is limited to learning how to write computer programs ( **False** ). 3. Learning how to use computer software is part of computer science ( **True** ). 4. According to Gibbs and Tucker, the central concept in computer science is the algorithm ( **True** ). 5. A sequential operation in an algorithm asks a question to decide the next step ( **True** ). 6. An iterative operation in an algorithm instructs us to repeat a set of instructions ( **True** ). 7. The definition of an algorithm includes an infinite number of steps to solve a problem ( **False** ). 8. The algorithm for adding two m-digit numbers does not require any conditional steps ( **False** ). 9. Step 5 in the addition algorithm resets the carry if the sum of two digits is greater than or equal to 10 ( **True** ). 10. A computing agent needs to understand the concepts behind an algorithm to execute it ( **False** ). 11. In computer science terminology, the machine, robot, person, or thing carrying out the steps of the algorithm is called a computing agent ( **True** ). 12. There are some tasks that artificial intelligence cannot yet perform as effectively as humans because we lack the ability to specify these tasks algorithmically ( **True** ). 13. Artificial intelligence has surpassed human intelligence in high-level problem-solving and abstract reasoning ( **False** ). 14. An algorithm must have a well-defined order for its operations ( **True** ). 15. If an instruction in an algorithm is ambiguous, it does not affect the algorithm's validity ( **False** ). 16. The shampoo bottle instructions provided in the example are a correct algorithm because they allow for repetition ( **True** ). 17. An algorithm can include instructions like "Do either Part 1 or Part 2" without clarifying the decision process ( **True** ). 18. It is possible to generate an infinite list of prime numbers in a finite amount of time ( **False** ). 19. A division by zero operation can prevent an algorithm from being effectively computable ( **True** ). 20. For an algorithm to be correct, it must always produce a perfect answer ( **True** ). 21. An algorithm that does not terminate is said to be in an infinite loop ( **True** ). 22. The shampoo instructions in the example will run infinitely if there is no condition to stop ( **True** ). 23. Computer scientists design, analyze, and test algorithmic solutions that could be executed by computers or robots ( **True** ). 24. Algorithms must be completed in a finite amount of time ( **True** ). 25. The history of computers can be traced to one specific person or moment in time ( **False** ). 26. Only a computer can perform algorithmic tasks efficiently ( **False** ). 27. The Greeks contributed to the fields of geometry and logic ( **True** ). 28. John Napier invented logarithms in the early seventeenth century to make complex calculations easier ( **True** ). 29. The Pascaline, a mechanical calculator developed by Blaise Pascal, could perform multiplication and division ( **True** ). 30. The slide rule and mechanical calculators like Pascal's and Leibniz's devices were not true computers ( **True** ). 31. The Jacquard loom was designed to automate weaving and used punched cards to create patterns ( **True** ). 32. The Jacquard loom was the first programmable device ( **True** ). 33. The advances in computer technology have been much slower than in other industries ( **False** ). 34. The first commercial computers were developed during the first generation of computing ( **True** ). 35. Natural language is the most effective way to represent algorithms ( **False** ). 36. The use of pseudocode helps in providing a structured and clear representation of algorithms ( **True** ). 37. Pseudocode allows for precise and unambiguous expression of algorithms ( **True** ). 38. In natural language, it's easy to identify the specific parts of an algorithm that require attention ( **False** ). 39. Natural language is always the best way to describe algorithms because it is familiar and easy to understand ( **False** ). 40. Pseudocode allows us to express algorithms clearly without worrying about the technical details of programming languages ( **True** ). 41. Using a high-level programming language for algorithm design helps avoid any ambiguity in the steps of the algorithm ( **True** ). 42. Pseudocode must follow rigid syntax rules and cannot be adapted to personal preferences ( **False** ). 43. Pseudocode is a perfect representation of algorithms in terms of execution and performance ( **False** ). 44. In pseudocode, the operation "Set the value of x to 5" is an example of a computation ( **True** ). 45. Computers internally use the decimal numbering system to store information ( **False** ). 46. In the binary numbering system, the value of a digit depends on its position and its absolute value ( **True** ). 47. Computers can store text, images, and sound using the binary numbering system ( **True** ). 48. The external representation of information is the same as its internal representation in computers. ( **False** ). 49. The binary numbering system uses only the digits 0 and 1. ( **True** ). 50. Converting a decimal number to binary involves successive divisions by 2. ( **True** ). 51. It takes fewer binary digits than decimal digits to represent the same value. ( **True** ). 52. The decimal number 19 is equivalent to the binary number 10011. ( **True** ). 53. The rules for binary addition include a carry when adding 1 + 1. ( **True** ). 54. The binary string 1110001 can only represent the number -49. ( **False** ). 55. In two's complement, it is possible to represent one more positive number than negative. ( **True** ). 56. In this circuit diagram if a = 0, b = 1, c = 0 then the output = 0. ( **True** ). 57. The "AND" operation produces a true value only if all inputs are true. ( **True** ). 58. Java is considered a high-level programming language. ( **True** ). 59. The function of the compiler is to translate code from high-level languages to machine language. ( **True** ). 60. The function of the linker is to link the code with the libraries used in the program. ( **True** ). # Multiple Choice Questions: 1. Computer science is primarily concerned with: a) Learning to use software b) Building physical computers **c) Studying the logical and mathematical properties of problems** 2. Which of the following is a common misconception about computer science? **a) It is the study of software applications** b) It is unrelated to mathematics c) It has no practical applications 3. Why do computer scientists implement new ideas as programs? a) To build more physical computers b) To measure and test their performance **c) To study programming languages** 4. Which of the following best captures the central concept of computer science, according to Gibbs and Tucker? a) Hardware construction **b) Algorithm design** c) Software package usage 5. What is the purpose of conditional operations in an algorithm? a) To perform repetitive tasks b) To follow a simple instruction **c) To ask a question and choose the next operation based on the answer** 6. Which category of algorithm operations includes looping instructions? a) Sequential operations b) Conditional operations **c) Iterative operations** 7. An algorithm is: a) A tool for designing hardware systems **b) A step-by-step method for solving a problem** c) A type of programming language 8. In algorithm design, what is the role of programming languages? a) To perform conditional checks within algorithms **b) To translate algorithms so they can be executed by hardware** c) To identify important problems for solving 9. In the addition algorithm, which value is initialized to zero at the beginning? **a) The carry** b) The final answer c) The variable 10. What type of operation is Step 3 in the addition algorithm? a) Sequential b) Conditional **c) Iterative** 11. In computer science, a "computing agent" refers to which of the following? a) Only machines **b) Machines, robots, or people following an algorithm** c) Programs that understand the underlying concepts 12. Certain problems are unsolvable because: **a) They are too complex for current technology** b) No algorithmic solution can ever exist for them c) They require human intelligence 13. Why is it important for an algorithm to have a well-defined order? a) To allow flexibility in the steps **b) To ensure each step is completed in a specific sequence** c) To make it easier for the computing agent to skip steps 14. Which of the following best describes an effectively computable operation? a) An operation that requires expert knowledge to complete **b) An operation that can be carried out by a computing agent without needing further clarification** c) An operation that only professionals can understand 15. The instruction "Repeat" in the shampoo bottle example is incorrect because: a) It requires a professional to interpret **b) It is not a step in an algorithm** c) It is ambiguous and does not specify which steps to repeat 16. An algorithm must be composed of operations that are: a) Ambiguous and complex **b) Unambiguous and effectively computable** c) General and easy to understand 17. Why is it problematic to generate a list of all prime numbers in Step 1 of the incorrect algorithm? a) Prime numbers are difficult to find b) The list would be too long to sort **c) There are infinitely many prime numbers, making it impossible to complete in finite time** 18. What is required for an algorithm to be considered "effectively computable"? a) It must be understandable by experts **b) Each step must be executable without ambiguity** c) It must be easy to write 19. In a well-designed algorithm, the final step should: a) Repeat the first step b) Print an error message **c) Indicate that the process is complete** 20. An infinite loop in an algorithm occurs when: a) The algorithm takes too long **b) There is no condition to stop the repetition of steps** c) The algorithm is incorrect 21. The main advantage of the computer revolution is that it has: a) Reduced the number of physical tasks humans need to perform b) Allowed us to fully replace human creativity with machines **c) Automated repetitive mental tasks, freeing humans to engage in creative and strategic thinking** 22. Which of the following characteristics is not required for a set of instructions to be considered a valid algorithm? a) It must produce a result **b) It must be executable by a human** c) It must halt in a finite amount of time 23. What significant difference does the passage highlight between the development of computers and inventions like the telephone? a) Computers were created by a single inventor b) Computers appeared suddenly as a complete invention **c) Computers evolved over time through the contributions of many people** 24. An algorithmic solution is useful because it: a) Provides flexibility in the order of operations b) Allows creative problem-solving without any restrictions **c) Ensures tasks are completed in a clear, ordered, and repeatable way** 25. Which of the following best describes the role of algorithms in the context of the computer revolution? a) Algorithms allow computers to perform creative tasks **b) Algorithms enable automation of complex mental tasks** c) Algorithms make all human work unnecessary 26. What was John Napier's main contribution to mathematics? a) The invention of calculus **b) The creation of logarithms** c) The development of mechanical gears 27. What feature made the Jacquard loom an early form of a computing device? a) It could add and subtract numbers **b) It used memory and programmability** c) It generated mathematical tables automatically 28. Which of the following statements about Blaise Pascal's and Gottfried Leibniz's inventions is accurate? a) Both devices could perform only addition b) Pascal's device could perform addition and multiplication **c) Leibniz's device could perform addition, subtraction, multiplication, and division** 29. What was a significant limitation of early mechanical calculators like the Pascaline and Leibniz's Wheel? **a) They required human intervention to perform basic arithmetic** b) They had limited arithmetic capabilities c) They lacked memory and programmability 30. What innovation did Jacquard's loom introduce to the weaving process? ** a) Faster weaving speed** b) Programmability through punched cards c) Automatic repair of damaged threads 31. Which individual expanded on the ideas of Jacquard, Pascal, and Leibniz in the early 19th century? a) Joseph Jacquard b) John Napier **c) Charles Babbage** 32. Which computer was the first to be commercially sold? a) ENIAC b) EDVAC **c) UNIVAC I** 33. What major development occurred during the first generation of computers (1950-1957)? **a) First symbolic programming languages** b) Use of vacuum tubes for storage c) Introduction of high-resolution graphics 34. Which generation of computers saw the development of first operating systems and high-level programming languages? **a) Second generation (1957-1965)** b) Fourth generation (1975-1985) c) Third generation (1965-1975) 35. What is one of the advances in the fifth generation of computers (1985- present)? a) Introduction of punched card input/output **b) Use of massive external data storage devices** c) Use of vacuum tubes for storage 36. Which of the following technologies is associated with the potential future of computing? **a) Quantum computing** b) Supercomputers c) Graphical user interfaces 37. What has been one of the defining features of the development of computers over time? a) Consistently increasing reliability b) Slower advancements compared to other industries **c) Reduction in size and cost while increasing reliability and performance** 38. What is a disadvantage of using natural language to represent algorithms? a) It is more precise than pseudocode. **b) It can be verbose and unstructured.** c) It lacks the ability to express complex logic. 39. Why is pseudocode preferred over natural language for expressing algorithms? a) It uses simple words that anyone can understand. **b) It is more formal and structured, making algorithms easier to follow.** c) It is more relatable to everyday experiences. 40. What is the main challenge in using natural language to write algorithms? a) It can be too short and uninformative. **b) It lacks the precision and structure needed for clarity.** c) It is difficult for computers to execute. 41. What is a major issue with using natural language to represent algorithms? a) It is too precise and leaves no room for interpretation. **b) It can be ambiguous and open to multiple interpretations.** c) It is easier for a computer to execute. 42. Why is using a high-level programming language like C++ or Java not ideal for early algorithm design? **a) It requires too much attention to punctuation, grammar, and syntax.** b) It is too abstract and lacks clarity. c) It makes the algorithm too simple to implement. 43. What is the advantage of using pseudocode over natural language and high-level programming languages? a) It allows the algorithm to be executed directly on a computer. **b) It avoids ambiguity and syntax issues, focusing on algorithm logic.** c) It uses the same syntax as programming languages, making it easier to convert into code. 44. What is the primary purpose of pseudocode? a) To write code that runs on a computer. **b) To represent algorithms in a language-agnostic, easy-to-read format.** c) To introduce a new programming language. 45. Which of the following is an example of a sequential operation in pseudocode? **a) If x > 0, do this.** b) Set the value of area to πr². c) While i < 10, increment i. 46. Why is pseudocode helpful for algorithm design? a) It is directly executable on a computer. **b) It simplifies complex programming syntax into more understandable logic.** c) It enforces strict programming language rules. 47. What is the base used in the binary numbering system? a) 10 b) 8 **c) 2** d) 16 48. In the decimal system, the digit in the hundreds place is multiplied by: a) 10¹ **b) 10²** c) 10³ d) 10⁰ 49. Which of the following represents an external representation of information? **a) Binary system** b) Alphabetic characters c) Boolean Logic d) Logic gates 50. In the binary numbering system, the digit in the 2³ position represents: a) 4 b) 8 **c) 16** d) 2 51. Which of the following is an example of external representation of information? **a) 1011** b) +45 c) Logic gates d) Boolean algebra 52. What is the binary equivalent of the decimal number 23? a) 10101 **b) 10111** c) 11011 d) 11101 53. What is the largest unsigned integer that can be represented using 5 binary digits? a) 16 **b) 31** c) 32 d) 15 54. What is the result of converting the binary number 111001 to decimal? a) 57 b) 49 **c) 32** d) 63 55. When converting a decimal number to binary, the first step involves: a) Multiplying by 2 **b) Dividing by 2 and recording the quotient** c) Dividing by 2 and recording the remainder d) Subtracting powers of 2 56. Which of the following is not a numbering system used in computer science? a) Binary (base 2) b) Decimal (base 10) **c) Vigesimal (base 20)** d) Hexadecimal (base 16) 57. In sign/magnitude representation, what does the leftmost bit represent? a) The magnitude of the number **b) The sign of the number** c) The parity of the number d) The position of the number 58. What happens when adding 3 + (-3) in two's complement representation? a) It results in an error. **b) It equals zero with a carry in the most significant bit discarded.** c) It equals -6. d) It results in two zeros. 59. In the binary number 5.75 represented as 101.11, what does the .11 represent? a) 5/16 b) 3/4 **c) 1/2** d) 1/4 60. What is the binary representation of the fraction -5/16 in normalized scientific notation? a) -0.101 x 2⁻¹ b) -1.0101 x 2⁻² **c) -0.1101 x 2⁻³** d) -1.01 x 2⁻² 61. What is the term used for the smallest unit of a digitized image? **a) Pixel** b) Bit c) Byte d) Element 62. What format is commonly used for storing color images? a) Grayscale b) BMP **c) RGB** d) Monochrome 63. What is the result of the operation "True AND False"? a) True **b) False** c) 0 d) 1 64. Which of the following operations is a unary operator? a) AND b) OR **c) NOT** 65. The correct Boolean expression in this circuit diagram is a) Output = NOT( b AND c) b) Output = NOT c OR b **c) Output = b AND NOT c** 66. What is the output of a NOT gate when the input is 1? a) 1 **b) 0** c) Undefined 67. In C++ we use for input data **a) cin** b) cout c) Text_IO.Get 68. In Java we use for output data: a) console.write() b) print() **c) system.out.print()** 69. in python we use for input data a) cout b) input.nextInt() **c) input()** 70. Object code is a) source code **b) code in machine language** c) code in assembly language # What do you know about 1. Computer science 2. An algorithm 3. Iterative Operations 4. ENIAC Computer 5. First & Second Generation 6. Pseudocode 7. Boolean logic 8. Truth table for the OR operation 9. Pretest & Posttest loop 10. Transitions of a high-level language program # Fill in the blanks: * **Write an algorithm draw a flowchart to check if a number is even or odd.** * **Draw a flowchart to check if a number is positive or negative.** * **Write an algorithm and draw a flowchart to print all numbers from 1 to N using a loop.** * **Draw a flowchart to calculate the sum of numbers from 1 to N using a loop.** * **Draw a flowchart to calculate the factorial of a number N using a loop.**

Use Quizgecko on...
Browser
Browser