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. An extra record at the start or end of a data structure such as a linked list - to simplify processing
merge
tail recursive
entinel
array
2. 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
complex data type
binary tree
runtime stack
3. The number of links between the root of a tree and the leaves
shadow
simple ADT
complex data type
depth
4. A description of operations on a data type that could have multiple possible implementations
abstract data type
amortized Analysis
big o
postorder
5. A simple case that can be solved easily - without recursion
base case
complex data type
class
gedanken
6. Composed of individually named data fields
intractable
simple ADT
stack frame
circular queue
7. Separation of the properties of a data type from its implementation
interior node
circularly linked list
data abstraction
successor
8. A case where a program calls itself
garbage collection
recursion
shadow
pointer
9. 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
ontology
random access
preorder
10. A pointer to the next element in a linked list
link
depth-first search
abstract data type
recursion
11. Last in first out: describes the order of a stack
LIFO
reference type
general list
interior node
12. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
stack frame
immutable
circularly linked list
queue
13. 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
branching factor
data abstraction
inorder
dereference
14. Composed of a collection of data values; implemented with a data structure
complex ADT
taxonomy
binary search tree (bst)
branching factor
15. An item (or description of items) being sough in a search
array
goal
interior node
shadow
16. A data structure that can be identified at runtime as being a member of a class
object
binary tree
general list
array
17. An order of processing a tree in which the parent node is processed before its children
preorder
inorder
cons
leaf
18. The amount of space on the runtime stack required for execution of a program
stack space
structure sharing
parent
cons
19. A linked list in which each elements has both forward and backward pointers
doubly linked list
fifo
stack
garbage collection
20. A pointer to data
abstract data type
data type
reference
DFS
21. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
divide and conquer
leaf
linear O(n)
preorder
22. In a tree - the union of a node's parent and the parent's ancestors
queue
ancestors
fair
depth
23. Constructed of multiple components (simple or complex types)
ancestors
data structure
fifo
complex data type
24. A given collection of values along with a collection of operations for use on those values
quadratic
data type
ontology
shadow
25. Given two sets - the intersection is the set of elements that are members of both sets
null dereference
random access
intersection
procedural abstraction
26. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
depth
structure sharing
queue
complex ADT
27. A problem that is so hard that it cannot be solved unless the problem is small
doubly linked list
array
runtime stack
intractable
28. First-child/next-sibling
association list
simple ADT
fair
complex ADT
29. A search in which children of a node are considered before siblings are considered
inorder
depth-first search
dereference
linear O(n)
30. 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
ontology
state
class
cons
31. An order of processing a tree in which the parent node is processed in between its children
filter
class
inorder
destructive
32. To look through a data structure until a goal object is found
filter
amortized Analysis
search
tail recursive
33. A classification of objects into a tree structure that groups related objects
taxonomy
entinel
link
ancestors
34. A list of pairs - where each pair has a key and a value associated with the key
runtime stack
procedural abstraction
data structure
association list
35. A runtime error that occurs when an operation such as method call is attempted on a null pointer
DFS
null dereference
circularly linked list
array
36. A section of the runtime stack holding the values of all variables for one invocation
complex data type
stack
stack frame
simple data type
37. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
recursive case
state
null dereference
grammar
38. The next element in a linked list
random access
search
successor
alias
39. A contiguous block of memory containing elements of the same type - accessed by numeric index
array
general list
doubly linked list
scope
40. The process of collecting garbage for recycling
leaf
garbage collection
depth-first search
fair
41. First in first out: describes ordering of a queue
data abstraction
recursion
fifo
node
42. A linked list in which the last element points back to the first element
alias
circularly linked list
merge
link
43. In a tree - a node pointed to by a parent node
LIFO
abstract data type
DFS
child
44. A collection of objects that are inserted and removed according to the LIFO principle
big o
association list
abstract data type
stack
45. storage that is no longer pointed to by any variable and therefore can no longer be accessed
data abstraction
postorder
garbage
search
46. In a tree search - to move back from the node currently being examined to its parent
reference
operator
ontology
backtrack
47. Describes a function that makes a new data structure but does not modify its arguments
complex ADT
descendants
side-effect
constructive
48. Describes a function that modifies its arguments
linked list
object
garbage
destructive
49. A problem whose solution requires a linear amount of time or space if the problem is size n
union
algorithm
pointer
linear O(n)
50. A case where tow data structures share some elements
recursive case
structure sharing
reference
gedanken