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. 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
cons
stack frame
gedanken
constructive
2. Describes a data structure or device in which all accesses have the same cost - O(1)
random access
leaf
procedural abstraction
complex ADT
3. Any container with linear ordering
operator
node
descendants
general list
4. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call
dictionary
tail recursive
base case
search
5. A linked list in which each elements has both forward and backward pointers
doubly linked list
descendants
root
side-effect
6. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
linked list
sort
reference
general list
7. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
interior node
grammar
reference type
algorithm
8. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
well-founded ordering xml
intractable
grammar
set difference
9. Composed of multiple sequential elements stored in contiguous bytes of memory
dereference
array
depth
goal
10. A case where a program calls itself
reference
recursion
constructive
sort
11. 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
dereference
data type
alias
boxed number
12. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
well-founded ordering xml
linked list
shadow
interior node
13. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
sort
stack space
operator
immutable
14. Describes a though experiment or view of an entity
gedanken
data type
LIFO
garbage
15. A collection of values
algorithm
LIFO
type
stack frame
16. To convert from a pointer to the data that is pointed to
dereference
operator
parent
descendants
17. A queue implemented within an array - where the first elements of the array logically follows the last elements
circular queue
grammar
type
tail recursive
18. storage that is no longer pointed to by any variable and therefore can no longer be accessed
alias
algorithm
stack
garbage
19. A runtime error that occurs when an operation such as method call is attempted on a null pointer
amortized Analysis
null dereference
data abstraction
child
20. Given two sets - the intersection is the set of elements that are members of both sets
taxonomy
destructive
intersection
runtime stack
21. 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
simple ADT
big o
taxonomy
data abstraction
22. A classification of objects into a tree structure that groups related objects
entinel
binary search tree (bst)
taxonomy
complex ADT
23. The number of links between the root of a tree and the leaves
binary search tree (bst)
depth
cons
sort
24. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
alias
taxonomy
preorder
set difference
25. The top node of a tree - from which all other nodes can be reached
DFS
root
intractable
cons
26. The process of collecting garbage for recycling
binary search tree (bst)
garbage collection
operator
backtrack
27. An item (or description of items) being sough in a search
ancestors
dereference
association list
goal
28. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
linked list
alias
side-effect
interior node
29. A pointer to the next element in a linked list
link
depth-first search
preorder
interior node
30. Separation of the properties of a data type from its implementation
circular queue
grammar
data abstraction
fair
31. All nodes below a give node in a tree
descendants
simple data type
side-effect
node
32. 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
DFS
dereference
tail recursive
reference type
33. A list of pairs - where each pair has a key and a value associated with the key
garbage collection
association list
set difference
shadow
34. Describes a function that makes a new data structure but does not modify its arguments
state
constructive
root
shadow
35. The area of program text over which a variable can be referenced
quadratic
destructive
sort
scope
36. A tree node containing a contents value but with no children
complex data type
leaf
preorder
node
37. A search in which children of a node are considered before siblings are considered
array
search
depth-first search
null dereference
38. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n
root
boxed number
set difference
quadratic
39. An extra record at the start or end of a data structure such as a linked list - to simplify processing
entinel
pointer
child
class
40. Composed of a collection of data values; implemented with a data structure
complex ADT
complex data type
object
operator
41. A case where tow data structures share some elements
structure sharing
child
data type
side-effect
42. In a search tree - a program that changes a state into a child state e.g a move in a game
runtime stack
operator
type
parent
43. 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?"
gedanken
amortized Analysis
circularly linked list
runtime stack
44. A given collection of values along with a collection of operations for use on those values
LIFO
data type
gedanken
backtrack
45. 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
data abstraction
branching factor
binary search tree (bst)
data type
46. Constructed of multiple components (simple or complex types)
link
grammar
complex data type
fair
47. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
ontology
type
pointer
DFS
48. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
data structure
intractable
stack space
garbage collection
49. An elements of a linked list - tree - or graph - often represented by a data structure
node
queue
linear O(n)
cons
50. A process that removes unwanted elements from a collection
LIFO
filter
reference
data abstraction