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 visual cue that tells the user to input data.
child
prompt
veneer
type conversion
2. A function that returns a boolean value.
exception
immutable data type
queue
boolean function
3. A collection of key-value pairs that maps from keys to values.
immutable data type
function definition
dictionary
modifier
4. The ability to combine simple expressions and statements into compound statements and expressions in order to represent complex computations concisely.
function composition
initialization (of a variable)
composition
data type
5. A way of developing programs that involves high-level insight into the problem and more planning than incremental development or prototype development.
queueing policy
sequence
tail recursion
planned development
6. A function which has no side effects. It only makes changes to the calling program through its return values.
wrapper
traceback
command line
pure function
7. A tree in which each node refers to zero or one or two dependent nodes.
incremental development
binary tree
invariant
tail recursion
8. One of the values in a list (or other sequence). The bracket operator selects elements of a list.
hint
handle an exception
scalar multiplication
element
9. To replace something unnecessarily specific (like a constant value) with something appropriately general (like a variable or parameter). It makes code more versatile - more likely to be reused and sometimes even easier to write.
key-value pair
generalize
overflow
runtime error
10. A function that does not modify any of the objects it receives as parameters. Most pure functions are fruitful.
prompt
parent
mode
pure function
11. A function that yields a return value.
fruitful function
condition
tuple
list traversal
12. A number or string (or other things to be named later) that can be stored in a variable or computed in an expression.
value
modifier
function definition
generalize
13. A language that provides features - such as user-defined classes and inheritance - that facilitate object-oriented programming.
overflow
object-oriented language
exception
continue statement
14. The process of adding a function header and parameters to a sequence of program statements. This process is very useful whenever the program statements in question are going to be used multiple times.
node
wrapping code in a function
priority queue
nested loop
15. A statement that controls the flow of execution depending on some condition.
conditional statement
optional parameter
evaluate
runtime error
16. The statement in a recursive function with is a call to itself.
natural language
data structure
parameter
recursive call
17. A box in a stack diagram that represents a function call. It contains the local variables and parameters of the function.
frame
nesting
sequence
return value
18. A data type that contains a sequence of elements of any type - like a list but is immutable. Can be used wherever an immutable type is required.
argument
tuple
link
base case
19. A data structure that implements a collection using a sequence of linked nodes.
loop
nested loop
class attribute
linked list
20. An ADT that performs the operations one might perform on a queue.
natural language
boolean expression
Queue
dot notation
21. There are exactly two boolean values: True and False.
algorithm
boolean value
import statement
concatenate
22. The set of rules governing the order in which expressions involving multiple operators and operands are evaluated.
rules of precedence
fundamental ambiguity theorem
loop variable
boolean function
23. A named entity - usually stored on a hard drive or floppy disk or CD-ROM - that contains a stream of characters.
function definition
compound data type
file
constant
24. The dot operator ( .) permits access to attributes and functions of a module.
infinite recursion
initialization method
method
dot operator
25. A list of the functions that are executing - printed when a runtime error occurs. Also commonly refered to as a stack trace since it lists the functions in the order in which they are stored in the runtime stack.
traceback
syntactical errors
incremental development
instantiate
26. The process of formulating a problem and finding a solution and expressing the solution.
variable name
traceback
problem solving
recursion
27. The order in which statements are executed during a program run.
flow of execution
modulus operator
argv (argument vector)
hint
28. A definition which defines something in terms of itself. It often provides an elegant way to express complex data structures.
temporary variable
postfix
parent
recursive definition
29. 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.
frame
integer division
veneer
immutable
30. A loop in which the terminating condition is never satisfied.
object code
algorithm
infinite loop
child
31. A program that translates higher level programming languages into basic instructions the CPU can understand.
natural language
Queue
compiler
composition (of functions)
32. An organization of data for the purpose of making it easier to use.
recursive definition
cargo
data structure
volatile memory
33. Temporary storage of a precomputed value to avoid redundant computation.
conditional statement
non-volatile memory
clone
hint
34. A step-by-step process for solving a category of problems.
nested loop
immutable
runtime error
algorithm
35. A compound data type whose elements cannot be assigned new values.
step size
compound statement
immutable
class
36. The boolean expression in a conditional statement that determines which branch is executed.
veneer
recursion
condition
list comprehension
37. The interval between successive elements of a linear sequence. The third (and optional argument) to the range function is called the step size. If not specified it defaults to 1.
invariant
integer division
step size
docstring
38. An error that occurs at runtime.
delimiter
exception
natural language
operator
39. A method for naming and accessing and organizing files and the data they contain.
wrapping code in a function
overflow
file system
recursion
40. A way of writing mathematical expressions with the operators between the operands.
algorithm
body
delimiter
infix
41. 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.
exception
multiple assignment
postfix
formal language
42. A list that is an element of another list.
temporary variable
child
loop
nested list
43. A name that refers to a value.
frame
variable
type conversion
initialization (of a variable)
44. A statement that consists of two parts: header - which begins with a keyword determining the statement type and ends with a colon. body - containing one or more statements indented the same amount from the header.
token
compound statement
formal language
data type
45. A variable used in a loop to accumulate a series of values - such as by concatenating them onto a string or adding them to a running sum.
block
command line argument
traceback
accumulator
46. Using the output from one function call as the input to another.
wrapper
recursive call
function composition
key-value pair
47. A syntactic construct which enables lists to be generated from other lists using a syntax analogous to the mathematical set-builder notation.
constant
iteration
standard library
list comprehension
48. An intermediate language between source code and object code. Many modern languages first compile source code into byte code and then interpret the byte code with a program called a virtual machine.
invariant
tuple
byte code
semantics
49. The output of the compiler after it translates the program.
object code
overflow
state diagram
syntax
50. A program development plan intended to avoid debugging by adding and testing only a small amount of code at a time.
client
incremental development
initialization method
object