GoConqr hat ein neues Design! Sag uns, wie es dir gefällt.

Quiz

Data Structures Exam 2

Curtis Gilbert 3 Fragen Aktualisiert am 4 Aug 2016

Quiz starten

Fragen in diesem Quiz (3)

  1. 1Declare an fsu::Stack object S with elements of type fsu::String and underlying container fsu::Vector.
    1. Afsu::Deque < fsu::String , fsu::Vector < fsu::String > > S;
    2. Bfsu::Stack < fsu::String > S;
    3. CNone of the other choices
    4. Dfsu::Vector < fsu::String , Stack < fsu::String > > S;
    5. Efsu::Stack < fsu::String , fsu::Vector < fsu::String > > S;
  2. 2Which of the following are optional (but very desirable) components of an algorithm?
    1. ABody: A recipe or set of instructions for a computation
    2. BAssumptions: Things that are assumed to be true prior to executing the body
    3. COutcomes: Things that are true after executing the body (assuming the assumptions)
    4. DRunTime Estimate: Statement of the runtime of the algorithm body, in asymptotic notation, as a function of input size
    5. ERunSpace Estimate: Statement of the algorithm runspace requirements, in asympotic "+" notation, as a function of input size
    6. FCorrectness Proof: THEOREM. If the assumptions hold and the algorithmn body is executed then the outcomes are true.
    7. GRunSpace Proof: THEOREM. If the assumptions hold then the asserted runspace estimates are correct.
    8. HRunTime Proof: THEOREM
  3. 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.)
    1. AA has runtime Θ(3n2 + 7n).
    2. BA has runtime O(n2).
    3. CA has runtime Θ(n3).
    4. DA has runtime Ω(n2).

Informationen

Beschreibung
Quiz am Data Structures Exam 2, erstellt von Curtis Gilbert am 07/07/2016.
Sprache
English
Aufrufe
2
Verlauf
Erstellt am 7 Jul 2016 · aktualisiert am 4 Aug 2016
Bewertung
Noch keine Bewertungen
Bewerte dieses Quiz
Bewerte dieses Quiz

Feedback

Worum geht es?

Wie gefällt dir das neue Design?

Dein Eindruck