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. The three categories for a program structure are: ____ - Branching/Selection - Looping/Iteration
Sequence
top down
Scope Rule 2
Character
2. ______ Decision Making checks if a particular condition is true.
not
If-Then
system testing
trace tables
3. The five types of operands allowed in Pascal are: Integer - Real - Boolean - _____ - Constant
Formal parameters
Character
nested
Requirements Gathering/Analysis
4. Where the statements for the module are coded.
control
Procedures
definition
local
5. 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.
Formal parameters
parameters
control
value parameters
6. Less than - equal to - not equal to etc. are examples of _________
infinite loops
If-Then
selection structure
relational operators
7. A method of passing a variable to a program by making a copy of the variable and giving it to the called program.
Selection
implementation
compilation
pass by value
8. 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
nested
boolean
OR
9. <> is the symbol for ___ equal to
infinite loops
not
single
boolean
10. When true the if executes the body which is a _________ statement.
single
declaration
implementation
procedural abstraction
11. Used to trace the execution of an algorithm.
pass by reference
compound statement
variable parameters
trace tables
12. Parameters act like _____ variables within a module
software design
compound
top down
local
13. The space on the task which holds the formal parameters local variables and the return value.
testing
value parameters
Requirements Gathering/Analysis
stack frame
14. In Pascal Programs are executed one ______ at a time.
pass by value
statement
top down
binary half adder
15. It makes possible the selection of one of a number of alternative actions - which is implemented by an IF statement.
XOR
selection structure
candidate
compound
16. 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
If-Then
sequential structure
candidate
17. 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.
testing
AND
Modular
parameters
18. A method of passing a variable to a program by making a copy of the variable and giving it to the called program.
local
control
if
pass by reference
19. The order of operations from first to last are ___ - (* / DIV MOD AND) - (+ - OR) - (< > = <= >= <>)
If
Formal parameters
NOT
Repeat-Until
20. Boolean expressions can be simple or _______
procedural abstraction
compound
implementation
selection structure
21. Typically a variable that determines whether or not the loop executes or not.
single
stack frame
NOT
control
22. It encapsulates a sequence of statements as a single statement. Has a begin and end statement.
simple
compound statement
limited
if
23. 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.
simple
candidate
if-else
Scope Rule 2
24. Variable When a variable is declared under a procedure it is a _____ variable?
Local
Scope Rule 3
stack frame
if-then-else
25. Break system into manageable units or modules.
numeric
Sequence
nested
software design
26. The three logical flows that govern a structured program are: Sequence - ______ - and Repetition.
Selection
statement
infinite loops
fundamental scope principle
27. The creation (write) of the code.
implementation
If
compound
AND
28. Deploy the software and fix bugs and modify to satisfy changing requirements.
Scope Rule 2
Actual parameters
If
deployment/maintenance
29. This is where the module is invoked or called.
call
declaration
compound
definition
30. The two types of parameters are: ______ and Actual.
Formal
Actual parameters
Called
selection structure
31. The order of operations of the boolean operators from first to last is: NOT - AND - _____
pass by reference
Called
While-Do
OR
32. 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
Formal parameters
OR
nested
Requirements Gathering/Analysis
33. The five activities in the lifetime of a piece of software? are _______ - Design - Implementation (Coding) - Testing - Deployment/Maintenance.
Modular
Requirements Gathering/Analysis
OR
top down
34. Some logical operators in Pascal are: OR - AND - ___ - NOT - NAND - NOR
Selection
AND
candidate
XOR
35. Modulars are ________ from one another
definition
independent
top down
system testing
36. The scope of an entity is the program or subprogram in which it is declared.
control
Formal
fundamental scope principle
XOR
37. A _______ statement involves Decision making with two conditions (true or false). No semicolon after 'else.
binary half adder
Declaration
trace tables
if-then-else
38. ________ design is the key to the ability to create large systems.
NOT
binary half adder
fundamental scope principle
Modular
39. A parameter value that is used in a function call or in a message sent to an object.
system testing
Actual parameters
Scope Rule 1
trace tables
40. ______ design starts by identifying tasks at the bottom level and then combine them to solve the main problem.
Selection
compilation
bottom up
independent
41. Test each module in isolation and test the modules all together and make sure every line of code is tested.
pass by reference
OR
testing
Modular
42. True and False are the two _____ constants
boolean
single
limited
call
43. Breaking things into modules.
candidate
if
procedural abstraction
software design
44. _______ boolean expressions are formed by combining boolean expressions using the boolean operators (NOT - AND- OR).
compound
If
binary half adder
call
45. Modules can be called anywhere in the program - but must be done after their ______.
Character
numeric
compound statement
definition
46. The three statements in PASCAL that implement repetition structures:WHILE - FOR - ______.
Repeat-Until
call
if-else
If-Then
47. 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).
Modular
selection structure
While-Do
if-else
48. For an ____ Boolean Expression to be true if any Boolean expression evaluates to true then the entire expression evaluates to true.
limited
variable parameters
OR
top down
49. They can store values passed on to them but cannot return any values.
not
Local
value parameters
limited
50. A nested decision making statement can also have a ____ in the inner statement.
candidate
Else
compound
procedural abstraction