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
filter
fifo
scope
data type
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?"
ancestors
amortized Analysis
array
parent
3. 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
circular queue
binary tree
amortized Analysis
simple ADT
4. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
search
algorithm
tail recursive
queue
5. A stack containing a stack frame of variable value for each active invocation of procedure
runtime stack
state
reference type
fifo
6. Values are in the most basic form and cannot be decomposed into smaller parts
circular queue
child
garbage collection
simple data type
7. In a tree search - to move back from the node currently being examined to its parent
backtrack
array
null dereference
data structure
8. A queue implemented within an array - where the first elements of the array logically follows the last elements
operator
reference
circular queue
recursion
9. A condition of the input data where the data will be handled by call(s) to the same program
cons
recursive case
dereference
base case
10. A simple case that can be solved easily - without recursion
object
cons
base case
side-effect
11. Any container with linear ordering
simple data type
state
LIFO
general list
12. A section of the runtime stack holding the values of all variables for one invocation
recursive case
garbage
big o
stack frame
13. A tree node containing a contents value but with no children
type
leaf
quadratic
stack frame
14. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
preorder
data abstraction
sort
doubly linked list
15. Use of a function or method without knowing how it's accomplished
procedural abstraction
grammar
leaf
intersection
16. Composed of individually named data fields
simple ADT
alias
data abstraction
pointer
17. A given collection of values along with a collection of operations for use on those values
linear O(n)
amortized Analysis
fair
data type
18. A pointer to the next element in a linked list
cons
filter
linear O(n)
link
19. Last in first out: describes the order of a stack
depth
set difference
LIFO
preorder
20. A runtime error that occurs when an operation such as method call is attempted on a null pointer
null dereference
binary search tree (bst)
garbage collection
random access
21. 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
big o
quadratic
depth
postorder
22. A problem that is so hard that it cannot be solved unless the problem is small
intractable
circular queue
goal
recursive case
23. A classification of objects into a tree structure that groups related objects
taxonomy
grammar
garbage collection
divide and conquer
24. storage that is no longer pointed to by any variable and therefore can no longer be accessed
binary search tree (bst)
recursion
garbage
descendants
25. A case where a program calls itself
node
class
recursion
doubly linked list
26. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
branching factor
general list
ontology
union
27. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
amortized Analysis
divide and conquer
root
stack frame
28. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
depth-first search
link
tail recursive
quadratic
29. A description of operations on a data type that could have multiple possible implementations
random access
sort
abstract data type
algorithm
30. Describes a function that modifies its arguments
procedural abstraction
stack space
reference
destructive
31. In a tree - a node that points to a given node
type
parent
design pattern
algorithm
32. The number of links between the root of a tree and the leaves
doubly linked list
random access
grammar
depth
33. In object oriented programming - a description of a set of similar objects
class
preorder
set difference
intractable
34. 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
simple ADT
filter
binary tree
35. Given two sets -the union is the set of elements that are members of either set
link
linear O(n)
union
shadow
36. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
grammar
data structure
state
queue
37. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
binary search tree (bst)
postorder
ontology
side-effect
38. A data structure that can be identified at runtime as being a member of a class
object
side-effect
reference
branching factor
39. A list of pairs - where each pair has a key and a value associated with the key
association list
general list
pointer
big o
40. In a search tree - a program that changes a state into a child state e.g a move in a game
operator
postorder
depth
well-founded ordering xml
41. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
grammar
interior node
design pattern
link
42. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
alias
side-effect
data structure
set difference
43. The process of collecting garbage for recycling
garbage collection
child
preorder
array
44. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
filter
ontology
runtime stack
immutable
45. A pointer to data
data structure
data abstraction
reference
divide and conquer
46. A collection of objects that are inserted and removed according to the LIFO principle
leaf
base case
stack
stack frame
47. Given two sets - the intersection is the set of elements that are members of both sets
operator
data type
intersection
object
48. In a tree - a node pointed to by a parent node
doubly linked list
ancestors
destructive
child
49. To look through a data structure until a goal object is found
postorder
search
association list
set difference
50. A search in which children of a node are considered before siblings are considered
pointer
procedural abstraction
recursive case
depth-first search