SUBJECTS
|
BROWSE
|
CAREER CENTER
|
POPULAR
|
JOIN
|
LOGIN
Business Skills
|
Soft Skills
|
Basic Literacy
|
Certifications
About
|
Help
|
Privacy
|
Terms
|
Email
Search
Test your basic knowledge |
Programming
Start Test
Study First
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. A program in a high-level language before being compiled.
infix
prompt
low-level language
source code
2. A way of developing programs starting with a prototype and gradually testing and improving it.
slice
prototype development
immutable
class attribute
3. A special symbol that represents a simple computation like addition or multiplication or string concatenation.
operator
key-value pair
pure function
chained conditional
4. A reserved word that is used by the compiler to parse program; you cannot use keywords like if or def or while as variable names.
instantiate
precondition
body
keyword
5. A program that translates higher level programming languages into basic instructions the CPU can understand.
text file
compiler
prototype development
object-oriented programming
6. The ability to combine simple expressions and statements into compound statements and expressions in order to represent complex computations concisely.
composition
wrapper
docstring
boolean value
7. A language that provides features - such as user-defined classes and inheritance - that facilitate object-oriented programming.
clone
modifier
object-oriented programming
object-oriented language
8. An integer variable or value that indicates an element of a list.
index
binary operator
operator overloading
delimiter
9. A branch of the conditional statement in a recursive function that does not result in a recursive call.
condition
postorder
base case
recursion
10. The process of finding and removing any of the three kinds of programming errors.
test-driven development (TDD)
mode
attribute
debugging
11. A value provided to a function when the function is called. This value is assigned to the corresponding parameter in the function.
argument
standard library
root
problem solving
12. An operation whose runtime does not depend on the size of the data structure.
constant
decrement
command prompt
constant time
13. A function that calls itself recursively without ever reaching the base case - ultimately causes a runtime error.
generalize
infinite recursion
nested loop
polymorphic
14. There are exactly two boolean values: True and False.
instance
boolean value
operator overloading
boolean expression
15. One of the operators that combines boolean expressions: and or and not.
logical operator
loop
scaffolding
encode
16. A software development practice which arrives at a desired feature through a series of small but iterative steps motivated by automated tests which are written first that express increasing refinements of the desired feature.
accumulator
test-driven development (TDD)
postfix
class attribute
17. A syntactic construct which enables lists to be generated from other lists using a syntax analogous to the mathematical set-builder notation.
path
list comprehension
postfix
composition (of functions)
18. A data structure that implements a collection using a sequence of linked nodes.
linked list
compound data type
linked queue
interface
19. One of the basic elements of the syntactic structure of a program - analogous to a word in a natural language.
token
slice
expression
side effect
20. A method that acts as a middleman between a caller and a helper method - often making the method easier or less error-prone to invoke.
return value
loop
child class
wrapper
21. A class definition that implements an ADT with method definitions that are invocations of other methods - sometimes with simple transformations. It does no significant work but it improves or standardizes the interface seen by the client.
veneer
generalize
pure function
clone
22. A name used inside a function to refer to the value passed as an argument.
loop
mutable type
handle an exception
parameter
23. To simplify an expression by performing the operations in order to yield a single value.
event loop
import statement
cursor
evaluate
24. The node that refers to a given node.
fundamental ambiguity theorem
type conversion
parent
link
25. A situation in which two or more names in a given namespace cannot be unambiguously resolved.
command line argument
variable name
naming collision
newline
26. One of the nodes referred to by a node.
argv (argument vector)
random
child
boolean expression
27. A statement that causes the current iteration of a loop to end.
command prompt
binary tree
local variable
continue statement
28. The second part of a compound statement. The body consists of a sequence of statements all indented the same amount from the beginning of the header.
node
body
file system
object-oriented language
29. A sequence of one or more characters used to specify the boundary between separate parts of text.
object
delimiter
dictionary
constant
30. To follow the flow of execution of a program by hand - recording the change of state of the variables and any output produced.
volatile memory
boolean function
trace
sequence
31. Any one of the languages that people have designed for specific purposes - such as representing mathematical ideas or computer programs; all programming languages are formal languages.
variable
compound data type
formal language
tab
32. A statement that controls the flow of execution depending on some condition.
parent
token
conditional statement
semantics
33. Temporary storage of a precomputed value to avoid redundant computation.
hint
import statement
event loop
compound data type
34. A way to traverse a tree - visiting each node before its children.
temporary variable
preorder
mode
data structure
35. A data type comprised of a collection of keys and associated values.
postorder
recursive call
slice
mapping type
36. Nodes that share a common parent.
abstract data type (ADT)
key
immutable
siblings
37. A data type which can be modified.
invariant
logical operator
linked list
mutable data type
38. A change in the state of a program made by calling a function that is not a result of reading the return value from the function. Can only be produced by modifiers.
side effect
compound statement
dot notation
prompt
39. A part of a string (substring) specified by a range of indices.
priority queue
level
slice
keyword
40. A function which changes its arguments inside the function body. Only mutable types can be changed by modifiers.
algorithm
comment
modifier
decrement
41. A set of instructions for solving a class of problems by a mechanical and unintelligent process.
recursion
dot notation
comparison operator
algorithm
42. Part of a program that can never be executed - often because it appears after a return statement.
abstraction
dead code
object-oriented language
infinite loop
43. A program stored in a file (usually one that will be interpreted).
boolean value
text file
script
newline
44. A set of values. The type of a value determines how it can be used in expressions. So far the types you have seen are integers (type int) and floating-point numbers (type float) and strings (type str).
compile
invariant
data type
encapsulate
45. A distinct method of operation within a computer program.
whitespace
encode
mode
logical operator
46. A function which has no side effects. It only makes changes to the calling program through its return values.
pure function
modulus operator
modifier
compound statement
47. A function that does not modify any of the objects it receives as parameters. Most pure functions are fruitful.
logical operator
dot notation
wrapping code in a function
pure function
48. The process of calling the function that is currently executing.
program
helper
boolean function
recursion
49. Function-like attribute of an object. Methods are invoked (called) on an object using the dot operator.
token
interpret
method
path
50. A property of a program that can run on more than one kind of computer.
dictionary
constant
nesting
portability