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 runtime error that occurs when an operation such as method call is attempted on a null pointer
object
null dereference
state
reference type
2. 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
taxonomy
scope
simple ADT
3. Use of a function or method without knowing how it's accomplished
procedural abstraction
simple data type
sort
root
4. A section of the runtime stack holding the values of all variables for one invocation
search
stack frame
stack
null dereference
5. A pattern that describes a set of similar programs
design pattern
queue
base case
divide and conquer
6. Describes a function that makes a new data structure but does not modify its arguments
depth-first search
constructive
shadow
data abstraction
7. A classification of objects into a tree structure that groups related objects
interior node
set difference
linear O(n)
taxonomy
8. 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
linked list
abstract data type
structure sharing
9. A condition of the input data where the data will be handled by call(s) to the same program
operator
recursive case
depth-first search
merge
10. The number of links between the root of a tree and the leaves
structure sharing
data abstraction
tail recursive
depth
11. A problem that is so hard that it cannot be solved unless the problem is small
intractable
tail recursive
postorder
link
12. Describes a data structure or device in which all accesses have the same cost - O(1)
linked list
design pattern
intractable
random access
13. A description of operations on a data type that could have multiple possible implementations
binary tree
abstract data type
well-founded ordering xml
interior node
14. An item (or description of items) being sough in a search
search
doubly linked list
goal
parent
15. storage that is no longer pointed to by any variable and therefore can no longer be accessed
parent
link
garbage collection
garbage
16. A queue implemented within an array - where the first elements of the array logically follows the last elements
type
divide and conquer
fifo
circular queue
17. An extra record at the start or end of a data structure such as a linked list - to simplify processing
root
entinel
simple ADT
merge
18. A search in which children of a node are considered before siblings are considered
general list
simple data type
depth-first search
tail recursive
19. 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
reference type
pointer
association list
circular queue
20. 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
tail recursive
recursion
boxed number
fair
21. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
stack
reference type
queue
object
22. To hide similar items with the same name
linked list
reference type
parent
shadow
23. In a tree search - to move back from the node currently being examined to its parent
backtrack
circularly linked list
association list
child
24. A data structure that can be identified at runtime as being a member of a class
runtime stack
object
array
leaf
25. A case where a program calls itself
alias
recursion
fifo
runtime stack
26. A pointer to the next element in a linked list
circular queue
goal
ancestors
link
27. In a tree - the union of a node's parent and the parent's ancestors
constructive
ancestors
depth-first search
recursive case
28. An order of processing a tree in which the parent node is processed before its children
ontology
preorder
interior node
grammar
29. 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
dereference
amortized Analysis
circularly linked list
branching factor
30. First-child/next-sibling
fair
set difference
intractable
descendants
31. The next element in a linked list
scope
ontology
successor
simple data type
32. Describes a though experiment or view of an entity
intersection
gedanken
stack space
DFS
33. Any container with linear ordering
general list
recursive case
design pattern
union
34. An order of processing a tree in which the parent node is processed in between its children
queue
inorder
array
binary tree
35. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
quadratic
circular queue
array
type
36. To look through a data structure until a goal object is found
complex ADT
search
inorder
cons
37. In object oriented programming - a description of a set of similar objects
object
class
immutable
descendants
38. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
well-founded ordering xml
circular queue
divide and conquer
depth-first search
39. 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)
amortized Analysis
set difference
general list
40. Last in first out: describes the order of a stack
taxonomy
association list
interior node
LIFO
41. The area of program text over which a variable can be referenced
operator
scope
linear O(n)
descendants
42. Describes a function that modifies its arguments
intractable
interior node
taxonomy
destructive
43. Composed of multiple sequential elements stored in contiguous bytes of memory
array
goal
parent
destructive
44. All nodes below a give node in a tree
descendants
null dereference
data abstraction
inorder
45. 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
child
stack space
design pattern
binary tree
46. In a tree - a node that points to a given node
dictionary
doubly linked list
parent
linear O(n)
47. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
stack frame
ancestors
sort
structure sharing
48. A case where tow data structures share some elements
interior node
descendants
data abstraction
structure sharing
49. A sequence of records - where each record contains a link to the next one
simple ADT
divide and conquer
state
linked list
50. 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?"
constructive
descendants
preorder
amortized Analysis