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. All modules must be _____ and they can call other modules.
compound
Modular
top down
Called
2. _______ boolean expressions are formed by combining boolean expressions using the boolean operators (NOT - AND- OR).
compound
variable parameters
Local
Scope Rule 1
3. To test that the subprograms are integrated into the program correctly. That they interact with one another correctly - passing the required information to and from one another.
Declaration
call
integration testing
selection structure
4. For an ____ Boolean Expression to be true if any Boolean expression evaluates to true then the entire expression evaluates to true.
Modular
OR
call
Selection
5. 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.
While-Do
Local
Declaration
OR
6. True and False are the two _____ constants
definition
If
boolean
Procedures
7. They can both receive and return values.
trace tables
single
procedural abstraction
variable parameters
8. Breaking things into modules.
procedural abstraction
infinite loops
software design
parameters
9. 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.
nested
Scope Rule 3
OR
If-Then
10. ______ design starts by identifying tasks at the bottom level and then combine them to solve the main problem.
boolean
parameters
bottom up
AND
11. The five types of operands allowed in Pascal are: Integer - Real - Boolean - _____ - Constant
compound
Requirements Gathering/Analysis
Character
Sequence
12. 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
Scope Rule 1
nested
parameters
value parameters
13. The order of operations from first to last are ___ - (* / DIV MOD AND) - (+ - OR) - (< > = <= >= <>)
Procedures
binary half adder
Scope Rule 2
NOT
14. An ____ statement evaluates a Boolean expression. The code will only be executed when the expression evaluates to true.
Modular
OR
declaration
if
15. A global entity is accessible throughout the main program and in any subprogram in which no local entity has the same name as the global item.
Scope Rule 2
If-Then
system testing
Else
16. A parameter value that is used in a function call or in a message sent to an object.
If-Then
NOT
Actual parameters
integration testing
17. They can store values passed on to them but cannot return any values.
infinite loops
if
Selection
value parameters
18. Boolean expressions can be simple or _______
Scope Rule 2
Procedures
compound
Else
19. 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.
parameters
OR
candidate
Actual parameters
20. <> is the symbol for ___ equal to
not
Else
Selection
Scope Rule 2
21. When true the if executes the body which is a _________ statement.
fundamental scope principle
Sequence
testing
single
22. The two types of parameters that can be implemented with PASCAL are: _______ and Functions.
Character
procedural abstraction
Scope Rule 2
Procedures
23. 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.
call
AND
independent
While-Do
24. A method of passing a variable to a program by making a copy of the variable and giving it to the called program.
if
pass by value
control
boolean
25. _______ design starts with high level idea of a solution and successively refine it. It favors hierarchial organization.
stack frame
OR
top down
value parameters
26. Variable When a variable is declared under a procedure it is a _____ variable?
declaration
Local
pass by reference
OR
27. The three categories for a program structure are: ____ - Branching/Selection - Looping/Iteration
numeric
Declaration
sequential structure
Sequence
28. 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).
Formal
Sequence
Procedures
if-else
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.
sequential structure
Scope Rule 1
not
OR
30. The order of operations of the boolean operators from first to last is: NOT - AND - _____
parameters
OR
independent
Scope Rule 2
31. This is where the module is invoked or called.
call
independent
local
Declaration
32. Used to trace the execution of an algorithm.
bottom up
trace tables
Formal parameters
definition
33. Modules can be called anywhere in the program - but must be done after their ______.
stack frame
definition
parameters
AND
34. Modules are defined in the ______ part of a program - under the constant.
single
declaration
pass by reference
While-Do
35. Test each module in isolation and test the modules all together and make sure every line of code is tested.
Actual parameters
relational operators
Scope Rule 3
testing
36. It makes possible the selection of one of a number of alternative actions - which is implemented by an IF statement.
selection structure
pass by reference
binary half adder
Scope Rule 1
37. The three statements in PASCAL that implement repetition structures:WHILE - FOR - ______.
binary half adder
definition
Repeat-Until
procedural abstraction
38. Deploy the software and fix bugs and modify to satisfy changing requirements.
deployment/maintenance
infinite loops
software design
Scope Rule 2
39. Some logical operators in Pascal are: OR - AND - ___ - NOT - NAND - NOR
definition
XOR
system testing
if
40. Break system into manageable units or modules.
definition
sequential structure
Declaration
software design
41. In Pascal Programs are executed one ______ at a time.
sequential structure
if
statement
software design
42. Loops that never end because the stopping/exit condition is never met.
statement
infinite loops
procedural abstraction
declaration
43. _____ error happens when the type and number of parameters does not match?
relational operators
compilation
OR
not
44. Typically a variable that determines whether or not the loop executes or not.
AND
variable parameters
control
Selection
45. Modulars are ________ from one another
Else
boolean
independent
Scope Rule 1
46. In a multiple ____ statement (Non-Exclusive Condition) any or all or none of the conditions may be true - they are independent.
If
Character
If-Then
not
47. The five activities in the lifetime of a piece of software? are _______ - Design - Implementation (Coding) - Testing - Deployment/Maintenance.
integration testing
candidate
compilation
Requirements Gathering/Analysis
48. Where the statements for the module are coded.
definition
if
boolean
if
49. ________ design is the key to the ability to create large systems.
Modular
Formal parameters
infinite loops
deployment/maintenance
50. It encapsulates a sequence of statements as a single statement. Has a begin and end statement.
infinite loops
procedural abstraction
compound statement
compound