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 statement that causes the current iteration of a loop to end.
sequence
wrapping code in a function
leaf
continue statement
2. The meaning of a program.
semantics
Queue
exception
incremental development
3. A number or string (or other things to be named later) that can be stored in a variable or computed in an expression.
boolean value
wrapping code in a function
instantiate
value
4. Part of a program that can never be executed - often because it appears after a return statement.
dead code
whitespace
level
attribute
5. An ADT that defines the operations one might perform on a priority queue.
exception
level
test-driven development (TDD)
Priority Queue
6. A programming language that is designed to be easy for a computer to execute; also called machine language or assembly language.
low-level language
inorder
block
local variable
7. A data item that is mapped to a value in a dictionary. Used to look up values in a dictionary.
counter
key
body
command prompt
8. Memory which requires an electrical current to maintain state. Information stored is lost when the computer is turned off.
parent
Queue
volatile memory
boolean function
9. 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.
command line argument
operand
tuple
key-value pair
10. An item of data contained in a node.
instance
modulus operator
stack diagram
cargo
11. A name that refers to a value.
trace
handle an exception
variable
problem solving
12. A language that provides features - such as user-defined classes and inheritance - that facilitate object-oriented programming.
command line argument
index
object-oriented language
program
13. Use of the dot operator '.' to access functions inside a module.
index
docstring
parse
dot notation
14. A combination of variables and operators and values that represents a single result value.
expression
function
variable name
embedded reference
15. A set of characters that are treated as a unit for purposes of parsing such as the words in a natural language.
child
token
infix
root
16. A program in a high-level language before being compiled.
encapsulate
recursive definition
tail recursion
source code
17. Given any real numbers a and b exactly one of the following relations holds: a < b or a > b or a = b. Thus when you can establish that two of the relations are false you can assume the remaining one is true. What is it called?
initialization (of a variable)
syntax
compound statement
trichotomy
18. A function which changes its arguments inside the function body. Only mutable types can be changed by modifiers.
modifier
wrapper
runtime error
operand
19. A style of program design in which the majority of functions are pure.
semantics
functional programming style
implementation
index
20. An intermediate language between source code and object code. Many modern languages first compile source code into byte code and then interpret the byte code with a program called a virtual machine.
instance
object
infinite loop
byte code
21. Any of the data types that consist of an ordered set of elements with each element identified by an index.
sequence
recursive definition
keyword
optional parameter
22. A tree in which each node refers to zero or one or two dependent nodes.
binary tree
attribute
whitespace
siblings
23. A variable defined inside a function. A local variable can only be used inside its function.
planned development
local variable
object-oriented language
counter
24. One of the pairs of items in a dictionary. Values are looked up in a dictionary by key.
key-value pair
algorithm
keyword
hint
25. A data type which can be modified.
fundamental ambiguity theorem
client
mutable data type
fruitful function
26. A function that does not modify any of the objects it receives as parameters. Most pure functions are fruitful.
random
pure function
nested list
rules of precedence
27. One of the values in a list (or other sequence). The bracket operator selects elements of a list.
interface
child
element
dot operator
28. The ability to combine simple expressions and statements into compound statements and expressions in order to represent complex computations concisely.
argument
Priority Queue
runtime error
composition
29. To simplify an expression by performing the operations in order to yield a single value.
volatile memory
evaluate
parameter
non-volatile memory
30. Extending built-in operators ( + or - or * or > or < etc.) so that they work with user-defined types.
wrapper
inheritance
operator overloading
key-value pair
31. A statement that creates a new function specifying its name and parameters and the statements it executes.
newline
overflow
optional parameter
function definition
32. The dot operator ( .) permits access to attributes and functions of a module.
volatile memory
linear time
block
dot operator
33. 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.
argv (argument vector)
delimiter
nesting
formal language
34. A process for developing a program.
binary tree
development plan
compound statement
veneer
35. A situation in which two or more names in a given namespace cannot be unambiguously resolved.
generalize
debugging
precondition
naming collision
36. 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.
binary tree
compound statement
source code
clone
37. A file that contains printable characters organized into lines separated by newline characters.
object-oriented programming
text file
scaffolding
conditional statement
38. An expression in parentheses that acts as a single operand in a larger expression.
binary operator
instantiate
nested loop
subexpression
39. A distinct method of operation within a computer program.
increment
veneer
operand
mode
40. A graphical representation of a stack of functions and their variables and the values to which they refer.
stack diagram
operator overloading
dead code
postorder
41. Another name for a runtime error.
counter
exception
veneer
queue
42. A programming language that is designed to be easy for humans to read and write.
exception
natural language
whitespace
high-level language
43. A name given to a variable.
default value
variable name
algorithm
linked queue
44. A function that calls itself recursively without ever reaching the base case - ultimately causes a runtime error.
infinite recursion
mapping type
runtime error
interpret
45. 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.
object
priority queue
exception
compiler
46. An operation defined in linear algebra that multiplies each of the coordinates of a Point by a numeric value.
scalar multiplication
dot operator
tuple
sequence
47. An operation whose runtime is a linear function of the size of the data structure.
function
whitespace
modulus operator
linear time
48. The set of operations that define an ADT.
local variable
interface
flow of execution
instantiate
49. A variable used in a loop to accumulate a series of values - such as by concatenating them onto a string or adding them to a running sum.
Queue
data structure
parent
accumulator
50. A box in a stack diagram that represents a function call. It contains the local variables and parameters of the function.
trichotomy
frame
fundamental ambiguity theorem
event loop