Test your basic knowledge |

Pascal Programming

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 space on the task which holds the formal parameters local variables and the return value.






2. The stucture of a procedure: Heading - ______ - Statement






3. ________ design is the key to the ability to create large systems.






4. Deploy the software and fix bugs and modify to satisfy changing requirements.






5. A ________ statement is what follows the 'then' in an (if-then statement) and precedes the first semi-colon.






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






7. The three logical flows that govern a structured program are: Sequence - ______ - and Repetition.






8. A ______ operand cannot be applied to an AND boolean operator






9. Parameters act like _____ variables within a module






10. 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.






11. A nested decision making statement can also have a ____ in the inner statement.






12. A logical circuit which is used to add two binary digits.






13. Refers to the execution of a sequence of statements in the order in which they appear so that each statement is executed exactly once.






14. Variable When a variable is declared under a procedure it is a _____ variable?






15. In a multiple ____ statement (Non-Exclusive Condition) any or all or none of the conditions may be true - they are independent.






16. When true the if executes the body which is a _________ statement.






17. Where the statements for the module are coded.






18. It makes possible the selection of one of a number of alternative actions - which is implemented by an IF statement.






19. In Pascal Programs are executed one ______ at a time.






20. 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.






21. The order of operations of the boolean operators from first to last is: NOT - AND - _____






22. Break system into manageable units or modules.






23. It encapsulates a sequence of statements as a single statement. Has a begin and end statement.






24. The order of operations from first to last are ___ - (* / DIV MOD AND) - (+ - OR) - (< > = <= >= <>)






25. <> is the symbol for ___ equal to






26. 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.






27. The five types of operands allowed in Pascal are: Integer - Real - Boolean - _____ - Constant






28. The scope of an entity is the program or subprogram in which it is declared.






29. 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.






30. A method of passing a variable to a program by making a copy of the variable and giving it to the called program.






31. The three categories for a program structure are: ____ - Branching/Selection - Looping/Iteration






32. _______ design starts with high level idea of a solution and successively refine it. It favors hierarchial organization.






33. Some logical operators in Pascal are: OR - AND - ___ - NOT - NAND - NOR






34. Modules can be called anywhere in the program - but must be done after their ______.






35. A _______ statement involves Decision making with two conditions (true or false). No semicolon after 'else.






36. 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.






37. A _________ statement is what follows the 'then' in an (if-then statement) and is enclosed within the begin-end pair.






38. The testing of the complete program to determine the overall system functions.






39. _____ error happens when the type and number of parameters does not match?






40. 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.






41. All modules must be _____ and they can call other modules.






42. For an ____ Boolean Expression to be true if any Boolean expression evaluates to true then the entire expression evaluates to true.






43. Local variables have _______ kind of scope






44. Modulars are ________ from one another






45. A method of passing a variable to a program by making a copy of the variable and giving it to the called program.






46. 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.






47. A body of ______ consists of multiple statements. The statements do have a semicolon - including the end (from the begin and end).






48. True and False are the two _____ constants






49. 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).






50. Used to trace the execution of an algorithm.