7th Class Computer MCQ Test with Answers | Computer Science Chapter 3

Top Scorers Of Chapter 3 "Computer Science 7th Class Chapter 3 Online Test" MCQ`s Test

Sr.#	Question	Answer
1	The algorithm which goes through al possible solutions untill the required soultionin found is.	A. Recursive Algorithm B. Searchign algorithm C. Brute force algorithm D. Sortig algorithm
2	Which of the following is an example of coputations thingking	A. Recipe to bake a cake B. Reding a bicycle C. Listening to music D. Painting a picture
3	What is the efficiency of a solution based on in terms of the given paremeters.	A. Numbers of lines of code B. amount of memory available C. Number of steps executed D. Complexity of the solution
4	Which does the diamond symbol represent in a flowchart.	A. Input/Output B. Arrow C. Terminal D. Decision
5	Whicht feature in Scratch is used for infinite loops in which an object wil repeat its action forever.	A. Loop forever B. Forever loop C. Infinite repeat D. Repeat forever
6	Breaking down a problem into sub-problems is called.	A. Generalization B. Doconstruction C. Design D. Pattern Recognition
7	The loops which have to be terminated are called.	A. Infinite loops B. Finite loops C. Simple loops D. INermediate loops
8	Which symbol represents a process in a flochart.	A. Terminal B. Arrow C. Action/Process D. Decision
9	The sequence where we repeat a specific set of instructions, again and again, is called.	A. Condition B. Sequence C. Loop D. All
10	Discover the principles that caue the patterns of a problem is called.	A. Generalization B. Design C. pattern Recognition D. Deconstruction