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. Composed of individually named data fields
simple ADT
union
backtrack
data type
2. Separation of the properties of a data type from its implementation
intersection
complex data type
binary search tree (bst)
data abstraction
3. Use of a function or method without knowing how it's accomplished
interior node
data abstraction
procedural abstraction
reference
4. A search in which children of a node are considered before siblings are considered
search
complex data type
depth-first search
linear O(n)
5. An order of processing a tree in which the parent node is processed before its children
preorder
sort
ontology
procedural abstraction
6. A condition of the input data where the data will be handled by call(s) to the same program
circularly linked list
link
preorder
recursive case
7. A problem that is so hard that it cannot be solved unless the problem is small
queue
intractable
leaf
general list
8. A pointer to data
DFS
reference
gedanken
simple data type
9. An order of processing a tree in which the parent node is processed in between its children
intersection
algorithm
inorder
gedanken
10. Given two sets - the intersection is the set of elements that are members of both sets
reference type
recursive case
intersection
operator
11. An item (or description of items) being sough in a search
scope
goal
general list
side-effect
12. Container for storing a collection of data in unique key/value pairs
node
dictionary
depth
fair
13. Depth first search
queue
circular queue
class
DFS
14. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
simple ADT
parent
sort
amortized Analysis
15. A problem whose solution requires a linear amount of time or space if the problem is size n
recursive case
cons
circularly linked list
linear O(n)
16. A sequence of records - where each record contains a link to the next one
linked list
reference
interior node
search
17. The process of collecting garbage for recycling
array
complex data type
divide and conquer
garbage collection
18. 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
leaf
successor
binary search tree (bst)
reference type
19. Describes a data structure or device in which all accesses have the same cost - O(1)
alias
random access
simple ADT
filter
20. A simple case that can be solved easily - without recursion
constructive
array
intersection
base case
21. 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
reference
null dereference
intractable
boxed number
22. In a tree search - to move back from the node currently being examined to its parent
backtrack
garbage
tail recursive
intractable
23. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
reference type
tail recursive
doubly linked list
filter
24. The area of program text over which a variable can be referenced
scope
garbage
taxonomy
array
25. 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
garbage
operator
intractable
26. Describes a function that makes a new data structure but does not modify its arguments
shadow
preorder
constructive
complex ADT
27. 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
descendants
reference type
doubly linked list
pointer
28. A linked list in which the last element points back to the first element
successor
ancestors
circularly linked list
dictionary
29. 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
base case
filter
stack
30. An elements of a linked list - tree - or graph - often represented by a data structure
scope
entinel
node
interior node
31. 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
quadratic
ancestors
binary tree
depth
32. Composed of multiple sequential elements stored in contiguous bytes of memory
array
side-effect
successor
descendants
33. Describes a though experiment or view of an entity
leaf
gedanken
random access
big o
34. Any container with linear ordering
binary tree
general list
grammar
algorithm
35. A given collection of values along with a collection of operations for use on those values
dictionary
binary tree
array
data type
36. A variable containing the address of other data
stack
pointer
root
branching factor
37. A collection of values
abstract data type
type
data type
depth-first search
38. To combine two ordered linear structures into one
doubly linked list
cons
merge
data abstraction
39. An order of processing a tree in which the parent node is processed after its children
fifo
postorder
linked list
algorithm
40. A runtime error that occurs when an operation such as method call is attempted on a null pointer
doubly linked list
null dereference
leaf
complex data type
41. A case where a program calls itself
set difference
search
recursion
pointer
42. Constructed of multiple components (simple or complex types)
fair
immutable
gedanken
complex data type
43. In object oriented programming - a description of a set of similar objects
data structure
descendants
scope
class
44. In a tree - a node pointed to by a parent node
leaf
child
cons
algorithm
45. A section of the runtime stack holding the values of all variables for one invocation
garbage collection
gedanken
stack frame
procedural abstraction
46. To hide similar items with the same name
root
goal
shadow
alias
47. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
garbage
dereference
stack frame
queue
48. Last in first out: describes the order of a stack
LIFO
garbage
reference
dereference
49. The next element in a linked list
data type
reference
stack
successor
50. In a search tree - a program that changes a state into a child state e.g a move in a game
backtrack
array
goal
operator