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. Any container with linear ordering
general list
intractable
gedanken
depth-first search
2. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
binary tree
side-effect
circularly linked list
successor
3. To convert from a pointer to the data that is pointed to
depth
dereference
doubly linked list
merge
4. A case where a program calls itself
recursion
big o
array
base case
5. A linked list in which each elements has both forward and backward pointers
design pattern
fair
base case
doubly linked list
6. The amount of space on the runtime stack required for execution of a program
constructive
intractable
stack space
branching factor
7. A sequence of records - where each record contains a link to the next one
root
linked list
grammar
sort
8. A list of pairs - where each pair has a key and a value associated with the key
class
intractable
simple ADT
association list
9. A runtime error that occurs when an operation such as method call is attempted on a null pointer
shadow
complex ADT
taxonomy
null dereference
10. Use of a function or method without knowing how it's accomplished
base case
circularly linked list
entinel
procedural abstraction
11. An extra record at the start or end of a data structure such as a linked list - to simplify processing
taxonomy
random access
reference type
entinel
12. Container for storing a collection of data in unique key/value pairs
array
dictionary
backtrack
general list
13. A node of a tree that has children
interior node
general list
recursive case
filter
14. A pointer to the next element in a linked list
data structure
link
recursive case
tail recursive
15. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
entinel
general list
link
well-founded ordering xml
16. A linked list in which the last element points back to the first element
well-founded ordering xml
circularly linked list
search
preorder
17. Given two sets -the union is the set of elements that are members of either set
inorder
abstract data type
union
leaf
18. A simple case that can be solved easily - without recursion
stack
cons
binary tree
base case
19. A description of operations on a data type that could have multiple possible implementations
abstract data type
association list
recursive case
sort
20. In a tree - a node that points to a given node
array
procedural abstraction
parent
queue
21. First in first out: describes ordering of a queue
fifo
successor
general list
interior node
22. All nodes below a give node in a tree
set difference
descendants
preorder
null dereference
23. In a search tree - a program that changes a state into a child state e.g a move in a game
pointer
operator
garbage collection
reference
24. storage that is no longer pointed to by any variable and therefore can no longer be accessed
garbage
base case
LIFO
search
25. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
circularly linked list
child
branching factor
divide and conquer
26. A variable containing the address of other data
reference type
procedural abstraction
immutable
pointer
27. The next element in a linked list
design pattern
child
random access
successor
28. A tree node containing a contents value but with no children
ontology
postorder
leaf
array
29. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
alias
sort
complex data type
queue
30. An order of processing a tree in which the parent node is processed in between its children
sort
successor
inorder
depth-first search
31. Describes a though experiment or view of an entity
sort
grammar
gedanken
parent
32. To look through a data structure until a goal object is found
union
tail recursive
successor
search
33. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
immutable
complex ADT
well-founded ordering xml
tail recursive
34. 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?"
stack frame
linear O(n)
amortized Analysis
recursive case
35. A stack containing a stack frame of variable value for each active invocation of procedure
preorder
queue
recursive case
runtime stack
36. Describes a data structure or device in which all accesses have the same cost - O(1)
procedural abstraction
scope
random access
entinel
37. A process that removes unwanted elements from a collection
big o
filter
branching factor
boxed number
38. Constructed of multiple components (simple or complex types)
complex data type
simple data type
reference type
linear O(n)
39. In a tree - the union of a node's parent and the parent's ancestors
ancestors
complex ADT
fifo
taxonomy
40. A search in which children of a node are considered before siblings are considered
well-founded ordering xml
depth-first search
operator
leaf
41. Last in first out: describes the order of a stack
LIFO
circularly linked list
taxonomy
ontology
42. Values are in the most basic form and cannot be decomposed into smaller parts
class
base case
linked list
simple data type
43. A contiguous block of memory containing elements of the same type - accessed by numeric index
depth-first search
array
tail recursive
cons
44. First-child/next-sibling
fair
constructive
binary tree
algorithm
45. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
parent
grammar
design pattern
search
46. A condition of the input data where the data will be handled by call(s) to the same program
state
stack
side-effect
recursive case
47. The number of links between the root of a tree and the leaves
gedanken
quadratic
union
depth
48. A case where tow data structures share some elements
structure sharing
fair
depth
filter
49. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
leaf
interior node
ontology
fair
50. Describes a function that makes a new data structure but does not modify its arguments
constructive
grammar
reference type
postorder