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 pointer to the next element in a linked list
link
depth
runtime stack
interior node
2. A linked list in which each elements has both forward and backward pointers
descendants
well-founded ordering xml
doubly linked list
queue
3. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
big o
quadratic
descendants
type
4. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
well-founded ordering xml
simple ADT
amortized Analysis
divide and conquer
5. The area of program text over which a variable can be referenced
quadratic
scope
divide and conquer
array
6. Use of a function or method without knowing how it's accomplished
stack space
design pattern
procedural abstraction
association list
7. A case where tow data structures share some elements
well-founded ordering xml
structure sharing
garbage collection
descendants
8. In a tree search - to move back from the node currently being examined to its parent
big o
scope
backtrack
algorithm
9. 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
simple data type
binary search tree (bst)
runtime stack
stack
10. First in first out: describes ordering of a queue
union
operator
alias
fifo
11. A tree node containing a contents value but with no children
set difference
binary search tree (bst)
leaf
LIFO
12. A simple case that can be solved easily - without recursion
base case
random access
amortized Analysis
root
13. 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
runtime stack
simple ADT
parent
binary tree
14. In a tree - a node pointed to by a parent node
child
leaf
intractable
garbage collection
15. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
null dereference
pointer
state
algorithm
16. A contiguous block of memory containing elements of the same type - accessed by numeric index
well-founded ordering xml
cons
reference type
array
17. Constructed of multiple components (simple or complex types)
well-founded ordering xml
divide and conquer
LIFO
complex data type
18. Depth first search
entinel
garbage
cons
DFS
19. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
random access
ontology
set difference
tail recursive
20. A section of the runtime stack holding the values of all variables for one invocation
stack frame
backtrack
fifo
node
21. A list of pairs - where each pair has a key and a value associated with the key
design pattern
child
filter
association list
22. An order of processing a tree in which the parent node is processed after its children
design pattern
doubly linked list
postorder
type
23. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
set difference
intersection
sort
recursive case
24. Values are in the most basic form and cannot be decomposed into smaller parts
immutable
interior node
runtime stack
simple data type
25. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
taxonomy
data structure
well-founded ordering xml
immutable
26. storage that is no longer pointed to by any variable and therefore can no longer be accessed
garbage
parent
array
design pattern
27. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
quadratic
set difference
algorithm
immutable
28. Any container with linear ordering
pointer
interior node
data abstraction
general list
29. To hide similar items with the same name
shadow
dereference
pointer
set difference
30. The amount of space on the runtime stack required for execution of a program
quadratic
union
stack space
circularly linked list
31. The process of collecting garbage for recycling
divide and conquer
simple ADT
node
garbage collection
32. A pointer to data
constructive
backtrack
entinel
reference
33. 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?"
amortized Analysis
immutable
sort
root
34. 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
type
intractable
reference type
design pattern
35. A linked list in which the last element points back to the first element
general list
circularly linked list
constructive
fair
36. 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
immutable
cons
preorder
grammar
37. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
queue
link
immutable
divide and conquer
38. Composed of individually named data fields
simple ADT
stack space
association list
intractable
39. 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
ancestors
big o
circularly linked list
40. In a tree - the union of a node's parent and the parent's ancestors
intractable
general list
ancestors
reference type
41. In a search tree - a program that changes a state into a child state e.g a move in a game
recursive case
data structure
operator
alias
42. In object oriented programming - a description of a set of similar objects
design pattern
child
node
class
43. 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
branching factor
object
merge
pointer
44. A problem that is so hard that it cannot be solved unless the problem is small
queue
dereference
intractable
leaf
45. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
array
grammar
interior node
successor
46. Two variables that reference the same object
class
linear O(n)
alias
union
47. Composed of a collection of data values; implemented with a data structure
complex ADT
root
ontology
depth
48. A description of the state of a process such as a board game
abstract data type
state
recursive case
simple data type
49. A condition of the input data where the data will be handled by call(s) to the same program
successor
recursive case
amortized Analysis
merge
50. A description of operations on a data type that could have multiple possible implementations
LIFO
abstract data type
backtrack
dictionary