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 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
boxed number
set difference
data structure
preorder
2. The next element in a linked list
pointer
successor
data type
amortized Analysis
3. In a tree search - to move back from the node currently being examined to its parent
child
backtrack
ontology
reference
4. The area of program text over which a variable can be referenced
dictionary
ontology
design pattern
scope
5. In a tree - a node pointed to by a parent node
interior node
simple data type
immutable
child
6. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
tail recursive
set difference
fifo
depth-first search
7. Depth first search
grammar
DFS
leaf
parent
8. storage that is no longer pointed to by any variable and therefore can no longer be accessed
circularly linked list
garbage
simple data type
queue
9. A search in which children of a node are considered before siblings are considered
backtrack
divide and conquer
depth-first search
search
10. Container for storing a collection of data in unique key/value pairs
stack space
dictionary
cons
procedural abstraction
11. A data structure that implements a complete binary tree within an array - such that every parent node has a value that is less than the value of either of its children
descendants
binary tree
DFS
ontology
12. The process of collecting garbage for recycling
data type
class
garbage collection
circular queue
13. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
class
tail recursive
alias
grammar
14. A pointer to data
reference
queue
operator
state
15. A given collection of values along with a collection of operations for use on those values
recursion
data type
tail recursive
binary search tree (bst)
16. Separation of the properties of a data type from its implementation
LIFO
data abstraction
sort
fair
17. A description of operations on a data type that could have multiple possible implementations
garbage
sort
abstract data type
stack
18. All nodes below a give node in a tree
object
union
descendants
queue
19. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
general list
binary tree
well-founded ordering xml
circularly linked list
20. 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
intersection
goal
big o
association list
21. Last in first out: describes the order of a stack
dictionary
sort
LIFO
boxed number
22. An order of processing a tree in which the parent node is processed after its children
random access
divide and conquer
postorder
alias
23. A linked list in which each elements has both forward and backward pointers
successor
doubly linked list
gedanken
queue
24. A case where a program calls itself
tail recursive
stack space
recursion
abstract data type
25. An order of processing a tree in which the parent node is processed before its children
preorder
circularly linked list
link
data type
26. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
algorithm
simple data type
entinel
grammar
27. In a tree - the union of a node's parent and the parent's ancestors
ancestors
preorder
base case
boxed number
28. In object oriented programming - a description of a set of similar objects
entinel
queue
class
root
29. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
ontology
quadratic
big o
backtrack
30. A list of pairs - where each pair has a key and a value associated with the key
association list
side-effect
ancestors
data abstraction
31. Use of a function or method without knowing how it's accomplished
complex ADT
algorithm
procedural abstraction
goal
32. Composed of multiple sequential elements stored in contiguous bytes of memory
general list
array
node
alias
33. A linked list in which the last element points back to the first element
circularly linked list
intersection
cons
constructive
34. 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
scope
reference type
amortized Analysis
circularly linked list
35. The amount of space on the runtime stack required for execution of a program
set difference
interior node
stack space
branching factor
36. An extra record at the start or end of a data structure such as a linked list - to simplify processing
algorithm
entinel
set difference
object
37. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
immutable
constructive
abstract data type
cons
38. A node of a tree that has children
binary tree
interior node
quadratic
association list
39. Values are in the most basic form and cannot be decomposed into smaller parts
null dereference
binary search tree (bst)
well-founded ordering xml
simple data type
40. 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
type
set difference
merge
branching factor
41. An item (or description of items) being sough in a search
goal
queue
recursion
gedanken
42. A contiguous block of memory containing elements of the same type - accessed by numeric index
gedanken
array
simple data type
quadratic
43. A classification of objects into a tree structure that groups related objects
cons
fair
taxonomy
array
44. Given two sets - the intersection is the set of elements that are members of both sets
side-effect
intersection
simple data type
child
45. Constructed of multiple components (simple or complex types)
abstract data type
inorder
complex data type
branching factor
46. A runtime error that occurs when an operation such as method call is attempted on a null pointer
immutable
successor
null dereference
recursive case
47. A tree node containing a contents value but with no children
leaf
union
child
boxed number
48. A problem whose solution requires a linear amount of time or space if the problem is size n
array
dictionary
ontology
linear O(n)
49. An elements of a linked list - tree - or graph - often represented by a data structure
ontology
node
doubly linked list
well-founded ordering xml
50. First-child/next-sibling
successor
union
doubly linked list
fair