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. Describes a data structure or device in which all accesses have the same cost - O(1)
random access
fair
merge
LIFO
2. Values are in the most basic form and cannot be decomposed into smaller parts
divide and conquer
data abstraction
simple data type
design pattern
3. Container for storing a collection of data in unique key/value pairs
garbage collection
dictionary
design pattern
tail recursive
4. Last in first out: describes the order of a stack
operator
LIFO
state
stack space
5. In object oriented programming - a description of a set of similar objects
circular queue
class
data type
circularly linked list
6. A pointer to the next element in a linked list
successor
pointer
link
structure sharing
7. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
binary search tree (bst)
association list
ontology
runtime stack
8. 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
cons
data structure
immutable
branching factor
9. To hide similar items with the same name
array
goal
DFS
shadow
10. Separation of the properties of a data type from its implementation
data abstraction
quadratic
node
reference type
11. An order of processing a tree in which the parent node is processed in between its children
inorder
leaf
fair
ontology
12. A process that removes unwanted elements from a collection
intractable
general list
filter
grammar
13. Composed of a collection of data values; implemented with a data structure
simple data type
abstract data type
complex ADT
branching factor
14. Given two sets - the intersection is the set of elements that are members of both sets
intersection
procedural abstraction
reference
object
15. To convert from a pointer to the data that is pointed to
divide and conquer
object
intersection
dereference
16. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
amortized Analysis
big o
object
sort
17. To combine two ordered linear structures into one
reference
merge
stack
search
18. A description of the state of a process such as a board game
data abstraction
taxonomy
ancestors
state
19. A data structure that can be identified at runtime as being a member of a class
object
intractable
destructive
algorithm
20. A case where tow data structures share some elements
destructive
filter
simple ADT
structure sharing
21. A problem whose solution requires a linear amount of time or space if the problem is size n
backtrack
linear O(n)
doubly linked list
inorder
22. Any container with linear ordering
cons
general list
garbage collection
gedanken
23. Use of a function or method without knowing how it's accomplished
descendants
procedural abstraction
object
type
24. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
design pattern
depth-first search
well-founded ordering xml
root
25. A queue implemented within an array - where the first elements of the array logically follows the last elements
circular queue
quadratic
complex ADT
runtime stack
26. A tree node containing a contents value but with no children
branching factor
leaf
array
gedanken
27. A condition of the input data where the data will be handled by call(s) to the same program
circular queue
random access
recursive case
intractable
28. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
inorder
intractable
taxonomy
grammar
29. All nodes below a give node in a tree
association list
array
descendants
object
30. The number of links between the root of a tree and the leaves
preorder
node
depth
random access
31. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
base case
divide and conquer
queue
child
32. A problem that is so hard that it cannot be solved unless the problem is small
root
intractable
depth-first search
sort
33. A contiguous block of memory containing elements of the same type - accessed by numeric index
circularly linked list
array
interior node
cons
34. A pointer to data
reference
child
object
data type
35. The process of collecting garbage for recycling
binary search tree (bst)
stack frame
recursive case
garbage collection
36. A case where a program calls itself
queue
recursion
circularly linked list
interior node
37. Given two sets -the union is the set of elements that are members of either set
stack space
algorithm
union
dereference
38. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
destructive
binary search tree (bst)
array
algorithm
39. An order of processing a tree in which the parent node is processed after its children
postorder
linked list
ancestors
backtrack
40. A given collection of values along with a collection of operations for use on those values
preorder
data type
stack space
pointer
41. An item (or description of items) being sough in a search
simple data type
entinel
procedural abstraction
goal
42. Composed of multiple sequential elements stored in contiguous bytes of memory
array
merge
binary tree
well-founded ordering xml
43. A linked list in which each elements has both forward and backward pointers
big o
side-effect
destructive
doubly linked list
44. A node of a tree that has children
fair
linked list
interior node
entinel
45. An elements of a linked list - tree - or graph - often represented by a data structure
linked list
procedural abstraction
node
postorder
46. A pattern that describes a set of similar programs
base case
design pattern
DFS
abstract data type
47. The top node of a tree - from which all other nodes can be reached
set difference
root
search
inorder
48. In a tree - a node that points to a given node
set difference
search
parent
doubly linked list
49. The next element in a linked list
descendants
alias
successor
cons
50. A collection of objects that are inserted and removed according to the LIFO principle
descendants
node
stack
tail recursive