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 formal description of a language in terms of vocabulary and rules for writing phrases and sentences
complex data type
state
algorithm
grammar
2. An item (or description of items) being sough in a search
immutable
stack frame
null dereference
goal
3. 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
reference
boxed number
interior node
reference type
4. 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
ontology
stack frame
garbage
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?"
amortized Analysis
successor
stack space
boxed number
6. An extra record at the start or end of a data structure such as a linked list - to simplify processing
leaf
entinel
pointer
boxed number
7. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
shadow
gedanken
quadratic
binary tree
8. A condition of the input data where the data will be handled by call(s) to the same program
simple data type
recursive case
base case
linked list
9. A search in which children of a node are considered before siblings are considered
big o
structure sharing
fair
depth-first search
10. A node of a tree that has children
filter
sort
pointer
interior node
11. An order of processing a tree in which the parent node is processed after its children
child
leaf
postorder
quadratic
12. Given two sets - the intersection is the set of elements that are members of both sets
base case
intersection
root
gedanken
13. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
immutable
stack space
simple data type
side-effect
14. Container for storing a collection of data in unique key/value pairs
class
dictionary
big o
amortized Analysis
15. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
tail recursive
recursive case
scope
data abstraction
16. Last in first out: describes the order of a stack
scope
destructive
parent
LIFO
17. A runtime error that occurs when an operation such as method call is attempted on a null pointer
big o
taxonomy
null dereference
shadow
18. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
array
array
alias
algorithm
19. A case where a program calls itself
array
node
successor
recursion
20. A queue implemented within an array - where the first elements of the array logically follows the last elements
binary search tree (bst)
object
interior node
circular queue
21. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
sort
goal
state
algorithm
22. Describes a function that modifies its arguments
set difference
destructive
tail recursive
dereference
23. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
abstract data type
ancestors
set difference
simple data type
24. All nodes below a give node in a tree
intractable
descendants
null dereference
search
25. A linked list in which each elements has both forward and backward pointers
doubly linked list
constructive
array
stack space
26. A simple case that can be solved easily - without recursion
descendants
base case
binary search tree (bst)
node
27. 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)
node
linear O(n)
intractable
28. To convert from a pointer to the data that is pointed to
scope
filter
linked list
dereference
29. In a search tree - a program that changes a state into a child state e.g a move in a game
constructive
entinel
boxed number
operator
30. A stack containing a stack frame of variable value for each active invocation of procedure
type
preorder
runtime stack
object
31. A list of pairs - where each pair has a key and a value associated with the key
association list
dictionary
random access
pointer
32. Any container with linear ordering
binary search tree (bst)
preorder
general list
complex data type
33. The top node of a tree - from which all other nodes can be reached
sort
root
recursive case
random access
34. A description of the state of a process such as a board game
state
union
ancestors
data type
35. To hide similar items with the same name
array
shadow
queue
preorder
36. A contiguous block of memory containing elements of the same type - accessed by numeric index
goal
entinel
array
inorder
37. 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
dictionary
destructive
algorithm
big o
38. A collection of values
union
filter
dictionary
type
39. 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
cons
circularly linked list
branching factor
40. The amount of space on the runtime stack required for execution of a program
stack space
sort
circular queue
intractable
41. First in first out: describes ordering of a queue
set difference
big o
postorder
fifo
42. storage that is no longer pointed to by any variable and therefore can no longer be accessed
complex ADT
node
tail recursive
garbage
43. Describes a data structure or device in which all accesses have the same cost - O(1)
random access
stack
complex data type
abstract data type
44. An order of processing a tree in which the parent node is processed in between its children
dereference
linear O(n)
recursive case
inorder
45. In object oriented programming - a description of a set of similar objects
recursion
null dereference
type
class
46. A problem whose solution requires a linear amount of time or space if the problem is size n
linear O(n)
fifo
type
queue
47. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
ontology
union
preorder
tail recursive
48. Composed of a collection of data values; implemented with a data structure
complex ADT
DFS
dereference
union
49. A sequence of records - where each record contains a link to the next one
linked list
parent
amortized Analysis
simple ADT
50. A pointer to data
depth
set difference
reference
immutable