0% found this document useful (0 votes)
4 views

9th Comp chapter 1

This document is a test paper for 9th-grade Computer Science students at Superior Science Academy, consisting of multiple-choice questions, short answer questions, and essay questions. It covers topics such as flow charts, algorithms, problem-solving, and testing solutions. The total marks for the test are 50, with a time limit of 1 hour and 30 minutes.

Uploaded by

usmanalipilot
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
4 views

9th Comp chapter 1

This document is a test paper for 9th-grade Computer Science students at Superior Science Academy, consisting of multiple-choice questions, short answer questions, and essay questions. It covers topics such as flow charts, algorithms, problem-solving, and testing solutions. The total marks for the test are 50, with a time limit of 1 hour and 30 minutes.

Uploaded by

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

SUPERIOR SCIENCE ACADEMY

Paper: Computer Science Test-01 Class:


9th
Student Name: …………………………………. Father Name: ……………………………………..

Maximum Marks: 50 Time Allowed: 1 hour 30 Mins

Q. No.1:- MCQ’s (10×1=10)

i. Which symbol is used at the beginning and end of flow chart?


(a) Oval (b) Line (c) Diamond (d) Parallelogram
ii. It should be ……………………. before solving any problem.
(a) Test (b) Fixation (c) Choice/Selection (d) To analysis
iii. Which of the following conditional operations in a flow chart:
(a) Terminal (b) Decision (c) Flow lines (d) Process
iv. How many possible solutions are there of a problem?
(a) One (b) Two (c) Three (d) Many
v. Which solutions are not reached through proper or work planning.
(a) Bad solutions (b) Strategized solution (c) Candid solution (d) Prepared solution
vi. Which algorithm notation is usually required in loops?
(a) Set (b) Goto (c) Input (d) If, else
vii. Which type of test data is used to establish, where does the largest and smallest value occurs?
(a) Absent test data (b) Abnormal test data (c) Wrong data format (d) Boundary test data
viii. In ………., error the solution is working but not giving the correct results.
(a) Run time error (b) Syntax error (c) Logical error (d) Random error
ix. An algorithm must terminate after how many steps:
(a) Five (b) Two (c) Infinite (d) Finite
x. …………….. means to test, whether the solution is correct or not?
(a) Trace table (b) Instruction table (c) Arithmetic table (d) Output table

Section – B

Q. No.2:- Attempt the following short questions. (12×2=24)

i. What is candid solution?


ii. Determine the essential requirements to make a flow chart.
iii. Draw a flow chart to find the volume of a cylinder.
iv. Write the steps of planning a solution.
v. What are 5 W’s?
vi. Why is it necessary to get the background knowledge of problem?
vii. Why testing of a solution is important?
viii. What is trace table?
ix. Write any three advantages of algorithm.
x. What are boundary test data values?
xi. What is process of validation?
xii. Define algorithm.

Q. No.3: Attempt TWO questions. All questions carry equal marks: (2×8=16)

Q. No.1: Give the name of symbols used in a flow chart, their diagrams and their use.

Q. No.2: What do you mean by problem solving? Describe the problem solving process.

You might also like