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. A data structure that can be identified at runtime as being a member of a class
object
dictionary
garbage
boxed number
2. A process that removes unwanted elements from a collection
ontology
stack
filter
depth-first search
3. Depth first search
amortized Analysis
DFS
search
set difference
4. In a tree - the union of a node's parent and the parent's ancestors
ancestors
null dereference
filter
cons
5. A list of pairs - where each pair has a key and a value associated with the key
association list
grammar
garbage collection
object
6. 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
simple data type
side-effect
reference type
boxed number
7. A classification of objects into a tree structure that groups related objects
taxonomy
immutable
linear O(n)
gedanken
8. 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
binary search tree (bst)
depth
leaf
simple ADT
9. A problem that is so hard that it cannot be solved unless the problem is small
complex ADT
stack frame
queue
intractable
10. Describes a though experiment or view of an entity
base case
gedanken
operator
runtime stack
11. An order of processing a tree in which the parent node is processed before its children
pointer
destructive
descendants
preorder
12. Describes a function that makes a new data structure but does not modify its arguments
cons
constructive
queue
quadratic
13. Constructed of multiple components (simple or complex types)
alias
search
complex data type
tail recursive
14. A collection of values
procedural abstraction
scope
type
simple ADT
15. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
node
well-founded ordering xml
data abstraction
sort
16. A variable containing the address of other data
object
constructive
pointer
child
17. Describes a data structure or device in which all accesses have the same cost - O(1)
fair
operator
link
random access
18. A condition of the input data where the data will be handled by call(s) to the same program
reference type
tail recursive
recursive case
destructive
19. A search in which children of a node are considered before siblings are considered
depth-first search
merge
data type
amortized Analysis
20. storage that is no longer pointed to by any variable and therefore can no longer be accessed
garbage
array
fair
general list
21. A simple case that can be solved easily - without recursion
scope
null dereference
base case
stack
22. A description of operations on a data type that could have multiple possible implementations
stack frame
boxed number
abstract data type
amortized Analysis
23. First-child/next-sibling
dictionary
boxed number
random access
fair
24. 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
linear O(n)
branching factor
parent
pointer
25. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
scope
tail recursive
ontology
well-founded ordering xml
26. A pattern that describes a set of similar programs
set difference
abstract data type
design pattern
intersection
27. A pointer to the next element in a linked list
set difference
link
amortized Analysis
simple data type
28. Container for storing a collection of data in unique key/value pairs
dictionary
amortized Analysis
intersection
structure sharing
29. Two variables that reference the same object
type
dictionary
alias
array
30. A tree node containing a contents value but with no children
divide and conquer
null dereference
tail recursive
leaf
31. The next element in a linked list
successor
gedanken
parent
goal
32. Given two sets - the intersection is the set of elements that are members of both sets
intersection
simple data type
circularly linked list
abstract data type
33. 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 data type
stack frame
amortized Analysis
complex ADT
34. Composed of individually named data fields
simple ADT
dictionary
leaf
immutable
35. 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
filter
null dereference
reference type
runtime stack
36. A linked list in which the last element points back to the first element
dereference
amortized Analysis
circularly linked list
recursion
37. A case where a program calls itself
recursion
entinel
circular queue
class
38. In a tree - a node that points to a given node
algorithm
garbage collection
parent
stack
39. A node of a tree that has children
branching factor
successor
interior node
algorithm
40. The number of links between the root of a tree and the leaves
intractable
depth
stack frame
parent
41. A given collection of values along with a collection of operations for use on those values
data type
fifo
leaf
search
42. A linked list in which each elements has both forward and backward pointers
doubly linked list
goal
preorder
child
43. Use of a function or method without knowing how it's accomplished
successor
amortized Analysis
procedural abstraction
association list
44. An elements of a linked list - tree - or graph - often represented by a data structure
node
doubly linked list
ancestors
general list
45. In object oriented programming - a description of a set of similar objects
quadratic
class
linear O(n)
branching factor
46. Last in first out: describes the order of a stack
abstract data type
parent
quadratic
LIFO
47. A stack containing a stack frame of variable value for each active invocation of procedure
runtime stack
complex data type
random access
child
48. In a tree search - to move back from the node currently being examined to its parent
stack space
backtrack
ontology
union
49. A case where tow data structures share some elements
entinel
grammar
child
structure sharing
50. Composed of a collection of data values; implemented with a data structure
union
complex ADT
sort
branching factor