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 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
tail recursive
scope
recursive case
2. A contiguous block of memory containing elements of the same type - accessed by numeric index
boxed number
array
design pattern
queue
3. 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
binary search tree (bst)
LIFO
depth-first search
4. Describes a function that modifies its arguments
algorithm
circular queue
destructive
filter
5. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
structure sharing
big o
well-founded ordering xml
array
6. An item (or description of items) being sough in a search
goal
grammar
boxed number
postorder
7. To hide similar items with the same name
inorder
shadow
class
DFS
8. All nodes below a give node in a tree
descendants
sort
null dereference
dictionary
9. Describes a data structure or device in which all accesses have the same cost - O(1)
random access
general list
filter
fifo
10. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
dictionary
scope
grammar
data structure
11. A simple case that can be solved easily - without recursion
intractable
data type
depth
base case
12. A section of the runtime stack holding the values of all variables for one invocation
destructive
fair
stack frame
circular queue
13. A linked list in which the last element points back to the first element
leaf
circularly linked list
dictionary
search
14. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
stack space
type
data structure
array
15. A problem whose solution requires a linear amount of time or space if the problem is size n
big o
linear O(n)
alias
stack
16. A pointer to the next element in a linked list
type
link
postorder
dereference
17. An order of processing a tree in which the parent node is processed after its children
circularly linked list
alias
postorder
dictionary
18. A description of operations on a data type that could have multiple possible implementations
abstract data type
general list
union
entinel
19. A given collection of values along with a collection of operations for use on those values
data type
tail recursive
set difference
pointer
20. A case where a program calls itself
side-effect
link
destructive
recursion
21. A linked list in which each elements has both forward and backward pointers
array
doubly linked list
abstract data type
type
22. Describes a function that makes a new data structure but does not modify its arguments
array
simple data type
DFS
constructive
23. Composed of individually named data fields
algorithm
simple ADT
merge
depth-first search
24. An elements of a linked list - tree - or graph - often represented by a data structure
stack
node
gedanken
simple data type
25. Separation of the properties of a data type from its implementation
state
cons
entinel
data abstraction
26. To look through a data structure until a goal object is found
queue
pointer
search
recursive case
27. In a tree - the union of a node's parent and the parent's ancestors
ancestors
state
queue
class
28. An order of processing a tree in which the parent node is processed in between its children
preorder
pointer
recursion
inorder
29. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
linear O(n)
runtime stack
quadratic
immutable
30. To convert from a pointer to the data that is pointed to
linked list
doubly linked list
dereference
abstract data type
31. Composed of a collection of data values; implemented with a data structure
stack frame
complex ADT
entinel
state
32. In a search tree - a program that changes a state into a child state e.g a move in a game
search
operator
merge
complex ADT
33. To combine two ordered linear structures into one
merge
gedanken
link
backtrack
34. 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
binary tree
array
reference
null dereference
35. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
DFS
divide and conquer
general list
binary search tree (bst)
36. A pattern that describes a set of similar programs
design pattern
sort
reference type
array
37. A case where tow data structures share some elements
association list
structure sharing
intersection
intractable
38. A pointer to data
ontology
reference
data type
type
39. The area of program text over which a variable can be referenced
runtime stack
circularly linked list
complex data type
scope
40. A problem that is so hard that it cannot be solved unless the problem is small
descendants
dictionary
intractable
sort
41. Values are in the most basic form and cannot be decomposed into smaller parts
simple data type
alias
simple ADT
intersection
42. In a tree - a node that points to a given node
parent
depth-first search
node
reference type
43. Given two sets -the union is the set of elements that are members of either set
abstract data type
structure sharing
search
union
44. In a tree - a node pointed to by a parent node
binary search tree (bst)
child
DFS
design pattern
45. In a tree search - to move back from the node currently being examined to its parent
link
design pattern
base case
backtrack
46. A condition of the input data where the data will be handled by call(s) to the same program
big o
null dereference
recursive case
design pattern
47. Container for storing a collection of data in unique key/value pairs
state
entinel
dictionary
leaf
48. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
search
set difference
cons
union
49. A collection of values
type
set difference
fair
complex ADT
50. A data structure that can be identified at runtime as being a member of a class
union
preorder
queue
object