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. To convert from a pointer to the data that is pointed to
array
stack frame
type
dereference
2. A problem that is so hard that it cannot be solved unless the problem is small
intractable
shadow
goal
garbage collection
3. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
DFS
reference type
LIFO
immutable
4. In a tree - a node pointed to by a parent node
child
type
operator
inorder
5. The next element in a linked list
successor
divide and conquer
immutable
simple ADT
6. Depth first search
parent
DFS
circularly linked list
garbage
7. An elements of a linked list - tree - or graph - often represented by a data structure
boxed number
node
stack
set difference
8. A list of pairs - where each pair has a key and a value associated with the key
immutable
big o
ancestors
association list
9. A classification of objects into a tree structure that groups related objects
taxonomy
well-founded ordering xml
runtime stack
null dereference
10. Values are in the most basic form and cannot be decomposed into smaller parts
node
amortized Analysis
simple data type
binary tree
11. A condition of the input data where the data will be handled by call(s) to the same program
data abstraction
leaf
filter
recursive case
12. In a tree - a node that points to a given node
dereference
parent
grammar
branching factor
13. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
circular queue
data structure
stack
linked list
14. The top node of a tree - from which all other nodes can be reached
data type
array
root
node
15. A description of operations on a data type that could have multiple possible implementations
node
abstract data type
successor
alias
16. An order of processing a tree in which the parent node is processed in between its children
fair
inorder
dereference
fifo
17. 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
null dereference
shadow
branching factor
root
18. A problem whose solution requires a linear amount of time or space if the problem is size n
data abstraction
link
linear O(n)
entinel
19. All nodes below a give node in a tree
link
circularly linked list
descendants
data structure
20. Any container with linear ordering
linked list
stack space
union
general list
21. In object oriented programming - a description of a set of similar objects
parent
garbage collection
class
intractable
22. A queue implemented within an array - where the first elements of the array logically follows the last elements
circular queue
state
successor
scope
23. A runtime error that occurs when an operation such as method call is attempted on a null pointer
null dereference
stack
branching factor
immutable
24. To combine two ordered linear structures into one
reference type
random access
merge
gedanken
25. A stack containing a stack frame of variable value for each active invocation of procedure
child
runtime stack
destructive
complex ADT
26. A linked list in which each elements has both forward and backward pointers
postorder
data structure
doubly linked list
immutable
27. Given two sets -the union is the set of elements that are members of either set
successor
abstract data type
union
class
28. 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
linked list
boxed number
complex ADT
reference type
29. Describes a data structure or device in which all accesses have the same cost - O(1)
tail recursive
garbage collection
random access
abstract data type
30. In a tree search - to move back from the node currently being examined to its parent
binary search tree (bst)
backtrack
fifo
dereference
31. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
stack
reference type
set difference
child
32. An order of processing a tree in which the parent node is processed after its children
fair
postorder
data structure
inorder
33. An order of processing a tree in which the parent node is processed before its children
data abstraction
preorder
stack frame
intersection
34. Composed of individually named data fields
procedural abstraction
set difference
destructive
simple ADT
35. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
DFS
depth
simple data type
well-founded ordering xml
36. An item (or description of items) being sough in a search
simple data type
complex data type
LIFO
goal
37. The number of links between the root of a tree and the leaves
depth
complex ADT
data abstraction
type
38. Composed of a collection of data values; implemented with a data structure
complex ADT
quadratic
grammar
class
39. A type in which variables of that type are pointers to objects. in the code integer i = 3 - the variable i holds a pointer to the integer object that contains the value. in in j = 3 - the variable j contains the value. in java - only reference types
set difference
reference
reference type
simple data type
40. A tree node containing a contents value but with no children
sort
dictionary
leaf
shadow
41. Container for storing a collection of data in unique key/value pairs
dictionary
branching factor
general list
complex ADT
42. A collection of objects that are inserted and removed according to the LIFO principle
intersection
divide and conquer
stack
ancestors
43. A section of the runtime stack holding the values of all variables for one invocation
algorithm
base case
stack frame
postorder
44. Use of a function or method without knowing how it's accomplished
successor
recursion
inorder
procedural abstraction
45. A search in which children of a node are considered before siblings are considered
intersection
depth-first search
reference type
union
46. First-child/next-sibling
fair
interior node
divide and conquer
cons
47. A case where a program calls itself
array
destructive
type
recursion
48. A given collection of values along with a collection of operations for use on those values
grammar
data type
scope
fifo
49. The process of collecting garbage for recycling
reference
garbage collection
successor
search
50. A collection of values
data structure
type
ancestors
algorithm