SUBJECTS
|
BROWSE
|
CAREER CENTER
|
POPULAR
|
JOIN
|
LOGIN
Business Skills
|
Soft Skills
|
Basic Literacy
|
Certifications
About
|
Help
|
Privacy
|
Terms
|
Email
Search
Test your basic knowledge |
Pascal Programming
Start Test
Study First
Subject
:
it-skills
Instructions:
Answer 50 questions in 15 minutes.
If you are not ready to take this test, you can
study here
.
Match each statement with the correct term.
Don't refresh. All questions and answers are randomly picked and ordered every time you load a test.
This is a study tool. The 3 wrong answers for each question are randomly chosen from answers to other questions. So, you might find at times the answers obvious, but you will see it re-enforces your understanding as you take the test each time.
1. Modules are defined in the ______ part of a program - under the constant.
If
numeric
Local
declaration
2. For an ____ Boolean Expression to be true if any Boolean expression evaluates to true then the entire expression evaluates to true.
Called
value parameters
top down
OR
3. A method of passing a variable to a program by making a copy of the variable and giving it to the called program.
OR
Selection
pass by reference
statement
4. The space on the task which holds the formal parameters local variables and the return value.
parameters
simple
infinite loops
stack frame
5. A parameter value that is used in a function call or in a message sent to an object.
variable parameters
Scope Rule 2
Actual parameters
limited
6. Break system into manageable units or modules.
infinite loops
deployment/maintenance
statement
software design
7. Boolean expressions can be simple or _______
Called
statement
pass by reference
compound
8. Test each module in isolation and test the modules all together and make sure every line of code is tested.
testing
variable parameters
if-then-else
compound
9. A _________ statement is what follows the 'then' in an (if-then statement) and is enclosed within the begin-end pair.
definition
compound
binary half adder
infinite loops
10. The three logical flows that govern a structured program are: Sequence - ______ - and Repetition.
Selection
fundamental scope principle
variable parameters
compound statement
11. All modules must be _____ and they can call other modules.
Called
compound
Declaration
Formal
12. Modulars are ________ from one another
compound
Repeat-Until
pass by value
independent
13. The five activities in the lifetime of a piece of software? are _______ - Design - Implementation (Coding) - Testing - Deployment/Maintenance.
Requirements Gathering/Analysis
While-Do
Scope Rule 3
bottom up
14. In a multiple ____ statement (Non-Exclusive Condition) any or all or none of the conditions may be true - they are independent.
boolean
limited
If
integration testing
15. The testing of the complete program to determine the overall system functions.
compound
Local
procedural abstraction
system testing
16. An ______ statement evaluates a Boolean expression. A different code will be executed if the expression evaluates to true (the body of the if) than if the expression evaluates to false (the body of the else).
system testing
call
if-else
fundamental scope principle
17. Less than - equal to - not equal to etc. are examples of _________
Scope Rule 1
Selection
While-Do
relational operators
18. An _____ statement allows the programmer to specify the statement selected for execution when the expression is true. It also indicates an alternative statement when the expression is false.
value parameters
if
binary half adder
declaration
19. An entity declared in a subprogram can be accessed by any subprogram defined within it - provided that no entity with the same name is declared in the internal subprogram.
Scope Rule 3
Called
system testing
statement
20. In ______ decision making when the first decision must evaluate to true before the successive (next) decisions are even considered for evaluation. One decision is made inside another. The outer decisions must evaluate to true before inner decisions a
pass by reference
Formal
nested
If-Then
21. An item declared within a procedure or function is not accessible outside that procedure or function.
Scope Rule 1
independent
local
compound statement
22. Local variables have _______ kind of scope
candidate
Requirements Gathering/Analysis
simple
limited
23. The two types of parameters that can be implemented with PASCAL are: _______ and Functions.
Requirements Gathering/Analysis
Procedures
compound
relational operators
24. Modules can be called anywhere in the program - but must be done after their ______.
definition
compound
Scope Rule 1
compound
25. A logical circuit which is used to add two binary digits.
binary half adder
If-Then
sequential structure
Scope Rule 3
26. Finding a ________ module is the process of going from a problem description to writing a program that fulfills those requirements. They cannot be summarized in just a series of steps that fit all scenarios.
independent
declaration
candidate
binary half adder
27. <> is the symbol for ___ equal to
value parameters
compound
statement
not
28. The order of operations from first to last are ___ - (* / DIV MOD AND) - (+ - OR) - (< > = <= >= <>)
If
compound statement
NOT
Formal
29. Refers to the execution of a sequence of statements in the order in which they appear so that each statement is executed exactly once.
statement
Called
Else
sequential structure
30. Typically a variable that determines whether or not the loop executes or not.
Scope Rule 1
NOT
single
control
31. Deploy the software and fix bugs and modify to satisfy changing requirements.
parameters
deployment/maintenance
Requirements Gathering/Analysis
relational operators
32. The creation (write) of the code.
nested
boolean
implementation
numeric
33. The stucture of a procedure: Heading - ______ - Statement
simple
implementation
local
Declaration
34. A ______ statement is generally used when the number of times that the loop executes is not known in advance. The loop executes as long as the boolean expression is true.
Formal
Repeat-Until
simple
While-Do
35. A method of passing a variable to a program by making a copy of the variable and giving it to the called program.
binary half adder
NOT
pass by value
limited
36. The scope of an entity is the program or subprogram in which it is declared.
fundamental scope principle
XOR
Declaration
stack frame
37. For an ____ Boolean Expression to be true the Boolean expressions must evaluate to true before the entire expression is true. If any expression is false then whole expression evaluates to false.
if
compound
candidate
AND
38. True and False are the two _____ constants
pass by value
Selection
software design
boolean
39. Some logical operators in Pascal are: OR - AND - ___ - NOT - NAND - NOR
stack frame
compound
XOR
compilation
40. A ______ operand cannot be applied to an AND boolean operator
numeric
If
nested
While-Do
41. The two types of parameters are: ______ and Actual.
candidate
Formal
control
Repeat-Until
42. A special kind of variable used in a subroutine to refer to one of the pieces of data provided as input to the subroutine. Values can be passed from outside the procedure.
single
parameters
not
sequential structure
43. When true the if executes the body which is a _________ statement.
not
bottom up
single
nested
44. In Pascal Programs are executed one ______ at a time.
While-Do
numeric
definition
statement
45. A parameter that is specified as part of a function definition.
Formal parameters
Scope Rule 1
independent
relational operators
46. An ____ statement evaluates a Boolean expression. The code will only be executed when the expression evaluates to true.
Scope Rule 3
Declaration
nested
if
47. A body of ______ consists of multiple statements. The statements do have a semicolon - including the end (from the begin and end).
nested
If-Then
call
selection structure
48. _______ boolean expressions are formed by combining boolean expressions using the boolean operators (NOT - AND- OR).
system testing
value parameters
testing
compound
49. ______ design starts by identifying tasks at the bottom level and then combine them to solve the main problem.
numeric
bottom up
Else
local
50. Breaking things into modules.
nested
procedural abstraction
Else
pass by value