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. Last in first out: describes the order of a stack
operator
goal
fair
LIFO
2. A process that removes unwanted elements from a collection
inorder
filter
stack frame
entinel
3. First in first out: describes ordering of a queue
class
branching factor
fifo
simple ADT
4. Composed of multiple sequential elements stored in contiguous bytes of memory
garbage collection
scope
array
DFS
5. To look through a data structure until a goal object is found
boxed number
operator
search
destructive
6. First-child/next-sibling
node
boxed number
amortized Analysis
fair
7. An extra record at the start or end of a data structure such as a linked list - to simplify processing
entinel
dereference
complex ADT
null dereference
8. The process of collecting garbage for recycling
scope
garbage collection
abstract data type
postorder
9. A collection of values
data structure
type
shadow
dictionary
10. In a tree - a node pointed to by a parent node
random access
child
state
fifo
11. A data structure that can be identified at runtime as being a member of a class
scope
binary tree
object
recursion
12. Composed of individually named data fields
simple ADT
linked list
complex ADT
boxed number
13. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
constructive
scope
sort
circularly linked list
14. Given two sets - the intersection is the set of elements that are members of both sets
circularly linked list
fair
dictionary
intersection
15. The next element in a linked list
descendants
doubly linked list
successor
data type
16. A collection of objects that are inserted and removed according to the LIFO principle
stack
boxed number
null dereference
set difference
17. To convert from a pointer to the data that is pointed to
dereference
filter
descendants
postorder
18. In object oriented programming - a description of a set of similar objects
leaf
class
boxed number
complex data type
19. A pointer to data
recursive case
reference
stack
algorithm
20. A pattern that describes a set of similar programs
simple data type
design pattern
binary tree
garbage
21. Describes a data structure or device in which all accesses have the same cost - O(1)
backtrack
random access
circularly linked list
grammar
22. An order of processing a tree in which the parent node is processed in between its children
simple data type
inorder
branching factor
quadratic
23. Depth first search
LIFO
alias
linear O(n)
DFS
24. A case where tow data structures share some elements
operator
intersection
structure sharing
fifo
25. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
circularly linked list
root
immutable
side-effect
26. In a tree - the union of a node's parent and the parent's ancestors
ancestors
circular queue
successor
parent
27. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
child
intersection
union
data structure
28. A description of the state of a process such as a board game
design pattern
linear O(n)
entinel
state
29. An order of processing a tree in which the parent node is processed before its children
preorder
branching factor
amortized Analysis
constructive
30. Describes a function that modifies its arguments
garbage
destructive
quadratic
procedural abstraction
31. A stack containing a stack frame of variable value for each active invocation of procedure
child
runtime stack
postorder
operator
32. A queue implemented within an array - where the first elements of the array logically follows the last elements
circular queue
garbage collection
fair
general list
33. A problem whose solution requires a linear amount of time or space if the problem is size n
linear O(n)
side-effect
operator
data type
34. Constructed of multiple components (simple or complex types)
dereference
complex data type
boxed number
inorder
35. The amount of space on the runtime stack required for execution of a program
union
stack space
procedural abstraction
data abstraction
36. A problem that is so hard that it cannot be solved unless the problem is small
intractable
inorder
general list
cons
37. A description of operations on a data type that could have multiple possible implementations
abstract data type
stack frame
array
binary search tree (bst)
38. 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
design pattern
big o
fair
filter
39. A pointer to the next element in a linked list
binary tree
null dereference
alias
link
40. The number of links between the root of a tree and the leaves
boxed number
data abstraction
depth
data structure
41. A node of a tree that has children
inorder
side-effect
intractable
interior node
42. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
side-effect
ontology
interior node
runtime stack
43. A linked list in which the last element points back to the first element
circularly linked list
random access
postorder
structure sharing
44. To hide similar items with the same name
shadow
ontology
complex ADT
circularly linked list
45. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
set difference
filter
random access
recursive case
46. 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
null dereference
reference
array
binary tree
47. An order of processing a tree in which the parent node is processed after its children
branching factor
stack frame
circular queue
postorder
48. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
side-effect
quadratic
tail recursive
divide and conquer
49. storage that is no longer pointed to by any variable and therefore can no longer be accessed
alias
garbage
root
complex data type
50. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
design pattern
divide and conquer
complex data type
stack space