Deck 9: Advanced Modularization Techniques

Question 1

When methods must share data, you can pass the data into and return the data out of methods.

Answer 1

True

Question 2

Variables and constants are ____ within, or local to, only the method in which they are declared.

A) in scope
B) out of bounds
C) out of scope
D) limited

Answer 2

A

Question 3

Programs that use recursion are error-prone but easy to debug.

Answer 3

False

Question 4

A method's name and parameter list constitute the method's ____.

A) header
B) interface
C) contract
D) signature

Question 5

You can invoke or call a method from another program or method.

Question 6

You can think of the ____ in a method declaration as a funnel into the method.

A) braces
B) brackets
C) parentheses
D) commas

Question 7

The input value that makes the recursion stop is called the base case or ending case.

Question 8

The variables in the method declaration that accept the values from the actual parameters are ____ parameters.

A) defined
B) proper
C) formal
D) actual

Question 9

A method's declared return type must match the type of value used in the return statement.

Question 10

A calling method sends a(n) ____ to a called method.

A) parameter
B) interface
C) object
D) argument

Question 11

A called method accepts the value of an argument passed to it as its ____.

A) parameter
B) reference
C) baseline
D) argument

Question 12

When a copy of a variable is sent to a method, it is passed by ____.

A) reference
B) inference
C) insinuation
D) value

Question 13

When a data item is known to all of a program's modules, it is a ____data item.

A) scope
B) defined
C) local
D) global

Question 14

Each time a method executes, any parameter variables listed in the method header are ____.

A) examined
B) redeclared
C) referenced
D) copied

Question 15

The last statement in a method is a(n) ____.

A) begin statement
B) return statement
C) exit statement
D) end statement

Question 16

A method's return type is part of its signature.

Question 17

A method could be called using any numeric value as an argument, whether it is a variable, a named constant, or a literal constant.

Question 18

In implementation hiding, the calling method needs to understand only the interface to the method that is called and it need not know how the method works internally.

Question 19

All modern programming languages contain many methods that are predefined.

Question 20

Methods with identical names that have identical parameter lists but different return types are ambiguous.

Question 21

Every time you call a method, the address to which the program should return at the completion of the method is stored in a memory location called the ____.

A) heap
B) queue
C) stack
D) dump

Question 22

When you ____ a method, you write multiple methods with a shared name but different parameter lists.

A) stack
B) overload
C) overhead
D) void

Question 23

____ is a measure of the strength of the connection between two program methods.

A) Coupling
B) Cohesion
C) Bonding
D) Binding

Question 24

Programmers refer to hidden implementation details as existing in a(n) ____________________.

Question 25

____ occurs when a method is defined in terms of itself.

A) Referential integrity
B) Repeatability
C) Dependence
D) Recursion

Question 26

Using recursion successfully requires a thorough understanding of ____________________.

Question 27

____ refers to how the internal statements of a method serve to accomplish the method's purpose.

A) Coupling
B) Cohesion
C) Bonding
D) Binding

Question 28

Using implementation hiding means that the ____ is the only part of a method with which the method's client interacts.

A) argument list
B) interface to the method
C) parameter list
D) internal detail

Question 29

____ is the ability of a method to act appropriately depending on the context.

A) Cohesion
B) Chameleon
C) Integrity
D) Polymorphism

Question 30

The method name and parameter list constitute the  ____.

A) signature
B) input list
C) title
D) variable list

Question 31

____ occurs when methods do not depend on others.

A) Tight coupling
B) Loose coupling
C) Data coupling
D) Abstract coupling

Question 32

Arrays, unlike simple built-in types, are passed by ____.

A) deference
B) value
C) reference
D) configuration

Question 33

When a data item is known to all of a program's modules, it is a(n) ____________________ data item.

Question 34

Programmers use the term ____ to describe any extra time and resources required by an operation.

A) black box
B) overhead
C) overload
D) cohesion

Question 35

____ provide an overview of input to the method, the processing steps that must occur, and the result.

A) Stacks
B) Hierarchy charts
C) IPO charts
D) Flowcharts

Question 36

____ occurs when methods excessively depend on each other and makes programs more prone to errors.

A) Late coupling
B) Loose coupling
C) Tight coupling
D) Weak coupling

Question 37

A method that calls itself is a ____.

A) recursive method
B) repeated method
C) self-referencing method
D) simple method

Question 38

When the method ends at the ____________________ statement, the locally declared parameter variable ceases to exist.

Question 39

A method can return nothing, in which case the method is a ____ method.

A) null
B) void
C) nul
D) empty

Question 40

A(n) ____________________ chart is a tool that identifies and categorizes each item needed within the method as pertaining to input, processing, or output.

Question 41

Discuss loose coupling.

Question 43

List the items that must be included within the method declaration's parentheses.

Question 44

Describe recursion.

Question 45

Explain what happens when you call a method and the method ends.

Question 46

List the four things you need to know when you call a method from a program or other method.

Question 47

Discuss tight coupling.

Question 48

Describe how you create and use a method with multiple parameters.

Question 49

Discuss the cumulative summing relationship.

Question 50

Describe what a method's return statement can return.

Question 51

List the three things that you need to know to design effective methods.