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. The area of program text over which a variable can be referenced
ancestors
scope
amortized Analysis
procedural abstraction
2. A process that removes unwanted elements from a collection
sort
general list
depth-first search
filter
3. A pointer to the next element in a linked list
link
stack space
tail recursive
set difference
4. A runtime error that occurs when an operation such as method call is attempted on a null pointer
search
null dereference
immutable
circularly linked list
5. A section of the runtime stack holding the values of all variables for one invocation
data structure
complex data type
stack frame
data type
6. Describes a data structure or device in which all accesses have the same cost - O(1)
DFS
random access
postorder
set difference
7. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
immutable
binary search tree (bst)
search
garbage
8. In a search tree - a program that changes a state into a child state e.g a move in a game
operator
complex data type
array
descendants
9. The next element in a linked list
abstract data type
successor
type
destructive
10. A simple case that can be solved easily - without recursion
entinel
fair
base case
complex ADT
11. Describes a though experiment or view of an entity
gedanken
divide and conquer
big o
taxonomy
12. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
structure sharing
amortized Analysis
goal
ontology
13. 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
dereference
binary search tree (bst)
procedural abstraction
recursion
14. A contiguous block of memory containing elements of the same type - accessed by numeric index
set difference
amortized Analysis
association list
array
15. A given collection of values along with a collection of operations for use on those values
divide and conquer
LIFO
data type
doubly linked list
16. A condition of the input data where the data will be handled by call(s) to the same program
recursive case
tail recursive
runtime stack
goal
17. To convert from a pointer to the data that is pointed to
class
dereference
goal
root
18. To hide similar items with the same name
tail recursive
design pattern
shadow
linked list
19. 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
cons
alias
search
design pattern
20. A collection of objects that are inserted and removed according to the LIFO principle
stack
binary tree
immutable
depth
21. A problem that is so hard that it cannot be solved unless the problem is small
sort
merge
association list
intractable
22. The amount of space on the runtime stack required for execution of a program
recursive case
sort
LIFO
stack space
23. A description of operations on a data type that could have multiple possible implementations
entinel
abstract data type
successor
base case
24. Use of a function or method without knowing how it's accomplished
big o
procedural abstraction
operator
complex data type
25. A classification of objects into a tree structure that groups related objects
merge
taxonomy
node
data abstraction
26. 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
simple data type
boxed number
object
complex data type
27. A tree node containing a contents value but with no children
root
intractable
leaf
divide and conquer
28. Describes a function that modifies its arguments
scope
leaf
filter
destructive
29. The top node of a tree - from which all other nodes can be reached
stack space
constructive
root
interior node
30. A list of pairs - where each pair has a key and a value associated with the key
big o
association list
entinel
preorder
31. A problem whose solution requires a linear amount of time or space if the problem is size n
reference
boxed number
backtrack
linear O(n)
32. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
leaf
random access
set difference
root
33. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
side-effect
intractable
filter
complex data type
34. In a tree - a node pointed to by a parent node
link
child
shadow
well-founded ordering xml
35. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
type
linear O(n)
tail recursive
alias
36. A variable containing the address of other data
complex data type
shadow
pointer
stack
37. A stack containing a stack frame of variable value for each active invocation of procedure
stack frame
procedural abstraction
runtime stack
binary tree
38. 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
leaf
search
data abstraction
binary tree
39. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
divide and conquer
well-founded ordering xml
big o
search
40. A node of a tree that has children
interior node
parent
child
search
41. The number of links between the root of a tree and the leaves
constructive
depth
circularly linked list
union
42. In a tree search - to move back from the node currently being examined to its parent
data type
null dereference
divide and conquer
backtrack
43. An order of processing a tree in which the parent node is processed after its children
runtime stack
postorder
node
stack
44. Separation of the properties of a data type from its implementation
data abstraction
dereference
fair
garbage
45. An elements of a linked list - tree - or graph - often represented by a data structure
data abstraction
node
merge
array
46. Last in first out: describes the order of a stack
data structure
LIFO
filter
quadratic
47. Composed of a collection of data values; implemented with a data structure
interior node
procedural abstraction
complex ADT
stack space
48. In object oriented programming - a description of a set of similar objects
linked list
class
stack space
object
49. An order of processing a tree in which the parent node is processed before its children
preorder
well-founded ordering xml
stack
entinel
50. 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?"
reference
grammar
amortized Analysis
sort