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. In object oriented programming - a description of a set of similar objects
backtrack
stack space
class
structure sharing
2. A sequence of records - where each record contains a link to the next one
array
linked list
taxonomy
base case
3. Composed of individually named data fields
structure sharing
shadow
simple ADT
stack frame
4. A node of a tree that has children
destructive
node
interior node
constructive
5. An extra record at the start or end of a data structure such as a linked list - to simplify processing
ancestors
entinel
operator
recursive case
6. Composed of multiple sequential elements stored in contiguous bytes of memory
search
interior node
array
base case
7. storage that is no longer pointed to by any variable and therefore can no longer be accessed
garbage
general list
stack frame
leaf
8. 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
design pattern
scope
simple ADT
reference type
9. 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
data abstraction
queue
array
10. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
class
algorithm
ancestors
preorder
11. A problem that is so hard that it cannot be solved unless the problem is small
side-effect
ontology
child
intractable
12. A search in which children of a node are considered before siblings are considered
goal
binary tree
data abstraction
depth-first search
13. An order of processing a tree in which the parent node is processed in between its children
interior node
node
taxonomy
inorder
14. In a tree - a node pointed to by a parent node
null dereference
filter
complex ADT
child
15. A pointer to the next element in a linked list
destructive
garbage collection
link
array
16. A collection of values
filter
null dereference
type
random access
17. A condition of the input data where the data will be handled by call(s) to the same program
runtime stack
random access
recursive case
successor
18. 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
algorithm
backtrack
garbage collection
19. A problem whose solution requires a linear amount of time or space if the problem is size n
association list
stack
scope
linear O(n)
20. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
amortized Analysis
doubly linked list
queue
data structure
21. A variable containing the address of other data
sort
pointer
successor
cons
22. Given two sets -the union is the set of elements that are members of either set
union
circular queue
inorder
linear O(n)
23. A classification of objects into a tree structure that groups related objects
state
taxonomy
data structure
big o
24. A tree node containing a contents value but with no children
garbage
leaf
scope
reference type
25. A runtime error that occurs when an operation such as method call is attempted on a null pointer
type
null dereference
data abstraction
linked list
26. A linked list in which the last element points back to the first element
sort
stack space
circularly linked list
inorder
27. In a search tree - a program that changes a state into a child state e.g a move in a game
operator
binary tree
null dereference
array
28. The top node of a tree - from which all other nodes can be reached
fifo
root
branching factor
complex ADT
29. Separation of the properties of a data type from its implementation
intractable
state
association list
data abstraction
30. In a tree search - to move back from the node currently being examined to its parent
linked list
destructive
stack
backtrack
31. 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
quadratic
boxed number
side-effect
filter
32. Composed of a collection of data values; implemented with a data structure
garbage collection
type
complex ADT
scope
33. An order of processing a tree in which the parent node is processed before its children
preorder
link
array
abstract data type
34. 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
boxed number
well-founded ordering xml
cons
structure sharing
35. A pattern that describes a set of similar programs
simple ADT
parent
design pattern
successor
36. A description of the state of a process such as a board game
state
ancestors
doubly linked list
data type
37. All nodes below a give node in a tree
dictionary
node
descendants
entinel
38. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
well-founded ordering xml
cons
branching factor
union
39. The process of collecting garbage for recycling
garbage collection
design pattern
search
merge
40. To convert from a pointer to the data that is pointed to
dereference
general list
reference
design pattern
41. A queue implemented within an array - where the first elements of the array logically follows the last elements
dereference
circular queue
filter
leaf
42. The next element in a linked list
shadow
destructive
successor
simple data type
43. An item (or description of items) being sough in a search
ontology
goal
object
stack
44. A simple case that can be solved easily - without recursion
base case
array
backtrack
pointer
45. To hide similar items with the same name
shadow
set difference
circularly linked list
entinel
46. Constructed of multiple components (simple or complex types)
data type
dictionary
branching factor
complex data type
47. 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
binary search tree (bst)
simple ADT
stack frame
complex data type
48. A case where tow data structures share some elements
circular queue
structure sharing
stack frame
search
49. A linked list in which each elements has both forward and backward pointers
design pattern
binary search tree (bst)
union
doubly linked list
50. The area of program text over which a variable can be referenced
child
circular queue
null dereference
scope