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)
ontology
random access
reference
side-effect
2. An elements of a linked list - tree - or graph - often represented by a data structure
destructive
node
taxonomy
recursion
3. Constructed of multiple components (simple or complex types)
postorder
merge
depth-first search
complex data type
4. The number of links between the root of a tree and the leaves
binary tree
descendants
association list
depth
5. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
union
sort
leaf
array
6. To combine two ordered linear structures into one
taxonomy
DFS
merge
intersection
7. Depth first search
DFS
depth-first search
immutable
parent
8. To convert from a pointer to the data that is pointed to
divide and conquer
dereference
array
immutable
9. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
simple data type
divide and conquer
destructive
preorder
10. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
linked list
queue
type
constructive
11. A problem that is so hard that it cannot be solved unless the problem is small
divide and conquer
LIFO
queue
intractable
12. An order of processing a tree in which the parent node is processed in between its children
circularly linked list
array
binary tree
inorder
13. An order of processing a tree in which the parent node is processed after its children
design pattern
postorder
base case
side-effect
14. A description of operations on a data type that could have multiple possible implementations
abstract data type
grammar
operator
linked list
15. Given two sets -the union is the set of elements that are members of either set
array
reference type
union
postorder
16. A process that removes unwanted elements from a collection
taxonomy
tail recursive
filter
descendants
17. Use of a function or method without knowing how it's accomplished
operator
procedural abstraction
object
entinel
18. storage that is no longer pointed to by any variable and therefore can no longer be accessed
garbage
descendants
filter
shadow
19. A runtime error that occurs when an operation such as method call is attempted on a null pointer
procedural abstraction
queue
complex data type
null dereference
20. Given two sets - the intersection is the set of elements that are members of both sets
intersection
shadow
algorithm
binary search tree (bst)
21. A simple case that can be solved easily - without recursion
depth-first search
null dereference
side-effect
base case
22. A condition of the input data where the data will be handled by call(s) to the same program
random access
circularly linked list
recursive case
DFS
23. The process of collecting garbage for recycling
depth
simple data type
garbage collection
filter
24. 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
binary search tree (bst)
operator
circular queue
linked list
25. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
scope
well-founded ordering xml
base case
gedanken
26. The area of program text over which a variable can be referenced
dictionary
scope
alias
array
27. All nodes below a give node in a tree
sort
depth-first search
root
descendants
28. A collection of objects that are inserted and removed according to the LIFO principle
pointer
stack
tail recursive
general list
29. A problem whose solution requires a linear amount of time or space if the problem is size n
scope
linear O(n)
filter
ontology
30. A classification of objects into a tree structure that groups related objects
taxonomy
linear O(n)
entinel
immutable
31. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
branching factor
gedanken
data structure
binary tree
32. A case where tow data structures share some elements
design pattern
interior node
structure sharing
recursion
33. To look through a data structure until a goal object is found
search
circular queue
stack
random access
34. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
shadow
side-effect
union
inorder
35. Values are in the most basic form and cannot be decomposed into smaller parts
tail recursive
simple data type
LIFO
successor
36. A pointer to data
stack
leaf
reference
node
37. Describes a function that makes a new data structure but does not modify its arguments
constructive
side-effect
node
simple ADT
38. In object oriented programming - a description of a set of similar objects
garbage collection
class
big o
fair
39. Separation of the properties of a data type from its implementation
structure sharing
data abstraction
class
array
40. Describes a function that modifies its arguments
dictionary
destructive
circularly linked list
grammar
41. 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
fair
class
recursion
cons
42. 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
simple data type
reference type
array
binary tree
43. 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
branching factor
reference type
immutable
big o
44. A linked list in which the last element points back to the first element
circularly linked list
operator
successor
DFS
45. 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?"
data type
merge
amortized Analysis
association list
46. A tree node containing a contents value but with no children
binary tree
array
leaf
taxonomy
47. First in first out: describes ordering of a queue
child
side-effect
fifo
constructive
48. An order of processing a tree in which the parent node is processed before its children
complex ADT
depth-first search
node
preorder
49. An item (or description of items) being sough in a search
null dereference
reference
goal
operator
50. In a search tree - a program that changes a state into a child state e.g a move in a game
simple ADT
queue
filter
operator