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. Container for storing a collection of data in unique key/value pairs
child
dictionary
recursive case
complex data type
2. A process that removes unwanted elements from a collection
filter
amortized Analysis
recursion
LIFO
3. To look through a data structure until a goal object is found
backtrack
search
data abstraction
stack
4. Last in first out: describes the order of a stack
gedanken
grammar
branching factor
LIFO
5. 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
stack frame
null dereference
preorder
boxed number
6. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
complex ADT
quadratic
operator
data abstraction
7. A collection of values
link
type
filter
abstract data type
8. A classification of objects into a tree structure that groups related objects
operator
preorder
filter
taxonomy
9. 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
data type
taxonomy
reference type
goal
10. The amount of space on the runtime stack required for execution of a program
divide and conquer
stack space
shadow
leaf
11. The process of collecting garbage for recycling
garbage collection
data abstraction
circular queue
scope
12. A variable containing the address of other data
boxed number
side-effect
linear O(n)
pointer
13. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
procedural abstraction
simple ADT
linear O(n)
divide and conquer
14. Describes a though experiment or view of an entity
data structure
binary tree
scope
gedanken
15. Constructed of multiple components (simple or complex types)
complex data type
amortized Analysis
cons
complex ADT
16. A case where tow data structures share some elements
data abstraction
backtrack
structure sharing
type
17. In object oriented programming - a description of a set of similar objects
depth
class
constructive
simple data type
18. 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?"
taxonomy
amortized Analysis
divide and conquer
garbage
19. The next element in a linked list
successor
alias
circularly linked list
general list
20. A runtime error that occurs when an operation such as method call is attempted on a null pointer
reference
null dereference
circular queue
design pattern
21. An order of processing a tree in which the parent node is processed after its children
data abstraction
linked list
postorder
search
22. Any container with linear ordering
linear O(n)
general list
child
entinel
23. Composed of multiple sequential elements stored in contiguous bytes of memory
merge
runtime stack
array
boxed number
24. In a tree - the union of a node's parent and the parent's ancestors
random access
dictionary
ancestors
cons
25. A section of the runtime stack holding the values of all variables for one invocation
stack frame
immutable
garbage
reference type
26. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
backtrack
interior node
general list
well-founded ordering xml
27. A linked list in which the last element points back to the first element
child
circularly linked list
postorder
inorder
28. A linked list in which each elements has both forward and backward pointers
doubly linked list
linked list
pointer
recursive case
29. Two variables that reference the same object
binary search tree (bst)
goal
scope
alias
30. 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
class
binary search tree (bst)
LIFO
null dereference
31. storage that is no longer pointed to by any variable and therefore can no longer be accessed
garbage
branching factor
scope
destructive
32. A tree node containing a contents value but with no children
array
goal
data abstraction
leaf
33. In a tree - a node that points to a given node
cons
recursive case
parent
boxed number
34. Values are in the most basic form and cannot be decomposed into smaller parts
pointer
simple data type
random access
big o
35. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
successor
parent
fair
tail recursive
36. A node of a tree that has children
interior node
leaf
branching factor
alias
37. Describes a data structure or device in which all accesses have the same cost - O(1)
merge
random access
binary tree
cons
38. To hide similar items with the same name
queue
shadow
binary search tree (bst)
set difference
39. Composed of a collection of data values; implemented with a data structure
sort
search
gedanken
complex ADT
40. A stack containing a stack frame of variable value for each active invocation of procedure
ancestors
shadow
runtime stack
grammar
41. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
garbage
array
side-effect
divide and conquer
42. In a tree - a node pointed to by a parent node
DFS
child
association list
recursive case
43. Use of a function or method without knowing how it's accomplished
procedural abstraction
array
constructive
stack frame
44. A sequence of records - where each record contains a link to the next one
linked list
taxonomy
well-founded ordering xml
ontology
45. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
linked list
data structure
circular queue
complex data type
46. A search in which children of a node are considered before siblings are considered
destructive
depth-first search
data type
complex data type
47. A condition of the input data where the data will be handled by call(s) to the same program
binary search tree (bst)
doubly linked list
abstract data type
recursive case
48. 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
amortized Analysis
data abstraction
cons
complex data type
49. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
branching factor
scope
data abstraction
set difference
50. In a tree search - to move back from the node currently being examined to its parent
backtrack
DFS
side-effect
garbage collection