PCCST303 · Module 4: Sorting and Searching

Syllabus

What this module covers

The KTU 2024 scheme lists the following topics in Module 4:

  1. Sorting Techniques
    • Selection Sort
    • Insertion Sort
    • Quick Sort
    • Merge Sort
    • Heap Sort
    • Radix Sort
  2. Searching Techniques
    • Linear Search
    • Binary Search
  3. Hashing
    • Hashing Functions: Mid Square, Division, Folding, Digit Analysis
    • Collision Resolution: Linear Probing, Quadratic Probing, Double Hashing, Open Hashing

Exam pattern

For Module 4, the exam includes 2 compulsory 3-mark questions in Part A and two 9-mark questions in Part B, of which one is answered. To prepare for both, this module's lessons cover the underlying concepts, the exam-ready algorithms, and larger worked problems for each topic.

For a focused list of the questions most likely to appear from this module, see Most Expected Questions.