Test
Data Structures Exam 2
Preguntas del test (3)
1Declare an fsu::Stack object S with elements of type fsu::String and underlying container fsu::Vector.
- Afsu::Deque < fsu::String , fsu::Vector < fsu::String > > S;
- Bfsu::Stack < fsu::String > S;
- CNone of the other choices
- Dfsu::Vector < fsu::String , Stack < fsu::String > > S;
- Efsu::Stack < fsu::String , fsu::Vector < fsu::String > > S;
2Which of the following are optional (but very desirable) components of an algorithm?
- ABody: A recipe or set of instructions for a computation
- BAssumptions: Things that are assumed to be true prior to executing the body
- COutcomes: Things that are true after executing the body (assuming the assumptions)
- DRunTime Estimate: Statement of the runtime of the algorithm body, in asymptotic notation, as a function of input size
- ERunSpace Estimate: Statement of the algorithm runspace requirements, in asympotic "+" notation, as a function of input size
- FCorrectness Proof: THEOREM. If the assumptions hold and the algorithmn body is executed then the outcomes are true.
- GRunSpace Proof: THEOREM. If the assumptions hold then the asserted runspace estimates are correct.
- HRunTime Proof: THEOREM
3Suppose that we know Algorithm A has runtime Θ(n2), where n is a measure of input size. Which of the following statements is also true? (Check all that apply.)
- AA has runtime Θ(3n2 + 7n).
- BA has runtime O(n2).
- CA has runtime Θ(n3).
- DA has runtime Ω(n2).
Información
- Descripción
- Test sobre Data Structures Exam 2, creado por Curtis Gilbert el 07/07/2016.
- Autor
- Curtis Gilbert
- Idioma
- English
- Visitas
- 2
- Historial
- Creado el 7 jul 2016 · actualizado el 4 ago 2016
- Valoración
- Aún sin valoraciones Valora este test