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. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
simple data type
entinel
data type
sort
2. A problem that is so hard that it cannot be solved unless the problem is small
intractable
link
alias
reference
3. A simple case that can be solved easily - without recursion
base case
abstract data type
doubly linked list
destructive
4. The amount of space on the runtime stack required for execution of a program
branching factor
stack space
recursive case
circular queue
5. A collection of values
merge
type
class
fair
6. A stack containing a stack frame of variable value for each active invocation of procedure
merge
destructive
pointer
runtime stack
7. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
quadratic
fair
binary tree
dereference
8. A description of the state of a process such as a board game
stack frame
state
entinel
tail recursive
9. To look through a data structure until a goal object is found
search
alias
recursion
descendants
10. A description of operations on a data type that could have multiple possible implementations
abstract data type
simple ADT
parent
operator
11. First-child/next-sibling
leaf
null dereference
fair
data structure
12. A case where tow data structures share some elements
structure sharing
immutable
DFS
array
13. A linked list in which the last element points back to the first element
circularly linked list
destructive
algorithm
array
14. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
stack frame
divide and conquer
ontology
base case
15. A condition of the input data where the data will be handled by call(s) to the same program
null dereference
garbage collection
type
recursive case
16. First in first out: describes ordering of a queue
stack
pointer
descendants
fifo
17. A classification of objects into a tree structure that groups related objects
type
fair
fifo
taxonomy
18. Two variables that reference the same object
alias
postorder
association list
circularly linked list
19. To combine two ordered linear structures into one
merge
simple ADT
recursion
root
20. A variable containing the address of other data
pointer
garbage
inorder
parent
21. An order of processing a tree in which the parent node is processed in between its children
inorder
stack
cons
filter
22. A node of a tree that has children
interior node
queue
algorithm
search
23. Describes a function that makes a new data structure but does not modify its arguments
depth-first search
procedural abstraction
constructive
pointer
24. Composed of multiple sequential elements stored in contiguous bytes of memory
operator
successor
array
dictionary
25. Depth first search
DFS
class
base case
intersection
26. A collection of objects that are inserted and removed according to the LIFO principle
runtime stack
stack
simple ADT
search
27. A pointer to the next element in a linked list
link
big o
dictionary
data type
28. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
immutable
structure sharing
object
tail recursive
29. A linked list in which each elements has both forward and backward pointers
stack
random access
doubly linked list
null dereference
30. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
ancestors
simple ADT
fifo
set difference
31. The area of program text over which a variable can be referenced
dereference
postorder
scope
divide and conquer
32. Separation of the properties of a data type from its implementation
amortized Analysis
parent
data abstraction
side-effect
33. Composed of individually named data fields
type
simple ADT
gedanken
circularly linked list
34. In a tree search - to move back from the node currently being examined to its parent
backtrack
recursive case
preorder
array
35. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
constructive
union
type
queue
36. 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
class
structure sharing
reference type
37. All nodes below a give node in a tree
state
dereference
stack space
descendants
38. A list of pairs - where each pair has a key and a value associated with the key
reference type
branching factor
association list
complex ADT
39. 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
circular queue
reference type
fair
data structure
40. A runtime error that occurs when an operation such as method call is attempted on a null pointer
simple data type
null dereference
constructive
garbage collection
41. storage that is no longer pointed to by any variable and therefore can no longer be accessed
garbage
depth
amortized Analysis
depth-first search
42. A problem whose solution requires a linear amount of time or space if the problem is size n
depth-first search
successor
linear O(n)
stack frame
43. In a search tree - a program that changes a state into a child state e.g a move in a game
operator
boxed number
fifo
stack
44. In a tree - the union of a node's parent and the parent's ancestors
ancestors
cons
state
dictionary
45. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
association list
side-effect
DFS
binary tree
46. 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
boxed number
DFS
set difference
grammar
47. A contiguous block of memory containing elements of the same type - accessed by numeric index
immutable
array
set difference
circularly linked list
48. Last in first out: describes the order of a stack
stack frame
LIFO
boxed number
union
49. To hide similar items with the same name
recursion
stack space
shadow
fair
50. An extra record at the start or end of a data structure such as a linked list - to simplify processing
intractable
entinel
stack space
binary search tree (bst)