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 sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
algorithm
interior node
operator
successor
2. Describes a though experiment or view of an entity
data abstraction
class
gedanken
shadow
3. The number of links between the root of a tree and the leaves
LIFO
leaf
depth
descendants
4. A collection of objects that are inserted and removed according to the LIFO principle
search
stack
recursion
abstract data type
5. 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
linked list
amortized Analysis
boxed number
descendants
6. The process of collecting garbage for recycling
filter
garbage collection
type
abstract data type
7. A search in which children of a node are considered before siblings are considered
depth-first search
amortized Analysis
DFS
dereference
8. A tree node containing a contents value but with no children
leaf
reference type
circular queue
gedanken
9. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
side-effect
dictionary
amortized Analysis
link
10. Values are in the most basic form and cannot be decomposed into smaller parts
recursive case
tail recursive
linear O(n)
simple data type
11. Composed of multiple sequential elements stored in contiguous bytes of memory
big o
array
quadratic
simple ADT
12. A pointer to data
reference
doubly linked list
null dereference
ancestors
13. In a search tree - a program that changes a state into a child state e.g a move in a game
constructive
intersection
operator
class
14. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
constructive
tail recursive
data structure
entinel
15. Last in first out: describes the order of a stack
LIFO
circularly linked list
simple ADT
abstract data type
16. A contiguous block of memory containing elements of the same type - accessed by numeric index
array
filter
entinel
descendants
17. A simple case that can be solved easily - without recursion
base case
tail recursive
random access
complex ADT
18. An order of processing a tree in which the parent node is processed in between its children
preorder
inorder
set difference
reference type
19. The top node of a tree - from which all other nodes can be reached
garbage
tail recursive
linked list
root
20. An extra record at the start or end of a data structure such as a linked list - to simplify processing
entinel
constructive
sort
object
21. 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
amortized Analysis
shadow
linked list
22. Depth first search
data structure
binary tree
inorder
DFS
23. Describes a data structure or device in which all accesses have the same cost - O(1)
random access
design pattern
backtrack
general list
24. An elements of a linked list - tree - or graph - often represented by a data structure
linked list
node
intersection
LIFO
25. The next element in a linked list
backtrack
successor
alias
big o
26. A problem that is so hard that it cannot be solved unless the problem is small
entinel
intractable
garbage collection
inorder
27. Describes a function that makes a new data structure but does not modify its arguments
class
procedural abstraction
reference
constructive
28. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
ancestors
set difference
destructive
depth
29. Container for storing a collection of data in unique key/value pairs
parent
dictionary
class
garbage
30. 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
garbage
reference type
array
side-effect
31. The amount of space on the runtime stack required for execution of a program
stack space
amortized Analysis
depth-first search
divide and conquer
32. Given two sets - the intersection is the set of elements that are members of both sets
immutable
destructive
intersection
search
33. A process that removes unwanted elements from a collection
linear O(n)
filter
ancestors
inorder
34. Given two sets -the union is the set of elements that are members of either set
simple ADT
union
amortized Analysis
successor
35. 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
queue
intersection
recursion
cons
36. A pattern that describes a set of similar programs
design pattern
data type
intractable
recursive case
37. In a tree - a node that points to a given node
goal
set difference
simple ADT
parent
38. Describes a function that modifies its arguments
ontology
destructive
data abstraction
fair
39. A condition of the input data where the data will be handled by call(s) to the same program
DFS
sort
recursive case
reference type
40. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
backtrack
stack frame
descendants
grammar
41. 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
stack space
depth-first search
binary search tree (bst)
child
42. A description of operations on a data type that could have multiple possible implementations
descendants
abstract data type
dereference
alias
43. A description of the state of a process such as a board game
descendants
dereference
state
cons
44. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
data type
structure sharing
quadratic
goal
45. 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
ontology
tail recursive
doubly linked list
46. 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
intersection
grammar
design pattern
branching factor
47. An order of processing a tree in which the parent node is processed after its children
tail recursive
procedural abstraction
association list
postorder
48. Any container with linear ordering
general list
depth-first search
link
simple data type
49. A collection of values
postorder
constructive
type
runtime stack
50. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
general list
stack
immutable
doubly linked list