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 branch of the conditional statement in a recursive function that does not result in a recursive call.
boolean value
base case
iteration
event loop
2. An operation whose runtime is a linear function of the size of the data structure.
linear time
type conversion
initialization method
program
3. 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.
formal language
wrapping code in a function
tuple
docstring
4. A compound data type whose elements cannot be assigned new values.
inorder
immutable
mapping type
standard library
5. A style of program design in which the majority of functions are pure.
trichotomy
functional programming style
postfix
dictionary
6. A thing to which a variable can refer.
child
veneer
object
command prompt
7. A statement that executes a function. It consists of the name of the function followed by a list of arguments enclosed in parentheses.
test-driven development (TDD)
encode
subexpression
function call
8. The block of statements in a compound statement that follows the header.
conditional statement
incremental development
body
dead code
9. Generalization by reducing the information content of a concept.
class attribute
priority queue
abstraction
keyword
10. A box in a stack diagram that represents a function call. It contains the local variables and parameters of the function.
dot operator
initialization method
frame
conditional statement
11. Multiple variables that contain references to the same object.
formal language
development plan
variable
aliases
12. To examine a program and analyze the syntactic structure.
dead code
polymorphic
recursion
parse
13. 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.
compound data type
priority queue
prompt
object-oriented programming
14. A method for naming and accessing and organizing files and the data they contain.
clone
file system
random
inorder
15. The ability to combine simple expressions and statements into compound statements and expressions in order to represent complex computations concisely.
infinite recursion
modulus operator
exception
composition
16. Repeated execution of a set of programming statements.
preorder
iteration
infinite recursion
temporary variable
17. A function which has no side effects. It only makes changes to the calling program through its return values.
pure function
postfix
compound data type
counter
18. The set of rules governing the order in which expressions involving multiple operators and operands are evaluated.
function composition
list
rules of precedence
iteration
19. A loop inside the body of another loop.
byte code
wrapper
whitespace
nested loop
20. The class from which a child class inherits.
parent class
incremental development
parent
planned development
21. A part of a string (substring) specified by a range of indices.
incremental development
slice
byte code
implementation
22. 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.
nested list
value
tail recursion
abstract data type (ADT)
23. An escape character '' followed by one or more printable characters used to designate a nonprintable character.
escape sequence
non-volatile memory
binary tree
handle an exception
24. A special character that causes the cursor to move to the beginning of the next line.
algorithm
variable
newline
object-oriented programming
25. A variable used to count something - usually initialized to zero and incremented in the body of a loop.
algorithm
body
continue statement
counter
26. Another name for a runtime error.
list traversal
wrapper
exception
parse
27. An operation defined in linear algebra that multiplies each of the coordinates of a Point by a numeric value.
class
import statement
scalar multiplication
base case
28. A property of a program that can run on more than one kind of computer.
parameter
portability
bug
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.
body
value
object code
algorithm
30. The interval between successive elements of a linear sequence. The third (and optional argument) to the range function is called the step size. If not specified it defaults to 1.
fruitful function
step size
tuple
compiler
31. To represent one set of values using another set of values by constructing a mapping between them.
encode
type conversion
tuple assignment
data type
32. An assertion that must be true in order for a method to work correctly.
Queue
precondition
preorder
pure function
33. A numerical result that is too large to be represented in a numerical format.
modifier
namespace
overflow
subexpression
34. A recursive call that occurs as the last statement (at the tail) of a function definition.
file system
body
instantiate
tail recursion
35. An ordered set of objects waiting for a service of some kind.
run time error
tail recursion
queue
recursive call
36. A data type in which the values are made up of components or elements that are themselves values.
key-value pair
executable
compound data type
value
37. Any of the data types that consist of an ordered set of elements with each element identified by an index.
path
encapsulate
queueing policy
sequence
38. A way of developing programs starting with a prototype and gradually testing and improving it.
side effect
accumulator
prototype development
object-oriented language
39. A queueing policy in which the first member to arrive is the first to be removed.
state diagram
wrapping code in a function
FIFO(First In First Out)
function call
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
tuple
scalar multiplication
dot notation
41. An error that occurs at runtime.
scalar multiplication
bug
exception
syntax error
42. A variable defined inside a function. A local variable can only be used inside its function.
class attribute
mutable data type
local variable
inheritance
43. To create an instance of a class.
base case
increment
instantiate
queueing policy
44. An expression that is either true or false.
formal language
boolean expression
concatenate
comparison operator
45. Code that is used during program development but is not part of the final version.
element
script
source code
scaffolding
46. A process for developing a program.
variable
development plan
text file
mutable type
47. A conditional branch with more than two possible flows of execution.
compile
chained conditional
FIFO(First In First Out)
tuple assignment
48. One of the possible paths of the flow of execution determined by conditional execution.
branch
body
escape sequence
dead code
49. Any one of the languages that people speak that evolved naturally.
mutable data type
root
modifier
natural language
50. A syntactic container providing a context for names so that the same name can reside in different namespaces without ambiguity.
element
compound data type
namespace
fundamental ambiguity theorem