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. The node that refers to a given node.
parent
nested list
delimiter
multiple assignment
2. A reference to a list node can be treated as a single object or as the first in a list of nodes.
encapsulate
function call
fundamental ambiguity theorem
type conversion
3. A program in a high-level language before being compiled.
compile
data structure
dead code
source code
4. To ________ a variable is to give it an initial value - usually in the context of multiple assignment.
priority queue
object-oriented programming
fundamental ambiguity theorem
initialization (of a variable)
5. The boolean expression in a conditional statement that determines which branch is executed.
condition
function composition
token
random
6. Any one of the languages that people speak that evolved naturally.
object-oriented programming
natural language
mapping type
exception
7. A situation in which two or more names in a given namespace cannot be unambiguously resolved.
naming collision
trichotomy
operator overloading
step size
8. The set of nodes equidistant from the root.
level
object
algorithm
parse
9. A kind of data structure that can contain data of any type.
parse
linear time
generic data structure
hint
10. An operator that takes two operands.
binary operator
child
semantic error
infinite recursion
11. A function that yields a return value.
boolean function
boolean value
event loop
fruitful function
12. A named collection of objects where each object is identified by an index.
function composition
list
continue statement
object
13. The statement in a recursive function with is a call to itself.
scalar multiplication
recursive call
frame
mutable type
14. A special method that is invoked automatically when a new object is created and that initializes the object's attributes.
initialization method
tab
whitespace
algorithm
15. Any one of the languages that people have designed for specific purposes - such as representing mathematical ideas or computer programs; all programming languages are formal languages.
cursor
instantiate
provider
formal language
16. The topmost node in a tree with no parent.
inorder
multiple assignment
fruitful function
root
17. An assignment to all of the elements in a tuple using a single assignment statement. Useful for swapping values.
instantiate
composition (of functions)
file system
tuple assignment
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).
data type
pure function
postfix
recursion
19. A combination of variables and operators and values that represents a single result value.
loop variable
tuple assignment
algorithm
expression
20. A process for developing a program.
semantic error
development plan
parse
exception
21. A syntactic construct which enables lists to be generated from other lists using a syntax analogous to the mathematical set-builder notation.
pure function
functional programming style
list comprehension
keyword
22. A programming construct that waits for events and processes them.
chained conditional
operand
event loop
logical operator
23. Both as a noun and as a verb - it means to increase by 1.
inorder
index
counter
increment
24. An expression in parentheses that acts as a single operand in a larger expression.
queueing policy
condition
loop variable
subexpression
25. An operation defined in linear algebra that multiplies each of the coordinates of a Point by a numeric value.
scalar multiplication
keyword
modifier
immutable data type
26. The rules that determine which member of a queue is removed next.
standard library
branch
syntax error
queueing policy
27. The set of rules governing the order in which expressions involving multiple operators and operands are evaluated.
priority queue
rules of precedence
fundamental ambiguity theorem
object-oriented language
28. To execute a program in a high-level language by translating it one line at a time.
tab
interpret
initialization method
operator overloading
29. A way of writing mathematical expressions with the operators after the operands.
data type
postfix
root
prototype development
30. The sequential accessing of each element in a list.
initialization (of a variable)
non-volatile memory
abstraction
list traversal
31. Making more than one assignment to the same variable during the execution of a program.
event
source code
multiple assignment
rules of precedence
32. A character that is used to separate tokens such as punctuation in a natural language.
high-level language
multiple assignment
chained conditional
delimiter
33. A compound data type whose elements cannot be assigned new values.
assignment statement
immutable
iteration
singleton
34. A data type comprised of a collection of keys and associated values.
recursive call
dot notation
mapping type
namespace
35. A variable or value used to select a member of an ordered set - such as a character from a string.
volatile memory
recursive call
argument
index
36. A variable defined inside a module - accessed by using the dot operator ( .).
traverse
attribute
nested loop
constant time
37. A distinct method of operation within a computer program.
mode
composition (of functions)
variable name
index
38. A numerical result that is too large to be represented in a numerical format.
script
overflow
iteration
root
39. The class from which a child class inherits.
parent class
return value
header
file
40. Use of the dot operator '.' to access functions inside a module.
dot notation
iteration
multiple assignment
Priority Queue
41. An organization of data for the purpose of making it easier to use.
index
integer division
embedded reference
data structure
42. A style of programming in which data and the operations that manipulate it are organized into classes and methods.
embedded reference
fundamental ambiguity theorem
object-oriented programming
compound data type
43. An error that does not occur until the program has started to execute but that prevents the program from continuing.
keyword
interface
runtime error
token
44. One of the values in a list (or other sequence). The bracket operator selects elements of a list.
boolean value
inorder
queueing policy
element
45. A function that does not modify any of the objects it receives as parameters. Most pure functions are fruitful.
non-volatile memory
infix
list traversal
pure function
46. A data type which cannot be modified. Assignments to elements or slices of immutable types cause a runtime error.
provider
preorder
variable name
immutable data type
47. A set of instructions for solving a class of problems by a mechanical and unintelligent process.
continue statement
immutable
algorithm
nesting
48. One of the nodes referred to by a node.
composition (of functions)
child
command line
dead code
49. One of the named data items that makes up an instance.
compound data type
directory
attribute
algorithm
50. A data type in which the values are made up of components or elements that are themselves values.
compound data type
non-volatile memory
class
variable name