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 section of the runtime stack holding the values of all variables for one invocation
LIFO
procedural abstraction
stack frame
alias
2. A search in which children of a node are considered before siblings are considered
recursion
operator
depth-first search
object
3. A pointer to the next element in a linked list
tail recursive
shadow
type
link
4. A variable containing the address of other data
pointer
binary tree
structure sharing
linear O(n)
5. 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
search
cons
linear O(n)
array
6. The area of program text over which a variable can be referenced
root
data structure
scope
data abstraction
7. A process that removes unwanted elements from a collection
filter
array
quadratic
stack
8. A given collection of values along with a collection of operations for use on those values
dictionary
grammar
data type
quadratic
9. A sequence of records - where each record contains a link to the next one
data structure
linked list
runtime stack
structure sharing
10. A linked list in which the last element points back to the first element
circularly linked list
stack space
preorder
simple ADT
11. An order of processing a tree in which the parent node is processed in between its children
inorder
circular queue
runtime stack
stack space
12. To convert from a pointer to the data that is pointed to
general list
abstract data type
dereference
stack
13. 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
runtime stack
structure sharing
intersection
branching factor
14. A type in which variables of that type are pointers to objects. in the code integer i = 3 - the variable i holds a pointer to the integer object that contains the value. in in j = 3 - the variable j contains the value. in java - only reference types
reference type
side-effect
state
data structure
15. A runtime error that occurs when an operation such as method call is attempted on a null pointer
intersection
complex ADT
null dereference
reference type
16. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
tail recursive
garbage
immutable
big o
17. A linked list in which each elements has both forward and backward pointers
doubly linked list
data structure
parent
complex data type
18. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
design pattern
base case
array
tail recursive
19. A list of pairs - where each pair has a key and a value associated with the key
null dereference
association list
ancestors
inorder
20. A problem whose solution requires a linear amount of time or space if the problem is size n
union
linear O(n)
stack
link
21. The number of links between the root of a tree and the leaves
object
depth
merge
simple ADT
22. All nodes below a give node in a tree
DFS
circularly linked list
descendants
destructive
23. A queue implemented within an array - where the first elements of the array logically follows the last elements
circular queue
base case
linked list
well-founded ordering xml
24. Separation of the properties of a data type from its implementation
stack space
data abstraction
recursive case
parent
25. A case where a program calls itself
goal
set difference
recursion
entinel
26. An order of processing a tree in which the parent node is processed before its children
stack
general list
preorder
sort
27. A description of operations on a data type that could have multiple possible implementations
abstract data type
merge
descendants
linked list
28. Composed of multiple sequential elements stored in contiguous bytes of memory
abstract data type
reference type
structure sharing
array
29. Container for storing a collection of data in unique key/value pairs
dictionary
taxonomy
alias
child
30. First in first out: describes ordering of a queue
structure sharing
pointer
fifo
general list
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?"
boxed number
structure sharing
amortized Analysis
quadratic
32. 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
intersection
big o
design pattern
reference
33. In object oriented programming - a description of a set of similar objects
class
stack frame
set difference
intersection
34. Describes a function that modifies its arguments
abstract data type
array
parent
destructive
35. An item (or description of items) being sough in a search
dictionary
ancestors
null dereference
goal
36. A data structure that can be identified at runtime as being a member of a class
random access
object
binary tree
simple data type
37. Composed of a collection of data values; implemented with a data structure
complex ADT
intersection
descendants
child
38. In a tree - the union of a node's parent and the parent's ancestors
filter
ancestors
complex ADT
binary search tree (bst)
39. Any container with linear ordering
general list
base case
association list
state
40. Describes a though experiment or view of an entity
gedanken
goal
parent
binary search tree (bst)
41. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
interior node
abstract data type
shadow
grammar
42. In a tree - a node pointed to by a parent node
successor
interior node
operator
child
43. Depth first search
DFS
data type
doubly linked list
amortized Analysis
44. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
union
set difference
fifo
garbage collection
45. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
root
queue
branching factor
pointer
46. A problem that is so hard that it cannot be solved unless the problem is small
alias
scope
linear O(n)
intractable
47. Two variables that reference the same object
merge
quadratic
search
alias
48. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
dictionary
recursive case
ontology
linear O(n)
49. A case where tow data structures share some elements
abstract data type
garbage collection
structure sharing
amortized Analysis
50. An elements of a linked list - tree - or graph - often represented by a data structure
union
doubly linked list
ancestors
node