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 case where tow data structures share some elements
structure sharing
garbage
fifo
type
2. A pointer to the next element in a linked list
leaf
descendants
link
simple data type
3. Composed of individually named data fields
constructive
leaf
simple ADT
well-founded ordering xml
4. The top node of a tree - from which all other nodes can be reached
reference
root
object
data structure
5. Separation of the properties of a data type from its implementation
fair
data abstraction
cons
simple data type
6. Any container with linear ordering
runtime stack
general list
operator
linear O(n)
7. Describes a data structure or device in which all accesses have the same cost - O(1)
simple data type
tail recursive
random access
shadow
8. To combine two ordered linear structures into one
postorder
array
well-founded ordering xml
merge
9. The amount of space on the runtime stack required for execution of a program
DFS
ontology
shadow
stack space
10. In a tree - the union of a node's parent and the parent's ancestors
filter
abstract data type
doubly linked list
ancestors
11. 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
object
child
12. A sequence of records - where each record contains a link to the next one
linked list
gedanken
quadratic
base case
13. An extra record at the start or end of a data structure such as a linked list - to simplify processing
algorithm
union
entinel
data abstraction
14. A tree node containing a contents value but with no children
leaf
interior node
well-founded ordering xml
merge
15. A problem that is so hard that it cannot be solved unless the problem is small
data abstraction
descendants
backtrack
intractable
16. A runtime error that occurs when an operation such as method call is attempted on a null pointer
divide and conquer
filter
null dereference
general list
17. Last in first out: describes the order of a stack
array
data abstraction
postorder
LIFO
18. Values are in the most basic form and cannot be decomposed into smaller parts
postorder
simple ADT
pointer
simple data type
19. An item (or description of items) being sough in a search
ontology
parent
goal
null dereference
20. 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
filter
LIFO
cons
21. Given two sets - the intersection is the set of elements that are members of both sets
intractable
intersection
search
data abstraction
22. Container for storing a collection of data in unique key/value pairs
doubly linked list
dictionary
algorithm
intersection
23. A queue implemented within an array - where the first elements of the array logically follows the last elements
circular queue
class
parent
shadow
24. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
well-founded ordering xml
scope
depth-first search
stack frame
25. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
set difference
merge
depth
data structure
26. To hide similar items with the same name
state
doubly linked list
shadow
linear O(n)
27. Given two sets -the union is the set of elements that are members of either set
union
entinel
array
stack frame
28. First in first out: describes ordering of a queue
successor
leaf
fifo
reference
29. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
immutable
ontology
data type
root
30. All nodes below a give node in a tree
reference type
constructive
circularly linked list
descendants
31. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
immutable
inorder
postorder
grammar
32. A section of the runtime stack holding the values of all variables for one invocation
null dereference
stack frame
intersection
intractable
33. In object oriented programming - a description of a set of similar objects
filter
class
data structure
quadratic
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
sort
ontology
child
reference type
35. To look through a data structure until a goal object is found
stack
association list
random access
search
36. A description of the state of a process such as a board game
operator
linear O(n)
state
big o
37. In a search tree - a program that changes a state into a child state e.g a move in a game
operator
random access
gedanken
DFS
38. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
data type
algorithm
simple ADT
search
39. storage that is no longer pointed to by any variable and therefore can no longer be accessed
garbage
state
alias
data type
40. 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
type
binary search tree (bst)
reference
root
41. 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?"
reference type
amortized Analysis
preorder
design pattern
42. In a tree - a node that points to a given node
destructive
parent
merge
design pattern
43. A simple case that can be solved easily - without recursion
base case
LIFO
procedural abstraction
random access
44. An order of processing a tree in which the parent node is processed before its children
depth
preorder
structure sharing
runtime stack
45. Describes a function that makes a new data structure but does not modify its arguments
child
constructive
garbage
alias
46. A problem whose solution requires a linear amount of time or space if the problem is size n
linear O(n)
divide and conquer
side-effect
depth
47. 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
recursion
goal
entinel
48. A node of a tree that has children
stack frame
linked list
interior node
well-founded ordering xml
49. 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
child
filter
array
50. An order of processing a tree in which the parent node is processed after its children
leaf
fifo
simple ADT
postorder