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. Where the statements for the module are coded.
pass by value
if-then-else
definition
Sequence
2. A method of passing a variable to a program by making a copy of the variable and giving it to the called program.
pass by value
binary half adder
boolean
procedural abstraction
3. The five activities in the lifetime of a piece of software? are _______ - Design - Implementation (Coding) - Testing - Deployment/Maintenance.
fundamental scope principle
Requirements Gathering/Analysis
deployment/maintenance
Repeat-Until
4. 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.
AND
if-else
call
Scope Rule 3
5. _______ design starts with high level idea of a solution and successively refine it. It favors hierarchial organization.
Actual parameters
top down
compilation
Modular
6. Modules can be called anywhere in the program - but must be done after their ______.
While-Do
definition
control
Modular
7. 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.
testing
While-Do
not
if
8. A logical circuit which is used to add two binary digits.
pass by value
local
binary half adder
sequential structure
9. A ______ operand cannot be applied to an AND boolean operator
compound
numeric
testing
simple
10. <> is the symbol for ___ equal to
not
candidate
trace tables
Selection
11. The order of operations of the boolean operators from first to last is: NOT - AND - _____
Sequence
Called
OR
Local
12. 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).
limited
software design
XOR
if-else
13. It makes possible the selection of one of a number of alternative actions - which is implemented by an IF statement.
if-else
binary half adder
fundamental scope principle
selection structure
14. An ____ statement evaluates a Boolean expression. The code will only be executed when the expression evaluates to true.
procedural abstraction
Scope Rule 2
if
Declaration
15. In a multiple ____ statement (Non-Exclusive Condition) any or all or none of the conditions may be true - they are independent.
trace tables
If-Then
If
Called
16. 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
parameters
nested
Else
17. For an ____ Boolean Expression to be true if any Boolean expression evaluates to true then the entire expression evaluates to true.
OR
Modular
compound
integration testing
18. Breaking things into modules.
value parameters
if-else
limited
procedural abstraction
19. A method of passing a variable to a program by making a copy of the variable and giving it to the called program.
definition
candidate
if
pass by reference
20. A parameter that is specified as part of a function definition.
value parameters
Formal parameters
if
deployment/maintenance
21. The three logical flows that govern a structured program are: Sequence - ______ - and Repetition.
Selection
Scope Rule 1
XOR
Else
22. A _______ statement involves Decision making with two conditions (true or false). No semicolon after 'else.
NOT
if-then-else
top down
local
23. ________ design is the key to the ability to create large systems.
Modular
call
pass by value
While-Do
24. Boolean expressions can be simple or _______
variable parameters
selection structure
OR
compound
25. Refers to the execution of a sequence of statements in the order in which they appear so that each statement is executed exactly once.
if-then-else
Repeat-Until
Formal
sequential structure
26. The stucture of a procedure: Heading - ______ - Statement
AND
system testing
Declaration
Character
27. Typically a variable that determines whether or not the loop executes or not.
definition
declaration
not
control
28. _____ error happens when the type and number of parameters does not match?
independent
Procedures
single
compilation
29. An item declared within a procedure or function is not accessible outside that procedure or function.
While-Do
simple
Scope Rule 1
testing
30. The testing of the complete program to determine the overall system functions.
system testing
numeric
Else
candidate
31. The order of operations from first to last are ___ - (* / DIV MOD AND) - (+ - OR) - (< > = <= >= <>)
NOT
stack frame
call
compound
32. A body of ______ consists of multiple statements. The statements do have a semicolon - including the end (from the begin and end).
fundamental scope principle
independent
testing
If-Then
33. 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
value parameters
Declaration
numeric
34. A ________ statement is what follows the 'then' in an (if-then statement) and precedes the first semi-colon.
binary half adder
simple
control
independent
35. Loops that never end because the stopping/exit condition is never met.
Selection
infinite loops
trace tables
stack frame
36. All modules must be _____ and they can call other modules.
binary half adder
nested
Called
compound statement
37. They can both receive and return values.
variable parameters
implementation
Scope Rule 2
Modular
38. 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
OR
trace tables
definition
39. This is where the module is invoked or called.
if
While-Do
not
call
40. When true the if executes the body which is a _________ statement.
single
If
Character
procedural abstraction
41. The two types of parameters that can be implemented with PASCAL are: _______ and Functions.
Requirements Gathering/Analysis
Procedures
Character
boolean
42. The three statements in PASCAL that implement repetition structures:WHILE - FOR - ______.
Procedures
nested
stack frame
Repeat-Until
43. 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
If
selection structure
software design
44. _______ boolean expressions are formed by combining boolean expressions using the boolean operators (NOT - AND- OR).
declaration
If-Then
compound
deployment/maintenance
45. A nested decision making statement can also have a ____ in the inner statement.
relational operators
single
integration testing
Else
46. Modulars are ________ from one another
Formal
if
independent
nested
47. ______ Decision Making checks if a particular condition is true.
if
If-Then
fundamental scope principle
implementation
48. Some logical operators in Pascal are: OR - AND - ___ - NOT - NAND - NOR
XOR
compound
single
Formal
49. Local variables have _______ kind of scope
trace tables
independent
limited
If-Then
50. 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.
procedural abstraction
Local
Selection
if