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. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
merge
intractable
circularly linked list
divide and conquer
2. 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?"
doubly linked list
amortized Analysis
garbage
array
3. In object oriented programming - a description of a set of similar objects
data type
base case
class
ancestors
4. To combine two ordered linear structures into one
merge
array
pointer
gedanken
5. A classification of objects into a tree structure that groups related objects
taxonomy
destructive
successor
set difference
6. An extra record at the start or end of a data structure such as a linked list - to simplify processing
entinel
stack
set difference
quadratic
7. A collection of values
postorder
algorithm
data abstraction
type
8. A case where tow data structures share some elements
complex data type
intersection
design pattern
structure sharing
9. Use of a function or method without knowing how it's accomplished
procedural abstraction
array
alias
array
10. A sequence of records - where each record contains a link to the next one
design pattern
destructive
stack space
linked list
11. A description of operations on a data type that could have multiple possible implementations
cons
abstract data type
linked list
garbage
12. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
amortized Analysis
union
node
well-founded ordering xml
13. A pointer to data
recursion
fair
immutable
reference
14. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
complex data type
descendants
depth-first search
set difference
15. Depth first search
taxonomy
divide and conquer
dictionary
DFS
16. A linked list in which each elements has both forward and backward pointers
shadow
postorder
doubly linked list
object
17. 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
descendants
binary tree
gedanken
parent
18. A variable containing the address of other data
depth-first search
reference
intersection
pointer
19. Composed of multiple sequential elements stored in contiguous bytes of memory
postorder
cons
array
search
20. Given two sets -the union is the set of elements that are members of either set
successor
node
garbage collection
union
21. To look through a data structure until a goal object is found
search
recursion
data type
descendants
22. A queue implemented within an array - where the first elements of the array logically follows the last elements
abstract data type
divide and conquer
set difference
circular queue
23. A description of the state of a process such as a board game
state
data type
amortized Analysis
circularly linked list
24. storage that is no longer pointed to by any variable and therefore can no longer be accessed
binary search tree (bst)
link
array
garbage
25. A pointer to the next element in a linked list
circularly linked list
quadratic
link
successor
26. A tree node containing a contents value but with no children
leaf
node
type
base case
27. An order of processing a tree in which the parent node is processed in between its children
array
pointer
big o
inorder
28. Describes a function that makes a new data structure but does not modify its arguments
union
scope
constructive
cons
29. 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)
amortized Analysis
DFS
backtrack
30. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
recursive case
queue
filter
well-founded ordering xml
31. The next element in a linked list
successor
abstract data type
stack frame
class
32. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
operator
filter
entinel
quadratic
33. Any container with linear ordering
class
shadow
general list
branching factor
34. Describes a though experiment or view of an entity
gedanken
random access
doubly linked list
simple ADT
35. A node of a tree that has children
node
association list
type
interior node
36. A condition of the input data where the data will be handled by call(s) to the same program
circularly linked list
depth
recursive case
branching factor
37. A runtime error that occurs when an operation such as method call is attempted on a null pointer
leaf
null dereference
state
side-effect
38. An order of processing a tree in which the parent node is processed after its children
runtime stack
postorder
gedanken
recursion
39. Constructed of multiple components (simple or complex types)
well-founded ordering xml
complex data type
union
operator
40. Values are in the most basic form and cannot be decomposed into smaller parts
simple data type
simple ADT
stack frame
alias
41. Composed of individually named data fields
simple ADT
branching factor
complex ADT
link
42. A pattern that describes a set of similar programs
design pattern
big o
operator
fifo
43. Container for storing a collection of data in unique key/value pairs
dereference
runtime stack
well-founded ordering xml
dictionary
44. Describes a function that modifies its arguments
binary search tree (bst)
filter
depth
destructive
45. An elements of a linked list - tree - or graph - often represented by a data structure
class
alias
pointer
node
46. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
design pattern
sort
descendants
grammar
47. In a search tree - a program that changes a state into a child state e.g a move in a game
successor
scope
operator
dereference
48. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
child
data abstraction
side-effect
doubly linked list
49. 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
complex data type
gedanken
fair
boxed number
50. A process that removes unwanted elements from a collection
random access
leaf
filter
big o