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 collection of values
object
quadratic
type
gedanken
2. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
sort
runtime stack
intersection
interior node
3. A section of the runtime stack holding the values of all variables for one invocation
data type
stack frame
parent
array
4. In a search tree - a program that changes a state into a child state e.g a move in a game
leaf
simple ADT
operator
immutable
5. A description of the state of a process such as a board game
state
destructive
association list
postorder
6. A process that removes unwanted elements from a collection
successor
filter
algorithm
reference type
7. A queue implemented within an array - where the first elements of the array logically follows the last elements
stack
shadow
circular queue
immutable
8. A linked list in which the last element points back to the first element
stack frame
data abstraction
circularly linked list
child
9. To hide similar items with the same name
garbage
side-effect
shadow
interior node
10. Last in first out: describes the order of a stack
link
algorithm
queue
LIFO
11. The number of links between the root of a tree and the leaves
array
depth
alias
preorder
12. Composed of a collection of data values; implemented with a data structure
complex ADT
ontology
general list
garbage collection
13. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
garbage collection
gedanken
divide and conquer
algorithm
14. The area of program text over which a variable can be referenced
reference type
linear O(n)
depth
scope
15. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
pointer
postorder
tail recursive
type
16. Given two sets -the union is the set of elements that are members of either set
union
branching factor
tail recursive
fifo
17. An extra record at the start or end of a data structure such as a linked list - to simplify processing
postorder
leaf
entinel
child
18. 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
algorithm
circular queue
type
19. 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
well-founded ordering xml
dictionary
boxed number
reference type
20. Describes a though experiment or view of an entity
well-founded ordering xml
state
tail recursive
gedanken
21. First-child/next-sibling
fair
random access
circularly linked list
inorder
22. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
successor
algorithm
inorder
fifo
23. Any container with linear ordering
general list
intersection
preorder
cons
24. An item (or description of items) being sough in a search
circular queue
gedanken
side-effect
goal
25. The top node of a tree - from which all other nodes can be reached
postorder
LIFO
linear O(n)
root
26. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
immutable
structure sharing
class
recursive case
27. A sequence of records - where each record contains a link to the next one
linked list
ontology
filter
data abstraction
28. To convert from a pointer to the data that is pointed to
complex data type
dereference
circularly linked list
tail recursive
29. A data structure that can be identified at runtime as being a member of a class
circular queue
object
simple data type
abstract data type
30. Use of a function or method without knowing how it's accomplished
stack
procedural abstraction
grammar
doubly linked list
31. A collection of objects that are inserted and removed according to the LIFO principle
stack
link
binary tree
algorithm
32. Separation of the properties of a data type from its implementation
pointer
queue
data abstraction
taxonomy
33. A runtime error that occurs when an operation such as method call is attempted on a null pointer
descendants
union
simple ADT
null dereference
34. A pointer to the next element in a linked list
link
binary search tree (bst)
constructive
branching factor
35. The next element in a linked list
circular queue
depth-first search
successor
preorder
36. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
well-founded ordering xml
tail recursive
divide and conquer
recursion
37. Container for storing a collection of data in unique key/value pairs
null dereference
base case
dictionary
intersection
38. A tree node containing a contents value but with no children
intractable
recursive case
child
leaf
39. An order of processing a tree in which the parent node is processed in between its children
general list
runtime stack
inorder
interior node
40. Values are in the most basic form and cannot be decomposed into smaller parts
depth-first search
cons
dictionary
simple data type
41. 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
destructive
branching factor
circularly linked list
taxonomy
42. In object oriented programming - a description of a set of similar objects
class
sort
binary tree
boxed number
43. A given collection of values along with a collection of operations for use on those values
circularly linked list
root
state
data type
44. To look through a data structure until a goal object is found
search
complex data type
dictionary
branching factor
45. A classification of objects into a tree structure that groups related objects
taxonomy
association list
dictionary
ontology
46. 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
search
binary search tree (bst)
random access
preorder
47. Describes a function that modifies its arguments
well-founded ordering xml
circular queue
destructive
filter
48. In a tree - a node that points to a given node
linear O(n)
parent
boxed number
LIFO
49. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
intractable
fifo
queue
divide and conquer
50. First in first out: describes ordering of a queue
fifo
recursive case
amortized Analysis
class