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
node
class
set difference
2. An order of processing a tree in which the parent node is processed before its children
ontology
garbage collection
fifo
preorder
3. The number of links between the root of a tree and the leaves
binary search tree (bst)
goal
type
depth
4. Constructed of multiple components (simple or complex types)
complex data type
inorder
scope
data structure
5. Describes a data structure or device in which all accesses have the same cost - O(1)
filter
fifo
type
random access
6. Two variables that reference the same object
alias
grammar
set difference
recursive case
7. A node of a tree that has children
operator
interior node
shadow
backtrack
8. A collection of objects that are inserted and removed according to the LIFO principle
null dereference
taxonomy
amortized Analysis
stack
9. First in first out: describes ordering of a queue
inorder
linear O(n)
fifo
ancestors
10. A process that removes unwanted elements from a collection
gedanken
ancestors
fair
filter
11. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
grammar
side-effect
depth
fair
12. An extra record at the start or end of a data structure such as a linked list - to simplify processing
entinel
random access
taxonomy
interior node
13. In a search tree - a program that changes a state into a child state e.g a move in a game
boxed number
divide and conquer
stack
operator
14. A tree node containing a contents value but with no children
algorithm
leaf
stack
abstract data type
15. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
array
dereference
abstract data type
immutable
16. A simple case that can be solved easily - without recursion
design pattern
fair
backtrack
base case
17. storage that is no longer pointed to by any variable and therefore can no longer be accessed
simple data type
parent
garbage
recursion
18. Any container with linear ordering
amortized Analysis
destructive
reference
general list
19. 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?"
filter
structure sharing
set difference
amortized Analysis
20. Separation of the properties of a data type from its implementation
circular queue
data abstraction
goal
pointer
21. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
random access
sort
data type
circular queue
22. A description of the state of a process such as a board game
entinel
state
fair
operator
23. A contiguous block of memory containing elements of the same type - accessed by numeric index
array
leaf
stack frame
divide and conquer
24. 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
binary tree
DFS
linked list
base case
25. Composed of a collection of data values; implemented with a data structure
complex ADT
fair
leaf
branching factor
26. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
general list
set difference
node
inorder
27. A description of operations on a data type that could have multiple possible implementations
abstract data type
root
class
fifo
28. A pointer to data
array
grammar
reference
descendants
29. A case where a program calls itself
recursion
data abstraction
scope
state
30. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
data structure
side-effect
alias
search
31. 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
constructive
entinel
circularly linked list
32. A linked list in which the last element points back to the first element
linear O(n)
circularly linked list
interior node
simple data type
33. A linked list in which each elements has both forward and backward pointers
doubly linked list
linear O(n)
branching factor
taxonomy
34. A pointer to the next element in a linked list
link
structure sharing
object
goal
35. Container for storing a collection of data in unique key/value pairs
LIFO
dictionary
binary tree
child
36. An item (or description of items) being sough in a search
immutable
intractable
fair
goal
37. Composed of individually named data fields
child
doubly linked list
stack frame
simple ADT
38. An elements of a linked list - tree - or graph - often represented by a data structure
search
node
cons
ontology
39. A sequence of records - where each record contains a link to the next one
garbage collection
quadratic
data abstraction
linked list
40. The next element in a linked list
quadratic
postorder
successor
object
41. A stack containing a stack frame of variable value for each active invocation of procedure
LIFO
well-founded ordering xml
runtime stack
boxed number
42. A problem that is so hard that it cannot be solved unless the problem is small
cons
stack frame
fair
intractable
43. Composed of multiple sequential elements stored in contiguous bytes of memory
entinel
array
design pattern
null dereference
44. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
class
interior node
node
algorithm
45. A data structure that can be identified at runtime as being a member of a class
object
boxed number
garbage collection
data abstraction
46. To convert from a pointer to the data that is pointed to
object
dereference
linked list
pointer
47. A section of the runtime stack holding the values of all variables for one invocation
grammar
null dereference
filter
stack frame
48. The process of collecting garbage for recycling
alias
garbage collection
parent
DFS
49. An order of processing a tree in which the parent node is processed in between its children
preorder
operator
reference
inorder
50. To hide similar items with the same name
cons
fifo
shadow
random access