Deck 12: Computer Programming
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/175
Play
Full screen (f)
Deck 12: Computer Programming
1
The procedural approach and procedural languages tend to produce programs that run quickly and use system resources efficiently.
True
2
Assembly language is an example of a third-generation language.
False
3

False
4
Pseudocode is more formalized than structured English.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
5
The unknown information in a problem statement is the information that you supply to the computer to help it solve a problem.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
6
A function is also called a goroutine.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
7
Syntax errors are very easy to make, but are typically difficult to detect and correct.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
8

Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
9
Systems analyst is a synonym for software engineer.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
10
Algorithms are typically written in a format that is specific to a particular programming language.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
11
A selection control structure is also called a decision structure or branch.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
12
Logic errors are usually more difficult to identify than syntax errors.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
13

Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
14
A high-level language is useful when a programmer needs to directly manipulate what happens at the hardware level.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
15
Remarks should be added to the sections of a program in which the purpose of the code is not immediately clear.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
16
A programming paradigm refers to a way of conceptualizing and structuring the tasks a computer performs.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
17
The BASIC programming language does not have procedural characteristics.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
18
In an OO paradigm, a public attribute is available for use by any routine in the program.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
19
The object-oriented paradigm is based on the idea that the solution for a problem can be visualized in terms of objects that interact with each other.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
20
A repetition control structure directs the computer to repeat one or more instructions until a certain condition is met.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
21
The procedural paradigm focuses on describing the problem.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
22
When coding programs in a procedural language, the order of program instructions is not really important.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
23
The process of finding a value for a variable is referred to as instantiation .
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
24
Many declarative languages use a collection of facts and steps to describe a problem.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
25
All the first programming languages were declarative .
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
26
A(n) run-time error occurs when a line of code does not follow the grammar rules for a programming language.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
27
The declarative paradigm emphasizes the evaluation of expressions, called "functions," rather than the execution of commands.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
28
Buffer overflows cannot be prevented.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
29
In the code: shapeof(pizza,round) , the words outside of the parentheses are called arguments.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
30
Before finalizing the algorithm for a computer program, you should perform a(n) problem assessment to verify that your algorithm works.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
31
Polymorphism allows a programmer to define different getArea() methods for each subclass.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
32
During indexed execution, the computer performs each instruction in the order it appears.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
33
Protected code is a software program that identifies its source and carries a digital certificate attesting to its authenticity.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
34
A(n) first-generation language allows programmers to use abbreviated command words, called op codes, such as LDA for load, rather than the 1s and 0s used in machine languages.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
35
Defensive programming is an approach to software development in which programmers anticipate what might go wrong as their programs run, and take steps to smoothly handle those situations.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
36
In the Prolog fact, likes (dog,biscuits) ..."likes" is called the argument .
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
37
A repetition control structure is sometimes referred to as a(n) loop .
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
38
Codification is a notational system for algorithms that has been described as a mixture of English and your favorite programming language.
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
39
Keywords and parameters are combined with punctuation according to a series of rules called syntax .
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
40
The process of passing certain characteristics from one class to other classes is referred to as inheritance .
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
41
Typically programmers use assembly languages to write ____.
A) system software
B) interactive tutorials
C) event-driven programs
D) None of the above
A) system software
B) interactive tutorials
C) event-driven programs
D) None of the above
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
42
____ refers to entering the list of commands that become a computer program.
A) Specification
B) Coding
C) Verification
D) Assessment
A) Specification
B) Coding
C) Verification
D) Assessment
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
43
A(n) ____ language is a low-level language in which instructions are represented by 1s and 0s that the microprocessor can execute directly.
A) assembly
B) syntactical
C) instruction-based
D) machine
A) assembly
B) syntactical
C) instruction-based
D) machine
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
44
In the context of programming, a problem ____ defines certain elements that must be manipulated to achieve a result or goal.
A) pseudocode
B) algorithm
C) statement
D) matrix
A) pseudocode
B) algorithm
C) statement
D) matrix
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
45
A(n) ____ language allows a programmer to use instructions that resemble human language.
A) low-level
B) high-level
C) assembly
D) machine
A) low-level
B) high-level
C) assembly
D) machine
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
46
A syntax error can be caused by ____.
A) using incorrect punctuation
B) misspelling a command word
C) omitting a command word
D) all of the above
A) using incorrect punctuation
B) misspelling a command word
C) omitting a command word
D) all of the above
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
47
Programmers typically use a ____ to code computer programs.
A) generic text editor
B) program editor
C) VDE
D) all of the above
A) generic text editor
B) program editor
C) VDE
D) all of the above
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
48
A good problem statement for a computer program has which of the following characteristics?
A) It specifies any assumptions that define the problem's scope
B) It clearly specifies the known information
C) It specifies when the problem has been solved
D) All of the above
A) It specifies any assumptions that define the problem's scope
B) It clearly specifies the known information
C) It specifies when the problem has been solved
D) All of the above
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
49
____ English is a subset of the English language with a limited selection of sentence structures that reflect processing activities.
A) Indexed
B) Pseudo
C) Structured
D) Flowchart
A) Indexed
B) Pseudo
C) Structured
D) Flowchart
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
50
A(n) ____ error shows up, for example, from instructions that the computer cannot execute.
A) analysis
B) runtime
C) syntax
D) all of the above
A) analysis
B) runtime
C) syntax
D) all of the above
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
51
Programming languages are categorized by ____.
A) level
B) generation
C) paradigm
D) all of the above
A) level
B) generation
C) paradigm
D) all of the above
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
52
Software ____ refers to a program development process in which mathematical, engineering, and management techniques are applied to reduce the cost and complexity of a computer program while increasing its reliability and modifiability.
A) programming
B) engineering
C) coding
D) analysis
A) programming
B) engineering
C) coding
D) analysis
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
53
The ____ paradigm emphasizes linear, step-by-step algorithms that provide the computer with instructions on how to solve a problem or carry out a task.
A) procedural
B) object-oriented
C) functional
D) declarative
A) procedural
B) object-oriented
C) functional
D) declarative
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
54
In a problem statement, a(n) ____ is something that you accept as true in order to proceed with program planning.
A) assumption
B) cardinal rule
C) validation
D) algorithm
A) assumption
B) cardinal rule
C) validation
D) algorithm
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
55
In a flowchart, a calculation is indicated by a ____.
A) diamond shape
B) rectangle
C) rhombus
D) black dot
A) diamond shape
B) rectangle
C) rhombus
D) black dot
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
56
In a flowchart, a connector is indicated by a ____.
A) diamond shape
B) rectangle
C) rhombus
D) black dot
A) diamond shape
B) rectangle
C) rhombus
D) black dot
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
57
Research has shown that, on average, a programmer can write, test, and document only ____ lines of code per day.
A) 20
B) 120
C) 250
D) 550
A) 20
B) 120
C) 250
D) 550
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
58
Fourth-generation languages, such as SQL, are typically used for ____.
A) interactive tutorials
B) database applications
C) system software
D) event-driven programs
A) interactive tutorials
B) database applications
C) system software
D) event-driven programs
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
59
A(n) ____ error is an error in the design of the program.
A) run-time
B) analysis
C) logic
D) syntax
A) run-time
B) analysis
C) logic
D) syntax
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
60
____ is a notational system for algorithms that has been described as a mix of English and your favorite programming language.
A) Structured English
B) Flowcharting
C) Codification
D) Pseudocode
A) Structured English
B) Flowcharting
C) Codification
D) Pseudocode
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
61
A class ____ visually presents the relationships between superclasses and subclasses.
A) network
B) grid
C) roster
D) hierarchy
A) network
B) grid
C) roster
D) hierarchy
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
62
Unless you specify otherwise, ____ execution is the normal pattern of program execution.
A) repetition
B) sequential
C) selection
D) indexed
A) repetition
B) sequential
C) selection
D) indexed
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
63
Most programming languages provide ____ types of control structures.
A) two
B) three
C) five
D) eleven
A) two
B) three
C) five
D) eleven
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
64
A ____ attribute can be accessed only from the routine in which it is defined.
A) global
B) public
C) private
D) located
A) global
B) public
C) private
D) located
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
65
The names of methods usually end in a set of ____.
A) parentheses
B) braces
C) brackets
D) quotation marks
A) parentheses
B) braces
C) brackets
D) quotation marks
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
66
A simple example of a selection control structure is the ____ command.
A) GO...TO
B) IF...THEN...ELSE
C) IF...WHEN
D) FOR...THEN
A) GO...TO
B) IF...THEN...ELSE
C) IF...WHEN
D) FOR...THEN
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
67
A(n) ____ is an unit of data that represents an abstract or a real-world entity.
A) method
B) class
C) message
D) object
A) method
B) class
C) message
D) object
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
68
In BASIC, lines that begin with ____ contain comments that explain each section of the program.
A) Comm
B) Comment
C) Note
D) Rem
A) Comm
B) Comment
C) Note
D) Rem
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
69
Objects can be grouped into a(n) _________.
A) class
B) aggregate
C) cluster
D) assembly
A) class
B) aggregate
C) cluster
D) assembly
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
70
Executing a ____ command directs the computer to a different section of the program.
A) NEWSECT
B) THEN
C) MOVE
D) GOSUB
A) NEWSECT
B) THEN
C) MOVE
D) GOSUB
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
71
A class can produce any number of unique ____.
A) indices
B) methods
C) paradigms
D) objects
A) indices
B) methods
C) paradigms
D) objects
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
72
Functions are sometimes referred to as ____.
A) indices
B) schemas
C) algorithms
D) procedures
A) indices
B) schemas
C) algorithms
D) procedures
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
73

A) Java
B) UML
C) DFD
D) flowchart
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
74
In a flowchart, a start (or end) is indicated by a ____.
A) rounded rectangle
B) black dot
C) circle
D) diamond shape
A) rounded rectangle
B) black dot
C) circle
D) diamond shape
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
75
A ____ attribute is available for use by any routine in a program.
A) private
B) public
C) local
D) basic
A) private
B) public
C) local
D) basic
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
76
The data types used to define class attributes are similar to the data types for defining database ____.
A) fields
B) records
C) tables
D) relationships
A) fields
B) records
C) tables
D) relationships
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
77
A(n) ____ is used to manipulate an object.
A) action
B) method
C) activity
D) attribute
A) action
B) method
C) activity
D) attribute
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
78
A(n) ____ control structure changes the order in which instructions are executed by directing the computer to execute an instruction elsewhere in the program.
A) order
B) indexed
C) sequence
D) iterative
A) order
B) indexed
C) sequence
D) iterative
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
79
Which of the following is a repetition command?
A) FOR...NEXT
B) DO...WHILE
C) DO...UNTIL
D) all of the above
A) FOR...NEXT
B) DO...WHILE
C) DO...UNTIL
D) all of the above
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck
80
In a flowchart, a decision is indicated by a ____.
A) diamond shape
B) rectangle
C) rhombus
D) black dot
A) diamond shape
B) rectangle
C) rhombus
D) black dot
Unlock Deck
Unlock for access to all 175 flashcards in this deck.
Unlock Deck
k this deck