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. An order of processing a tree in which the parent node is processed after its children
queue
search
postorder
algorithm
2. The process of collecting garbage for recycling
stack frame
dictionary
garbage collection
circular queue
3. To convert from a pointer to the data that is pointed to
interior node
object
depth
dereference
4. A data structure that can be identified at runtime as being a member of a class
node
tail recursive
object
taxonomy
5. The number of links between the root of a tree and the leaves
interior node
depth
data abstraction
reference type
6. All nodes below a give node in a tree
descendants
reference
pointer
child
7. To combine two ordered linear structures into one
merge
structure sharing
fair
sort
8. A list of pairs - where each pair has a key and a value associated with the key
side-effect
alias
association list
divide and conquer
9. 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
preorder
data abstraction
parent
big o
10. A problem that is so hard that it cannot be solved unless the problem is small
intractable
goal
interior node
set difference
11. An item (or description of items) being sough in a search
sort
taxonomy
filter
goal
12. Describes a function that makes a new data structure but does not modify its arguments
constructive
stack
algorithm
linked list
13. In a search tree - a program that changes a state into a child state e.g a move in a game
data abstraction
operator
circular queue
simple ADT
14. An extra record at the start or end of a data structure such as a linked list - to simplify processing
taxonomy
design pattern
intersection
entinel
15. Composed of multiple sequential elements stored in contiguous bytes of memory
divide and conquer
array
link
inorder
16. Use of a function or method without knowing how it's accomplished
garbage collection
sort
procedural abstraction
successor
17. A variable containing the address of other data
pointer
circular queue
linked list
abstract data type
18. A pointer to data
abstract data type
reference
circular queue
general list
19. A pattern that describes a set of similar programs
design pattern
fifo
algorithm
constructive
20. A collection of values
type
abstract data type
doubly linked list
random access
21. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
successor
side-effect
inorder
queue
22. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
entinel
pointer
set difference
link
23. 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
circularly linked list
depth
random access
boxed number
24. A queue implemented within an array - where the first elements of the array logically follows the last elements
gedanken
descendants
circular queue
null dereference
25. A runtime error that occurs when an operation such as method call is attempted on a null pointer
well-founded ordering xml
scope
side-effect
null dereference
26. A contiguous block of memory containing elements of the same type - accessed by numeric index
entinel
intractable
data structure
array
27. A description of the state of a process such as a board game
state
constructive
random access
pointer
28. An order of processing a tree in which the parent node is processed before its children
preorder
garbage collection
depth
binary tree
29. Values are in the most basic form and cannot be decomposed into smaller parts
intractable
scope
link
simple data type
30. Depth first search
DFS
object
reference
data abstraction
31. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
random access
grammar
union
tail recursive
32. A linked list in which each elements has both forward and backward pointers
doubly linked list
recursive case
complex ADT
array
33. First-child/next-sibling
fair
interior node
structure sharing
recursive case
34. storage that is no longer pointed to by any variable and therefore can no longer be accessed
abstract data type
garbage
ontology
linear O(n)
35. A simple case that can be solved easily - without recursion
algorithm
complex data type
base case
dereference
36. A case where tow data structures share some elements
fair
structure sharing
child
complex data type
37. A section of the runtime stack holding the values of all variables for one invocation
recursive case
garbage collection
stack frame
garbage
38. 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
state
reference type
recursion
39. Given two sets -the union is the set of elements that are members of either set
union
search
backtrack
tail recursive
40. In object oriented programming - a description of a set of similar objects
fifo
intersection
reference
class
41. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
grammar
divide and conquer
runtime stack
stack
42. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
shadow
recursive case
simple ADT
ontology
43. Composed of individually named data fields
simple ADT
immutable
intersection
stack
44. In a tree - the union of a node's parent and the parent's ancestors
cons
fair
ancestors
successor
45. Last in first out: describes the order of a stack
well-founded ordering xml
LIFO
design pattern
recursive case
46. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
simple data type
tail recursive
successor
well-founded ordering xml
47. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
ancestors
structure sharing
data structure
complex ADT
48. A problem whose solution requires a linear amount of time or space if the problem is size n
linear O(n)
runtime stack
queue
child
49. A pointer to the next element in a linked list
circularly linked list
link
fifo
reference
50. First in first out: describes ordering of a queue
quadratic
fifo
operator
parent