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. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
side-effect
ancestors
binary search tree (bst)
operator
2. A condition of the input data where the data will be handled by call(s) to the same program
sort
recursive case
shadow
branching factor
3. 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
DFS
simple ADT
data type
binary search tree (bst)
4. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
intractable
data structure
root
complex data type
5. 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
successor
linear O(n)
cons
garbage
6. An order of processing a tree in which the parent node is processed before its children
binary tree
base case
depth-first search
preorder
7. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
backtrack
algorithm
linear O(n)
constructive
8. Separation of the properties of a data type from its implementation
stack space
data abstraction
data structure
leaf
9. A description of the state of a process such as a board game
taxonomy
cons
state
association list
10. The amount of space on the runtime stack required for execution of a program
quadratic
stack space
taxonomy
postorder
11. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
taxonomy
algorithm
structure sharing
queue
12. A pattern that describes a set of similar programs
reference type
binary tree
child
design pattern
13. A collection of objects that are inserted and removed according to the LIFO principle
circularly linked list
child
complex data type
stack
14. A tree node containing a contents value but with no children
leaf
array
constructive
amortized Analysis
15. Container for storing a collection of data in unique key/value pairs
set difference
goal
taxonomy
dictionary
16. Composed of individually named data fields
simple ADT
object
abstract data type
entinel
17. A linked list in which each elements has both forward and backward pointers
garbage collection
data type
state
doubly linked list
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
tail recursive
null dereference
interior node
reference type
19. A runtime error that occurs when an operation such as method call is attempted on a null pointer
abstract data type
tail recursive
search
null dereference
20. To look through a data structure until a goal object is found
general list
dictionary
search
sort
21. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
grammar
child
class
immutable
22. Two variables that reference the same object
dereference
garbage collection
stack
alias
23. To answer the question - "If the algorithm is run several times - what is the average time per run - given the worst possible sequence of runs?"
immutable
state
amortized Analysis
cons
24. To combine two ordered linear structures into one
merge
amortized Analysis
interior node
dereference
25. Describes a function that modifies its arguments
destructive
procedural abstraction
data abstraction
filter
26. A case where a program calls itself
big o
recursion
interior node
pointer
27. A description of operations on a data type that could have multiple possible implementations
abstract data type
array
garbage collection
cons
28. A section of the runtime stack holding the values of all variables for one invocation
intersection
design pattern
reference
stack frame
29. The number of links between the root of a tree and the leaves
depth
association list
depth-first search
successor
30. An order of processing a tree in which the parent node is processed after its children
postorder
gedanken
intersection
circularly linked list
31. 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
circular queue
LIFO
pointer
32. Depth first search
circularly linked list
DFS
well-founded ordering xml
linked list
33. An item (or description of items) being sough in a search
leaf
goal
immutable
filter
34. A queue implemented within an array - where the first elements of the array logically follows the last elements
reference type
data abstraction
circularly linked list
circular queue
35. First-child/next-sibling
fifo
branching factor
well-founded ordering xml
fair
36. Given two sets -the union is the set of elements that are members of either set
cons
successor
union
entinel
37. 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
cons
boxed number
simple ADT
fifo
38. To convert from a pointer to the data that is pointed to
alias
dereference
node
fair
39. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
data abstraction
inorder
state
well-founded ordering xml
40. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
amortized Analysis
node
quadratic
fifo
41. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
sort
child
circularly linked list
constructive
42. Composed of multiple sequential elements stored in contiguous bytes of memory
array
reference type
complex data type
simple ADT
43. A contiguous block of memory containing elements of the same type - accessed by numeric index
root
union
array
structure sharing
44. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
shadow
circularly linked list
divide and conquer
general list
45. First in first out: describes ordering of a queue
inorder
fifo
simple data type
linked list
46. A list of pairs - where each pair has a key and a value associated with the key
association list
array
simple ADT
entinel
47. A simple case that can be solved easily - without recursion
merge
garbage
base case
leaf
48. All nodes below a give node in a tree
scope
descendants
data type
array
49. The top node of a tree - from which all other nodes can be reached
root
stack space
garbage
algorithm
50. A process that removes unwanted elements from a collection
filter
preorder
pointer
alias