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. An item (or description of items) being sough in a search
alias
intractable
goal
link
2. 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
constructive
taxonomy
filter
binary tree
3. A case where tow data structures share some elements
structure sharing
search
union
child
4. A description of the state of a process such as a board game
backtrack
state
complex ADT
recursive case
5. 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?"
taxonomy
preorder
amortized Analysis
pointer
6. Composed of a collection of data values; implemented with a data structure
state
complex ADT
leaf
link
7. To look through a data structure until a goal object is found
merge
ontology
shadow
search
8. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
dereference
postorder
complex ADT
data structure
9. 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
binary tree
LIFO
backtrack
cons
10. The amount of space on the runtime stack required for execution of a program
binary tree
filter
stack space
alias
11. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
intersection
leaf
circularly linked list
tail recursive
12. A node of a tree that has children
object
interior node
operator
ontology
13. Describes a function that makes a new data structure but does not modify its arguments
data structure
constructive
child
doubly linked list
14. 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
intractable
stack space
circularly linked list
binary search tree (bst)
15. A sequence of records - where each record contains a link to the next one
postorder
binary search tree (bst)
linked list
union
16. A collection of values
binary search tree (bst)
queue
base case
type
17. In a tree - a node pointed to by a parent node
base case
binary tree
circularly linked list
child
18. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
algorithm
inorder
DFS
reference type
19. A case where a program calls itself
array
amortized Analysis
simple data type
recursion
20. Constructed of multiple components (simple or complex types)
complex data type
preorder
design pattern
constructive
21. Composed of multiple sequential elements stored in contiguous bytes of memory
filter
array
dictionary
procedural abstraction
22. Describes a data structure or device in which all accesses have the same cost - O(1)
link
inorder
random access
big o
23. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
procedural abstraction
side-effect
successor
null dereference
24. Container for storing a collection of data in unique key/value pairs
parent
procedural abstraction
dictionary
interior node
25. A condition of the input data where the data will be handled by call(s) to the same program
successor
recursive case
abstract data type
link
26. An order of processing a tree in which the parent node is processed before its children
preorder
type
taxonomy
boxed number
27. Use of a function or method without knowing how it's accomplished
quadratic
procedural abstraction
alias
data abstraction
28. A problem that is so hard that it cannot be solved unless the problem is small
type
goal
intractable
association list
29. A classification of objects into a tree structure that groups related objects
entinel
pointer
taxonomy
merge
30. Values are in the most basic form and cannot be decomposed into smaller parts
depth-first search
association list
procedural abstraction
simple data type
31. All nodes below a give node in a tree
object
data structure
descendants
union
32. 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
stack space
branching factor
general list
reference
33. Depth first search
garbage collection
DFS
taxonomy
tail recursive
34. A pattern that describes a set of similar programs
goal
algorithm
design pattern
LIFO
35. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
boxed number
null dereference
amortized Analysis
ontology
36. storage that is no longer pointed to by any variable and therefore can no longer be accessed
garbage
alias
descendants
procedural abstraction
37. Any container with linear ordering
reference
general list
tail recursive
quadratic
38. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
reference
shadow
search
immutable
39. The top node of a tree - from which all other nodes can be reached
root
constructive
child
merge
40. A pointer to the next element in a linked list
interior node
fifo
link
procedural abstraction
41. The number of links between the root of a tree and the leaves
stack frame
association list
depth
fair
42. A data structure that can be identified at runtime as being a member of a class
link
inorder
taxonomy
object
43. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
quadratic
inorder
union
search
44. A contiguous block of memory containing elements of the same type - accessed by numeric index
shadow
array
root
quadratic
45. A pointer to data
entinel
reference
circular queue
well-founded ordering xml
46. Two variables that reference the same object
alias
ontology
operator
algorithm
47. A simple case that can be solved easily - without recursion
circular queue
base case
scope
union
48. Given two sets -the union is the set of elements that are members of either set
union
reference type
array
backtrack
49. In a tree - the union of a node's parent and the parent's ancestors
depth
abstract data type
destructive
ancestors
50. 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
binary search tree (bst)
structure sharing
boxed number
object