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. Use of a function or method without knowing how it's accomplished
reference type
gedanken
ontology
procedural abstraction
2. The number of links between the root of a tree and the leaves
depth
search
intersection
recursive case
3. Describes a function that modifies its arguments
gedanken
destructive
complex data type
alias
4. A contiguous block of memory containing elements of the same type - accessed by numeric index
immutable
array
depth-first search
doubly linked list
5. The amount of space on the runtime stack required for execution of a program
stack space
inorder
data structure
destructive
6. A case where a program calls itself
alias
child
recursion
structure sharing
7. A problem whose solution requires a linear amount of time or space if the problem is size n
runtime stack
branching factor
linear O(n)
destructive
8. A variable containing the address of other data
data abstraction
pointer
circularly linked list
interior node
9. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
constructive
operator
set difference
type
10. A stack containing a stack frame of variable value for each active invocation of procedure
linked list
union
runtime stack
algorithm
11. A classification of objects into a tree structure that groups related objects
inorder
taxonomy
procedural abstraction
filter
12. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
algorithm
immutable
interior node
type
13. A search in which children of a node are considered before siblings are considered
cons
union
depth-first search
structure sharing
14. A list of pairs - where each pair has a key and a value associated with the key
algorithm
gedanken
association list
postorder
15. Given two sets -the union is the set of elements that are members of either set
binary tree
link
union
cons
16. 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
simple data type
reference type
filter
17. A pattern that describes a set of similar programs
design pattern
destructive
complex ADT
grammar
18. storage that is no longer pointed to by any variable and therefore can no longer be accessed
garbage
leaf
preorder
backtrack
19. A tree node containing a contents value but with no children
preorder
simple data type
well-founded ordering xml
leaf
20. An item (or description of items) being sough in a search
quadratic
data type
goal
reference type
21. 1. In lisp - the function that constructs a pair of points - or basic elements of list structure. 2. To make a cons data structure 2. a cons data structure
type
binary search tree (bst)
cons
link
22. An order of processing a tree in which the parent node is processed after its children
LIFO
leaf
stack frame
postorder
23. 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
big o
design pattern
complex data type
union
24. A case where tow data structures share some elements
structure sharing
tail recursive
divide and conquer
reference
25. The top node of a tree - from which all other nodes can be reached
filter
divide and conquer
grammar
root
26. Describes a data structure or device in which all accesses have the same cost - O(1)
parent
random access
pointer
null dereference
27. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
array
complex data type
ontology
fifo
28. A linked list in which each elements has both forward and backward pointers
well-founded ordering xml
doubly linked list
random access
circularly linked list
29. An extra record at the start or end of a data structure such as a linked list - to simplify processing
pointer
data structure
entinel
recursive case
30. A collection of values
array
recursion
general list
type
31. Composed of multiple sequential elements stored in contiguous bytes of memory
complex data type
taxonomy
array
reference
32. A section of the runtime stack holding the values of all variables for one invocation
quadratic
stack frame
algorithm
DFS
33. To combine two ordered linear structures into one
circularly linked list
destructive
circular queue
merge
34. In object oriented programming - a description of a set of similar objects
union
class
operator
descendants
35. Composed of individually named data fields
simple ADT
interior node
binary tree
design pattern
36. Two variables that reference the same object
dictionary
array
interior node
alias
37. Composed of a collection of data values; implemented with a data structure
goal
boxed number
data type
complex ADT
38. 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
linear O(n)
ancestors
dictionary
39. The process of collecting garbage for recycling
object
garbage collection
doubly linked list
child
40. First-child/next-sibling
garbage collection
sort
fair
general list
41. A process that removes unwanted elements from a collection
big o
child
boxed number
filter
42. An order of processing a tree in which the parent node is processed in between its children
depth-first search
array
inorder
linked list
43. Separation of the properties of a data type from its implementation
side-effect
LIFO
reference type
data abstraction
44. A queue implemented within an array - where the first elements of the array logically follows the last elements
fair
data structure
stack
circular queue
45. In a tree - the union of a node's parent and the parent's ancestors
algorithm
ancestors
design pattern
intractable
46. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
big o
scope
fair
divide and conquer
47. To hide similar items with the same name
gedanken
association list
shadow
structure sharing
48. A description of operations on a data type that could have multiple possible implementations
branching factor
boxed number
data structure
abstract data type
49. 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
general list
runtime stack
binary search tree (bst)
inorder
50. A data structure that can be identified at runtime as being a member of a class
object
pointer
amortized Analysis
linked list