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 variable used as part of the terminating condition of a loop.
loop variable
infinite recursion
multiple assignment
prototype development
2. A data type which can be modified.
recursion
attribute
mutable data type
composition (of functions)
3. A string displayed by a command line interface indicating that commands can be entered.
nested list
logical operator
command prompt
linked list
4. 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.
text file
invariant
compound data type
traceback
5. An error in a program that makes it do something other than what the programmer intended.
instance
semantic error
Queue
iteration
6. A special symbol that represents a simple computation like addition or multiplication or string concatenation.
operator
escape sequence
body
prompt
7. A statement that executes a function. It consists of the name of the function followed by a list of arguments enclosed in parentheses.
delimiter
function call
exception
syntactical errors
8. A queueing policy in which each member has a priority determined by external factors. The member with the highest priority is the first to be removed.
volatile memory
priority queue
concatenate
algorithm
9. The meaning of a program.
mutable data type
semantics
whitespace
operator overloading
10. Memory that can maintain its state without power. Hard drives and flash drives and rewritable compact disks (CD-RW) are examples of such memory.
key
object-oriented language
non-volatile memory
parse
11. An item of data contained in a node.
element
counter
cargo
mutable type
12. A list that is an element of another list.
binary tree
nested list
inheritance
object-oriented language
13. A data structure that implements a collection using a sequence of linked nodes.
linked list
object-oriented programming
prompt
unit testing
14. 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.
nesting
step size
attribute
hint
15. Decrease by 1.
infinite loop
decrement
volatile memory
text file
16. A collection of key-value pairs that maps from keys to values.
node
abstract data type (ADT)
dictionary
cursor
17. An implementation of a queue using a linked list.
linked queue
parse
byte code
comparison operator
18. The ability to define a new class that is a modified version of a previously defined class.
scalar multiplication
default value
algorithm
inheritance
19. A property of a program that can run on more than one kind of computer.
source code
portability
inorder
raise
20. A loop in which the terminating condition is never satisfied.
infinite loop
instance
attribute
infinite recursion
21. A string constant on the first line of a function or module definition - they provide a convenient way to associate documentation with code.
dictionary
nested list
generalize
docstring
22. The rules that determine which member of a queue is removed next.
mapping type
linked list
queueing policy
problem solving
23. A file that contains printable characters organized into lines separated by newline characters.
compound data type
frame
text file
priority queue
24. One of the pairs of items in a dictionary. Values are looked up in a dictionary by key.
key-value pair
parse
priority queue
provider
25. The value provided as the result of a function call.
namespace
accumulator
operand
return value
26. A tree in which each node refers to zero or one or two dependent nodes.
object
clone
handle an exception
binary tree
27. A name that refers to a value.
algorithm
prompt
variable
event
28. The output of the compiler after it translates the program.
object code
recursion
block
precondition
29. Code that satisfies the syntactic and semantic requirements of an interface.
list traversal
event loop
non-volatile memory
implementation
30. a sequence of instructions that specifies to a computer actions and computations to be performed.
sequence
dot product
attribute
program
31. A set of instructions for solving a class of problems by a mechanical and unintelligent process.
compound data type
algorithm
modulus operator
inheritance
32. A language that provides features - such as user-defined classes and inheritance - that facilitate object-oriented programming.
object-oriented language
body
dead code
parent class
33. Any of the characters that move the cursor without printing visible characters. The constant string.whitespace contains all the white-space characters.
whitespace
tail recursion
inorder
type conversion
34. A program in a high-level language before being compiled.
cursor
source code
trichotomy
parse
35. A named collection of files - also called a folder.
recursion
hint
abstract data type (ADT)
directory
36. Function-like attribute of an object. Methods are invoked (called) on an object using the dot operator.
list
evaluate
method
object-oriented language
37. One of the operators that compares two values: == or != or > or < or >= and <=.
function call
prefix notation
comparison operator
formal language
38. A programming language that is designed to be easy for humans to read and write.
fruitful function
body
trace
high-level language
39. One of the nodes referred to by a node.
constant
child
key
script
40. A character or string used to indicate where a string should be split.
delimiter
clone
leaf
portability
41. A way of writing mathematical expressions with the operators after the operands.
postfix
algorithm
function composition
high-level language
42. A statement that assigns a value to a name (variable).
multiple assignment
assignment statement
return value
non-volatile memory
43. A way to traverse a tree - visiting the children of each node before the node itself.
postorder
conditional statement
attribute
continue statement
44. 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.
queueing policy
linked queue
stack diagram
wrapper
45. A function that is defined inside a class definition and is invoked on instances of that class. :override:: To replace a default. Examples include replacing a default parameter with a particular argument and replacing a default method by providing a
method
function definition
bug
clone
46. An ADT that performs the operations one might perform on a queue.
decrement
Queue
variable
trace
47. 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.
mapping type
immutable
tab
accumulator
48. Making more than one assignment to the same variable during the execution of a program.
semantics
multiple assignment
delimiter
test-driven development (TDD)
49. A named sequence of statements that performs some useful operation. Functions may or may not take parameters and may or may not produce a result.
function
precondition
script
stack diagram
50. A data type (usually a collection of objects) that is defined by a set of operations but that can be implemented in a variety of ways.
abstract data type (ADT)
child class
operand
optional parameter