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. A case where tow data structures share some elements
abstract data type
structure sharing
general list
binary search tree (bst)
2. Given two sets -the union is the set of elements that are members of either set
object
union
array
type
3. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
fifo
leaf
type
side-effect
4. A condition of the input data where the data will be handled by call(s) to the same program
reference
recursive case
sort
doubly linked list
5. Composed of a collection of data values; implemented with a data structure
complex ADT
structure sharing
base case
search
6. A simple case that can be solved easily - without recursion
random access
circularly linked list
base case
link
7. Describes a though experiment or view of an entity
postorder
base case
gedanken
cons
8. The area of program text over which a variable can be referenced
recursive case
scope
parent
big o
9. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
linear O(n)
well-founded ordering xml
grammar
complex ADT
10. An order of processing a tree in which the parent node is processed in between its children
immutable
structure sharing
LIFO
inorder
11. Container for storing a collection of data in unique key/value pairs
binary search tree (bst)
cons
object
dictionary
12. Last in first out: describes the order of a stack
LIFO
backtrack
type
garbage collection
13. First-child/next-sibling
fair
preorder
garbage
intersection
14. To hide similar items with the same name
queue
simple data type
shadow
intractable
15. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
search
inorder
divide and conquer
leaf
16. 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
inorder
taxonomy
boxed number
object
17. Values are in the most basic form and cannot be decomposed into smaller parts
dereference
simple ADT
simple data type
depth-first search
18. Constructed of multiple components (simple or complex types)
complex data type
queue
data type
binary search tree (bst)
19. A tree node containing a contents value but with no children
inorder
stack frame
tail recursive
leaf
20. The top node of a tree - from which all other nodes can be reached
divide and conquer
state
postorder
root
21. The process of collecting garbage for recycling
reference type
fifo
complex ADT
garbage collection
22. Depth first search
node
DFS
recursive case
circularly linked list
23. Composed of multiple sequential elements stored in contiguous bytes of memory
boxed number
array
circular queue
root
24. 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
state
branching factor
algorithm
structure sharing
25. A search in which children of a node are considered before siblings are considered
backtrack
boxed number
depth-first search
big o
26. A given collection of values along with a collection of operations for use on those values
data type
data structure
array
pointer
27. A stack containing a stack frame of variable value for each active invocation of procedure
runtime stack
well-founded ordering xml
amortized Analysis
LIFO
28. A problem whose solution requires a linear amount of time or space if the problem is size n
LIFO
preorder
linear O(n)
destructive
29. A pointer to the next element in a linked list
binary search tree (bst)
stack frame
circular queue
link
30. Use of a function or method without knowing how it's accomplished
LIFO
simple data type
destructive
procedural abstraction
31. In object oriented programming - a description of a set of similar objects
cons
tail recursive
class
amortized Analysis
32. A data structure that can be identified at runtime as being a member of a class
branching factor
object
backtrack
side-effect
33. A problem that is so hard that it cannot be solved unless the problem is small
intractable
association list
garbage
stack
34. The amount of space on the runtime stack required for execution of a program
random access
stack space
child
recursive case
35. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
queue
root
doubly linked list
pointer
36. A process that removes unwanted elements from a collection
well-founded ordering xml
merge
object
filter
37. In a tree - a node that points to a given node
constructive
parent
random access
link
38. A list of pairs - where each pair has a key and a value associated with the key
big o
goal
association list
fair
39. storage that is no longer pointed to by any variable and therefore can no longer be accessed
depth
garbage
type
scope
40. Given two sets - the intersection is the set of elements that are members of both sets
array
intersection
successor
LIFO
41. A pattern that describes a set of similar programs
node
algorithm
structure sharing
design pattern
42. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
complex data type
state
runtime stack
algorithm
43. To combine two ordered linear structures into one
garbage
intractable
merge
type
44. An item (or description of items) being sough in a search
immutable
ancestors
goal
queue
45. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
complex ADT
scope
ontology
circular queue
46. A data structure that implements a complete binary tree within an array - such that every parent node has a value that is less than the value of either of its children
runtime stack
binary tree
recursive case
ancestors
47. 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
alias
taxonomy
big o
tail recursive
48. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
set difference
search
dereference
null dereference
49. Any container with linear ordering
general list
operator
procedural abstraction
dictionary
50. Separation of the properties of a data type from its implementation
data abstraction
fifo
cons
union