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. First in first out: describes ordering of a queue
alias
fifo
recursive case
union
2. A pattern that describes a set of similar programs
LIFO
design pattern
array
taxonomy
3. In a tree - a node pointed to by a parent node
child
linked list
boxed number
null dereference
4. A collection of objects that are inserted and removed according to the LIFO principle
array
intractable
child
stack
5. A problem whose solution requires a linear amount of time or space if the problem is size n
linear O(n)
simple ADT
recursive case
sort
6. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java
immutable
stack
quadratic
object
7. A description of the state of a process such as a board game
queue
state
linked list
stack frame
8. A contiguous block of memory containing elements of the same type - accessed by numeric index
array
design pattern
quadratic
data type
9. To hide similar items with the same name
destructive
shadow
runtime stack
scope
10. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down
binary tree
backtrack
branching factor
well-founded ordering xml
11. A runtime error that occurs when an operation such as method call is attempted on a null pointer
stack
null dereference
depth-first search
dictionary
12. 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
big o
taxonomy
garbage
binary search tree (bst)
13. A problem that is so hard that it cannot be solved unless the problem is small
entinel
intractable
runtime stack
array
14. A classification of objects into a tree structure that groups related objects
side-effect
object
taxonomy
intractable
15. A condition of the input data where the data will be handled by call(s) to the same program
recursive case
procedural abstraction
reference type
side-effect
16. A search in which children of a node are considered before siblings are considered
depth-first search
procedural abstraction
merge
scope
17. 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
runtime stack
binary tree
shadow
grammar
18. In a tree search - to move back from the node currently being examined to its parent
big o
reference
backtrack
branching factor
19. A stack containing a stack frame of variable value for each active invocation of procedure
recursive case
binary search tree (bst)
runtime stack
gedanken
20. storage that is no longer pointed to by any variable and therefore can no longer be accessed
random access
garbage
link
pointer
21. An order of processing a tree in which the parent node is processed in between its children
inorder
DFS
recursion
circularly linked list
22. Container for storing a collection of data in unique key/value pairs
merge
dictionary
data structure
null dereference
23. Two variables that reference the same object
data abstraction
alias
complex data type
boxed number
24. 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
stack frame
simple data type
cons
queue
25. A description of operations on a data type that could have multiple possible implementations
preorder
abstract data type
DFS
array
26. Constructed of multiple components (simple or complex types)
dictionary
complex data type
circular queue
tail recursive
27. 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
preorder
branching factor
gedanken
array
28. A sequence of records - where each record contains a link to the next one
queue
preorder
linked list
LIFO
29. Depth first search
array
root
DFS
cons
30. A linked list in which the last element points back to the first element
binary search tree (bst)
cons
intractable
circularly linked list
31. First-child/next-sibling
fair
branching factor
complex ADT
data type
32. Composed of multiple sequential elements stored in contiguous bytes of memory
destructive
array
random access
shadow
33. Describes a data structure or device in which all accesses have the same cost - O(1)
pointer
link
simple ADT
random access
34. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences
grammar
dereference
complex data type
inorder
35. Describes a function that modifies its arguments
taxonomy
destructive
procedural abstraction
linear O(n)
36. 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
structure sharing
boxed number
node
big o
37. A section of the runtime stack holding the values of all variables for one invocation
ancestors
entinel
fifo
stack frame
38. To look through a data structure until a goal object is found
well-founded ordering xml
base case
search
design pattern
39. An elements of a linked list - tree - or graph - often represented by a data structure
pointer
boxed number
node
merge
40. Given two sets -the union is the set of elements that are members of either set
object
union
operator
ontology
41. An extra record at the start or end of a data structure such as a linked list - to simplify processing
sort
reference
entinel
tail recursive
42. A pointer to data
interior node
amortized Analysis
reference
stack frame
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?"
union
boxed number
cons
amortized Analysis
44. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order
sort
design pattern
class
data structure
45. Last in first out: describes the order of a stack
backtrack
preorder
LIFO
entinel
46. 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
boxed number
base case
merge
general list
47. Describes a function that makes a new data structure but does not modify its arguments
child
parent
constructive
fair
48. Values are in the most basic form and cannot be decomposed into smaller parts
stack
stack frame
simple data type
LIFO
49. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached
divide and conquer
set difference
simple ADT
goal
50. In a search tree - a program that changes a state into a child state e.g a move in a game
simple ADT
procedural abstraction
quadratic
operator