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 value passed to a program along with the program's invocation at the command prompt of a command line interface (CLI).
tuple
infix
function
command line argument
2. The process of calling the function that is currently executing.
recursion
continue statement
bug
tail recursion
3. A kind of data structure that can contain data of any type.
variable
generic data structure
composition (of functions)
comment
4. To join two strings end-to-end.
compound data type
FIFO(First In First Out)
concatenate
compile
5. 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
integer division
siblings
hint
6. An ADT that performs the operations one might perform on a queue.
file
delimiter
Queue
trichotomy
7. One program structure within another - such as a conditional statement inside a branch of another conditional statement.
unit testing
nesting
header
exception
8. The set of nodes equidistant from the root.
dead code
token
level
prototype development
9. A method for naming and accessing and organizing files and the data they contain.
file system
path
root
expression
10. A way to traverse a tree - visiting the children of each node before the node itself.
postorder
subexpression
type conversion
scalar multiplication
11. An operator that takes two operands.
modifier
queue
namespace
binary operator
12. A style of program design in which the majority of functions are pure.
volatile memory
list comprehension
attribute
functional programming style
13. A special character that causes the cursor to move to the beginning of the next line.
siblings
delimiter
newline
compound statement
14. A function that changes one or more of the objects it receives as parameters. Most modifiers are void.
generalize
inheritance
formal language
modifier
15. Both as a noun and as a verb - it means to increase by 1.
functional programming style
dictionary
tuple assignment
increment
16. A way of developing programs starting with a prototype and gradually testing and improving it.
local variable
FIFO(First In First Out)
prototype development
iteration
17. An object that belongs to a class.
block
instance
leaf
loop
18. The first part of a compound statement. Headers begin with a keyword and end with a colon (:)
interpret
header
import statement
keyword
19. A character or string used to indicate where a string should be split.
delimiter
algorithm
generic data structure
prompt
20. A function that does not modify any of the objects it receives as parameters. Most pure functions are fruitful.
pure function
mapping type
naming collision
script
21. To simplify an expression by performing the operations in order to yield a single value.
evaluate
function call
argument
condition
22. A step-by-step process for solving a category of problems.
clone
event loop
algorithm
newline
23. An assertion that should be true of an object at all times (except perhaps while the object is being modified).
portability
docstring
branch
invariant
24. A general process for solving a category of problems.
root
veneer
value
algorithm
25. To translate a program written in a high-level language into a low-level language all at once - in preparation for later execution.
assignment statement
argument
compile
low-level language
26. Code that satisfies the syntactic and semantic requirements of an interface.
implementation
cargo
composition (of functions)
raise
27. A graphical representation of a set of variables and the values to which they refer.
compound data type
delimiter
composition (of functions)
state diagram
28. Memory that can maintain its state without power. Hard drives and flash drives and rewritable compact disks (CD-RW) are examples of such memory.
syntactical errors
dot operator
non-volatile memory
tuple
29. The structure of a program.
immutable
helper
boolean expression
syntax
30. An expression in parentheses that acts as a single operand in a larger expression.
queue
volatile memory
conditional statement
subexpression
31. To prevent an exception from terminating a program using the try and except statements.
polymorphic
composition
token
handle an exception
32. A loop in which the terminating condition is never satisfied.
function call
infinite loop
hint
postorder
33. An error that occurs at runtime.
mutable type
subexpression
exception
object code
34. Another name for object code that is ready to be executed.
parse
prompt
dot notation
executable
35. 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.
tab
side effect
delimiter
data type
36. A program development plan intended to avoid debugging by adding and testing only a small amount of code at a time.
argv (argument vector)
parse
incremental development
binary tree
37. A list that is an element of another list.
overflow
body
parse
nested list
38. A combination of variables and operators and values that represents a single result value.
rules of precedence
expression
interpret
debugging
39. A program (or the person who wrote it) that uses an ADT.
polymorphic
traceback
implementation
client
40. An operator denoted with a percent sign ( %) - that works on integers and yields the remainder when one number is divided by another.
linear time
modulus operator
linked queue
slice
41. A conditional branch with more than two possible flows of execution.
concatenate
chained conditional
operator
planned development
42. A function that can operate on more than one type. If all the operations in a function can be applied to a type then the function can be applied to a type.
boolean expression
veneer
polymorphic
instantiate
43. An invisible marker that keeps track of where the next character will be printed.
cursor
command prompt
compound statement
method
44. An organization of data for the purpose of making it easier to use.
data structure
function
algorithm
pure function
45. A program that translates higher level programming languages into basic instructions the CPU can understand.
semantics
wrapping code in a function
compiler
dot notation
46. The order in which statements are executed during a program run.
flow of execution
implementation
abstraction
keyword
47. 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.
optional parameter
function
pure function
infinite loop
48. A user-defined compound type. A class can also be thought of as a template for the objects that are instances of it.
class
node
trace
tuple assignment
49. An implementation of a queue using a linked list.
block
linked queue
nested list
siblings
50. A way of developing programs that involves high-level insight into the problem and more planning than incremental development or prototype development.
exception
leaf
planned development
parse