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. Composed of multiple sequential elements stored in contiguous bytes of memory
divide and conquer
cons
array
stack space
2. A problem whose solution requires a linear amount of time or space if the problem is size n
linear O(n)
descendants
recursion
depth-first search
3. 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
design pattern
big o
array
alias
4. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
recursive case
null dereference
array
quadratic
5. To look through a data structure until a goal object is found
garbage collection
fair
garbage
search
6. storage that is no longer pointed to by any variable and therefore can no longer be accessed
data type
random access
fair
garbage
7. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
interior node
sort
divide and conquer
destructive
8. Given two sets - the intersection is the set of elements that are members of both sets
search
link
intersection
interior node
9. 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
depth
immutable
postorder
10. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
grammar
association list
algorithm
well-founded ordering xml
11. A linked list in which each elements has both forward and backward pointers
doubly linked list
filter
fifo
well-founded ordering xml
12. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
ontology
linear O(n)
successor
inorder
13. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
association list
backtrack
amortized Analysis
side-effect
14. The next element in a linked list
tail recursive
entinel
stack
successor
15. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
type
stack
structure sharing
well-founded ordering xml
16. Given two sets -the union is the set of elements that are members of either set
fair
simple data type
union
operator
17. 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
linked list
binary tree
interior node
taxonomy
18. A problem that is so hard that it cannot be solved unless the problem is small
LIFO
intractable
operator
child
19. Describes a function that makes a new data structure but does not modify its arguments
data type
depth
constructive
class
20. An item (or description of items) being sough in a search
state
goal
ancestors
doubly linked list
21. A pointer to data
doubly linked list
reference
linear O(n)
divide and conquer
22. To hide similar items with the same name
binary tree
shadow
child
ancestors
23. A pointer to the next element in a linked list
leaf
fair
pointer
link
24. A description of operations on a data type that could have multiple possible implementations
successor
garbage
circular queue
abstract data type
25. In a tree search - to move back from the node currently being examined to its parent
depth
ontology
backtrack
intersection
26. The area of program text over which a variable can be referenced
parent
stack
scope
ancestors
27. Two variables that reference the same object
alias
intersection
simple data type
binary search tree (bst)
28. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
procedural abstraction
successor
depth-first search
grammar
29. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
search
intersection
data structure
ontology
30. A tree node containing a contents value but with no children
state
leaf
immutable
array
31. In a search tree - a program that changes a state into a child state e.g a move in a game
ontology
intersection
successor
operator
32. A simple case that can be solved easily - without recursion
binary search tree (bst)
backtrack
base case
set difference
33. In a tree - a node that points to a given node
amortized Analysis
parent
set difference
intractable
34. A data structure that can be identified at runtime as being a member of a class
union
object
algorithm
random access
35. Use of a function or method without knowing how it's accomplished
procedural abstraction
constructive
shadow
gedanken
36. First-child/next-sibling
data abstraction
fifo
set difference
fair
37. A description of the state of a process such as a board game
state
procedural abstraction
taxonomy
constructive
38. Separation of the properties of a data type from its implementation
garbage
data abstraction
leaf
well-founded ordering xml
39. An elements of a linked list - tree - or graph - often represented by a data structure
data type
abstract data type
stack space
node
40. A process that removes unwanted elements from a collection
filter
ancestors
general list
dereference
41. Last in first out: describes the order of a stack
entinel
LIFO
garbage
stack frame
42. An extra record at the start or end of a data structure such as a linked list - to simplify processing
entinel
operator
backtrack
circular queue
43. A node of a tree that has children
intractable
garbage
stack
interior node
44. A collection of objects that are inserted and removed according to the LIFO principle
stack
set difference
ancestors
simple data type
45. Describes a data structure or device in which all accesses have the same cost - O(1)
intersection
merge
reference type
random access
46. To combine two ordered linear structures into one
linked list
operator
boxed number
merge
47. 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?"
simple ADT
algorithm
amortized Analysis
filter
48. To convert from a pointer to the data that is pointed to
dereference
union
parent
data structure
49. A variable containing the address of other data
algorithm
inorder
sort
pointer
50. A section of the runtime stack holding the values of all variables for one invocation
complex data type
scope
stack frame
object