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. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
intersection
sort
cons
constructive
2. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
grammar
association list
big o
intersection
3. Container for storing a collection of data in unique key/value pairs
tail recursive
stack space
dictionary
association list
4. Use of a function or method without knowing how it's accomplished
procedural abstraction
state
type
tail recursive
5. An order of processing a tree in which the parent node is processed after its children
leaf
node
preorder
postorder
6. An order of processing a tree in which the parent node is processed in between its children
ancestors
operator
interior node
inorder
7. A pointer to the next element in a linked list
DFS
simple ADT
link
linked list
8. A contiguous block of memory containing elements of the same type - accessed by numeric index
garbage collection
array
depth-first search
root
9. A simple case that can be solved easily - without recursion
array
preorder
destructive
base case
10. A sequence of records - where each record contains a link to the next one
linked list
stack
divide and conquer
interior node
11. In a tree search - to move back from the node currently being examined to its parent
array
complex ADT
backtrack
sort
12. Two variables that reference the same object
alias
queue
stack frame
circular queue
13. To look through a data structure until a goal object is found
root
search
garbage collection
null dereference
14. In a tree - the union of a node's parent and the parent's ancestors
inorder
type
ancestors
null dereference
15. An order of processing a tree in which the parent node is processed before its children
design pattern
association list
preorder
scope
16. A variable containing the address of other data
pointer
circular queue
merge
intractable
17. A case where a program calls itself
recursion
stack
association list
array
18. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
intractable
tail recursive
quadratic
preorder
19. The number of links between the root of a tree and the leaves
complex ADT
leaf
depth
parent
20. A collection of values
queue
intersection
type
backtrack
21. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
child
simple data type
quadratic
set difference
22. The process of collecting garbage for recycling
random access
state
dereference
garbage collection
23. 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
reference type
binary tree
random access
branching factor
24. Describes a though experiment or view of an entity
state
set difference
gedanken
amortized Analysis
25. Composed of multiple sequential elements stored in contiguous bytes of memory
parent
entinel
array
base case
26. In a search tree - a program that changes a state into a child state e.g a move in a game
linear O(n)
quadratic
binary search tree (bst)
operator
27. A pointer to data
divide and conquer
simple ADT
reference
abstract data type
28. A problem whose solution requires a linear amount of time or space if the problem is size n
preorder
cons
abstract data type
linear O(n)
29. 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?"
quadratic
binary search tree (bst)
inorder
amortized Analysis
30. A tree node containing a contents value but with no children
leaf
runtime stack
association list
set difference
31. 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
interior node
big o
simple ADT
state
32. In a tree - a node pointed to by a parent node
child
design pattern
root
data type
33. 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
binary search tree (bst)
pointer
linear O(n)
cons
34. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
descendants
big o
data type
ontology
35. Describes a function that makes a new data structure but does not modify its arguments
object
big o
garbage collection
constructive
36. Depth first search
complex ADT
stack frame
DFS
array
37. A list of pairs - where each pair has a key and a value associated with the key
runtime stack
circularly linked list
quadratic
association list
38. In a tree - a node that points to a given node
parent
inorder
preorder
pointer
39. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
data structure
state
reference
destructive
40. A linked list in which the last element points back to the first element
circularly linked list
quadratic
abstract data type
design pattern
41. A description of the state of a process such as a board game
child
data abstraction
state
type
42. A node of a tree that has children
fair
interior node
fifo
parent
43. 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
scope
boxed number
constructive
complex ADT
44. A problem that is so hard that it cannot be solved unless the problem is small
state
linked list
structure sharing
intractable
45. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
immutable
link
ancestors
entinel
46. An elements of a linked list - tree - or graph - often represented by a data structure
successor
array
node
backtrack
47. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
fair
well-founded ordering xml
data type
class
48. Constructed of multiple components (simple or complex types)
garbage
LIFO
complex data type
doubly linked list
49. Describes a data structure or device in which all accesses have the same cost - O(1)
random access
ontology
stack space
general list
50. The area of program text over which a variable can be referenced
well-founded ordering xml
reference type
scope
array