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. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
immutable
data structure
reference type
stack frame
2. Describes a though experiment or view of an entity
fair
side-effect
child
gedanken
3. First-child/next-sibling
inorder
linked list
link
fair
4. The top node of a tree - from which all other nodes can be reached
stack frame
immutable
root
constructive
5. A stack containing a stack frame of variable value for each active invocation of procedure
runtime stack
dereference
branching factor
intersection
6. An elements of a linked list - tree - or graph - often represented by a data structure
node
random access
link
shadow
7. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
association list
intersection
simple data type
data structure
8. A simple case that can be solved easily - without recursion
complex data type
base case
circularly linked list
array
9. A linked list in which each elements has both forward and backward pointers
operator
taxonomy
entinel
doubly linked list
10. Describes a function that makes a new data structure but does not modify its arguments
sort
cons
destructive
constructive
11. A pointer to data
filter
merge
garbage
reference
12. An item (or description of items) being sough in a search
goal
reference type
child
taxonomy
13. In a tree search - to move back from the node currently being examined to its parent
child
operator
backtrack
binary tree
14. A problem that is so hard that it cannot be solved unless the problem is small
ancestors
intractable
child
set difference
15. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
divide and conquer
class
binary search tree (bst)
linear O(n)
16. Describes a function that modifies its arguments
merge
destructive
ontology
reference type
17. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
fifo
side-effect
design pattern
recursive case
18. Container for storing a collection of data in unique key/value pairs
dictionary
successor
side-effect
abstract data type
19. Any container with linear ordering
general list
simple ADT
node
circularly linked list
20. A node of a tree that has children
interior node
structure sharing
node
branching factor
21. A tree node containing a contents value but with no children
destructive
simple data type
simple ADT
leaf
22. 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
interior node
amortized Analysis
complex ADT
reference type
23. A given collection of values along with a collection of operations for use on those values
gedanken
cons
data type
simple data type
24. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
quadratic
linked list
reference
tail recursive
25. Values are in the most basic form and cannot be decomposed into smaller parts
simple data type
state
dereference
abstract data type
26. To convert from a pointer to the data that is pointed to
general list
taxonomy
dereference
inorder
27. 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
data structure
postorder
boxed number
depth
28. In a search tree - a program that changes a state into a child state e.g a move in a game
operator
data structure
backtrack
merge
29. 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
binary search tree (bst)
interior node
fifo
cons
30. In a tree - a node pointed to by a parent node
child
merge
set difference
data structure
31. Two variables that reference the same object
side-effect
binary tree
alias
destructive
32. The next element in a linked list
successor
general list
descendants
backtrack
33. Depth first search
DFS
runtime stack
structure sharing
set difference
34. The amount of space on the runtime stack required for execution of a program
stack space
data structure
complex ADT
algorithm
35. 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?"
cons
recursive case
amortized Analysis
constructive
36. In a tree - a node that points to a given node
grammar
random access
depth
parent
37. Composed of multiple sequential elements stored in contiguous bytes of memory
object
type
array
complex ADT
38. A data structure that can be identified at runtime as being a member of a class
preorder
linked list
object
taxonomy
39. Separation of the properties of a data type from its implementation
search
data abstraction
queue
stack space
40. A sequence of records - where each record contains a link to the next one
linked list
link
amortized Analysis
reference type
41. 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
grammar
taxonomy
big o
binary tree
42. Describes a data structure or device in which all accesses have the same cost - O(1)
garbage collection
general list
random access
destructive
43. A collection of objects that are inserted and removed according to the LIFO principle
quadratic
union
intersection
stack
44. 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
data structure
fair
tail recursive
45. The area of program text over which a variable can be referenced
node
structure sharing
amortized Analysis
scope
46. A runtime error that occurs when an operation such as method call is attempted on a null pointer
null dereference
child
side-effect
state
47. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
pointer
abstract data type
well-founded ordering xml
intractable
48. The number of links between the root of a tree and the leaves
data structure
postorder
depth
goal
49. Composed of a collection of data values; implemented with a data structure
goal
base case
successor
complex ADT
50. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
complex ADT
ontology
boxed number
garbage