Chat with us on WhatsAppCall Learnizo

KTU 2024 Scheme · Semester 4 · Program Elective I — Computer Science and Engineering

Advanced Data Structures (PECST495) Syllabus

Official KTU 2024 Scheme syllabus for Advanced Data Structures, Semester 4, Program Elective I — Computer Science and Engineering (Computer Science and Engineering).

This page compiles APJ Abdul Kalam Technological University's officially published 2024 Scheme syllabus for Computer Science and Engineering, Semester 4, sourced directly from KTU's official website (ktu.edu.in). Learnizo is an independent online tuition platform and is not affiliated with, endorsed by, or officially connected to APJKTU. The university may revise syllabus content after this page was last updated — always cross-check with the official KTU source for the current, authoritative version.

Course Code

PECST495

Credits

3

Teaching Hours

3:0:0:0 (L:T:P:R)

CIE Marks

40

ESE Marks

60

Exam Duration

2 Hrs. 30 Min.

Prerequisites

PCCST303

Semester

Semester 4

Course Objective

To equip students with comprehensive knowledge of advanced data structures utilized in cutting-edge areas of computer science, including database management, cyber security, information retrieval, and networked systems. To prepare students to address challenges in emerging fields of computer science by applying advanced data structures to practical, real-world problems.

Module-wise Syllabus

Module 1

9 contact hours

Foundational Data Structures- Overview of Arrays and Linked Lists, implementation of pointers and objects, Representing rooted trees, Hashing - Hash Tables, Hash functions, Cuckoo Hashing; Bloom Filters - Count-Min Sketch, Applications to Networks - Click Stream Processing using Bloom Filters, Applications to Data Science - Heavy Hitters and count-min structures.

Module 2

9 contact hours

Advanced Tree Data Structures - Balanced Trees - AVL Trees (review), Red-Black Trees, Suffix Trees and Arrays, Segment Trees, Heaps and Related Structures - Binomial heap, Fibonacci Heaps, Merkle Trees, Applications to information Retrieval and WWW - AutoComplete using Tries.

Module 3

9 contact hours

Specialized Data Structures - Spatial Data Structures - Quadtree, K-D Trees (k-dimensional tree); R-trees; Temporal Data Structures- Persistence, Retroactivity; Search and Optimization Trees - Skip List, Tango Trees; Applications to Data Science - Approximate nearest neighbor search, Applications to information Retrieval and WWW, Posting List intersection.

Module 4

9 contact hours

Data Structure applications - Distributed and Parallel Data Structures - Distributed Hash Tables (DHTs); Consistent Hashing; Distributed BST; Data Compression and Transformations - Burrows-Wheeler Transform; Histogram; Wavelet Trees; Cryptographic Applications - Hashing.

Course Outcomes

  • CO1Implement and use arrays, linked lists, rooted trees and hashing techniques in various programming scenarios.
  • CO2Design and implement advanced tree data structures for information retrieval.
  • CO3Use spatial and temporal data structures in data science problems.
  • CO4Analyze data structures in special scenarios such as distributed, parallel and data compression areas.

Assessment Pattern (CIE: 40 marks, ESE: 60 marks)

Continuous Internal Evaluation (CIE)

Attendance5
Assignment / Microproject15
Internal Examination 1 (Written)10
Internal Examination 2 (Written)10

End Semester Examination (ESE)

Total 60 marks, 2 Hrs. 30 Min.. See the official KTU syllabus document for the exact Part A / Part B question pattern for this course.

Textbooks & Reference Books

Reference Books

  • Advanced Data Structures: Theory and Applications — Suman Saha, Shailendra Shukla (CRC Press, 1/e, 2019)
  • Advanced Data Structures — Peter Brass (Cambridge University Press, 1/e, 2008)
  • Introduction to Algorithms — Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, Clifford Stein (MIT Press, 4/e, 2022)
  • Fundamentals of Computer Algorithms — Ellis Horowitz, SatrajSahani and Rajasekharam (University Press, 2/e, 2009)
  • Advanced Data Structures — Reema Thareja, S. Rama Sree (Oxford University Press, 1/e, 2018)
  • Data Structures and Algorithm Analysis in C++, — Mark Allen Weiss (Pearson, 2/e, 2004.)
  • Design and Analysis of Algorithms — M T Goodrich, Roberto Tamassia (Wiley, 1/e, 2021)

Frequently Asked Questions

How many credits is KTU Advanced Data Structures (PECST495)?

3 credits, with 3:0:0:0 (L:T:P:R) teaching hours per week, under the KTU 2024 Scheme.

How many modules are in the PECST495 syllabus?

4 modules, 36 total contact hours.

What is the CIE and ESE mark split for this course?

CIE (Continuous Internal Evaluation): 40 marks. ESE (End Semester Examination): 60 marks, 2 Hrs. 30 Min.. Total: 100 marks.

What are the recommended reference books for PECST495?

Advanced Data Structures: Theory and Applications (Suman Saha, Shailendra Shukla); Advanced Data Structures (Peter Brass); Introduction to Algorithms (Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, Clifford Stein); Fundamentals of Computer Algorithms (Ellis Horowitz, SatrajSahani and Rajasekharam), and others.

Is this syllabus specific to one branch, or common to others too?

This Semester 4 course is listed under Program Elective I — Computer Science and Engineering at KTU under the 2024 Scheme — check the course header above for which branches it's common to.

Need help with KTU Advanced Data Structures?

Learnizo offers live, 1-on-1 online tuition for KTU CSE subjects — matched to your exact module and semester.