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 possible paths of the flow of execution determined by conditional execution.
whitespace
algorithm
data type
branch
2. 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.
temporary variable
body
Queue
priority queue
3. A variable in the sys module which stores a list of command line arguments passed to a program at run time.
list traversal
flow of execution
newline
argv (argument vector)
4. An implementation of a queue using a linked list.
body
linked queue
generic data structure
high-level language
5. The process of finding and removing any of the three kinds of programming errors.
list
file
random
debugging
6. 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.
parse
syntax
keyword
boolean value
7. A graphical representation of a set of variables and the values to which they refer.
postorder
trace
state diagram
dot product
8. 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.
sequence
abstract data type (ADT)
attribute
cargo
9. The code (or the person who wrote it) that implements an ADT.
random
boolean value
mutable type
provider
10. A special character that causes the cursor to move to the next tab stop on the current line.
clone
generic data structure
raise
tab
11. A visual cue that tells the user to input data.
body
event loop
list traversal
prompt
12. To simplify an expression by performing the operations in order to yield a single value.
type conversion
evaluate
variable
incremental development
13. The set of rules governing the order in which expressions involving multiple operators and operands are evaluated.
rules of precedence
infix
dead code
key
14. Code that is used during program development but is not part of the final version.
scaffolding
frame
linear time
counter
15. The dot operator ( .) permits access to attributes and functions of a module.
dot operator
evaluate
embedded reference
functional programming style
16. A bottom-most node in a tree with no children.
leaf
immutable data type
helper
command line
17. A variable used to store an intermediate value in a complex calculation.
method
temporary variable
program
incremental development
18. A style of programming in which data and the operations that manipulate it are organized into classes and methods.
infinite loop
interface
cargo
object-oriented programming
19. A property of a program that can run on more than one kind of computer.
compound data type
portability
aliases
iteration
20. The topmost node in a tree with no parent.
root
accumulator
instantiate
initialization method
21. One of the values on which an operator operates.
parse
operand
interpret
semantics
22. A thing to which a variable can refer.
object
child class
variable
infinite loop
23. Part of a program that can never be executed - often because it appears after a return statement.
dead code
attribute
modulus operator
parent
24. The second part of a compound statement. The body consists of a sequence of statements all indented the same amount from the beginning of the header.
child class
incremental development
function composition
body
25. a sequence of instructions that specifies to a computer actions and computations to be performed.
child
low-level language
command line argument
program
26. 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.
leaf
class
side effect
nested loop
27. An operation defined in linear algebra that multiplies each of the coordinates of a Point by a numeric value.
scalar multiplication
object-oriented language
volatile memory
flow of execution
28. A style of program design in which the majority of functions are pure.
non-volatile memory
inheritance
functional programming style
nested list
29. A reference stored in an attribute of an object.
embedded reference
natural language
loop variable
whitespace
30. A special method that is invoked automatically when a new object is created and that initializes the object's attributes.
initialization method
default value
slice
portability
31. A kind of data structure that can contain data of any type.
multiple assignment
inheritance
generic data structure
generalize
32. 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.
Priority Queue
parse
prompt
formal language
33. A data type in which the elements can be modified. It is a compound type - e.g. lists.
inorder
mutable type
functional programming style
compile
34. A sequence of one or more characters used to specify the boundary between separate parts of text.
delimiter
sequence
object code
development plan
35. An element of a list - usually implemented as an object that contains a reference to another object of the same type.
generic data structure
compound statement
data type
node
36. To ________ a variable is to give it an initial value - usually in the context of multiple assignment.
functional programming style
run time error
veneer
initialization (of a variable)
37. 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.
whitespace
embedded reference
branch
wrapper
38. A function that returns a boolean value.
branch
boolean function
traverse
key-value pair
39. A variable defined inside a module - accessed by using the dot operator ( .).
attribute
function
dictionary
volatile memory
40. 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.
compound statement
program
compiler
file
41. A way of developing programs that involves high-level insight into the problem and more planning than incremental development or prototype development.
planned development
header
evaluate
naming collision
42. The node that refers to a given node.
continue statement
generic data structure
delimiter
parent
43. A name that refers to a value.
key-value pair
postfix
variable
dot operator
44. A process for developing a program.
development plan
natural language
priority queue
integer division
45. A graphical representation of a stack of functions and their variables and the values to which they refer.
index
stack diagram
binary operator
chained conditional
46. 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
class
polymorphic
immutable
47. A syntactic construct which enables lists to be generated from other lists using a syntax analogous to the mathematical set-builder notation.
path
queueing policy
list comprehension
infinite loop
48. A variable that is defined inside a class definition but outside any method. These are accessible from any method in the class and are shared by all instances of the class.
condition
cursor
mutable data type
class attribute
49. To read a string of characters or tokens and analyze its grammatical structure.
increment
element
algorithm
parse
50. A definition which defines something in terms of itself. It often provides an elegant way to express complex data structures.
parameter
planned development
recursive definition
operator overloading