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. Constructed of multiple components (simple or complex types)
tail recursive
descendants
dictionary
complex data type
2. Use of a function or method without knowing how it's accomplished
linked list
linear O(n)
procedural abstraction
binary tree
3. Describes a function that makes a new data structure but does not modify its arguments
constructive
root
cons
union
4. In a tree - a node pointed to by a parent node
scope
structure sharing
child
entinel
5. Any container with linear ordering
reference type
constructive
general list
intractable
6. 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
cons
scope
parent
7. To combine two ordered linear structures into one
pointer
class
array
merge
8. storage that is no longer pointed to by any variable and therefore can no longer be accessed
garbage
reference type
recursive case
taxonomy
9. The amount of space on the runtime stack required for execution of a program
descendants
quadratic
circular queue
stack space
10. Two variables that reference the same object
circular queue
alias
preorder
reference
11. A list of pairs - where each pair has a key and a value associated with the key
association list
simple ADT
entinel
taxonomy
12. A tree node containing a contents value but with no children
garbage
branching factor
leaf
well-founded ordering xml
13. Given two sets -the union is the set of elements that are members of either set
goal
type
intersection
union
14. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
array
grammar
search
well-founded ordering xml
15. A data structure that can be identified at runtime as being a member of a class
queue
object
interior node
procedural abstraction
16. A problem that is so hard that it cannot be solved unless the problem is small
amortized Analysis
depth-first search
fair
intractable
17. In a tree - the union of a node's parent and the parent's ancestors
set difference
root
ancestors
stack space
18. A linked list in which each elements has both forward and backward pointers
grammar
recursive case
doubly linked list
link
19. A queue implemented within an array - where the first elements of the array logically follows the last elements
pointer
circular queue
class
object
20. A collection of objects that are inserted and removed according to the LIFO principle
preorder
pointer
stack
sort
21. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
algorithm
dictionary
quadratic
grammar
22. 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
divide and conquer
boxed number
grammar
search
23. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
set difference
algorithm
object
binary tree
24. The top node of a tree - from which all other nodes can be reached
root
link
array
recursion
25. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
descendants
simple ADT
root
immutable
26. Composed of individually named data fields
simple ADT
immutable
ontology
filter
27. A process that removes unwanted elements from a collection
binary search tree (bst)
filter
inorder
reference
28. 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
general list
cons
recursion
link
29. A simple case that can be solved easily - without recursion
binary tree
type
union
base case
30. A node of a tree that has children
dictionary
goal
interior node
design pattern
31. An elements of a linked list - tree - or graph - often represented by a data structure
node
data abstraction
pointer
LIFO
32. 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
filter
reference type
depth
branching factor
33. A sequence of records - where each record contains a link to the next one
linked list
array
null dereference
stack
34. Composed of a collection of data values; implemented with a data structure
dictionary
filter
data abstraction
complex ADT
35. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
complex ADT
operator
entinel
ontology
36. All nodes below a give node in a tree
ontology
descendants
successor
binary tree
37. Describes a data structure or device in which all accesses have the same cost - O(1)
random access
stack space
ontology
entinel
38. To hide similar items with the same name
shadow
leaf
reference type
data structure
39. First-child/next-sibling
fair
pointer
quadratic
postorder
40. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
sort
divide and conquer
general list
preorder
41. 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
set difference
binary tree
data abstraction
entinel
42. 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
DFS
destructive
big o
object
43. Describes a though experiment or view of an entity
inorder
dictionary
class
gedanken
44. To convert from a pointer to the data that is pointed to
scope
ancestors
dereference
operator
45. The area of program text over which a variable can be referenced
array
interior node
dereference
scope
46. A collection of values
circularly linked list
garbage
array
type
47. First in first out: describes ordering of a queue
runtime stack
fifo
root
postorder
48. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
structure sharing
reference type
backtrack
side-effect
49. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
tail recursive
depth
LIFO
scope
50. Describes a function that modifies its arguments
dereference
destructive
filter
well-founded ordering xml