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 name given to a variable.
variable name
initialization method
index
instantiate
2. The structure of a program.
parse
generalize
syntax
assignment statement
3. Nodes that share a common parent.
assignment statement
directory
siblings
low-level language
4. An operation defined in linear algebra that multiplies two Points and yields a numeric value.
dot product
functional programming style
attribute
recursive call
5. To translate a program written in a high-level language into a low-level language all at once - in preparation for later execution.
compile
command prompt
immutable
random
6. The ability to combine simple expressions and statements into compound statements and expressions in order to represent complex computations concisely.
composition
naming collision
loop variable
linear time
7. Multiple variables that contain references to the same object.
tuple assignment
aliases
modulus operator
optional parameter
8. A variable used as part of the terminating condition of a loop.
run time error
escape sequence
scalar multiplication
loop variable
9. A method for naming and accessing and organizing files and the data they contain.
problem solving
initialization method
file system
mutable data type
10. Using the output from one function call as the input to another.
function composition
block
flow of execution
nesting
11. A style of programming in which data and the operations that manipulate it are organized into classes and methods.
comment
object-oriented programming
modulus operator
algorithm
12. Calling one function from within the body of another or using the return value of one function as an argument to the call of another.
iteration
composition (of functions)
recursion
polymorphic
13. An expression that is either true or false.
boolean expression
wrapping code in a function
condition
trace
14. Repeated execution of a set of programming statements.
slice
interpret
postorder
iteration
15. 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.
exception
increment
script
test-driven development (TDD)
16. A way to traverse a tree - visiting the children of each node before the node itself.
encapsulate
postorder
problem solving
composition
17. A function that calls itself recursively without ever reaching the base case - ultimately causes a runtime error.
queue
dead code
instantiate
infinite recursion
18. A data item that is mapped to a value in a dictionary. Used to look up values in a dictionary.
tuple
key
priority queue
path
19. An embedded reference used to link one object to another.
link
non-volatile memory
generalize
algorithm
20. A process for developing a program.
overflow
development plan
decrement
object-oriented language
21. One program structure within another - such as a conditional statement inside a branch of another conditional statement.
composition (of functions)
nesting
byte code
high-level language
22. A character that is used to separate tokens such as punctuation in a natural language.
problem solving
comment
continue statement
delimiter
23. Any of the data types that consist of an ordered set of elements with each element identified by an index.
token
child
siblings
sequence
24. A tree in which each node refers to zero or one or two dependent nodes.
step size
syntax error
conditional statement
binary tree
25. The dot operator ( .) permits access to attributes and functions of a module.
provider
dot operator
child
argv (argument vector)
26. A box in a stack diagram that represents a function call. It contains the local variables and parameters of the function.
frame
fruitful function
delimiter
interpret
27. To create a new object that has the same value as an existing object.
assignment statement
parent
stack diagram
clone
28. A function that returns a boolean value.
raise
tuple
boolean function
default value
29. An assertion that should be true of an object at all times (except perhaps while the object is being modified).
temporary variable
invariant
node
child class
30. A variable defined inside a function. A local variable can only be used inside its function.
polymorphic
modulus operator
local variable
queueing policy
31. A data type comprised of a collection of keys and associated values.
operator
optional parameter
mapping type
infinite recursion
32. The set of operations that define an ADT.
tuple assignment
random
function composition
interface
33. A data structure that implements a collection using a sequence of linked nodes.
linked list
singleton
function call
delimiter
34. The topmost node in a tree with no parent.
functional programming style
base case
event
root
35. A function which changes its arguments inside the function body. Only mutable types can be changed by modifiers.
modifier
decrement
newline
base case
36. To follow the flow of execution of a program by hand - recording the change of state of the variables and any output produced.
semantics
syntax error
trace
default value
37. 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.
wrapping code in a function
conditional statement
function call
hint
38. To iterate through the elements of a set performing a similar operation on each.
traverse
compound statement
fundamental ambiguity theorem
semantic error
39. Both as a noun and as a verb - it means to increase by 1.
random
prompt
token
increment
40. The ability to define a new class that is a modified version of a previously defined class.
inheritance
leaf
nested list
initialization method
41. An ordered set of objects waiting for a service of some kind.
queue
escape sequence
slice
loop variable
42. A name used inside a function to refer to the value passed as an argument.
compound data type
precondition
local variable
parameter
43. A visual cue that tells the user to input data.
counter
prompt
dictionary
pure function
44. The sequential accessing of each element in a list.
siblings
compiler
constant time
list traversal
45. The class from which a child class inherits.
method
fruitful function
state diagram
parent class
46. A statement that controls the flow of execution depending on some condition.
operator overloading
conditional statement
function composition
composition
47. A data type in which the elements can be modified. It is a compound type - e.g. lists.
mutable type
operand
abstraction
slice
48. A combination of variables and operators and values that represents a single result value.
linked queue
link
expression
subexpression
49. An item of data contained in a node.
cargo
command line
fundamental ambiguity theorem
token
50. 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.
wrapper
mutable type
modifier
list traversal