praxis.ibLog in
B4.1 Fundamentals of ADTsB4.1.2

Evaluate linked lists

Evaluate linked lists

AHL≈ 50 minCommand term: EvaluatePremium

In this lesson

  • Describing singly, doubly and circular linked lists and sketching them
  • Showing insertion, deletion, traversal and search on diagrams of linked lists
  • Comparing linked lists with arrays for speed of operations and use of memory
  • Evaluating whether a linked list suits a given situation

This lesson is part of Premium

Every topic has one free lesson. Premium unlocks every interactive lesson, the exam-style questions at the end of each one, and the rest of Praxis IB.

Log in or sign upTry the free lesson: B4.1.1 Properties and purpose of ADTs in programming

What's inside

  1. LearnA chain of nodes
  2. LearnOperations on a diagram
  3. LabArray or linked list?
  4. LearnArrays and linked lists compared
  5. CheckWhich suits better?
  6. CheckQuick check
  7. ExamWorked exam answer
  8. ReviewMistakes examiners see
  9. Exam practiceExam-style questions

Ends with 3 exam-style questions worth 10 marks, with a self-marking markscheme.