Deck 1: Introduction

Full screen (f)
exit full mode
Question
The syntax of a programming language is like the grammar of a natural language.
Use Space or
up arrow
down arrow
to flip the card.
Question
The ALGOL programming language provides support for recursive procedures.
Question
The lambda calculus was based on the theory of recursive functions.
Question
FORTRAN was the first programming language to be machine independent.
Question
A linker program is used to load machine code into computer memory.
Question
The first assembly languages appeared in the 1970s.
Question
Machine code was considered to be the first software.
Question
Machine language consists of entering a series of hexadecimal codes into the computer.
Question
A higher-order function returns a function as a value.
Question
An abstraction is a way of expressing ideas that make them concise,simple,and easy for the human mind to grasp.
Question
A structured control abstraction divides a program into groups of instructions.
Question
Before the middle of the 1940s,computer operators hardwired their programs by setting switches that adjusted the internal wiring of the computer.
Question
A procedure is a function that returns a value to its caller.
Question
Assembly language is standard across all types of computer hardware architectures.
Question
The syntax of a programming language refers to its meaning.
Question
The FORTRAN language provided support for algebraic notation and floating-point numbers.
Question
Assembly language consists of entering a series of binary codes into the computer.
Question
The lexical structure of a programming language is similar to grammar in a natural language.
Question
The use of variable names is considered to be a basic data abstraction.
Question
The primary feature of an imperative language is a sequence of statements that represent commands.
Question
____ was the first programming language to have a formal definition.

A) Assembly language
B) ALGOL
C) ADA
D) FORTRAN
Question
Lisp is based on the ____ model of computation.

A) functional
B) imperative
C) semantic
D) interpretive
Question
____ abstractions support information hiding.

A) Basic data
B) Structured data
C) Unit data
D) Structured control
Question
A translator that executes a program directly is called a compiler.
Question
An array is considered to be a ____.

A) basic data abstraction
B) structured data abstraction
C) unit abstraction
D) basic control abstraction
Question
Specification languages would allow users to indicate their requirements and would then implement those requirements.
Question
A programming language's words are referred to as tokens.
Question
Abstractions can be categorized in terms of ____,which can be viewed as measures of the amount of information contained (and hidden)in the abstraction.

A) procedures
B) statements
C) levels
D) protocols
Question
Which of the following statements about programming languages is correct?

A) ALGOL was developed before FORTRAN.
B) C language was developed before ALGOL.
C) The Ada language is based on Prolog.
D) Pascal is based on ALGOL.
Question
A variable in a programming language is considered to be a ____.

A) basic data abstraction
B) basic control abstraction
C) structured data abstraction
D) structured control abstraction
Question
A class is considered to be a ____.

A) basic data abstraction
B) basic control abstraction
C) structured data abstraction
D) unit abstraction
Question
A translator that produces an equivalent program in an executable form is called a compiler.
Question
A module,a class,and a package are all examples of ____

A) unit data abstractions
B) structured data abstractions
C) basic data abstractions
D) structured control abstractions
Question
A text file is considered to be a ____.

A) basic data abstraction
B) basic control abstraction
C) structured data abstraction
D) structured control abstraction
Question
In a program,selection and iteration are accomplished by the use of ____.

A) structured data abstractions
B) application programming interfaces
C) branch instructions
D) syntactic sugar
Question
The term ____ refers to a programming language mechanism that replaces a complex notation with a simpler notation.

A) shorthand
B) syntactic sugar
C) semantic sugar
D) API
Question
A virtual machine is an interpreter.
Question
Variables are given names and data types using a ____.

A) declaration
B) function
C) structure
D) package
Question
The ____ abstraction is often associated with the concept of an abstract data type.

A) unit data
B) basic data
C) structured data
D) structured control
Question
A(n)____ gives a programmer information about a resource's classes,methods,and functions.

A) library
B) package
C) API
D) component
Question
An iterator is an example of a ____.

A) basic data abstraction
B) basic control abstraction
C) structured data abstraction
D) structured control abstraction
Question
An enhanced for loop is an example of a ____.

A) basic data abstraction
B) basic control abstraction
C) collection
D) syntactic sugar
Question
The lexical structure of a programming language is similar to the ____ in a natural language

A) grammar
B) syntax
C) semantics
D) spelling
Question
____ languages allow the user to enter the requirements for a program and have the system implement the requirements..

A) Imperative
B) Functional
C) Definitive
D) Specification
Question
A(n)____ takes source code as input and translates it into a program that is executable.

A) interpreter
B) compiler
C) linker
D) loader
Question
Which of the following statements about a programming language is correct?

A) Syntax refers to the structure of the language, while semantics refers to the meaning of the language.
B) Semantics refers to the structure of the language, while syntax refers to the meaning of the language.
C) Syntax refers to the structure of the language, while abstraction refers to the meaning of the language.
D) Semantics refers to the structure of the language, while abstraction refers to the meaning of the language.
Question
Threads in Java are an example of ____.

A) basic data abstractions
B) basic control abstractions
C) structured control abstractions
D) unit control abstractions
Question
A map is an example of a(n)____.

A) iterator
B) API
C) higher-order function
D) procedure
Question
A(n)____ is an object associated with a collection,and is used to visit each element in the collection.

A) interpreter
B) iterator
C) invocator
D) argument
Question
The ____ programming paradigm has achieved widespread use over the last 20 years.

A) functional
B) logic
C) object-oriented
D) assembler
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/50
auto play flashcards
Play
simple tutorial
Full screen (f)
exit full mode
Deck 1: Introduction
1
The syntax of a programming language is like the grammar of a natural language.
True
2
The ALGOL programming language provides support for recursive procedures.
True
3
The lambda calculus was based on the theory of recursive functions.
True
4
FORTRAN was the first programming language to be machine independent.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
5
A linker program is used to load machine code into computer memory.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
6
The first assembly languages appeared in the 1970s.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
7
Machine code was considered to be the first software.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
8
Machine language consists of entering a series of hexadecimal codes into the computer.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
9
A higher-order function returns a function as a value.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
10
An abstraction is a way of expressing ideas that make them concise,simple,and easy for the human mind to grasp.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
11
A structured control abstraction divides a program into groups of instructions.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
12
Before the middle of the 1940s,computer operators hardwired their programs by setting switches that adjusted the internal wiring of the computer.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
13
A procedure is a function that returns a value to its caller.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
14
Assembly language is standard across all types of computer hardware architectures.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
15
The syntax of a programming language refers to its meaning.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
16
The FORTRAN language provided support for algebraic notation and floating-point numbers.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
17
Assembly language consists of entering a series of binary codes into the computer.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
18
The lexical structure of a programming language is similar to grammar in a natural language.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
19
The use of variable names is considered to be a basic data abstraction.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
20
The primary feature of an imperative language is a sequence of statements that represent commands.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
21
____ was the first programming language to have a formal definition.

A) Assembly language
B) ALGOL
C) ADA
D) FORTRAN
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
22
Lisp is based on the ____ model of computation.

A) functional
B) imperative
C) semantic
D) interpretive
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
23
____ abstractions support information hiding.

A) Basic data
B) Structured data
C) Unit data
D) Structured control
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
24
A translator that executes a program directly is called a compiler.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
25
An array is considered to be a ____.

A) basic data abstraction
B) structured data abstraction
C) unit abstraction
D) basic control abstraction
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
26
Specification languages would allow users to indicate their requirements and would then implement those requirements.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
27
A programming language's words are referred to as tokens.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
28
Abstractions can be categorized in terms of ____,which can be viewed as measures of the amount of information contained (and hidden)in the abstraction.

A) procedures
B) statements
C) levels
D) protocols
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
29
Which of the following statements about programming languages is correct?

A) ALGOL was developed before FORTRAN.
B) C language was developed before ALGOL.
C) The Ada language is based on Prolog.
D) Pascal is based on ALGOL.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
30
A variable in a programming language is considered to be a ____.

A) basic data abstraction
B) basic control abstraction
C) structured data abstraction
D) structured control abstraction
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
31
A class is considered to be a ____.

A) basic data abstraction
B) basic control abstraction
C) structured data abstraction
D) unit abstraction
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
32
A translator that produces an equivalent program in an executable form is called a compiler.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
33
A module,a class,and a package are all examples of ____

A) unit data abstractions
B) structured data abstractions
C) basic data abstractions
D) structured control abstractions
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
34
A text file is considered to be a ____.

A) basic data abstraction
B) basic control abstraction
C) structured data abstraction
D) structured control abstraction
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
35
In a program,selection and iteration are accomplished by the use of ____.

A) structured data abstractions
B) application programming interfaces
C) branch instructions
D) syntactic sugar
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
36
The term ____ refers to a programming language mechanism that replaces a complex notation with a simpler notation.

A) shorthand
B) syntactic sugar
C) semantic sugar
D) API
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
37
A virtual machine is an interpreter.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
38
Variables are given names and data types using a ____.

A) declaration
B) function
C) structure
D) package
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
39
The ____ abstraction is often associated with the concept of an abstract data type.

A) unit data
B) basic data
C) structured data
D) structured control
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
40
A(n)____ gives a programmer information about a resource's classes,methods,and functions.

A) library
B) package
C) API
D) component
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
41
An iterator is an example of a ____.

A) basic data abstraction
B) basic control abstraction
C) structured data abstraction
D) structured control abstraction
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
42
An enhanced for loop is an example of a ____.

A) basic data abstraction
B) basic control abstraction
C) collection
D) syntactic sugar
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
43
The lexical structure of a programming language is similar to the ____ in a natural language

A) grammar
B) syntax
C) semantics
D) spelling
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
44
____ languages allow the user to enter the requirements for a program and have the system implement the requirements..

A) Imperative
B) Functional
C) Definitive
D) Specification
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
45
A(n)____ takes source code as input and translates it into a program that is executable.

A) interpreter
B) compiler
C) linker
D) loader
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
46
Which of the following statements about a programming language is correct?

A) Syntax refers to the structure of the language, while semantics refers to the meaning of the language.
B) Semantics refers to the structure of the language, while syntax refers to the meaning of the language.
C) Syntax refers to the structure of the language, while abstraction refers to the meaning of the language.
D) Semantics refers to the structure of the language, while abstraction refers to the meaning of the language.
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
47
Threads in Java are an example of ____.

A) basic data abstractions
B) basic control abstractions
C) structured control abstractions
D) unit control abstractions
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
48
A map is an example of a(n)____.

A) iterator
B) API
C) higher-order function
D) procedure
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
49
A(n)____ is an object associated with a collection,and is used to visit each element in the collection.

A) interpreter
B) iterator
C) invocator
D) argument
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
50
The ____ programming paradigm has achieved widespread use over the last 20 years.

A) functional
B) logic
C) object-oriented
D) assembler
Unlock Deck
Unlock for access to all 50 flashcards in this deck.
Unlock Deck
k this deck
locked card icon
Unlock Deck
Unlock for access to all 50 flashcards in this deck.