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 variable containing the address of other data
tail recursive
pointer
depth-first search
runtime stack
2. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
ontology
grammar
preorder
binary tree
3. An elements of a linked list - tree - or graph - often represented by a data structure
cons
array
node
reference type
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
reference type
node
grammar
null dereference
5. A list of pairs - where each pair has a key and a value associated with the key
node
type
association list
object
6. All nodes below a give node in a tree
doubly linked list
fifo
quadratic
descendants
7. A pattern that describes a set of similar programs
child
state
descendants
design pattern
8. First in first out: describes ordering of a queue
backtrack
LIFO
node
fifo
9. In a search tree - a program that changes a state into a child state e.g a move in a game
operator
state
entinel
stack space
10. A linked list in which the last element points back to the first element
taxonomy
algorithm
circularly linked list
dereference
11. In a tree - the union of a node's parent and the parent's ancestors
LIFO
ancestors
state
inorder
12. 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
base case
set difference
linear O(n)
13. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
backtrack
sort
successor
entinel
14. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
algorithm
grammar
set difference
pointer
15. The number of links between the root of a tree and the leaves
depth
alias
binary tree
taxonomy
16. Separation of the properties of a data type from its implementation
structure sharing
garbage
data abstraction
boxed number
17. Last in first out: describes the order of a stack
data abstraction
LIFO
amortized Analysis
complex ADT
18. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
tail recursive
queue
postorder
depth-first search
19. A contiguous block of memory containing elements of the same type - accessed by numeric index
operator
node
shadow
array
20. Use of a function or method without knowing how it's accomplished
recursion
data type
merge
procedural abstraction
21. The process of collecting garbage for recycling
garbage collection
goal
search
shadow
22. A node of a tree that has children
intersection
array
interior node
complex ADT
23. Composed of individually named data fields
algorithm
simple ADT
reference type
garbage
24. A search in which children of a node are considered before siblings are considered
depth-first search
fair
reference type
reference
25. An order of processing a tree in which the parent node is processed before its children
stack
goal
preorder
procedural abstraction
26. A data structure that can be identified at runtime as being a member of a class
type
null dereference
tail recursive
object
27. A simple case that can be solved easily - without recursion
pointer
association list
boxed number
base case
28. Given two sets -the union is the set of elements that are members of either set
side-effect
garbage collection
union
set difference
29. A section of the runtime stack holding the values of all variables for one invocation
stack frame
abstract data type
reference
filter
30. A description of the state of a process such as a board game
abstract data type
depth
operator
state
31. Given two sets - the intersection is the set of elements that are members of both sets
DFS
branching factor
link
intersection
32. 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
grammar
destructive
big o
pointer
33. A pointer to the next element in a linked list
association list
data structure
link
state
34. An order of processing a tree in which the parent node is processed after its children
array
dereference
stack
postorder
35. Composed of multiple sequential elements stored in contiguous bytes of memory
array
null dereference
quadratic
circular queue
36. Describes a though experiment or view of an entity
gedanken
immutable
procedural abstraction
association list
37. Any container with linear ordering
procedural abstraction
linked list
general list
well-founded ordering xml
38. Describes a function that makes a new data structure but does not modify its arguments
constructive
node
link
tail recursive
39. A stack containing a stack frame of variable value for each active invocation of procedure
runtime stack
big o
constructive
set difference
40. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
fair
scope
side-effect
operator
41. An extra record at the start or end of a data structure such as a linked list - to simplify processing
design pattern
doubly linked list
stack
entinel
42. An item (or description of items) being sough in a search
ancestors
garbage
goal
runtime stack
43. In a tree - a node pointed to by a parent node
boxed number
garbage collection
child
depth-first search
44. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
binary search tree (bst)
stack frame
child
immutable
45. First-child/next-sibling
link
type
fair
random access
46. Values are in the most basic form and cannot be decomposed into smaller parts
boxed number
union
simple data type
ontology
47. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
data structure
root
recursion
array
48. storage that is no longer pointed to by any variable and therefore can no longer be accessed
dereference
grammar
abstract data type
garbage
49. A tree node containing a contents value but with no children
garbage collection
data type
association list
leaf
50. A collection of objects that are inserted and removed according to the LIFO principle
divide and conquer
operator
gedanken
stack