stud
bud
Sign up
Log in
Home
Library
Explore
SAT
More
[CSCI 70 - S] Quiz #4 Flashcards | StudBud
Explore
/
[CSCI 70 - S] Quiz #4
[CSCI 70 - S] Quiz #4
33 terms
·
StudBud Administration
Imported from external platform
Flashcards
33 cards
F
Practice quiz
P
Host live
L
Questions
33
Answers
1
Pure functional programming languages support imperative paradigms.
True
False
2
What is the difference between compilation and interpretation?
Compilers don't convert high-level code to machine-readable code.
Interpreters don't convert high-level code to machine-readable code.
Interpreters execute programs
Compilers execute programs
3
A collection of programming concepts; the "core language" of a programming paradigm
Kernel Paradigm
Colonel Paradigm
Kernel Language
Colonel Sanders
4
This is what converts assembly code into machine code.
Compiler
Assembler
Assembly compiler
assemble.out
5
Which of the following is FALSE? All programming language are:
Defined by a set of programming concepts
Built on top of either C or Fortran
Abstractions between the physical computer and software programs
Defined by a set of programming paradigms
6
There is a one-to-one correspondence between a low-level language (like C) and the machine code it's converted to.
False
True
7
Which one is correctly matched?
Static Analysis : Semantics --- Parsing : Syntax
Static Analysis : Syntax --- Parsing : Syntax
Static Analysis : Semantics --- Parsing : Semantics
Static Analysis : Syntax --- Parsing : Semantics
8
Which of these shows the correct relationship?
Imperative: How --- Declarative: What
Imperative: How --- Declarative: How
Imperative: What --- Declarative: How
Imperative: What --- Declarative: What
9
Bytecode is an example of an intermediate representation
True
False
10
The middle-end converts the front-end PL to the back-end PL
True
False
11
Which of these is not a base notation in lambda calculus?
Application
All are base notations
Abstraction
Variable
12
Which of these is the first popular high-level programming language?
Lisp
Fortran
Plankalkül
Algol
13
Lexers and parsers are the same thing
True
False
14
Which one is correctly matched?
Parsing: Parse Tree --- Static Analysis : Parse Tree
Parsing: Abstract Syntax Tree --- Static Analysis : Parse Tree
Parsing: Parse Tree --- Static Analysis : Abstract Syntax Tree
Parsing: Abstract Syntax Tree --- Static Analysis : Abstract Syntax Tree
15
A program that emulates a hypothetical chip
Code Generation
P-code
Virtual Machine
Bytecode
16
Which of these is a correct match?
Imperative : Lambda Calculus --- Declarative: Turing Machine
Imperative : Turing Machine --- Declarative: Lambda Calculus
Imperative : Turing Machine --- Declarative: Turing Machine
Imperative : Lambda Calculus --- Declarative: Lambda Calculus
17
Which of these statements is true?
Only 2
Only 1
Neither
Both 1 and 2
18
Which of these is NOT a type of programming concept?
Concurrency
State
All of them are programming concepts
Closure
19
Which of these are true?
"2" is a nonterminal symbol
N is a terminal symbol
"+" is a terminal symbol
S is a nonterminal symbol
20
Why would you have a compiled AND interpreted programming language?
Compilation -> More Optimization -- Interpretation -> Platform-Independence
Compilation -> Platform-independence -- Interpretation -> More Optimization
21
A C compiler compiles assembly code into C code.
True
False
22
This occurs when a statement can be replaced with its corresponding value without changing the program's behavior
Substitution Opacity
Subsitution Transparency
Referential Transparency
Referential Opacity
23
A program that converts code from one machine language to another machine language counts as a transpiler
True
False
24
What programming concept exists in imperative programming but not in declarative programming?
Closures
Functions
State
Code Comments
25
Odd one out.
Parsing
Scanning
Lexing
Lexical Analysis
26
Modifying a global variable in a function leads to a
Peripheral Effect
Unexpected Change
Peripheral Change
Side Effect
27
This is the process when a syntax gets its grammar.
Static Analysis
Scanning
Dynamic Analysis
Parsing
28
This refers to software that takes code as input and executes the said code.
Compiler
Programming Language Implementation
Assembler
Parse tree
29
This is the process of compiling a high-level language to assembly before converting the assembly to machine code.
Linking
Post-compilation Assembly
Interpretation
Bootstrapping
30
A high-level language can be compiled directly into machine code.
False
True
31
This is a valid conversion
False
True
32
Code generation refers to the creation of either high-level or low-level code
False
True
33
This shows the possible substitutions for a nonterminal symbol
Context-free Grammar
Production Rule
Derivation
Terminal Symbol
