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. All nodes below a give node in a tree
descendants
array
tail recursive
sort
2. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
runtime stack
queue
garbage collection
fair
3. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
alias
algorithm
reference type
link
4. The top node of a tree - from which all other nodes can be reached
set difference
linked list
side-effect
root
5. Separation of the properties of a data type from its implementation
general list
data abstraction
merge
intersection
6. A case where tow data structures share some elements
structure sharing
alias
child
recursion
7. An order of processing a tree in which the parent node is processed in between its children
reference type
inorder
stack
boxed number
8. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
alias
grammar
base case
goal
9. Describes a function that modifies its arguments
descendants
merge
union
destructive
10. The area of program text over which a variable can be referenced
type
state
stack space
scope
11. A collection of objects that are inserted and removed according to the LIFO principle
object
merge
complex ADT
stack
12. 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?"
interior node
postorder
backtrack
amortized Analysis
13. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
fair
cons
well-founded ordering xml
quadratic
14. Two variables that reference the same object
successor
alias
boxed number
stack
15. In a tree - a node pointed to by a parent node
dereference
reference type
child
abstract data type
16. 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
fifo
DFS
boxed number
amortized Analysis
17. A sequence of records - where each record contains a link to the next one
depth
big o
constructive
linked list
18. A given collection of values along with a collection of operations for use on those values
data type
destructive
shadow
gedanken
19. First in first out: describes ordering of a queue
complex data type
union
fifo
link
20. Depth first search
DFS
depth-first search
state
merge
21. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
set difference
ontology
design pattern
tail recursive
22. Composed of multiple sequential elements stored in contiguous bytes of memory
base case
gedanken
array
doubly linked list
23. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
scope
reference
well-founded ordering xml
child
24. A section of the runtime stack holding the values of all variables for one invocation
filter
stack frame
recursion
gedanken
25. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
side-effect
set difference
depth-first search
linear O(n)
26. A condition of the input data where the data will be handled by call(s) to the same program
inorder
search
recursive case
queue
27. Use of a function or method without knowing how it's accomplished
stack
procedural abstraction
constructive
intractable
28. A pointer to the next element in a linked list
backtrack
null dereference
structure sharing
link
29. In a tree - the union of a node's parent and the parent's ancestors
fifo
reference
ancestors
entinel
30. A linked list in which each elements has both forward and backward pointers
link
depth-first search
branching factor
doubly linked list
31. An item (or description of items) being sough in a search
array
goal
immutable
ontology
32. In object oriented programming - a description of a set of similar objects
interior node
class
linear O(n)
recursion
33. To hide similar items with the same name
data type
divide and conquer
shadow
LIFO
34. A queue implemented within an array - where the first elements of the array logically follows the last elements
depth
queue
circular queue
stack frame
35. A stack containing a stack frame of variable value for each active invocation of procedure
abstract data type
tail recursive
runtime stack
ontology
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
intractable
garbage collection
set difference
37. 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
circularly linked list
branching factor
stack space
constructive
38. Describes a though experiment or view of an entity
filter
gedanken
simple data type
backtrack
39. A linked list in which the last element points back to the first element
garbage collection
queue
backtrack
circularly linked list
40. A contiguous block of memory containing elements of the same type - accessed by numeric index
array
simple ADT
data type
linked list
41. Values are in the most basic form and cannot be decomposed into smaller parts
simple data type
fair
circular queue
null dereference
42. An order of processing a tree in which the parent node is processed before its children
boxed number
preorder
runtime stack
complex ADT
43. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
alias
data structure
sort
divide and conquer
44. 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
node
simple data type
quadratic
45. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
data type
immutable
set difference
data structure
46. A description of the state of a process such as a board game
simple data type
array
well-founded ordering xml
state
47. Describes a data structure or device in which all accesses have the same cost - O(1)
random access
object
data abstraction
general list
48. An elements of a linked list - tree - or graph - often represented by a data structure
fifo
null dereference
node
recursion
49. A node of a tree that has children
array
interior node
cons
random access
50. Constructed of multiple components (simple or complex types)
complex data type
inorder
boxed number
union