Syllabus

What this module covers

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

1. Trees
   • Representation of Trees
   • Binary Trees - Types and Properties
   • Binary Tree Representation
   • Tree Operations
   • Tree Traversals
2. Expression Trees
3. Binary Search Trees
   • Binary Search Tree Operations
4. Binary Heaps
   • Binary Heap Operations
   • Priority Queue
5. Graphs
   • Definitions
   • Representation of Graphs
   • Depth First Search and Breadth First Search
   • Applications of Graphs - Single Source All Destination

Exam pattern

For Module 3, 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.