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. Given two sets -the union is the set of elements that are members of either set
union
garbage
divide and conquer
garbage collection
2. A condition of the input data where the data will be handled by call(s) to the same program
recursive case
stack frame
reference
union
3. To convert from a pointer to the data that is pointed to
binary search tree (bst)
dereference
filter
divide and conquer
4. A queue implemented within an array - where the first elements of the array logically follows the last elements
fifo
circular queue
amortized Analysis
dereference
5. A stack containing a stack frame of variable value for each active invocation of procedure
pointer
runtime stack
object
linked list
6. The amount of space on the runtime stack required for execution of a program
dereference
boxed number
abstract data type
stack space
7. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
pointer
grammar
ontology
LIFO
8. A section of the runtime stack holding the values of all variables for one invocation
DFS
stack frame
data structure
leaf
9. 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
link
branching factor
leaf
merge
10. Use of a function or method without knowing how it's accomplished
grammar
filter
procedural abstraction
object
11. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
data structure
complex data type
scope
reference
12. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
depth-first search
binary search tree (bst)
sort
stack
13. To hide similar items with the same name
constructive
shadow
goal
filter
14. Given two sets - the intersection is the set of elements that are members of both sets
set difference
fair
intersection
abstract data type
15. 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?"
backtrack
structure sharing
amortized Analysis
fair
16. The process of collecting garbage for recycling
procedural abstraction
linear O(n)
doubly linked list
garbage collection
17. A search in which children of a node are considered before siblings are considered
depth-first search
intractable
entinel
taxonomy
18. First-child/next-sibling
search
fair
array
ontology
19. The area of program text over which a variable can be referenced
intersection
scope
merge
recursive case
20. A variable containing the address of other data
successor
runtime stack
data abstraction
pointer
21. 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
garbage
stack
22. A pattern that describes a set of similar programs
well-founded ordering xml
design pattern
ontology
dereference
23. Two variables that reference the same object
array
alias
successor
array
24. In a tree - a node that points to a given node
shadow
parent
null dereference
node
25. A linked list in which each elements has both forward and backward pointers
doubly linked list
stack space
class
taxonomy
26. A pointer to the next element in a linked list
association list
backtrack
link
data type
27. Constructed of multiple components (simple or complex types)
complex data type
queue
data structure
stack
28. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
well-founded ordering xml
random access
runtime stack
reference
29. A description of operations on a data type that could have multiple possible implementations
search
abstract data type
amortized Analysis
dictionary
30. 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
circular queue
interior node
reference type
inorder
31. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
successor
runtime stack
algorithm
backtrack
32. An item (or description of items) being sough in a search
dictionary
type
state
goal
33. A linked list in which the last element points back to the first element
array
type
garbage
circularly linked list
34. Last in first out: describes the order of a stack
postorder
taxonomy
LIFO
base case
35. In a tree - a node pointed to by a parent node
constructive
algorithm
child
linked list
36. A sequence of records - where each record contains a link to the next one
data type
linked list
successor
preorder
37. 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
reference type
backtrack
big o
depth
38. A collection of objects that are inserted and removed according to the LIFO principle
stack
link
scope
recursive case
39. Values are in the most basic form and cannot be decomposed into smaller parts
operator
simple data type
random access
union
40. An elements of a linked list - tree - or graph - often represented by a data structure
node
queue
random access
data abstraction
41. A process that removes unwanted elements from a collection
filter
well-founded ordering xml
procedural abstraction
simple data type
42. Describes a though experiment or view of an entity
stack
structure sharing
gedanken
preorder
43. A pointer to data
reference
random access
doubly linked list
taxonomy
44. A list of pairs - where each pair has a key and a value associated with the key
pointer
alias
association list
inorder
45. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
class
divide and conquer
immutable
simple ADT
46. To look through a data structure until a goal object is found
association list
search
complex ADT
child
47. A problem whose solution requires a linear amount of time or space if the problem is size n
linear O(n)
root
child
set difference
48. 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
queue
divide and conquer
immutable
boxed number
49. First in first out: describes ordering of a queue
doubly linked list
fifo
intersection
child
50. A simple case that can be solved easily - without recursion
base case
filter
intractable
intersection