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)
boxed number
random access
successor
big o
2. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
operator
intractable
big o
data structure
3. Describes a function that modifies its arguments
search
destructive
branching factor
recursive case
4. First-child/next-sibling
shadow
association list
type
fair
5. A problem that is so hard that it cannot be solved unless the problem is small
recursion
link
intractable
branching factor
6. Depth first search
DFS
doubly linked list
postorder
algorithm
7. To combine two ordered linear structures into one
recursion
dictionary
grammar
merge
8. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
root
side-effect
entinel
depth
9. All nodes below a give node in a tree
dereference
procedural abstraction
descendants
binary tree
10. A collection of objects that are inserted and removed according to the LIFO principle
stack
dereference
alias
scope
11. Container for storing a collection of data in unique key/value pairs
circular queue
dictionary
recursion
grammar
12. Describes a though experiment or view of an entity
filter
base case
node
gedanken
13. A simple case that can be solved easily - without recursion
parent
linked list
destructive
base case
14. The area of program text over which a variable can be referenced
stack
scope
preorder
depth-first search
15. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
filter
tail recursive
general list
entinel
16. In a search tree - a program that changes a state into a child state e.g a move in a game
link
stack space
runtime stack
operator
17. Composed of a collection of data values; implemented with a data structure
null dereference
taxonomy
shadow
complex ADT
18. The amount of space on the runtime stack required for execution of a program
grammar
association list
stack space
design pattern
19. A description of operations on a data type that could have multiple possible implementations
abstract data type
complex ADT
destructive
well-founded ordering xml
20. A classification of objects into a tree structure that groups related objects
taxonomy
successor
stack space
fifo
21. A stack containing a stack frame of variable value for each active invocation of procedure
runtime stack
array
data type
constructive
22. Any container with linear ordering
parent
general list
boxed number
stack frame
23. A problem whose solution requires a linear amount of time or space if the problem is size n
backtrack
linear O(n)
root
interior node
24. A pattern that describes a set of similar programs
queue
recursive case
design pattern
DFS
25. A condition of the input data where the data will be handled by call(s) to the same program
grammar
fifo
recursive case
simple data type
26. A node of a tree that has children
gedanken
interior node
ontology
class
27. In a tree - the union of a node's parent and the parent's ancestors
divide and conquer
quadratic
constructive
ancestors
28. In object oriented programming - a description of a set of similar objects
class
leaf
boxed number
simple data type
29. 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
DFS
linked list
big o
boxed number
30. A variable containing the address of other data
doubly linked list
ontology
pointer
scope
31. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
preorder
immutable
destructive
boxed number
32. Use of a function or method without knowing how it's accomplished
operator
leaf
procedural abstraction
preorder
33. A case where tow data structures share some elements
descendants
base case
structure sharing
destructive
34. A process that removes unwanted elements from a collection
well-founded ordering xml
filter
scope
doubly linked list
35. Given two sets -the union is the set of elements that are members of either set
general list
scope
union
gedanken
36. Constructed of multiple components (simple or complex types)
complex data type
immutable
big o
fair
37. The process of collecting garbage for recycling
complex data type
garbage collection
LIFO
complex ADT
38. A pointer to data
reference
backtrack
pointer
garbage
39. A case where a program calls itself
link
circular queue
destructive
recursion
40. A sequence of records - where each record contains a link to the next one
DFS
ancestors
descendants
linked list
41. 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
filter
binary search tree (bst)
simple data type
preorder
42. An item (or description of items) being sough in a search
array
object
side-effect
goal
43. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
runtime stack
root
divide and conquer
type
44. An order of processing a tree in which the parent node is processed before its children
amortized Analysis
state
preorder
runtime stack
45. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
queue
quadratic
stack frame
stack
46. Last in first out: describes the order of a stack
design pattern
LIFO
branching factor
operator
47. A collection of values
state
postorder
type
intractable
48. The next element in a linked list
successor
entinel
preorder
shadow
49. A description of the state of a process such as a board game
union
scope
LIFO
state
50. To hide similar items with the same name
alias
shadow
constructive
backtrack