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. A linked list in which each elements has both forward and backward pointers
DFS
backtrack
design pattern
doubly linked list
2. A linked list in which the last element points back to the first element
abstract data type
structure sharing
circularly linked list
runtime stack
3. A condition of the input data where the data will be handled by call(s) to the same program
reference
alias
recursive case
ancestors
4. Describes a function that makes a new data structure but does not modify its arguments
circularly linked list
branching factor
constructive
inorder
5. To hide similar items with the same name
complex data type
side-effect
shadow
stack frame
6. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
grammar
fifo
entinel
merge
7. Describes a though experiment or view of an entity
garbage collection
filter
grammar
gedanken
8. The top node of a tree - from which all other nodes can be reached
fifo
root
child
LIFO
9. A process that removes unwanted elements from a collection
filter
node
fair
side-effect
10. 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
sort
random access
boxed number
complex data type
11. Describes a data structure or device in which all accesses have the same cost - O(1)
union
big o
random access
class
12. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
circularly linked list
entinel
simple ADT
divide and conquer
13. First in first out: describes ordering of a queue
immutable
inorder
fifo
stack frame
14. First-child/next-sibling
big o
base case
fair
constructive
15. In a search tree - a program that changes a state into a child state e.g a move in a game
reference
reference type
backtrack
operator
16. In a tree - a node that points to a given node
taxonomy
postorder
quadratic
parent
17. An extra record at the start or end of a data structure such as a linked list - to simplify processing
interior node
structure sharing
type
entinel
18. In a tree - the union of a node's parent and the parent's ancestors
DFS
backtrack
ancestors
state
19. A queue implemented within an array - where the first elements of the array logically follows the last elements
queue
reference type
backtrack
circular queue
20. The number of links between the root of a tree and the leaves
depth
stack space
interior node
filter
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
stack space
ontology
big o
linked list
22. To convert from a pointer to the data that is pointed to
dereference
linked list
data structure
leaf
23. Given two sets - the intersection is the set of elements that are members of both sets
intersection
preorder
quadratic
depth-first search
24. 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)
recursion
preorder
simple ADT
25. A section of the runtime stack holding the values of all variables for one invocation
stack frame
amortized Analysis
node
intractable
26. 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
dereference
stack space
quadratic
27. Values are in the most basic form and cannot be decomposed into smaller parts
DFS
entinel
intractable
simple data type
28. A pointer to the next element in a linked list
cons
node
link
queue
29. Constructed of multiple components (simple or complex types)
complex data type
stack
queue
data structure
30. storage that is no longer pointed to by any variable and therefore can no longer be accessed
garbage
alias
runtime stack
binary search tree (bst)
31. An order of processing a tree in which the parent node is processed after its children
garbage collection
postorder
stack space
depth-first search
32. Given two sets -the union is the set of elements that are members of either set
union
leaf
data abstraction
complex data type
33. 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
stack space
branching factor
set difference
type
34. A variable containing the address of other data
side-effect
entinel
pointer
boxed number
35. Give two sets - the set difference is the set of elements of the first set that are not members of the second set
circular queue
fifo
set difference
taxonomy
36. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure
queue
recursion
side-effect
DFS
37. Composed of individually named data fields
destructive
ontology
recursive case
simple ADT
38. 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
successor
array
cons
leaf
39. 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?"
amortized Analysis
branching factor
abstract data type
linear O(n)
40. Any container with linear ordering
garbage collection
child
general list
procedural abstraction
41. A description of operations on a data type that could have multiple possible implementations
branching factor
doubly linked list
simple ADT
abstract data type
42. A classification of objects into a tree structure that groups related objects
set difference
cons
linear O(n)
taxonomy
43. To look through a data structure until a goal object is found
search
backtrack
object
child
44. The next element in a linked list
fifo
successor
simple ADT
destructive
45. Describes a function that modifies its arguments
scope
tail recursive
destructive
cons
46. A node of a tree that has children
descendants
design pattern
interior node
grammar
47. An item (or description of items) being sough in a search
backtrack
descendants
garbage collection
goal
48. A pattern that describes a set of similar programs
design pattern
amortized Analysis
dereference
search
49. An elements of a linked list - tree - or graph - often represented by a data structure
simple ADT
fifo
ancestors
node
50. A problem whose solution requires a linear amount of time or space if the problem is size n
circular queue
linear O(n)
cons
successor