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. One of the operators that combines boolean expressions: and or and not.
logical operator
precondition
binary tree
decrement
2. Any one of the languages that people speak that evolved naturally.
natural language
side effect
loop
test-driven development (TDD)
3. A definition which defines something in terms of itself. It often provides an elegant way to express complex data structures.
script
infinite loop
local variable
recursive definition
4. A name that refers to a value.
traceback
debugging
variable
branch
5. A string constant on the first line of a function or module definition - they provide a convenient way to associate documentation with code.
constant time
function call
link
docstring
6. 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.
base case
parameter
mode
function
7. A variable or value used to select a member of an ordered set - such as a character from a string.
binary tree
test-driven development (TDD)
index
event
8. A step-by-step process for solving a category of problems.
raise
list
algorithm
semantics
9. One of the pairs of items in a dictionary. Values are looked up in a dictionary by key.
recursive definition
value
key-value pair
syntactical errors
10. A kind of data structure that can contain data of any type.
generic data structure
constant time
child class
comparison operator
11. 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.
boolean value
concatenate
syntactical errors
compound statement
12. The structure of a program.
provider
tab
syntax
method
13. A style of program design in which the majority of functions are pure.
functional programming style
embedded reference
provider
iteration
14. Repeated execution of a set of programming statements.
wrapping code in a function
iteration
composition (of functions)
file system
15. The set of operations that define an ADT.
infinite loop
interface
handle an exception
natural language
16. A program that translates higher level programming languages into basic instructions the CPU can understand.
compiler
object-oriented language
trichotomy
run time error
17. A tree in which each node refers to zero or one or two dependent nodes.
binary tree
object code
linked list
tuple
18. A way of writing mathematical expressions with the operators between the operands.
infix
program
aliases
siblings
19. 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
initialization (of a variable)
syntax
method
boolean expression
20. Any of the data types that consist of an ordered set of elements with each element identified by an index.
aliases
interface
sequence
multiple assignment
21. A change in the state of a program made by calling a function that is not a result of reading the return value from the function. Can only be produced by modifiers.
aliases
cursor
side effect
function definition
22. 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
constant
pure function
modulus operator
23. 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 definition
rules of precedence
tuple
Priority Queue
24. Any of the characters that move the cursor without printing visible characters. The constant string.whitespace contains all the white-space characters.
formal language
slice
whitespace
function definition
25. An operation whose runtime does not depend on the size of the data structure.
constant time
algorithm
flow of execution
raise
26. A name used inside a function to refer to the value passed as an argument.
constant time
parameter
function
volatile memory
27. One of the values in a list (or other sequence). The bracket operator selects elements of a list.
preorder
element
precondition
hint
28. A function that yields a return value.
debugging
syntax
method
fruitful function
29. A function which has no side effects. It only makes changes to the calling program through its return values.
command prompt
pure function
argument
fundamental ambiguity theorem
30. An integer variable or value that indicates an element of a list.
embedded reference
index
infinite loop
body
31. An error in a program that makes it impossible to parse
attribute
development plan
syntax error
high-level language
32. 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.
block
accumulator
siblings
wrapper
33. An operator denoted with a percent sign ( %) - that works on integers and yields the remainder when one number is divided by another.
fundamental ambiguity theorem
random
queueing policy
modulus operator
34. A conditional branch with more than two possible flows of execution.
constant
index
compiler
chained conditional
35. A function that calls itself recursively without ever reaching the base case - ultimately causes a runtime error.
rules of precedence
data structure
slice
infinite recursion
36. A way of writing a mathematical expression with each operator appearing before its operands.
postfix
evaluate
instantiate
prefix notation
37. One of the nodes referred to by a node.
tuple assignment
child
operator overloading
traceback
38. A way to traverse a tree - visiting the left subtree and then the root and then the right subtree.
inorder
leaf
tuple assignment
attribute
39. The sequential accessing of each element in a list.
portability
composition
list traversal
siblings
40. A statement that causes the current iteration of a loop to end.
state diagram
dot operator
continue statement
inorder
41. Multiple variables that contain references to the same object.
planned development
list
immutable data type
aliases
42. 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.
planned development
infinite loop
natural language
abstract data type (ADT)
43. Another name for object code that is ready to be executed.
nested loop
nesting
nested list
executable
44. The value given to an optional parameter if no argument for it is provided in the function call.
tab
abstract data type (ADT)
constant time
default value
45. A queueing policy in which the first member to arrive is the first to be removed.
expression
Queue
FIFO(First In First Out)
object code
46. A thing to which a variable can refer.
abstract data type (ADT)
invariant
object
body
47. A sequence of one or more characters used to specify the boundary between separate parts of text.
child class
delimiter
exception
algorithm
48. 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.
optional parameter
iteration
traceback
dot notation
49. An element of a list - usually implemented as an object that contains a reference to another object of the same type.
prefix notation
executable
linear time
node
50. A set of instructions for solving a class of problems by a mechanical and unintelligent process.
functional programming style
object-oriented language
algorithm
flow of execution