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. A body of ______ consists of multiple statements. The statements do have a semicolon - including the end (from the begin and end).
XOR
definition
If-Then
value parameters
2. The five types of operands allowed in Pascal are: Integer - Real - Boolean - _____ - Constant
Character
integration testing
relational operators
trace tables
3. A ________ statement is what follows the 'then' in an (if-then statement) and precedes the first semi-colon.
simple
variable parameters
trace tables
boolean
4. Loops that never end because the stopping/exit condition is never met.
single
Formal
statement
infinite loops
5. Test each module in isolation and test the modules all together and make sure every line of code is tested.
testing
sequential structure
value parameters
Scope Rule 1
6. All modules must be _____ and they can call other modules.
OR
selection structure
sequential structure
Called
7. 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.
Requirements Gathering/Analysis
NOT
parameters
value parameters
8. The two types of parameters that can be implemented with PASCAL are: _______ and Functions.
control
Procedures
compound statement
independent
9. Less than - equal to - not equal to etc. are examples of _________
relational operators
if-else
deployment/maintenance
integration testing
10. They can store values passed on to them but cannot return any values.
sequential structure
parameters
OR
value parameters
11. Some logical operators in Pascal are: OR - AND - ___ - NOT - NAND - NOR
While-Do
Else
Selection
XOR
12. In a multiple ____ statement (Non-Exclusive Condition) any or all or none of the conditions may be true - they are independent.
infinite loops
Formal
If
binary half adder
13. Deploy the software and fix bugs and modify to satisfy changing requirements.
definition
deployment/maintenance
If-Then
value parameters
14. It encapsulates a sequence of statements as a single statement. Has a begin and end statement.
statement
compound statement
definition
compound
15. The two types of parameters are: ______ and Actual.
Formal
value parameters
OR
declaration
16. The scope of an entity is the program or subprogram in which it is declared.
fundamental scope principle
Local
trace tables
Actual parameters
17. A method of passing a variable to a program by making a copy of the variable and giving it to the called program.
relational operators
pass by reference
call
nested
18. Modulars are ________ from one another
variable parameters
independent
bottom up
Scope Rule 2
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.
stack frame
If-Then
Modular
Scope Rule 3
20. A parameter that is specified as part of a function definition.
binary half adder
candidate
OR
Formal parameters
21. True and False are the two _____ constants
NOT
system testing
boolean
relational operators
22. Where the statements for the module are coded.
call
Sequence
compilation
definition
23. Variable When a variable is declared under a procedure it is a _____ variable?
sequential structure
Local
implementation
compound
24. Refers to the execution of a sequence of statements in the order in which they appear so that each statement is executed exactly once.
Called
sequential structure
stack frame
Scope Rule 2
25. _____ error happens when the type and number of parameters does not match?
if
numeric
Sequence
compilation
26. Boolean expressions can be simple or _______
compound
pass by reference
single
Sequence
27. Modules are defined in the ______ part of a program - under the constant.
declaration
compound statement
software design
While-Do
28. <> is the symbol for ___ equal to
fundamental scope principle
Scope Rule 1
not
Else
29. The three logical flows that govern a structured program are: Sequence - ______ - and Repetition.
software design
Selection
simple
pass by value
30. Modules can be called anywhere in the program - but must be done after their ______.
definition
Local
NOT
If-Then
31. The creation (write) of the code.
procedural abstraction
pass by value
Formal
implementation
32. Breaking things into modules.
definition
Repeat-Until
independent
procedural abstraction
33. Parameters act like _____ variables within a module
candidate
local
call
variable parameters
34. A method of passing a variable to a program by making a copy of the variable and giving it to the called program.
system testing
parameters
pass by value
compound
35. _______ boolean expressions are formed by combining boolean expressions using the boolean operators (NOT - AND- OR).
Character
procedural abstraction
compound
Formal parameters
36. _______ design starts with high level idea of a solution and successively refine it. It favors hierarchial organization.
definition
compound
top down
AND
37. 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.
implementation
integration testing
if
If-Then
38. 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.
candidate
While-Do
selection structure
fundamental scope principle
39. 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.
pass by value
Scope Rule 2
AND
Repeat-Until
40. 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.
relational operators
integration testing
if
software design
41. 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
Modular
if
deployment/maintenance
42. The five activities in the lifetime of a piece of software? are _______ - Design - Implementation (Coding) - Testing - Deployment/Maintenance.
stack frame
fundamental scope principle
if
Requirements Gathering/Analysis
43. A ______ operand cannot be applied to an AND boolean operator
numeric
Selection
if
Requirements Gathering/Analysis
44. Typically a variable that determines whether or not the loop executes or not.
selection structure
OR
control
integration testing
45. The space on the task which holds the formal parameters local variables and the return value.
pass by reference
stack frame
AND
infinite loops
46. An ____ statement evaluates a Boolean expression. The code will only be executed when the expression evaluates to true.
if
stack frame
boolean
If-Then
47. The order of operations from first to last are ___ - (* / DIV MOD AND) - (+ - OR) - (< > = <= >= <>)
if
If-Then
NOT
Declaration
48. A parameter value that is used in a function call or in a message sent to an object.
trace tables
compound
Actual parameters
declaration
49. It makes possible the selection of one of a number of alternative actions - which is implemented by an IF statement.
If-Then
selection structure
variable parameters
compound
50. Break system into manageable units or modules.
implementation
software design
Scope Rule 1
relational operators