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 case where a program calls itself
random access
divide and conquer
algorithm
recursion
2. An order of processing a tree in which the parent node is processed before its children
binary tree
filter
set difference
preorder
3. An order of processing a tree in which the parent node is processed after its children
successor
circularly linked list
depth-first search
postorder
4. 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
state
intersection
reference type
leaf
5. A description of operations on a data type that could have multiple possible implementations
descendants
grammar
fair
abstract data type
6. A collection of objects that are inserted and removed according to the LIFO principle
data type
stack
pointer
preorder
7. First-child/next-sibling
fair
side-effect
garbage
recursion
8. The area of program text over which a variable can be referenced
intractable
base case
recursion
scope
9. A classification of objects into a tree structure that groups related objects
taxonomy
doubly linked list
depth-first search
amortized Analysis
10. Use of a function or method without knowing how it's accomplished
child
LIFO
procedural abstraction
recursive case
11. The top node of a tree - from which all other nodes can be reached
garbage
root
DFS
well-founded ordering xml
12. In a tree - the union of a node's parent and the parent's ancestors
tail recursive
data type
taxonomy
ancestors
13. A contiguous block of memory containing elements of the same type - accessed by numeric index
abstract data type
node
array
alias
14. An order of processing a tree in which the parent node is processed in between its children
stack space
doubly linked list
inorder
depth
15. In object oriented programming - a description of a set of similar objects
class
link
reference
procedural abstraction
16. A search in which children of a node are considered before siblings are considered
depth-first search
taxonomy
inorder
data abstraction
17. In a tree - a node pointed to by a parent node
constructive
child
array
null dereference
18. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
algorithm
tail recursive
general list
association list
19. Describes a though experiment or view of an entity
gedanken
shadow
child
destructive
20. A pointer to the next element in a linked list
link
inorder
array
search
21. A runtime error that occurs when an operation such as method call is attempted on a null pointer
linear O(n)
null dereference
gedanken
quadratic
22. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
ontology
garbage
general list
cons
23. A linked list in which the last element points back to the first element
type
garbage
circularly linked list
ontology
24. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
scope
side-effect
union
garbage collection
25. A problem that is so hard that it cannot be solved unless the problem is small
destructive
null dereference
intractable
entinel
26. Last in first out: describes the order of a stack
LIFO
garbage collection
depth-first search
pointer
27. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
pointer
operator
set difference
class
28. An extra record at the start or end of a data structure such as a linked list - to simplify processing
amortized Analysis
entinel
design pattern
circularly linked list
29. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
queue
data structure
shadow
operator
30. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
circularly linked list
class
procedural abstraction
queue
31. Any container with linear ordering
complex data type
constructive
general list
filter
32. All nodes below a give node in a tree
null dereference
descendants
scope
node
33. First in first out: describes ordering of a queue
fifo
array
design pattern
tail recursive
34. Given two sets - the intersection is the set of elements that are members of both sets
linear O(n)
recursive case
intersection
well-founded ordering xml
35. storage that is no longer pointed to by any variable and therefore can no longer be accessed
garbage
successor
stack
circular queue
36. The number of links between the root of a tree and the leaves
ancestors
doubly linked list
depth
shadow
37. A given collection of values along with a collection of operations for use on those values
ancestors
data type
alias
fifo
38. To convert from a pointer to the data that is pointed to
procedural abstraction
merge
reference
dereference
39. Depth first search
node
immutable
union
DFS
40. To hide similar items with the same name
shadow
big o
state
general list
41. A condition of the input data where the data will be handled by call(s) to the same program
recursive case
side-effect
data structure
fifo
42. A sequence of records - where each record contains a link to the next one
association list
node
linked list
class
43. To combine two ordered linear structures into one
search
merge
sort
leaf
44. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
divide and conquer
circular queue
gedanken
array
45. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
garbage collection
big o
grammar
array
46. A pointer to data
data type
data structure
reference
object
47. A collection of values
type
union
array
stack
48. In a tree search - to move back from the node currently being examined to its parent
goal
amortized Analysis
node
backtrack
49. A case where tow data structures share some elements
LIFO
structure sharing
design pattern
goal
50. The process of collecting garbage for recycling
operator
LIFO
doubly linked list
garbage collection