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 that cannot be changed once it has been created - such as Integer or String in Java
design pattern
immutable
destructive
stack
2. A runtime error that occurs when an operation such as method call is attempted on a null pointer
cons
depth
complex data type
null dereference
3. Composed of individually named data fields
data type
simple ADT
divide and conquer
inorder
4. A data structure that can be identified at runtime as being a member of a class
object
postorder
DFS
structure sharing
5. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
parent
runtime stack
reference
well-founded ordering xml
6. Describes a though experiment or view of an entity
gedanken
association list
child
type
7. First in first out: describes ordering of a queue
object
operator
stack frame
fifo
8. Use of a function or method without knowing how it's accomplished
leaf
procedural abstraction
abstract data type
entinel
9. A sequence of records - where each record contains a link to the next one
DFS
set difference
linked list
immutable
10. A case where a program calls itself
amortized Analysis
circularly linked list
immutable
recursion
11. 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
merge
depth
amortized Analysis
12. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
alias
child
abstract data type
queue
13. An order of processing a tree in which the parent node is processed after its children
array
state
goal
postorder
14. An elements of a linked list - tree - or graph - often represented by a data structure
node
ancestors
gedanken
recursion
15. To convert from a pointer to the data that is pointed to
fair
grammar
reference type
dereference
16. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
set difference
ancestors
structure sharing
sort
17. A description of the state of a process such as a board game
complex data type
doubly linked list
reference
state
18. Container for storing a collection of data in unique key/value pairs
base case
dictionary
null dereference
descendants
19. Describes a data structure or device in which all accesses have the same cost - O(1)
cons
random access
state
reference type
20. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
garbage
set difference
filter
tail recursive
21. Composed of a collection of data values; implemented with a data structure
big o
pointer
doubly linked list
complex ADT
22. storage that is no longer pointed to by any variable and therefore can no longer be accessed
garbage
gedanken
dictionary
big o
23. A condition of the input data where the data will be handled by call(s) to the same program
linear O(n)
filter
recursive case
shadow
24. Values are in the most basic form and cannot be decomposed into smaller parts
abstract data type
taxonomy
stack
simple data type
25. Describes a function that modifies its arguments
stack
entinel
destructive
immutable
26. An extra record at the start or end of a data structure such as a linked list - to simplify processing
structure sharing
alias
shadow
entinel
27. In a tree - the union of a node's parent and the parent's ancestors
goal
binary tree
ancestors
structure sharing
28. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
descendants
parent
quadratic
root
29. In a tree search - to move back from the node currently being examined to its parent
set difference
fifo
backtrack
runtime stack
30. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
simple data type
tail recursive
queue
stack space
31. 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?"
constructive
amortized Analysis
data abstraction
runtime stack
32. A collection of objects that are inserted and removed according to the LIFO principle
general list
operator
set difference
stack
33. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
algorithm
state
divide and conquer
grammar
34. First-child/next-sibling
random access
fair
complex data type
stack space
35. A process that removes unwanted elements from a collection
pointer
operator
filter
goal
36. A variable containing the address of other data
structure sharing
immutable
garbage collection
pointer
37. A pointer to data
state
reference
cons
tail recursive
38. 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
stack space
inorder
cons
successor
39. An order of processing a tree in which the parent node is processed before its children
alias
preorder
data abstraction
descendants
40. The next element in a linked list
fair
link
successor
grammar
41. A simple case that can be solved easily - without recursion
association list
simple ADT
base case
side-effect
42. In object oriented programming - a description of a set of similar objects
data abstraction
class
array
well-founded ordering xml
43. A linked list in which the last element points back to the first element
amortized Analysis
circularly linked list
side-effect
fifo
44. Describes a function that makes a new data structure but does not modify its arguments
constructive
divide and conquer
garbage collection
base case
45. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
reference
reference type
constructive
side-effect
46. Constructed of multiple components (simple or complex types)
abstract data type
complex data type
preorder
root
47. A pattern that describes a set of similar programs
fifo
inorder
null dereference
design pattern
48. A given collection of values along with a collection of operations for use on those values
data structure
circularly linked list
data type
depth
49. A pointer to the next element in a linked list
constructive
intersection
operator
link
50. 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
well-founded ordering xml
DFS
garbage collection
binary tree