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. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
scope
fair
grammar
design pattern
2. An order of processing a tree in which the parent node is processed after its children
postorder
queue
runtime stack
descendants
3. The top node of a tree - from which all other nodes can be reached
binary search tree (bst)
root
backtrack
simple data type
4. A pointer to the next element in a linked list
garbage
shadow
search
link
5. A given collection of values along with a collection of operations for use on those values
circular queue
complex data type
data type
inorder
6. A variable containing the address of other data
pointer
runtime stack
doubly linked list
merge
7. A case where tow data structures share some elements
depth-first search
structure sharing
linked list
backtrack
8. A linked list in which the last element points back to the first element
association list
descendants
taxonomy
circularly linked list
9. Given two sets - the intersection is the set of elements that are members of both sets
class
set difference
array
intersection
10. In a tree - a node that points to a given node
parent
taxonomy
ontology
recursive case
11. A collection of values
type
class
general list
ancestors
12. The area of program text over which a variable can be referenced
algorithm
array
scope
dictionary
13. The process of collecting garbage for recycling
array
postorder
garbage collection
stack
14. The number of links between the root of a tree and the leaves
depth
fair
successor
binary tree
15. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
depth-first search
data structure
reference
class
16. A problem that is so hard that it cannot be solved unless the problem is small
reference type
intractable
leaf
big o
17. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
garbage collection
alias
algorithm
immutable
18. A process that removes unwanted elements from a collection
link
filter
scope
grammar
19. Describes a data structure or device in which all accesses have the same cost - O(1)
simple data type
big o
array
random access
20. In a search tree - a program that changes a state into a child state e.g a move in a game
LIFO
operator
well-founded ordering xml
sort
21. In a tree search - to move back from the node currently being examined to its parent
backtrack
depth
algorithm
scope
22. Container for storing a collection of data in unique key/value pairs
child
quadratic
dictionary
node
23. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
successor
set difference
shadow
structure sharing
24. An order of processing a tree in which the parent node is processed before its children
preorder
branching factor
interior node
LIFO
25. 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
circularly linked list
child
big o
tail recursive
26. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
association list
shadow
LIFO
ontology
27. A stack containing a stack frame of variable value for each active invocation of procedure
depth
general list
simple data type
runtime stack
28. A queue implemented within an array - where the first elements of the array logically follows the last elements
data type
complex ADT
set difference
circular queue
29. In a tree - the union of a node's parent and the parent's ancestors
merge
ancestors
recursive case
recursion
30. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
tail recursive
stack space
quadratic
stack frame
31. 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
circular queue
garbage
binary tree
tail recursive
32. A collection of objects that are inserted and removed according to the LIFO principle
object
complex ADT
doubly linked list
stack
33. Constructed of multiple components (simple or complex types)
shadow
complex data type
parent
DFS
34. A contiguous block of memory containing elements of the same type - accessed by numeric index
array
fair
parent
tail recursive
35. A problem whose solution requires a linear amount of time or space if the problem is size n
linear O(n)
class
quadratic
child
36. A simple case that can be solved easily - without recursion
design pattern
circularly linked list
null dereference
base case
37. Last in first out: describes the order of a stack
LIFO
leaf
DFS
gedanken
38. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
well-founded ordering xml
dereference
parent
class
39. Composed of individually named data fields
cons
reference type
root
simple ADT
40. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
gedanken
quadratic
intersection
sort
41. An elements of a linked list - tree - or graph - often represented by a data structure
immutable
reference
node
depth-first search
42. A description of the state of a process such as a board game
state
root
quadratic
sort
43. A search in which children of a node are considered before siblings are considered
depth-first search
doubly linked list
linear O(n)
data abstraction
44. An item (or description of items) being sough in a search
goal
ancestors
postorder
binary search tree (bst)
45. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
divide and conquer
goal
taxonomy
design pattern
46. Composed of a collection of data values; implemented with a data structure
fair
complex ADT
object
DFS
47. A case where a program calls itself
filter
data structure
goal
recursion
48. Use of a function or method without knowing how it's accomplished
object
complex data type
procedural abstraction
depth-first search
49. A classification of objects into a tree structure that groups related objects
circularly linked list
taxonomy
class
linked list
50. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
DFS
scope
queue
side-effect