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. 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
depth-first search
ontology
entinel
branching factor
2. Values are in the most basic form and cannot be decomposed into smaller parts
child
simple data type
alias
postorder
3. A variable containing the address of other data
pointer
recursive case
immutable
stack space
4. To combine two ordered linear structures into one
operator
merge
pointer
linked list
5. storage that is no longer pointed to by any variable and therefore can no longer be accessed
root
garbage
complex data type
big o
6. A linked list in which each elements has both forward and backward pointers
link
parent
algorithm
doubly linked list
7. First in first out: describes ordering of a queue
fifo
parent
filter
grammar
8. 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
stack
data structure
binary search tree (bst)
boxed number
9. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
LIFO
set difference
base case
association list
10. Given two sets - the intersection is the set of elements that are members of both sets
depth
intersection
simple data type
alias
11. A data structure that can be identified at runtime as being a member of a class
DFS
object
reference type
sort
12. An item (or description of items) being sough in a search
goal
recursion
leaf
random access
13. A search in which children of a node are considered before siblings are considered
interior node
tail recursive
depth-first search
null dereference
14. Separation of the properties of a data type from its implementation
abstract data type
ancestors
grammar
data abstraction
15. A contiguous block of memory containing elements of the same type - accessed by numeric index
recursive case
array
circular queue
filter
16. A given collection of values along with a collection of operations for use on those values
data structure
search
data type
well-founded ordering xml
17. 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
algorithm
garbage collection
reference type
queue
18. Given two sets -the union is the set of elements that are members of either set
doubly linked list
union
shadow
parent
19. The area of program text over which a variable can be referenced
abstract data type
reference type
scope
cons
20. A runtime error that occurs when an operation such as method call is attempted on a null pointer
null dereference
intractable
association list
ancestors
21. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
algorithm
cons
immutable
simple data type
22. A linked list in which the last element points back to the first element
circularly linked list
destructive
taxonomy
pointer
23. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy
class
intractable
ontology
immutable
24. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
binary search tree (bst)
side-effect
search
sort
25. A problem that is so hard that it cannot be solved unless the problem is small
garbage
procedural abstraction
intractable
algorithm
26. A classification of objects into a tree structure that groups related objects
taxonomy
stack space
quadratic
gedanken
27. Describes a function that modifies its arguments
general list
array
destructive
search
28. A section of the runtime stack holding the values of all variables for one invocation
stack frame
merge
structure sharing
interior node
29. An order of processing a tree in which the parent node is processed in between its children
inorder
array
constructive
linked list
30. In object oriented programming - a description of a set of similar objects
circularly linked list
class
successor
quadratic
31. A queue implemented within an array - where the first elements of the array logically follows the last elements
preorder
circular queue
alias
backtrack
32. A pattern that describes a set of similar programs
leaf
design pattern
constructive
inorder
33. A problem whose solution requires a linear amount of time or space if the problem is size n
node
binary search tree (bst)
interior node
linear O(n)
34. To hide similar items with the same name
shadow
array
immutable
recursive case
35. In a tree - a node that points to a given node
linear O(n)
dictionary
parent
cons
36. A node of a tree that has children
random access
alias
interior node
postorder
37. 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
linear O(n)
root
preorder
big o
38. 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)
random access
circularly linked list
garbage collection
39. A sequence of records - where each record contains a link to the next one
linked list
taxonomy
recursive case
leaf
40. A condition of the input data where the data will be handled by call(s) to the same program
scope
entinel
recursive case
structure sharing
41. A process that removes unwanted elements from a collection
queue
big o
filter
destructive
42. A data structure representing a sequence of items - which are removed in the same order as they were inserted.
amortized Analysis
queue
shadow
complex ADT
43. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
garbage collection
divide and conquer
data structure
dereference
44. A case where tow data structures share some elements
inorder
procedural abstraction
complex ADT
structure sharing
45. In a tree - the union of a node's parent and the parent's ancestors
ancestors
class
queue
amortized Analysis
46. To convert from a pointer to the data that is pointed to
dereference
queue
recursive case
base case
47. First-child/next-sibling
root
fair
stack space
circular queue
48. Two variables that reference the same object
parent
alias
general list
goal
49. A stack containing a stack frame of variable value for each active invocation of procedure
array
descendants
runtime stack
inorder
50. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
backtrack
simple data type
side-effect
well-founded ordering xml