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. Composed of individually named data fields
grammar
descendants
general list
simple ADT
2. A collection of values
side-effect
type
entinel
goal
3. In a search tree - a program that changes a state into a child state e.g a move in a game
operator
stack space
depth
data type
4. A case where a program calls itself
runtime stack
recursion
ancestors
garbage
5. To hide similar items with the same name
null dereference
ancestors
leaf
shadow
6. To convert from a pointer to the data that is pointed to
leaf
intersection
dereference
descendants
7. A linked list in which the last element points back to the first element
array
circularly linked list
garbage
constructive
8. Describes a function that modifies its arguments
destructive
boxed number
complex data type
design pattern
9. A pointer to data
algorithm
reference
sort
DFS
10. Use of a function or method without knowing how it's accomplished
inorder
recursive case
dictionary
procedural abstraction
11. First in first out: describes ordering of a queue
gedanken
intersection
sort
fifo
12. A problem whose solution requires a linear amount of time or space if the problem is size n
postorder
immutable
linear O(n)
big o
13. 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
amortized Analysis
grammar
binary search tree (bst)
destructive
14. A simple case that can be solved easily - without recursion
root
ancestors
base case
boxed number
15. A variable containing the address of other data
fifo
pointer
ancestors
sort
16. In a tree search - to move back from the node currently being examined to its parent
backtrack
intractable
quadratic
data type
17. 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
ontology
big o
gedanken
immutable
18. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
child
algorithm
shadow
stack
19. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
queue
branching factor
linear O(n)
operator
20. The amount of space on the runtime stack required for execution of a program
stack space
gedanken
shadow
fifo
21. A node of a tree that has children
interior node
array
grammar
reference
22. A linked list in which each elements has both forward and backward pointers
set difference
preorder
doubly linked list
postorder
23. A contiguous block of memory containing elements of the same type - accessed by numeric index
dereference
array
depth-first search
postorder
24. In a tree - a node pointed to by a parent node
queue
child
immutable
linear O(n)
25. A queue implemented within an array - where the first elements of the array logically follows the last elements
alias
structure sharing
immutable
circular queue
26. A condition of the input data where the data will be handled by call(s) to the same program
binary tree
taxonomy
procedural abstraction
recursive case
27. An order of processing a tree in which the parent node is processed after its children
entinel
postorder
constructive
child
28. A sequence of records - where each record contains a link to the next one
simple data type
stack space
dereference
linked list
29. 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
association list
reference type
data structure
30. A given collection of values along with a collection of operations for use on those values
descendants
abstract data type
data type
general list
31. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
LIFO
design pattern
complex ADT
data structure
32. A pattern that describes a set of similar programs
object
root
class
design pattern
33. An order of processing a tree in which the parent node is processed in between its children
link
side-effect
ontology
inorder
34. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
depth-first search
reference
backtrack
ontology
35. To look through a data structure until a goal object is found
big o
state
search
cons
36. A description of the state of a process such as a board game
alias
garbage
state
simple ADT
37. Values are in the most basic form and cannot be decomposed into smaller parts
inorder
garbage collection
simple data type
linked list
38. A case where tow data structures share some elements
pointer
union
structure sharing
merge
39. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
backtrack
immutable
union
stack
40. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
interior node
branching factor
array
grammar
41. Any container with linear ordering
stack
binary search tree (bst)
general list
shadow
42. First-child/next-sibling
algorithm
dereference
fair
root
43. A list of pairs - where each pair has a key and a value associated with the key
association list
complex ADT
boxed number
abstract data type
44. Composed of a collection of data values; implemented with a data structure
postorder
fifo
fair
complex ADT
45. Depth first search
circularly linked list
grammar
DFS
tail recursive
46. The next element in a linked list
node
successor
parent
abstract data type
47. Composed of multiple sequential elements stored in contiguous bytes of memory
array
cons
sort
operator
48. 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
LIFO
descendants
alias
49. The area of program text over which a variable can be referenced
association list
tail recursive
union
scope
50. 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
circular queue
interior node
preorder