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 implementation of a queue using a linked list.
rules of precedence
delimiter
temporary variable
linked queue
2. A named sequence of statements that performs some useful operation. Functions may or may not take parameters and may or may not produce a result.
function
evaluate
parse
queueing policy
3. The value given to an optional parameter if no argument for it is provided in the function call.
default value
preorder
command prompt
algorithm
4. Function-like attribute of an object. Methods are invoked (called) on an object using the dot operator.
method
natural language
scalar multiplication
delimiter
5. 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.
optional parameter
type conversion
keyword
stack diagram
6. A function that does not modify any of the objects it receives as parameters. Most pure functions are fruitful.
tail recursion
pure function
slice
low-level language
7. An organization of data for the purpose of making it easier to use.
provider
generic data structure
data structure
modulus operator
8. To iterate through the elements of a set performing a similar operation on each.
mode
prefix notation
increment
traverse
9. An ADT that defines the operations one might perform on a priority queue.
child
Priority Queue
function composition
planned development
10. One of the nodes referred to by a node.
operator overloading
function definition
queue
child
11. To signal an exception using the raise statement.
comparison operator
standard library
raise
parse
12. 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.
compile
source code
step size
node
13. A statement which makes the objects contained in a module available for use within another module.
abstraction
program
prefix notation
import statement
14. A value provided to a function when the function is called. This value is assigned to the corresponding parameter in the function.
initialization method
step size
accumulator
argument
15. Temporary storage of a precomputed value to avoid redundant computation.
hint
slice
whitespace
implementation
16. An operation defined in linear algebra that multiplies two Points and yields a numeric value.
linked list
side effect
functional programming style
dot product
17. A data item that is mapped to a value in a dictionary. Used to look up values in a dictionary.
generic data structure
constant
key
parse
18. 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.
whitespace
event
compound statement
argument
19. A way of developing programs that involves high-level insight into the problem and more planning than incremental development or prototype development.
planned development
chained conditional
fruitful function
algorithm
20. A tree in which each node refers to zero or one or two dependent nodes.
overflow
binary tree
raise
recursion
21. A step-by-step process for solving a category of problems.
key
algorithm
delimiter
implementation
22. The name and location of a file within a file system.
key
path
constant
base case
23. A way to traverse a tree - visiting each node before its children.
header
preorder
singleton
generalize
24. A variable defined inside a module - accessed by using the dot operator ( .).
clone
attribute
subexpression
binary operator
25. A program development plan intended to avoid debugging by adding and testing only a small amount of code at a time.
embedded reference
expression
incremental development
aliases
26. An operator that takes two operands.
directory
binary operator
body
counter
27. A function that returns a boolean value.
incremental development
sequence
counter
boolean function
28. The process of calling the function that is currently executing.
function
client
index
recursion
29. To follow the flow of execution of a program by hand - recording the change of state of the variables and any output produced.
trace
preorder
increment
byte code
30. A name that refers to a value.
variable
object
key-value pair
file
31. Decrease by 1.
high-level language
operator overloading
decrement
object-oriented programming
32. One of the named data items that makes up an instance.
namespace
modifier
attribute
infix
33. A variable used to store an intermediate value in a complex calculation.
temporary variable
stack diagram
dot product
body
34. A part of a string (substring) specified by a range of indices.
volatile memory
slice
initialization method
wrapper
35. A programming language that is designed to be easy for a computer to execute; also called machine language or assembly language.
boolean function
immutable data type
method
low-level language
36. Code that is used during program development but is not part of the final version.
comment
evaluate
scaffolding
mapping type
37. A graphical representation of a set of variables and the values to which they refer.
generalize
encode
state diagram
traceback
38. Information in a program that is meant for other programmers (or anyone reading the source code) and has no effect on the execution of the program.
random
scalar multiplication
comment
initialization (of a variable)
39. a sequence of instructions that specifies to a computer actions and computations to be performed.
constant time
queueing policy
program
counter
40. A special method that is invoked automatically when a new object is created and that initializes the object's attributes.
polymorphic
priority queue
initialization method
generic data structure
41. A sequence of one or more characters used to specify the boundary between separate parts of text.
precondition
delimiter
class
client
42. A programming language that is designed to be easy for humans to read and write.
high-level language
rules of precedence
compound data type
value
43. A set of characters that are treated as a unit for purposes of parsing such as the words in a natural language.
operator
scalar multiplication
postfix
token
44. 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.
pure function
traverse
header
side effect
45. A combination of variables and operators and values that represents a single result value.
expression
debugging
list
optional parameter
46. To join two strings end-to-end.
embedded reference
concatenate
semantic error
object
47. A compound data type that is often used to model a thing or concept in the real world.
object
helper
variable
import statement
48. A variable in the sys module which stores a list of command line arguments passed to a program at run time.
boolean function
argv (argument vector)
accumulator
polymorphic
49. An ordered set of objects waiting for a service of some kind.
loop
runtime error
queue
compile
50. A language that provides features - such as user-defined classes and inheritance - that facilitate object-oriented programming.
trace
object-oriented language
exception
fruitful function