SUBJECTS
|
BROWSE
|
CAREER CENTER
|
POPULAR
|
JOIN
|
LOGIN
Business Skills
|
Soft Skills
|
Basic Literacy
|
Certifications
About
|
Help
|
Privacy
|
Terms
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. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
pointer
immutable
association list
interior node
2. storage that is no longer pointed to by any variable and therefore can no longer be accessed
ancestors
immutable
sort
garbage
3. Depth first search
stack space
complex ADT
DFS
procedural abstraction
4. Describes a data structure or device in which all accesses have the same cost - O(1)
association list
parent
big o
random access
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?"
data structure
amortized Analysis
design pattern
operator
6. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
structure sharing
root
amortized Analysis
algorithm
7. In a tree - a node that points to a given node
postorder
grammar
parent
simple ADT
8. In a tree - a node pointed to by a parent node
constructive
type
child
fair
9. The next element in a linked list
successor
recursion
side-effect
depth-first search
10. The amount of space on the runtime stack required for execution of a program
recursion
class
data abstraction
stack space
11. A given collection of values along with a collection of operations for use on those values
data type
scope
garbage
binary tree
12. Describes a function that modifies its arguments
destructive
stack frame
set difference
boxed number
13. A collection of values
base case
fair
type
recursive case
14. A pointer to the next element in a linked list
link
child
general list
depth-first search
15. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
side-effect
tail recursive
class
stack frame
16. Given two sets -the union is the set of elements that are members of either set
taxonomy
stack frame
node
union
17. The top node of a tree - from which all other nodes can be reached
root
pointer
abstract data type
state
18. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
data structure
alias
data type
depth-first search
19. A linked list in which the last element points back to the first element
circularly linked list
general list
stack space
postorder
20. Values are in the most basic form and cannot be decomposed into smaller parts
depth-first search
simple data type
link
runtime stack
21. A search in which children of a node are considered before siblings are considered
depth-first search
recursion
linked list
stack frame
22. 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
well-founded ordering xml
big o
leaf
cons
23. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
set difference
preorder
destructive
data structure
24. A node of a tree that has children
array
interior node
scope
root
25. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
sort
abstract data type
random access
grammar
26. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
shadow
divide and conquer
ancestors
reference
27. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
DFS
scope
postorder
ontology
28. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
postorder
well-founded ordering xml
data type
shadow
29. A data structure that can be identified at runtime as being a member of a class
fifo
object
random access
set difference
30. An item (or description of items) being sough in a search
goal
side-effect
shadow
branching factor
31. 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
successor
random access
branching factor
state
32. 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
reference type
successor
array
class
33. A queue implemented within an array - where the first elements of the array logically follows the last elements
structure sharing
alias
circular queue
null dereference
34. 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
amortized Analysis
set difference
data structure
35. A tree node containing a contents value but with no children
depth-first search
leaf
design pattern
class
36. In object oriented programming - a description of a set of similar objects
class
operator
runtime stack
dictionary
37. An order of processing a tree in which the parent node is processed in between its children
reference type
data type
circularly linked list
inorder
38. A description of operations on a data type that could have multiple possible implementations
algorithm
ancestors
data type
abstract data type
39. A contiguous block of memory containing elements of the same type - accessed by numeric index
reference
null dereference
preorder
array
40. Last in first out: describes the order of a stack
simple data type
backtrack
immutable
LIFO
41. A classification of objects into a tree structure that groups related objects
pointer
taxonomy
stack space
recursive case
42. A condition of the input data where the data will be handled by call(s) to the same program
merge
runtime stack
recursive case
constructive
43. Composed of individually named data fields
array
union
simple ADT
entinel
44. Use of a function or method without knowing how it's accomplished
association list
cons
linear O(n)
procedural abstraction
45. An order of processing a tree in which the parent node is processed before its children
circular queue
preorder
binary tree
shadow
46. To hide similar items with the same name
queue
simple ADT
amortized Analysis
shadow
47. To combine two ordered linear structures into one
merge
filter
boxed number
stack frame
48. A stack containing a stack frame of variable value for each active invocation of procedure
design pattern
runtime stack
entinel
linear O(n)
49. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
tail recursive
child
filter
sort
50. An order of processing a tree in which the parent node is processed after its children
postorder
procedural abstraction
goal
random access