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. Describes a function that makes a new data structure but does not modify its arguments
design pattern
constructive
garbage
random access
2. To hide similar items with the same name
shadow
runtime stack
fifo
side-effect
3. 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
scope
boxed number
node
4. To convert from a pointer to the data that is pointed to
grammar
depth
dereference
ancestors
5. Describes a data structure or device in which all accesses have the same cost - O(1)
complex ADT
random access
base case
amortized Analysis
6. Any container with linear ordering
general list
fair
sort
recursion
7. 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
parent
pointer
reference type
binary tree
8. The area of program text over which a variable can be referenced
scope
complex ADT
procedural abstraction
circular queue
9. A runtime error that occurs when an operation such as method call is attempted on a null pointer
null dereference
structure sharing
entinel
quadratic
10. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
big o
intractable
stack
divide and conquer
11. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
object
pointer
side-effect
garbage collection
12. Describes a function that modifies its arguments
intersection
destructive
null dereference
union
13. In a tree search - to move back from the node currently being examined to its parent
parent
alias
backtrack
taxonomy
14. A problem that is so hard that it cannot be solved unless the problem is small
stack frame
big o
leaf
intractable
15. To combine two ordered linear structures into one
boxed number
recursive case
merge
data abstraction
16. In a tree - a node that points to a given node
node
parent
child
constructive
17. Depth first search
branching factor
DFS
child
class
18. 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
child
depth
object
19. A classification of objects into a tree structure that groups related objects
array
state
tail recursive
taxonomy
20. Two variables that reference the same object
branching factor
alias
boxed number
DFS
21. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
stack frame
set difference
descendants
queue
22. 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
entinel
array
doubly linked list
binary search tree (bst)
23. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
stack frame
immutable
node
quadratic
24. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
sort
circularly linked list
alias
grammar
25. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time
binary search tree (bst)
union
algorithm
data structure
26. Values are in the most basic form and cannot be decomposed into smaller parts
simple data type
class
quadratic
circularly linked list
27. A linked list in which each elements has both forward and backward pointers
ontology
recursive case
operator
doubly linked list
28. A tree node containing a contents value but with no children
type
recursive case
leaf
quadratic
29. A process that removes unwanted elements from a collection
filter
linear O(n)
amortized Analysis
taxonomy
30. A description of the state of a process such as a board game
complex data type
general list
null dereference
state
31. A queue implemented within an array - where the first elements of the array logically follows the last elements
circular queue
procedural abstraction
child
divide and conquer
32. The amount of space on the runtime stack required for execution of a program
stack space
algorithm
parent
entinel
33. Container for storing a collection of data in unique key/value pairs
dictionary
destructive
search
reference
34. A search in which children of a node are considered before siblings are considered
tail recursive
depth-first search
entinel
merge
35. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
leaf
binary search tree (bst)
grammar
sort
36. An order of processing a tree in which the parent node is processed after its children
backtrack
search
postorder
branching factor
37. Composed of individually named data fields
reference
simple ADT
constructive
goal
38. Constructed of multiple components (simple or complex types)
complex data type
complex ADT
algorithm
successor
39. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
DFS
object
destructive
well-founded ordering xml
40. A sequence of records - where each record contains a link to the next one
filter
simple ADT
linked list
cons
41. A simple case that can be solved easily - without recursion
depth-first search
base case
binary search tree (bst)
intractable
42. A pattern that describes a set of similar programs
null dereference
divide and conquer
design pattern
structure sharing
43. An elements of a linked list - tree - or graph - often represented by a data structure
root
node
linear O(n)
structure sharing
44. In object oriented programming - a description of a set of similar objects
successor
dereference
class
garbage collection
45. In a tree - the union of a node's parent and the parent's ancestors
simple data type
procedural abstraction
data abstraction
ancestors
46. Separation of the properties of a data type from its implementation
data abstraction
search
immutable
ancestors
47. A stack containing a stack frame of variable value for each active invocation of procedure
constructive
parent
runtime stack
well-founded ordering xml
48. Given two sets -the union is the set of elements that are members of either set
object
general list
union
quadratic
49. The next element in a linked list
successor
circularly linked list
array
parent
50. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated
data structure
base case
circularly linked list
boxed number