Course Hero Logo

DA256B-exam20190216_answers.pdf - Namn Name Personnummer...

Course Hero uses AI to attempt to automatically extract content from documents to surface to you and others so you can study better, e.g., in search results, to enrich docs, and more. This preview shows page 1 - 4 out of 9 pages.

1NamnNamePersonnummerCivic registration numberProgramProgrammeAntagningsårAdmission yearSkriftlig tentamen iWritten examination inAlgorithms and Data StructuresKurskodCourse codeDA256B/ DT256A/ DA256A/ DA522B/DatumDate2019-02-16SkrivtidExamination time10:00 – 16:00LärareTeacherKamilla KlonowskaTillåtna hjälpmedelPermitted aidDictionary (without notes in it), Ruler, CalculatorÖvrigtFurther informationThe answers can be provide in English or/and Swedish.Please write clearly. No points will be given if the text/figures are un-readable.The exam papers are not allowed to take outside of the examination room.All answers must be on the exam papers. You can also usethe back sideof the paper.NO OTHER papers are allowed.To pass the exam you must earn at least 21 points in total AND at least 5 points on eachProblem. However, if you get at least 21 points AND you are missing 1-2 points to get 5 inonly one Problem then you can complement the exam orally.Betygsgränser /Grade limits3: 21 – 274: 28 – 355: 36 – 40UtkvitteradReceivedDatumDateInlämningstidSubmit timeLeg.IDAntal inlämnade bladNo. of submitted sheetsKontrollerat av studetenChecked by studentKontrollerat av skrivvaktChecked byinvigilatorUppgiftQuestionPoängPointsResultatResult110210310410Max poängMax no of points40SummaSumBetygGrade
2Algorithms and Data StructuresExam 4 hpFrom syllabus:Expected Learning Outcomes 1 and 3 are examined through an individual written exam.Grades awarded: Fail, 3, 4 and 5, there 5 is the highest grade.Intended learning outcomesKnowledge and understandingAfter completing the course students mustbe able to explain the algorithm theory and data structures on a general level (1)Competence and skillsAfter completing the course students mustbe able to apply the algorithm theory and data structures in practice (3)To pass the exam you must earn at least 21 points in total AND at least 5 points on eachProblem. However, if you get at least 21 points AND you are missing 1-2 points to get 5 inonly one Problem then you can complement the exam orally.
31.Algorithm Analysis and Recursive Algorithms(10p) j1.1Consider an algorithm A and an execution time X of this algorithm. There are twometrics depending on many factors while calculating this algorithm complexity.a)Explain the metrics and give at least three factorsb)Give one example of an algorithm with complexity larger than square. Describe thisalgorithm and its complexity. Explain the usability of this algorithm.

Upload your study docs or become a

Course Hero member to access this document

Upload your study docs or become a

Course Hero member to access this document

End of preview. Want to read all 9 pages?

Upload your study docs or become a

Course Hero member to access this document

Term
Spring
Professor
N/A
Tags
Big O notation

Newly uploaded documents

Show More

Newly uploaded documents

Show More

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture