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. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
intractable
link
class
data structure
2. A simple case that can be solved easily - without recursion
base case
procedural abstraction
backtrack
general list
3. Use of a function or method without knowing how it's accomplished
procedural abstraction
simple ADT
fair
type
4. A classification of objects into a tree structure that groups related objects
simple data type
null dereference
grammar
taxonomy
5. A node of a tree that has children
child
link
interior node
entinel
6. Given two sets -the union is the set of elements that are members of either set
runtime stack
entinel
union
parent
7. A pattern that describes a set of similar programs
structure sharing
design pattern
null dereference
data abstraction
8. Depth first search
circular queue
root
DFS
tail recursive
9. A condition of the input data where the data will be handled by call(s) to the same program
recursive case
side-effect
depth
leaf
10. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
reference type
grammar
random access
queue
11. The next element in a linked list
destructive
binary search tree (bst)
successor
binary tree
12. The process of collecting garbage for recycling
fifo
queue
state
garbage collection
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
constructive
stack frame
link
branching factor
14. In a tree search - to move back from the node currently being examined to its parent
boxed number
linked list
backtrack
fifo
15. The top node of a tree - from which all other nodes can be reached
side-effect
root
general list
boxed number
16. In a tree - a node that points to a given node
side-effect
quadratic
cons
parent
17. An order of processing a tree in which the parent node is processed before its children
circular queue
preorder
data structure
leaf
18. The amount of space on the runtime stack required for execution of a program
stack space
type
DFS
quadratic
19. A search in which children of a node are considered before siblings are considered
depth-first search
garbage
association list
search
20. Values are in the most basic form and cannot be decomposed into smaller parts
complex data type
well-founded ordering xml
simple data type
grammar
21. A linked list in which the last element points back to the first element
gedanken
circularly linked list
binary tree
constructive
22. To convert from a pointer to the data that is pointed to
postorder
dereference
reference
procedural abstraction
23. An order of processing a tree in which the parent node is processed after its children
grammar
postorder
successor
divide and conquer
24. A problem that is so hard that it cannot be solved unless the problem is small
simple data type
scope
intractable
association list
25. Composed of multiple sequential elements stored in contiguous bytes of memory
intersection
scope
array
set difference
26. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
intersection
simple data type
well-founded ordering xml
dictionary
27. storage that is no longer pointed to by any variable and therefore can no longer be accessed
backtrack
intersection
garbage
ontology
28. A linked list in which each elements has both forward and backward pointers
pointer
binary tree
reference
doubly linked list
29. A case where tow data structures share some elements
goal
structure sharing
amortized Analysis
binary tree
30. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
random access
data structure
immutable
set difference
31. A description of operations on a data type that could have multiple possible implementations
root
object
abstract data type
data abstraction
32. In object oriented programming - a description of a set of similar objects
class
complex data type
recursive case
binary search tree (bst)
33. The area of program text over which a variable can be referenced
dereference
scope
node
DFS
34. A variable containing the address of other data
random access
recursive case
search
pointer
35. An extra record at the start or end of a data structure such as a linked list - to simplify processing
algorithm
entinel
complex data type
successor
36. Given two sets - the intersection is the set of elements that are members of both sets
branching factor
state
intersection
stack
37. Describes a though experiment or view of an entity
recursive case
gedanken
parent
descendants
38. Any container with linear ordering
operator
shadow
preorder
general list
39. 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
boxed number
object
array
alias
40. In a tree - the union of a node's parent and the parent's ancestors
ancestors
queue
garbage
pointer
41. Describes a data structure or device in which all accesses have the same cost - O(1)
child
random access
scope
doubly linked list
42. A pointer to data
fifo
divide and conquer
set difference
reference
43. Composed of individually named data fields
tail recursive
dereference
simple ADT
garbage
44. A contiguous block of memory containing elements of the same type - accessed by numeric index
search
leaf
array
intractable
45. A given collection of values along with a collection of operations for use on those values
reference type
fair
shadow
data type
46. Composed of a collection of data values; implemented with a data structure
node
tail recursive
complex ADT
recursive case
47. An item (or description of items) being sough in a search
sort
goal
leaf
intractable
48. A sequence of records - where each record contains a link to the next one
linked list
complex ADT
taxonomy
goal
49. A list of pairs - where each pair has a key and a value associated with the key
LIFO
association list
linear O(n)
filter
50. First-child/next-sibling
intersection
algorithm
linked list
fair