← Back to course home
CSE3144 · Resources

Downloads

Printable, annotation-friendly versions of the lecture decks — every step-through animation is expanded into numbered still frames, so nothing that appears on screen is missing from the page — together with past question papers for the course.

A note on these PDFs. Each one is generated automatically from its corresponding interactive HTML lecture page — the same page linked from the course home page. The HTML page is the authoritative version of every lecture; the PDF exists purely as a printable, offline convenience. If a PDF ever looks incomplete, misaligned, or out of sync with what the interactive page shows, treat the HTML as correct and let your instructor know.

Lecture decks

01–02 Introduction and Course Hand-out Briefing  +  Foundations of Advanced Data Structures ads-lecture-1-2.pdf · 0.3 MB Download PDF 03 Amortized Analysis Techniques ads-lecture-3.pdf · 0.5 MB Download PDF 04 External Sorting and Memory Hierarchy ads-lecture-4.pdf · 1.8 MB Download PDF 05 Tournament Trees, Buffering, and Run Generation ads-lecture-5.pdf · 1.6 MB Download PDF 06 Huffman Trees and Applications ads-lecture-6.pdf · 0.4 MB Download PDF 07–08 Binary Search Trees Review and AVL Trees  +  AVL Tree Rotations, Insertion, and Deletion ads-lecture-7-8.pdf · 1.0 MB Download PDF 09 Red-Black Trees and Operations ads-lecture-9.pdf · 0.5 MB Download PDF 10 Splay Trees and Self-Adjusting Trees ads-lecture-10.pdf · 1.1 MB Download PDF 11 B-Trees and Variants ads-lecture-11.pdf · 0.8 MB Download PDF 12 Segment Trees and Interval Trees ads-lecture-12.pdf · 1.1 MB Download PDF 13 Tries and Digital Search Trees ads-lecture-13.pdf · 1.4 MB Download PDF 14 Suffix Trees and String Processing Applications ads-lecture-14.pdf · 0.8 MB Download PDF 15 Comparative Analysis of Advanced Tree Structures ads-lecture-15.pdf · 0.6 MB Download PDF 16 Binary Heaps and Heap Operations ads-lecture-16.pdf · 3.7 MB Download PDF 17 Heap Sort and Priority Queue Applications ads-lecture-17.pdf · 3.0 MB Download PDF 18 Binomial Heaps ads-lecture-18.pdf · 4.5 MB Download PDF 19 Fibonacci Heaps and Amortized Efficiency ads-lecture-19.pdf · 6.3 MB Download PDF 20 Pairing Heaps and Double-Ended Priority Queues ads-lecture-20.pdf · 2.6 MB Download PDF 21 Comparative Study of Heap Structures ads-lecture-21.pdf · 2.2 MB Download PDF

Past question papers

Previous years’ papers for this course, to show the format, the spread of marks across sections, and the level of question you should expect.

MTE Mid Term Examination — September 2025 CSE3144 · Sem V · 1.5 hrs · 30 marks · 0.1 MB Download PDF RE Re-Sessional Examination — November 2025 CSE3144 · Sem V · 1.5 hrs · 30 marks · 0.2 MB Download PDF
Lecture PDFs are currently available for Lectures 1–21. For the interactive versions — with clickable step-through animations — use the lecture links on the course home page.