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 description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
successor
gedanken
ontology
constructive
2. All nodes below a give node in a tree
preorder
procedural abstraction
fair
descendants
3. 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
binary tree
filter
depth
4. A search in which children of a node are considered before siblings are considered
simple ADT
simple data type
depth-first search
intersection
5. A runtime error that occurs when an operation such as method call is attempted on a null pointer
backtrack
state
union
null dereference
6. An extra record at the start or end of a data structure such as a linked list - to simplify processing
algorithm
entinel
doubly linked list
gedanken
7. A data structure that can be identified at runtime as being a member of a class
circularly linked list
object
backtrack
link
8. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
side-effect
successor
entinel
merge
9. An elements of a linked list - tree - or graph - often represented by a data structure
link
null dereference
node
intractable
10. A sequence of records - where each record contains a link to the next one
linked list
boxed number
general list
stack
11. binary tree that is ordered such that each node has contents - and all of its left descendants are less than the contents - an all of its right descendants are greater than the contents
binary search tree (bst)
gedanken
algorithm
fifo
12. A stack containing a stack frame of variable value for each active invocation of procedure
data abstraction
shadow
binary search tree (bst)
runtime stack
13. A process that removes unwanted elements from a collection
recursive case
filter
goal
amortized Analysis
14. 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
structure sharing
dereference
cons
data structure
15. Composed of a collection of data values; implemented with a data structure
data type
ancestors
fifo
complex ADT
16. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
complex ADT
data structure
sort
big o
17. Last in first out: describes the order of a stack
descendants
LIFO
union
data structure
18. A pointer to the next element in a linked list
link
queue
taxonomy
leaf
19. A pointer to data
well-founded ordering xml
reference
intractable
procedural abstraction
20. The number of links between the root of a tree and the leaves
backtrack
data structure
depth
association list
21. A linked list in which the last element points back to the first element
runtime stack
abstract data type
constructive
circularly linked list
22. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
tail recursive
dereference
union
operator
23. Values are in the most basic form and cannot be decomposed into smaller parts
fifo
simple data type
simple ADT
state
24. In a tree - a node pointed to by a parent node
gedanken
tail recursive
child
branching factor
25. To convert from a pointer to the data that is pointed to
ancestors
type
dereference
root
26. Describes a data structure or device in which all accesses have the same cost - O(1)
complex data type
gedanken
queue
random access
27. A linked list in which each elements has both forward and backward pointers
union
doubly linked list
type
boxed number
28. Use of a function or method without knowing how it's accomplished
procedural abstraction
depth
scope
amortized Analysis
29. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
search
postorder
link
well-founded ordering xml
30. A collection of values
depth
root
big o
type
31. A contiguous block of memory containing elements of the same type - accessed by numeric index
stack
gedanken
tail recursive
array
32. 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
destructive
inorder
binary tree
divide and conquer
33. A problem that is so hard that it cannot be solved unless the problem is small
recursion
root
inorder
intractable
34. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
tail recursive
grammar
shadow
circularly linked list
35. Given two sets -the union is the set of elements that are members of either set
union
goal
simple data type
binary tree
36. The amount of space on the runtime stack required for execution of a program
general list
recursion
ancestors
stack space
37. The top node of a tree - from which all other nodes can be reached
data structure
recursive case
depth-first search
root
38. An order of processing a tree in which the parent node is processed in between its children
shadow
intractable
inorder
fair
39. To combine two ordered linear structures into one
filter
simple data type
doubly linked list
merge
40. Container for storing a collection of data in unique key/value pairs
dictionary
linked list
type
LIFO
41. Separation of the properties of a data type from its implementation
DFS
amortized Analysis
dictionary
data abstraction
42. A condition of the input data where the data will be handled by call(s) to the same program
recursive case
DFS
well-founded ordering xml
recursion
43. A section of the runtime stack holding the values of all variables for one invocation
stack frame
set difference
amortized Analysis
base case
44. An item (or description of items) being sough in a search
data abstraction
runtime stack
goal
taxonomy
45. To look through a data structure until a goal object is found
big o
search
runtime stack
depth-first search
46. The area of program text over which a variable can be referenced
fifo
binary search tree (bst)
descendants
scope
47. A problem whose solution requires a linear amount of time or space if the problem is size n
random access
linear O(n)
data structure
ontology
48. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
merge
array
queue
algorithm
49. Constructed of multiple components (simple or complex types)
complex data type
amortized Analysis
root
general list
50. A case where a program calls itself
merge
big o
binary tree
recursion