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. Given two sets -the union is the set of elements that are members of either set
pointer
depth-first search
root
union
2. In a tree - a node pointed to by a parent node
set difference
quadratic
general list
child
3. In object oriented programming - a description of a set of similar objects
array
taxonomy
class
merge
4. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
stack frame
data structure
algorithm
association list
5. To convert from a pointer to the data that is pointed to
array
dereference
binary search tree (bst)
LIFO
6. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
successor
quadratic
grammar
root
7. Use of a function or method without knowing how it's accomplished
goal
procedural abstraction
null dereference
interior node
8. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
state
type
set difference
grammar
9. An elements of a linked list - tree - or graph - often represented by a data structure
node
divide and conquer
successor
fifo
10. 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?"
amortized Analysis
linked list
scope
data structure
11. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
garbage
state
queue
filter
12. A data structure that can be identified at runtime as being a member of a class
object
divide and conquer
DFS
structure sharing
13. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
backtrack
type
divide and conquer
link
14. 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
operator
big o
intersection
alias
15. Last in first out: describes the order of a stack
reference type
LIFO
queue
data structure
16. A problem that is so hard that it cannot be solved unless the problem is small
side-effect
child
intractable
recursive case
17. A search in which children of a node are considered before siblings are considered
depth-first search
random access
fair
dereference
18. The number of links between the root of a tree and the leaves
backtrack
depth
recursive case
ancestors
19. A problem whose solution requires a linear amount of time or space if the problem is size n
linear O(n)
random access
divide and conquer
class
20. A linked list in which the last element points back to the first element
circularly linked list
binary search tree (bst)
node
cons
21. A variable containing the address of other data
pointer
alias
data abstraction
depth-first search
22. A collection of values
root
type
runtime stack
merge
23. The top node of a tree - from which all other nodes can be reached
inorder
root
class
recursive case
24. Two variables that reference the same object
alias
state
base case
recursion
25. To hide similar items with the same name
class
stack
shadow
cons
26. A given collection of values along with a collection of operations for use on those values
linked list
depth-first search
data type
side-effect
27. A list of pairs - where each pair has a key and a value associated with the key
association list
circular queue
root
link
28. A case where tow data structures share some elements
structure sharing
immutable
reference type
procedural abstraction
29. 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
branching factor
association list
backtrack
tail recursive
30. The next element in a linked list
LIFO
circular queue
fifo
successor
31. A pointer to data
reference
branching factor
descendants
array
32. A condition of the input data where the data will be handled by call(s) to the same program
recursive case
complex data type
scope
side-effect
33. 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
reference
grammar
general list
binary search tree (bst)
34. Given two sets - the intersection is the set of elements that are members of both sets
node
fair
reference
intersection
35. Any container with linear ordering
simple ADT
backtrack
alias
general list
36. The process of collecting garbage for recycling
garbage collection
filter
DFS
algorithm
37. To look through a data structure until a goal object is found
fair
search
data type
intersection
38. Composed of a collection of data values; implemented with a data structure
linear O(n)
grammar
stack
complex ADT
39. A contiguous block of memory containing elements of the same type - accessed by numeric index
random access
circularly linked list
array
filter
40. Separation of the properties of a data type from its implementation
recursive case
ancestors
data abstraction
node
41. An order of processing a tree in which the parent node is processed after its children
postorder
set difference
structure sharing
root
42. A node of a tree that has children
interior node
recursion
taxonomy
leaf
43. A linked list in which each elements has both forward and backward pointers
doubly linked list
association list
pointer
runtime stack
44. An order of processing a tree in which the parent node is processed before its children
abstract data type
recursive case
reference
preorder
45. An extra record at the start or end of a data structure such as a linked list - to simplify processing
entinel
intractable
scope
design pattern
46. In a tree - the union of a node's parent and the parent's ancestors
boxed number
DFS
ancestors
union
47. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
scope
depth
immutable
abstract data type
48. An order of processing a tree in which the parent node is processed in between its children
inorder
pointer
link
runtime stack
49. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
depth
dereference
tail recursive
big o
50. A process that removes unwanted elements from a collection
filter
ontology
shadow
alias