Scribd
Upload
5 views4 pages

Grade 2 - Computer Science - Final Exam 2025

The document outlines the final exam for Grade 2 Computer Science, consisting of 35 questions totaling 50 marks, to be completed in 2 hours. It includes a variety of question types, such as multiple choice, true/false, and algorithm writing. Instructions emphasize answering all questions, marking correctly, and providing page numbers.

Uploaded by

atifiqba0
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views4 pages

Grade 2 - Computer Science - Final Exam 2025

The document outlines the final exam for Grade 2 Computer Science, consisting of 35 questions totaling 50 marks, to be completed in 2 hours. It includes a variety of question types, such as multiple choice, true/false, and algorithm writing. Instructions emphasize answering all questions, marking correctly, and providing page numbers.

Uploaded by

atifiqba0
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

FINAL EXAM 2025

SUBJECT – COMPUTER SCIENCE


GRADE – 2
TOTAL MARKS – 50
TOTAL TIME – 2 HOURS

INSTRUCTIONS:
 Answer all questions.
 Provide page number in your answer sheet
 Marks the answer numbers correctly
 The number of marks for each question or part question is shown in brackets [].

Q1. Select the picture that shows the fastest way to find a book at the library. A or B? [1]

Q2. We can collect data and put it into group or _______.


[1]
Q3. What type of question type it is?
[1]

Q4. A copy of data is called _________. [1]


Q5. ____________ is the physical object and __________ is a computer program. [2]

Q6. Software can be used to create pictures. TRUE or FALSE? [1]

Q7. Identify and write the input and output devices from the below picture. [3]

Q8. Write algorithm to find shortest path to from point 1 to point 2. [2]
Q9. Debugging with others helps to find the errors easily. TRUE or FALSE? [1]

Q10. What this program will so? [1]

Q11. Write algorithm for drawing letter E. [4]

Q12. Which icon shows that the device connect to network without wires? [1]

Q13. What is Malware? [2]

Q14. Write expansion for SMART. [2]

Q15. What is testing program? [2]

Q16. What is the output of the algorithm if 28 is input? [1]

Q17. Find errors and correcting mistakes are called ______. [1]

Q18. Computers can perform task for long time. TRUE or FALSE? [1]

Q19. Difference between real and fictional robot. [2]

Q20. Which of these jobs would be easier for a computer to do? [1]
a. Count number of words in a book

b. Write a joke

c. Cut the grass

Q21. Danny uses his device to design things. Which device Danny should use? [1]

Q22. A ________ is a precise set of instructions. [1]

Q23. A ___________ is a set of instructions that a computer understands. [1]

Q24. Instructions for a computer must be unclear. TRUE or FALSE? [1]

Q25. Look at the code and algorithm below. [2]

a. Does the code match the algorithm?

b. Which steps contain errors?

Q26. What is bug? [2]

Q27. Repeat block is used to __________. [1]

Q28. Look into the algorithm for getting out of maze. Find the error and correct it. [1]

Q29. Write difference between statistical and non-statistical question. [2]

Q30. State if the following data collected is numerical or categorical.

a. Student belongs to one of four houses. [1]


b. A reading on the thermometer. [1]

Q31. Data is used to _______. [1]

Q32. What is an e-reader? [1]

Q33. What is a connected device? [1]

Q34. Connected devices can share devices like printers. TRUE or FALSE? [1]

Q35. Wireless networks are popular at homes and cafes. TRUE or FALSE? [1]

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy