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 function that does not modify any of the objects it receives as parameters. Most pure functions are fruitful.
pure function
node
condition
abstract data type (ADT)
2. One of the nodes referred to by a node.
loop variable
link
child
scalar multiplication
3. A string displayed by a command line interface indicating that commands can be entered.
infix
command prompt
nested list
run time error
4. Nodes that share a common parent.
generic data structure
element
siblings
variable name
5. A recursive call that occurs as the last statement (at the tail) of a function definition.
natural language
child class
tail recursion
singleton
6. An expression that is either true or false.
index
linked list
boolean expression
key-value pair
7. The ability to combine simple expressions and statements into compound statements and expressions in order to represent complex computations concisely.
development plan
bug
functional programming style
composition
8. 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.
test-driven development (TDD)
function definition
data type
loop variable
9. The ability to define a new class that is a modified version of a previously defined class.
boolean value
inheritance
comment
object code
10. Another name for a runtime error.
handle an exception
algorithm
exception
prompt
11. An intermediate language between source code and object code. Many modern languages first compile source code into byte code and then interpret the byte code with a program called a virtual machine.
token
postfix
byte code
compile
12. The set of nodes equidistant from the root.
standard library
level
state diagram
binary operator
13. One of the pairs of items in a dictionary. Values are looked up in a dictionary by key.
key-value pair
precondition
queueing policy
encode
14. Repeated execution of a set of programming statements.
iteration
data structure
algorithm
debugging
15. A collection of key-value pairs that maps from keys to values.
dictionary
abstraction
fundamental ambiguity theorem
import statement
16. A program stored in a file (usually one that will be interpreted).
assignment statement
mode
script
recursive definition
17. A step-by-step process for solving a category of problems.
syntactical errors
level
algorithm
functional programming style
18. To divide a large complex program into components (like functions) and isolate the components from each other (by using local variables - for example).
overflow
encapsulate
directory
Queue
19. The value provided as the result of a function call.
return value
object-oriented language
function composition
instance
20. A numerical result that is too large to be represented in a numerical format.
overflow
keyword
executable
rules of precedence
21. 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.
operator
dot notation
aliases
wrapping code in a function
22. The structure of a program.
modifier
chained conditional
planned development
syntax
23. Having no specific pattern. Unpredictable.
standard library
function
stack diagram
random
24. Memory which requires an electrical current to maintain state. Information stored is lost when the computer is turned off.
volatile memory
chained conditional
data type
initialization method
25. To follow the flow of execution of a program by hand - recording the change of state of the variables and any output produced.
non-volatile memory
concatenate
trace
compound data type
26. The name and location of a file within a file system.
path
interpret
expression
pure function
27. Any of the characters that move the cursor without printing visible characters. The constant string.whitespace contains all the white-space characters.
infix
function composition
whitespace
fruitful function
28. To ________ a variable is to give it an initial value - usually in the context of multiple assignment.
function
docstring
initialization (of a variable)
sequence
29. A function that changes one or more of the objects it receives as parameters. Most modifiers are void.
FIFO(First In First Out)
tail recursion
modifier
state diagram
30. The class from which a child class inherits.
nested list
parent class
block
high-level language
31. A variable used to count something - usually initialized to zero and incremented in the body of a loop.
wrapping code in a function
comment
object-oriented language
counter
32. A language that provides features - such as user-defined classes and inheritance - that facilitate object-oriented programming.
object-oriented language
increment
planned development
runtime error
33. A syntactic container providing a context for names so that the same name can reside in different namespaces without ambiguity.
operand
namespace
comment
accumulator
34. The meaning of a program.
header
queueing policy
semantics
parameter
35. An ADT that defines the operations one might perform on a priority queue.
Priority Queue
algorithm
scaffolding
loop
36. Both as a noun and as a verb - it means to increase by 1.
increment
runtime error
boolean expression
loop
37. A string constant on the first line of a function or module definition - they provide a convenient way to associate documentation with code.
infinite loop
planned development
list
docstring
38. The boolean expression in a conditional statement that determines which branch is executed.
condition
data type
algorithm
token
39. An explicit statement that takes a value of one type and computes a corresponding value of another type.
infix
docstring
type conversion
key
40. A box in a stack diagram that represents a function call. It contains the local variables and parameters of the function.
list comprehension
expression
frame
block
41. A linked list with a single node.
aliases
syntax
queue
singleton
42. A numerical value that does not change during the execution of a program.
branch
side effect
constant
newline
43. One of the values in a list (or other sequence). The bracket operator selects elements of a list.
mode
element
nested loop
composition (of functions)
44. A queueing policy in which the first member to arrive is the first to be removed.
FIFO(First In First Out)
function definition
algorithm
parent
45. A value provided to a function when the function is called. This value is assigned to the corresponding parameter in the function.
argument
composition
variable name
type conversion
46. An ordered set of objects waiting for a service of some kind.
conditional statement
queue
standard library
instantiate
47. A data item that is mapped to a value in a dictionary. Used to look up values in a dictionary.
key
accumulator
interface
type conversion
48. A way of writing a mathematical expression with each operator appearing before its operands.
sequence
prefix notation
object-oriented language
constant
49. 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.
prompt
key
linked queue
wrapper
50. Extending built-in operators ( + or - or * or > or < etc.) so that they work with user-defined types.
operator overloading
implementation
boolean function
block