SUBJECTS
|
BROWSE
|
CAREER CENTER
|
POPULAR
|
JOIN
|
LOGIN
Business Skills
|
Soft Skills
|
Basic Literacy
|
Certifications
About
|
Help
|
Privacy
|
Terms
|
Email
Search
Test your basic knowledge |
Data Structures
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. The area of program text over which a variable can be referenced
scope
class
stack space
entinel
2. In object oriented programming - a description of a set of similar objects
class
data structure
data abstraction
entinel
3. A number that is defined as an object so that it has a runtime type and methods that can be used - e.g. Integer in Java
preorder
general list
boxed number
ancestors
4. The process of collecting garbage for recycling
garbage collection
destructive
fair
scope
5. A classification of objects into a tree structure that groups related objects
base case
pointer
taxonomy
circular queue
6. A given collection of values along with a collection of operations for use on those values
circularly linked list
tail recursive
merge
data type
7. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
recursion
procedural abstraction
doubly linked list
side-effect
8. Composed of a collection of data values; implemented with a data structure
depth
union
procedural abstraction
complex ADT
9. Constructed of multiple components (simple or complex types)
design pattern
descendants
data type
complex data type
10. To look through a data structure until a goal object is found
search
recursive case
algorithm
shadow
11. The amount of space on the runtime stack required for execution of a program
side-effect
branching factor
doubly linked list
stack space
12. In a search tree - a program that changes a state into a child state e.g a move in a game
node
operator
data structure
taxonomy
13. In a search tree - the number of children of a given node. often - the branching factors of individual nodes will vary - so an average value may be used
queue
branching factor
root
doubly linked list
14. A case where a program calls itself
divide and conquer
null dereference
operator
recursion
15. A process that removes unwanted elements from a collection
alias
immutable
filter
reference type
16. An abstracted function that describes the amount of computer time or memory space required by an algorithm - as a function of problem size. for problems larger than a certain size - the actual time or space required will be less than the Big O multip
big o
state
backtrack
divide and conquer
17. A simple case that can be solved easily - without recursion
recursive case
base case
circular queue
sort
18. A pattern that describes a set of similar programs
dictionary
sort
design pattern
operator
19. Last in first out: describes the order of a stack
child
LIFO
linear O(n)
divide and conquer
20. A collection of values
LIFO
type
reference type
design pattern
21. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
inorder
queue
LIFO
null dereference
22. A data structure that can be identified at runtime as being a member of a class
queue
class
LIFO
object
23. A runtime error that occurs when an operation such as method call is attempted on a null pointer
null dereference
boxed number
circular queue
queue
24. Describes a data structure or device in which all accesses have the same cost - O(1)
intractable
random access
cons
structure sharing
25. Describes a function that makes a new data structure but does not modify its arguments
postorder
constructive
random access
branching factor
26. Describes a though experiment or view of an entity
class
gedanken
intersection
sort
27. An elements of a linked list - tree - or graph - often represented by a data structure
gedanken
node
stack
fifo
28. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
big o
goal
parent
well-founded ordering xml
29. A problem whose solution requires a linear amount of time or space if the problem is size n
association list
type
linear O(n)
linked list
30. The next element in a linked list
stack frame
DFS
successor
merge
31. First in first out: describes ordering of a queue
child
preorder
array
fifo
32. Given two sets -the union is the set of elements that are members of either set
entinel
union
well-founded ordering xml
type
33. The number of links between the root of a tree and the leaves
destructive
runtime stack
depth
side-effect
34. A sequence of records - where each record contains a link to the next one
data abstraction
linked list
branching factor
recursive case
35. To answer the question - "If the algorithm is run several times - what is the average time per run - given the worst possible sequence of runs?"
type
general list
amortized Analysis
stack frame
36. Container for storing a collection of data in unique key/value pairs
data structure
dictionary
backtrack
interior node
37. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
fair
depth-first search
scope
divide and conquer
38. 1. In lisp - the function that constructs a pair of points - or basic elements of list structure. 2. To make a cons data structure 2. a cons data structure
intersection
simple ADT
design pattern
cons
39. Any container with linear ordering
complex data type
general list
intractable
well-founded ordering xml
40. Two variables that reference the same object
merge
base case
procedural abstraction
alias
41. A condition of the input data where the data will be handled by call(s) to the same program
linear O(n)
intractable
recursive case
grammar
42. To combine two ordered linear structures into one
branching factor
structure sharing
merge
grammar
43. An order of processing a tree in which the parent node is processed in between its children
search
divide and conquer
circular queue
inorder
44. To convert from a pointer to the data that is pointed to
dereference
child
queue
base case
45. The top node of a tree - from which all other nodes can be reached
root
amortized Analysis
taxonomy
postorder
46. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
stack space
set difference
filter
runtime stack
47. In a tree search - to move back from the node currently being examined to its parent
data abstraction
array
backtrack
general list
48. A description of operations on a data type that could have multiple possible implementations
recursion
parent
abstract data type
runtime stack
49. A pointer to the next element in a linked list
divide and conquer
entinel
link
postorder
50. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
object
grammar
algorithm
successor