Scribd
Upload
25 views3 pages

CS Test 1

Uploaded by

Kyaw Myint Naing
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
25 views3 pages

CS Test 1

Uploaded by

Kyaw Myint Naing
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/ 3

Computer Science TEST 1

Name

Time : 1 hour
Answer all questions.

1. The following statement are TRUE or FALSE.


(i) A solution to a problem with these characteristics is called an algorithm. Most problems
have more than one solution, so different algorithms can be created for the same problem. TRUE
(ii) Algorithms and programs are the same things. An algorithm is a detailed design for a
solution; a program is when that design is implemented. FALSE
(iii) The pseudocode can be used to show an algorithm as a diagram. They provide a more
visual display. FALSE
(iv) An arithmetic operator is an operator that performs a calculation on two numbers. TRUE
(v) Variable is a ‘container’ used to store data. The data stored in a variable is referred to as a
value. The value stored in a variable is not fixed. The same variable can store different values
during the course of a program and each time a program is run. TRUE

(vi) Flowcharts can be used to code the solution in an actual programming language. FALSE
(vii) The constructs sequence, selection and iteration are the basic building blocks of
algorithms. TRUE
(viii) A ‘container’ that holds a value that never changes; like variables, constants have
unique identifiers is called logical operator. FALSE
(ix) Repeatedly applying a method to the results of a previous application of the method is
called recursion. TRUE
(x) Brute force means an algorithm design that works by dividing a problem into smaller and
smaller sub-problems, until they are easy to solve. The solutions to these are then combined
to give a solution to the complete problem. FALSE
2.(a) Match the flow chart symbols and related definitions. q

a b c d e

(i) Indicates an input or output c (iv) Shows the logical flow of the algorithm e

(ii) Indicates a process to be carried out b (v) Indicates a decision to be made d

(iii) Indicates the start or end of an algorithm a


(b) Produce a written description of an algorithm for making a cup of strawberry juice. It
should start with placing strawberry in container and end with mixing the juice. For example,
the algorithm could start with ‘Place some strawberry in blander’ and end with ‘stir’.

3. Match the following terms with related statements explanatory notes. (Write only alphabet)

(a) iteration (b) condition (c) high-level programming language (d) identifier

(e) developer (f) logic (g) selection (h) Consistency (i) Efficiency

(i) a construct that allows a choice to be made between different alternatives g


(ii) a unique name given to a variable or a constant. Using descriptive names for variables
makes code much easier to read d
(iii) a construct that means a process is repeated. An action is repeated until a condition is met
or a particular outcome is reached. It is often referred to as a ‘loop’ a
(iv) the principles and reasoning underlying the constructs and elements to be applied in
solving problems f
(v) a person whose job it is to create new software e

(vi) it must solve the problem in the shortest possible time, using as few computer resources
as possible. i

(vii) it must produce the same result each time it is run. h

(viii) a programming language that is similar to natural human language c

(ix) something that must happen before something else can happen b
4. A developer make a program for calculating the area of the tringle. The software could
accept base and height of the tringle from the users and the area of tringle will display to the
users. (Area of tringle = ½ * base * height )

a. Write written description for that algorithm.


b. Draw flowchart for that algorithm.
c. Create pseudocode for that algorithm.

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