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. Code that satisfies the syntactic and semantic requirements of an interface.
implementation
local variable
semantics
functional programming style
2. A statement that assigns a value to a name (variable).
portability
inheritance
constant time
assignment statement
3. A function that does not modify any of the objects it receives as parameters. Most pure functions are fruitful.
pure function
veneer
infinite loop
parameter
4. One program structure within another - such as a conditional statement inside a branch of another conditional statement.
expression
linked queue
event
nesting
5. A reference to a list node can be treated as a single object or as the first in a list of nodes.
compile
fundamental ambiguity theorem
scaffolding
low-level language
6. There are exactly two boolean values: True and False.
priority queue
pure function
boolean value
compiler
7. One of the operators that combines boolean expressions: and or and not.
modifier
loop variable
overflow
logical operator
8. A special character that causes the cursor to move to the beginning of the next line.
compile
test-driven development (TDD)
operator
newline
9. An item of data contained in a node.
compound data type
default value
cargo
dot operator
10. An escape character '' followed by one or more printable characters used to designate a nonprintable character.
escape sequence
embedded reference
postfix
traceback
11. A set of instructions for solving a class of problems by a mechanical and unintelligent process.
interpret
algorithm
function composition
overflow
12. To create an instance of a class.
cursor
instantiate
veneer
mutable type
13. A function that is defined inside a class definition and is invoked on instances of that class. :override:: To replace a default. Examples include replacing a default parameter with a particular argument and replacing a default method by providing a
child
compiler
run time error
method
14. A character that is used to separate tokens such as punctuation in a natural language.
mode
step size
delimiter
run time error
15. Repeated execution of a set of programming statements.
iteration
parse
instantiate
low-level language
16. One of the pairs of items in a dictionary. Values are looked up in a dictionary by key.
key-value pair
binary operator
directory
integer division
17. Function-like attribute of an object. Methods are invoked (called) on an object using the dot operator.
command prompt
method
functional programming style
step size
18. A syntactic construct which enables lists to be generated from other lists using a syntax analogous to the mathematical set-builder notation.
list comprehension
function call
problem solving
singleton
19. The value provided as the result of a function call.
compile
return value
nesting
object
20. An implementation of a queue using a linked list.
newline
function composition
linear time
linked queue
21. The statements inside a loop.
composition
non-volatile memory
operator overloading
body
22. 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.
child
syntactical errors
escape sequence
tuple
23. A function which has no side effects. It only makes changes to the calling program through its return values.
pure function
condition
keyword
random
24. An operation whose runtime does not depend on the size of the data structure.
siblings
level
integer division
constant time
25. An ADT that defines the operations one might perform on a priority queue.
base case
token
comparison operator
Priority Queue
26. A special symbol that represents a simple computation like addition or multiplication or string concatenation.
recursive call
operator
class
mode
27. 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.
mutable data type
comment
stack diagram
binary tree
28. To ________ a variable is to give it an initial value - usually in the context of multiple assignment.
initialization (of a variable)
composition (of functions)
escape sequence
boolean expression
29. An automatic procedure used to validate that individual units of code are working properly.
unit testing
sequence
frame
volatile memory
30. A data item that is mapped to a value in a dictionary. Used to look up values in a dictionary.
traceback
key
scaffolding
low-level language
31. A group of consecutive statements with the same indentation.
parse
block
namespace
loop variable
32. An expression that is either true or false.
object
precondition
list traversal
boolean expression
33. A data type which can be modified.
mutable data type
priority queue
inorder
implementation
34. The order in which statements are executed during a program run.
infinite recursion
flow of execution
type conversion
recursive call
35. A combination of variables and operators and values that represents a single result value.
volatile memory
root
stack diagram
expression
36. An organization of data for the purpose of making it easier to use.
generic data structure
cargo
flow of execution
data structure
37. 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.
priority queue
index
local variable
node
38. A kind of data structure that can contain data of any type.
encode
random
generic data structure
volatile memory
39. 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.
compound data type
abstract data type (ADT)
comment
concatenate
40. To join two strings end-to-end.
invariant
temporary variable
concatenate
iteration
41. A logical error which stops a program from performing.
run time error
local variable
loop
stack diagram
42. A method that is not invoked directly by a caller but is used by another method to perform part of an operation.
composition
implementation
helper
formal language
43. A way to traverse a tree - visiting the children of each node before the node itself.
postorder
command prompt
implementation
queue
44. The code (or the person who wrote it) that implements an ADT.
accumulator
command line
tuple assignment
provider
45. A property of a program that can run on more than one kind of computer.
encode
portability
handle an exception
element
46. Another name for a runtime error.
command prompt
level
sequence
exception
47. The process of calling the function that is currently executing.
iteration
recursion
exception
compound statement
48. A named collection of files - also called a folder.
stack diagram
keyword
directory
formal language
49. An element of a list - usually implemented as an object that contains a reference to another object of the same type.
handle an exception
object
path
node
50. A program (or the person who wrote it) that uses an ADT.
object-oriented language
function
client
mutable data type