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. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
preorder
circularly linked list
quadratic
association list
2. An order of processing a tree in which the parent node is processed after its children
stack frame
base case
sort
postorder
3. 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
boxed number
simple ADT
big o
immutable
4. Depth first search
pointer
DFS
abstract data type
union
5. The next element in a linked list
goal
array
successor
random access
6. In a tree - a node that points to a given node
cons
simple data type
stack
parent
7. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
data structure
reference type
successor
interior node
8. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
immutable
alias
random access
side-effect
9. A runtime error that occurs when an operation such as method call is attempted on a null pointer
null dereference
goal
fifo
design pattern
10. To combine two ordered linear structures into one
merge
root
linked list
backtrack
11. Two variables that reference the same object
big o
alias
leaf
recursive case
12. To hide similar items with the same name
taxonomy
recursive case
grammar
shadow
13. Use of a function or method without knowing how it's accomplished
procedural abstraction
array
simple data type
node
14. 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
depth-first search
successor
preorder
boxed number
15. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
parent
descendants
divide and conquer
successor
16. A simple case that can be solved easily - without recursion
depth
algorithm
base case
scope
17. A pointer to the next element in a linked list
destructive
link
scope
parent
18. Last in first out: describes the order of a stack
LIFO
successor
data structure
ontology
19. A section of the runtime stack holding the values of all variables for one invocation
dereference
tail recursive
inorder
stack frame
20. A condition of the input data where the data will be handled by call(s) to the same program
recursive case
general list
parent
reference
21. A contiguous block of memory containing elements of the same type - accessed by numeric index
garbage
array
set difference
root
22. A search in which children of a node are considered before siblings are considered
linear O(n)
LIFO
fair
depth-first search
23. A process that removes unwanted elements from a collection
scope
intersection
constructive
filter
24. A problem whose solution requires a linear amount of time or space if the problem is size n
type
data structure
linear O(n)
scope
25. A sequence of records - where each record contains a link to the next one
leaf
linked list
parent
quadratic
26. A queue implemented within an array - where the first elements of the array logically follows the last elements
depth
shadow
circular queue
grammar
27. First in first out: describes ordering of a queue
circularly linked list
ontology
fifo
entinel
28. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
backtrack
association list
sort
dictionary
29. A node of a tree that has children
binary search tree (bst)
interior node
array
search
30. 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
goal
depth
cons
big o
31. A pattern that describes a set of similar programs
simple data type
grammar
design pattern
array
32. 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
garbage
branching factor
type
data structure
33. Describes a though experiment or view of an entity
amortized Analysis
association list
gedanken
procedural abstraction
34. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
sort
doubly linked list
immutable
structure sharing
35. A stack containing a stack frame of variable value for each active invocation of procedure
array
procedural abstraction
divide and conquer
runtime stack
36. In a search tree - a program that changes a state into a child state e.g a move in a game
data type
operator
set difference
data abstraction
37. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
set difference
linear O(n)
ontology
goal
38. A data structure that can be identified at runtime as being a member of a class
filter
abstract data type
class
object
39. An item (or description of items) being sough in a search
constructive
operator
goal
simple data type
40. The top node of a tree - from which all other nodes can be reached
stack
scope
side-effect
root
41. A tree node containing a contents value but with no children
leaf
type
abstract data type
node
42. A variable containing the address of other data
pointer
type
link
sort
43. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
well-founded ordering xml
dereference
type
scope
44. A pointer to data
reference
class
garbage
array
45. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
grammar
runtime stack
queue
parent
46. To look through a data structure until a goal object is found
linear O(n)
procedural abstraction
search
complex data type
47. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
algorithm
fair
well-founded ordering xml
grammar
48. storage that is no longer pointed to by any variable and therefore can no longer be accessed
fifo
base case
grammar
garbage
49. A problem that is so hard that it cannot be solved unless the problem is small
branching factor
ancestors
type
intractable
50. Composed of a collection of data values; implemented with a data structure
depth
complex ADT
successor
data structure