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