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 operation whose runtime is a linear function of the size of the data structure.
incremental development
body
linear time
recursive call
2. A way to traverse a tree - visiting the left subtree and then the root and then the right subtree.
file
raise
path
inorder
3. A way of developing programs starting with a prototype and gradually testing and improving it.
runtime error
syntax
prototype development
data structure
4. A value provided to a function when the function is called. This value is assigned to the corresponding parameter in the function.
argument
value
trichotomy
body
5. Use of the dot operator '.' to access functions inside a module.
queueing policy
operand
dot notation
continue statement
6. One of the basic elements of the syntactic structure of a program - analogous to a word in a natural language.
token
prompt
command line
dot operator
7. A data type which can be modified.
counter
mutable data type
list
data structure
8. A general process for solving a category of problems.
test-driven development (TDD)
body
algorithm
instantiate
9. To iterate through the elements of a set performing a similar operation on each.
function definition
traverse
random
function composition
10. 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.
priority queue
constant time
comparison operator
source code
11. The code (or the person who wrote it) that implements an ADT.
provider
tuple assignment
linked queue
encode
12. An invisible marker that keeps track of where the next character will be printed.
concatenate
cursor
functional programming style
embedded reference
13. A variable used to count something - usually initialized to zero and incremented in the body of a loop.
mutable type
prototype development
counter
parent class
14. An operation defined in linear algebra that multiplies two Points and yields a numeric value.
aliases
composition (of functions)
dot product
function call
15. To create an instance of a class.
instantiate
text file
volatile memory
script
16. A program that translates higher level programming languages into basic instructions the CPU can understand.
compiler
subexpression
planned development
dead code
17. An expression that is either true or false.
function
boolean expression
program
command line
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.
function call
expression
scaffolding
tuple
19. An automatic procedure used to validate that individual units of code are working properly.
unit testing
mode
concatenate
operator overloading
20. 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.
list comprehension
dot operator
traceback
wrapping code in a function
21. To execute a program in a high-level language by translating it one line at a time.
interpret
sequence
naming collision
dead code
22. Decrease by 1.
object-oriented programming
function definition
decrement
syntactical errors
23. A way of writing mathematical expressions with the operators between the operands.
infix
binary tree
Queue
assignment statement
24. A parameter written in a function header with an assignment to a default value which it will receive if no corresponding argument is given for it in the function call.
binary operator
optional parameter
import statement
operand
25. A data type which cannot be modified. Assignments to elements or slices of immutable types cause a runtime error.
immutable data type
high-level language
slice
prototype development
26. A tree in which each node refers to zero or one or two dependent nodes.
side effect
binary tree
token
queueing policy
27. A program stored in a file (usually one that will be interpreted).
mode
source code
script
loop
28. A string displayed by a command line interface indicating that commands can be entered.
method
comparison operator
operand
command prompt
29. A statement or group of statements that execute repeatedly until a terminating condition is satisfied.
loop
prompt
list traversal
compiler
30. The set of rules governing the order in which expressions involving multiple operators and operands are evaluated.
rules of precedence
block
immutable
child class
31. To follow the flow of execution of a program by hand - recording the change of state of the variables and any output produced.
branch
trace
formal language
variable name
32. To examine a program and analyze the syntactic structure.
parse
embedded reference
modifier
preorder
33. Both as a noun and as a verb - it means to increase by 1.
functional programming style
object-oriented language
mutable data type
increment
34. A way of developing programs that involves high-level insight into the problem and more planning than incremental development or prototype development.
planned development
class attribute
function
increment
35. A character or string used to indicate where a string should be split.
algorithm
data structure
delimiter
client
36. A reference to a list node can be treated as a single object or as the first in a list of nodes.
dictionary
trace
tuple
fundamental ambiguity theorem
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.
whitespace
continue statement
accumulator
modifier
38. A statement which makes the objects contained in a module available for use within another module.
boolean function
linked list
type conversion
import statement
39. An assertion that must be true in order for a method to work correctly.
rules of precedence
siblings
precondition
loop
40. A loop inside the body of another loop.
nested loop
non-volatile memory
step size
interface
41. Memory which requires an electrical current to maintain state. Information stored is lost when the computer is turned off.
volatile memory
Queue
object-oriented programming
postorder
42. A data item that is mapped to a value in a dictionary. Used to look up values in a dictionary.
key
inheritance
tail recursion
pure function
43. A function that returns a boolean value.
rules of precedence
boolean function
dead code
exception
44. 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.
composition (of functions)
list
object
temporary variable
45. To signal an exception using the raise statement.
event loop
raise
accumulator
argument
46. A step-by-step process for solving a category of problems.
provider
class attribute
algorithm
compound statement
47. An escape character '' followed by one or more printable characters used to designate a nonprintable character.
escape sequence
syntax error
Queue
object
48. An integer variable or value that indicates an element of a list.
overflow
decrement
return value
index
49. A function which changes its arguments inside the function body. Only mutable types can be changed by modifiers.
attribute
compound statement
modifier
byte code
50. To divide a large complex program into components (like functions) and isolate the components from each other (by using local variables - for example).
mode
comment
dictionary
encapsulate