More Classes

5th Class
6th Class
7th Class
8th Class
9th Class
10th Class
11th Class
12th Class
NAT I
NAT II
CSS
IQ
General Knowledge
MDCAT
ECAT
GAT General
GAT Subject

Computer Science 7th Class Chapter 3 Online Test MCQs With Answers

Question # 1

What is the tpe of algorithm that uses a random numebr to decide the expected outcome.

Choose an answer

Brute force algorihm

Recursive algorithm

Sorting algorithm

Randomized algorithm

Skip

Question # 2

Whicht feature in Scratch is used for infinite loops in which an object wil repeat its action forever.

Choose an answer

Loop forever

Forever loop

Infinite repeat

Repeat forever

Skip

Question # 3

The loops which are never going to end are called.

Choose an answer

Finite loops

Infinite loops

Intermediate loops

Simple loops

Skip

Question # 4

What is the first step in solving a problem with an algorighm.

Choose an answer

Desingning the algorithm

Fulfilling the prerequisites

Implementing the algorithm

Testing the algorithm

Skip

Question # 5

Which does the diamond symbol represent in a flowchart.

Choose an answer

Input/Output

Arrow

Terminal

Decision

Skip

Question # 6

The sequence where we repeat a specific set of instructions, again and again, is called.

Choose an answer

Condition

Sequence

Loop

All

Skip

Question # 7

Which symbol represents a process in a flochart.

Choose an answer

Terminal

Arrow

Action/Process

Decision

Skip

Question # 8

What is the characteristic of an algorithm that states that each step must be clear and lead to only one measning.

Choose an answer

Clear and unambiguous

Well-defined imputs

Well -defined outputs

Feasible

Skip

Question # 9

Breaking down a problem into sub-problems is called.

Choose an answer

Generalization

Doconstruction

Design

Pattern Recognition

Skip

Question # 10

Which strcuture executes a statement or set of statements only if the condition in true.

Choose an answer

Sequence strcuture

Selection strcuture

Conditinal structure

Repetition structure

Skip

Question # 11

Which step involves breaking down complex prblems into smaller parts.

Choose an answer

Decompostion

Pattern recongnition

Generalization and Abstraction

Algorithm Design

Skip

Back