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. An ordered set of objects waiting for a service of some kind.
queue
composition
data structure
invariant
2. A way of writing mathematical expressions with the operators after the operands.
argv (argument vector)
boolean function
prefix notation
postfix
3. 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.
tuple
boolean function
generalize
modifier
4. One of the nodes referred to by a node.
pure function
index
child
compiler
5. One of the values in a list (or other sequence). The bracket operator selects elements of a list.
element
value
multiple assignment
implementation
6. The ability to define a new class that is a modified version of a previously defined class.
function definition
program
decrement
inheritance
7. To examine a program and analyze the syntactic structure.
parse
operand
recursive definition
stack diagram
8. A list that is an element of another list.
initialization method
nested list
parse
Priority Queue
9. The statement in a recursive function with is a call to itself.
recursive call
parameter
optional parameter
pure function
10. A loop inside the body of another loop.
fruitful function
node
recursion
nested loop
11. A group of consecutive statements with the same indentation.
nested loop
condition
instance
block
12. A statement that creates a new function specifying its name and parameters and the statements it executes.
function definition
source code
compiler
queueing policy
13. A string constant on the first line of a function or module definition - they provide a convenient way to associate documentation with code.
scalar multiplication
docstring
algorithm
parse
14. A loop in which the terminating condition is never satisfied.
index
logical operator
abstract data type (ADT)
infinite loop
15. To execute a program in a high-level language by translating it one line at a time.
tuple assignment
inheritance
interpret
body
16. Memory which requires an electrical current to maintain state. Information stored is lost when the computer is turned off.
dictionary
data structure
run time error
volatile memory
17. 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.
keyword
decrement
stack diagram
event loop
18. 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).
infinite loop
counter
data type
value
19. A name that refers to a value.
variable
syntax
dot operator
newline
20. The structure of a program.
key-value pair
syntax
priority queue
increment
21. An escape character '' followed by one or more printable characters used to designate a nonprintable character.
invariant
chained conditional
escape sequence
keyword
22. A variable defined inside a module - accessed by using the dot operator ( .).
dot operator
attribute
boolean value
linear time
23. To simplify an expression by performing the operations in order to yield a single value.
compound data type
temporary variable
exception
evaluate
24. To follow the flow of execution of a program by hand - recording the change of state of the variables and any output produced.
composition
body
interface
trace
25. One program structure within another - such as a conditional statement inside a branch of another conditional statement.
nesting
parse
overflow
tail recursion
26. Repeated execution of a set of programming statements.
leaf
token
iteration
cargo
27. An operation whose runtime does not depend on the size of the data structure.
delimiter
frame
constant time
comparison operator
28. An error that occurs at runtime.
exception
initialization (of a variable)
object-oriented programming
infix
29. Part of a program that can never be executed - often because it appears after a return statement.
state diagram
newline
dead code
keyword
30. A way of writing a mathematical expression with each operator appearing before its operands.
prefix notation
composition (of functions)
parent
level
31. An operation whose runtime is a linear function of the size of the data structure.
loop variable
pure function
composition (of functions)
linear time
32. A distinct method of operation within a computer program.
compile
state diagram
assignment statement
mode
33. A reference to a list node can be treated as a single object or as the first in a list of nodes.
fundamental ambiguity theorem
recursive definition
method
trace
34. Given any real numbers a and b exactly one of the following relations holds: a < b or a > b or a = b. Thus when you can establish that two of the relations are false you can assume the remaining one is true. What is it called?
development plan
continue statement
postorder
trichotomy
35. A step-by-step process for solving a category of problems.
implementation
syntax error
algorithm
tuple
36. A named entity - usually stored on a hard drive or floppy disk or CD-ROM - that contains a stream of characters.
evaluate
return value
file
trace
37. 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.
accumulator
inorder
executable
siblings
38. The set of rules governing the order in which expressions involving multiple operators and operands are evaluated.
boolean function
wrapping code in a function
low-level language
rules of precedence
39. To translate a program written in a high-level language into a low-level language all at once - in preparation for later execution.
initialization method
syntax
compile
body
40. The process of formulating a problem and finding a solution and expressing the solution.
problem solving
prompt
veneer
loop
41. A compound data type that is often used to model a thing or concept in the real world.
exception
object
nested list
unit testing
42. An organization of data for the purpose of making it easier to use.
Queue
high-level language
nested list
data structure
43. Any of the data types that consist of an ordered set of elements with each element identified by an index.
sequence
class attribute
evaluate
non-volatile memory
44. An operator that takes two operands.
multiple assignment
class attribute
linked list
binary operator
45. One of the values on which an operator operates.
operand
test-driven development (TDD)
exception
Queue
46. A situation in which two or more names in a given namespace cannot be unambiguously resolved.
low-level language
naming collision
header
singleton
47. A combination of variables and operators and values that represents a single result value.
expression
stack diagram
side effect
prototype development
48. 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.
cursor
generalize
composition (of functions)
argv (argument vector)
49. One of the named data items that makes up an instance.
child class
cursor
attribute
development plan
50. 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.
operator overloading
step size
argument
linked queue