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. _______ design starts with high level idea of a solution and successively refine it. It favors hierarchial organization.
top down
compilation
compound
Requirements Gathering/Analysis
2. In Pascal Programs are executed one ______ at a time.
definition
call
statement
While-Do
3. The three logical flows that govern a structured program are: Sequence - ______ - and Repetition.
Selection
deployment/maintenance
Formal
if-else
4. It makes possible the selection of one of a number of alternative actions - which is implemented by an IF statement.
selection structure
if
if-else
deployment/maintenance
5. Deploy the software and fix bugs and modify to satisfy changing requirements.
definition
not
value parameters
deployment/maintenance
6. 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
Requirements Gathering/Analysis
statement
nested
7. True and False are the two _____ constants
If-Then
numeric
Declaration
boolean
8. 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.
compound
if-else
implementation
integration testing
9. For an ____ Boolean Expression to be true if any Boolean expression evaluates to true then the entire expression evaluates to true.
OR
independent
single
Actual parameters
10. Local variables have _______ kind of scope
integration testing
Character
Local
limited
11. Modulars are ________ from one another
infinite loops
Declaration
independent
Formal
12. Less than - equal to - not equal to etc. are examples of _________
If-Then
compound statement
relational operators
definition
13. 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.
pass by reference
Modular
if
Else
14. _______ boolean expressions are formed by combining boolean expressions using the boolean operators (NOT - AND- OR).
Scope Rule 1
pass by value
sequential structure
compound
15. 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.
system testing
OR
While-Do
Repeat-Until
16. Typically a variable that determines whether or not the loop executes or not.
relational operators
declaration
fundamental scope principle
control
17. The stucture of a procedure: Heading - ______ - Statement
Procedures
integration testing
sequential structure
Declaration
18. 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 reference
not
Local
compilation
19. The two types of parameters that can be implemented with PASCAL are: _______ and Functions.
compilation
Repeat-Until
Procedures
stack frame
20. A _________ statement is what follows the 'then' in an (if-then statement) and is enclosed within the begin-end pair.
compound
Procedures
Selection
sequential structure
21. Breaking things into modules.
trace tables
system testing
testing
procedural abstraction
22. Loops that never end because the stopping/exit condition is never met.
Formal
If-Then
declaration
infinite loops
23. A logical circuit which is used to add two binary digits.
Scope Rule 1
pass by reference
limited
binary half adder
24. Test each module in isolation and test the modules all together and make sure every line of code is tested.
not
Scope Rule 1
testing
If
25. 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.
Sequence
Called
if-else
AND
26. 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.
XOR
pass by reference
Scope Rule 2
If-Then
27. A body of ______ consists of multiple statements. The statements do have a semicolon - including the end (from the begin and end).
parameters
If-Then
AND
nested
28. Modules are defined in the ______ part of a program - under the constant.
local
Modular
NOT
declaration
29. When true the if executes the body which is a _________ statement.
numeric
single
limited
relational operators
30. Parameters act like _____ variables within a module
local
declaration
if-then-else
software design
31. A parameter value that is used in a function call or in a message sent to an object.
control
Actual parameters
bottom up
Local
32. ______ design starts by identifying tasks at the bottom level and then combine them to solve the main problem.
bottom up
Selection
compilation
Procedures
33. The two types of parameters are: ______ and Actual.
Called
independent
Formal
fundamental scope principle
34. The order of operations of the boolean operators from first to last is: NOT - AND - _____
procedural abstraction
OR
infinite loops
XOR
35. 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).
definition
If-Then
if-else
NOT
36. Modules can be called anywhere in the program - but must be done after their ______.
if
definition
boolean
Character
37. 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
variable parameters
testing
Scope Rule 3
38. The five types of operands allowed in Pascal are: Integer - Real - Boolean - _____ - Constant
Character
if
candidate
Called
39. The order of operations from first to last are ___ - (* / DIV MOD AND) - (+ - OR) - (< > = <= >= <>)
single
AND
NOT
compilation
40. A ______ operand cannot be applied to an AND boolean operator
if-else
Formal
OR
numeric
41. A parameter that is specified as part of a function definition.
limited
Procedures
Formal parameters
AND
42. Used to trace the execution of an algorithm.
compilation
definition
sequential structure
trace tables
43. All modules must be _____ and they can call other modules.
Called
Scope Rule 3
declaration
definition
44. They can both receive and return values.
variable parameters
integration testing
bottom up
stack frame
45. In a multiple ____ statement (Non-Exclusive Condition) any or all or none of the conditions may be true - they are independent.
While-Do
If
XOR
Actual parameters
46. 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.
Sequence
Scope Rule 3
declaration
fundamental scope principle
47. An item declared within a procedure or function is not accessible outside that procedure or function.
deployment/maintenance
Scope Rule 1
Actual parameters
compound
48. The scope of an entity is the program or subprogram in which it is declared.
if
fundamental scope principle
Local
compound statement
49. The three categories for a program structure are: ____ - Branching/Selection - Looping/Iteration
selection structure
local
Requirements Gathering/Analysis
Sequence
50. Variable When a variable is declared under a procedure it is a _____ variable?
variable parameters
simple
Local
Selection