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 operator that takes two operands.
binary tree
binary operator
key
parent class
2. To execute a program in a high-level language by translating it one line at a time.
compile
interpret
prototype development
random
3. A special symbol that represents a simple computation like addition or multiplication or string concatenation.
operator
increment
step size
pure function
4. The statements inside a loop.
counter
syntactical errors
executable
body
5. A list that is an element of another list.
increment
parent
method
nested list
6. 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.
portability
optional parameter
fundamental ambiguity theorem
dot notation
7. 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).
scalar multiplication
data type
link
linear time
8. One of the possible paths of the flow of execution determined by conditional execution.
prefix notation
binary operator
branch
loop
9. A data type in which the values are made up of components or elements that are themselves values.
composition (of functions)
boolean expression
compound data type
decrement
10. A class definition that implements an ADT with method definitions that are invocations of other methods - sometimes with simple transformations. It does no significant work but it improves or standardizes the interface seen by the client.
instance
veneer
encode
inorder
11. The class from which a child class inherits.
attribute
stack diagram
nesting
parent class
12. A statement which makes the objects contained in a module available for use within another module.
import statement
operator overloading
step size
directory
13. To iterate through the elements of a set performing a similar operation on each.
traverse
variable
bug
formal language
14. Any of the characters that move the cursor without printing visible characters. The constant string.whitespace contains all the white-space characters.
constant time
decrement
high-level language
whitespace
15. Another name for object code that is ready to be executed.
executable
traverse
wrapper
aliases
16. One of the basic elements of the syntactic structure of a program - analogous to a word in a natural language.
optional parameter
token
dot operator
compiler
17. A tree in which each node refers to zero or one or two dependent nodes.
binary tree
concatenate
parent
postfix
18. The output of the compiler after it translates the program.
object code
directory
function call
inorder
19. A recursive call that occurs as the last statement (at the tail) of a function definition.
inorder
function definition
mode
tail recursion
20. A situation in which two or more names in a given namespace cannot be unambiguously resolved.
program
import statement
naming collision
command prompt
21. To examine a program and analyze the syntactic structure.
parse
linked queue
helper
formal language
22. A definition which defines something in terms of itself. It often provides an elegant way to express complex data structures.
exception
wrapper
parse
recursive definition
23. The process of calling the function that is currently executing.
cursor
mutable type
recursion
semantics
24. The ability to combine simple expressions and statements into compound statements and expressions in order to represent complex computations concisely.
embedded reference
object-oriented programming
argument
composition
25. The ability to define a new class that is a modified version of a previously defined class.
value
object-oriented programming
inheritance
sequence
26. An implementation of a queue using a linked list.
nesting
key
linked list
linked queue
27. Repeated execution of a set of programming statements.
tail recursion
iteration
Queue
prompt
28. An escape character '' followed by one or more printable characters used to designate a nonprintable character.
Priority Queue
traceback
data type
escape sequence
29. 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.
initialization method
composition
preorder
body
30. The dot operator ( .) permits access to attributes and functions of a module.
dot operator
rules of precedence
block
comparison operator
31. An ADT that defines the operations one might perform on a priority queue.
parse
Priority Queue
block
exception
32. A way of developing programs starting with a prototype and gradually testing and improving it.
prototype development
immutable data type
escape sequence
argument
33. A process for developing a program.
development plan
level
dot operator
natural language
34. A function which has no side effects. It only makes changes to the calling program through its return values.
base case
pure function
recursion
conditional statement
35. 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.
implementation
traceback
parse
compile
36. A number or string (or other things to be named later) that can be stored in a variable or computed in an expression.
program
generalize
value
bug
37. A data type which cannot be modified. Assignments to elements or slices of immutable types cause a runtime error.
syntactical errors
dictionary
continue statement
immutable data type
38. A style of program design in which the majority of functions are pure.
postorder
delimiter
bug
functional programming style
39. 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.
invariant
body
wrapping code in a function
method
40. An operation whose runtime does not depend on the size of the data structure.
default value
constant time
argv (argument vector)
pure function
41. Code that is used during program development but is not part of the final version.
FIFO(First In First Out)
incremental development
scaffolding
list traversal
42. An expression that is either true or false.
boolean expression
prompt
function composition
token
43. Generalization by reducing the information content of a concept.
composition (of functions)
event
abstraction
keyword
44. One of the values on which an operator operates.
assignment statement
nested loop
tuple assignment
operand
45. A method that is not invoked directly by a caller but is used by another method to perform part of an operation.
helper
initialization method
variable
nesting
46. An object that belongs to a class.
veneer
command line
block
instance
47. Using the output from one function call as the input to another.
function composition
operator overloading
queue
Queue
48. To simplify an expression by performing the operations in order to yield a single value.
evaluate
tuple
immutable
state diagram
49. 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.
scaffolding
tuple
dot product
branch
50. An error that occurs at runtime.
dead code
tail recursion
exception
functional programming style