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. To combine two ordered linear structures into one
destructive
design pattern
merge
descendants
2. An item (or description of items) being sough in a search
amortized Analysis
object
entinel
goal
3. Composed of multiple sequential elements stored in contiguous bytes of memory
amortized Analysis
random access
algorithm
array
4. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
data structure
null dereference
merge
recursion
5. A data structure that can be identified at runtime as being a member of a class
doubly linked list
object
leaf
node
6. Any container with linear ordering
general list
cons
recursion
reference type
7. 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
big o
stack frame
data structure
operator
8. In a tree - a node that points to a given node
parent
binary search tree (bst)
gedanken
leaf
9. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
intersection
queue
intractable
stack space
10. A linked list in which each elements has both forward and backward pointers
merge
immutable
search
doubly linked list
11. The number of links between the root of a tree and the leaves
linear O(n)
grammar
data abstraction
depth
12. An extra record at the start or end of a data structure such as a linked list - to simplify processing
preorder
random access
entinel
binary tree
13. 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
stack
procedural abstraction
dereference
14. A description of the state of a process such as a board game
recursive case
stack space
state
linked list
15. A runtime error that occurs when an operation such as method call is attempted on a null pointer
filter
LIFO
null dereference
child
16. A queue implemented within an array - where the first elements of the array logically follows the last elements
operator
tail recursive
circular queue
general list
17. A process that removes unwanted elements from a collection
data abstraction
filter
data structure
depth-first search
18. A contiguous block of memory containing elements of the same type - accessed by numeric index
backtrack
array
LIFO
null dereference
19. 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
stack
linked list
filter
binary tree
20. Depth first search
inorder
node
DFS
state
21. An elements of a linked list - tree - or graph - often represented by a data structure
node
fifo
stack space
abstract data type
22. To hide similar items with the same name
descendants
root
general list
shadow
23. A problem that is so hard that it cannot be solved unless the problem is small
circularly linked list
interior node
goal
intractable
24. In a tree - a node pointed to by a parent node
dictionary
destructive
class
child
25. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
immutable
entinel
alias
cons
26. An order of processing a tree in which the parent node is processed in between its children
immutable
linear O(n)
object
inorder
27. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
operator
scope
linked list
side-effect
28. A node of a tree that has children
successor
interior node
state
node
29. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
algorithm
reference type
fifo
stack
30. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
ontology
reference
fifo
procedural abstraction
31. A linked list in which the last element points back to the first element
type
amortized Analysis
structure sharing
circularly linked list
32. A section of the runtime stack holding the values of all variables for one invocation
stack frame
goal
structure sharing
entinel
33. Values are in the most basic form and cannot be decomposed into smaller parts
dictionary
interior node
simple data type
union
34. First in first out: describes ordering of a queue
postorder
parent
fifo
child
35. A problem whose solution requires a linear amount of time or space if the problem is size n
linear O(n)
interior node
procedural abstraction
reference
36. The top node of a tree - from which all other nodes can be reached
root
node
data type
successor
37. A stack containing a stack frame of variable value for each active invocation of procedure
amortized Analysis
merge
shadow
runtime stack
38. 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
simple ADT
branching factor
big o
stack frame
39. A pattern that describes a set of similar programs
design pattern
successor
stack frame
procedural abstraction
40. A search in which children of a node are considered before siblings are considered
object
depth-first search
design pattern
reference
41. In a tree - the union of a node's parent and the parent's ancestors
merge
ancestors
constructive
search
42. The process of collecting garbage for recycling
runtime stack
pointer
garbage collection
procedural abstraction
43. An order of processing a tree in which the parent node is processed before its children
side-effect
preorder
parent
object
44. Container for storing a collection of data in unique key/value pairs
linear O(n)
dictionary
runtime stack
interior node
45. Use of a function or method without knowing how it's accomplished
random access
descendants
taxonomy
procedural abstraction
46. A description of operations on a data type that could have multiple possible implementations
fair
child
abstract data type
entinel
47. A simple case that can be solved easily - without recursion
well-founded ordering xml
fair
DFS
base case
48. Constructed of multiple components (simple or complex types)
LIFO
complex data type
DFS
fifo
49. To look through a data structure until a goal object is found
search
stack frame
tail recursive
preorder
50. 1. In lisp - the function that constructs a pair of points - or basic elements of list structure. 2. To make a cons data structure 2. a cons data structure
entinel
linear O(n)
cons
reference