KTU 2024 Scheme · Semester 3 · Group A

Data Structures Lab (PCCSL307) Syllabus

Official KTU 2024 Scheme syllabus for Data Structures Lab, Semester 3, Group A (Computer Science and Engineering).

This page compiles APJ Abdul Kalam Technological University's officially published 2024 Scheme syllabus for Computer Science and Engineering, Semester 3, 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

PCCSL307

Credits

Teaching Hours

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

CIE Marks

ESE Marks

Exam Duration

2 Hrs 30 Min

Prerequisites

PCCST303 (Data Structures and Algorithms)

Semester

Semester 3

Course Objective

To give practical experience for learners on implementing different linear and non-linear data structures, and algorithms for searching and sorting.

Module-wise Syllabus

Module 1

Sum of two sparse polynomials and transpose/sum of sparse matrices using arrays; infix-to-postfix conversion and evaluation using a stack; Queue, DEQUEUE and Circular Queue using arrays; browser back/forward navigation using doubly linked list operations; polynomial addition and multiplication using singly linked lists; binary tree construction for an arithmetic expression with prefix/postfix equivalents; a word dictionary using binary search trees; shortest distance from a landmine in a maze (graph problem); a container-pouring puzzle modeled as a graph problem; find-and-replace in a text editor; efficient search in a sorted array; Bubble sort, Insertion Sort, Radix sort, Quick Sort and Merge Sort with a comparison of steps; preferential queue ordering for a post office scenario; a spell checker using a hash table; a memory allocator/garbage collector simulation using a doubly linked list; an activity-points optimization problem (0/1 knapsack style); merging K sorted lists using a min-heap.

Course Outcomes

CO1Model a real world problem using a suitable data structure and implement the solution.
CO2Compare the efficiency of different data structures in terms of time and space complexity.
CO3Evaluate the time complexities of various searching and sorting algorithms.
CO4Differentiate static and dynamic data structures in terms of their advantages and application.

Assessment Pattern (CIE: 50 marks, ESE: 50 marks)

Continuous Internal Evaluation (CIE)

Attendance	5
Preparation / Pre-Lab Work, Viva, Timely Record Completion (Continuous Assessment)	25
Internal Examination	20

End Semester Examination (ESE)

Total 50 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

Textbooks

Fundamentals of Data Structures in C — Ellis Horowitz, Sartaj Sahni and Susan Anderson-Freed (Universities Press, 2nd edition, 2007)
Introduction to Algorithms — Thomas H Cormen, Charles Leiserson, Ronald L Rivest, Clifford Stein (PHI, 3rd edition, 2009)

Reference Books

Classic Data Structures — Samanta D. (Prentice Hall India, 2nd edition, 2018)
Data Structures and Algorithms — Aho A.V., J.E. Hopcroft and J.D. Ullman (Pearson Publication, 1st edition, 2003)
Introduction to Data Structures with Applications — Tremblay J.P., P.G. Sorenson (Tata McGraw Hill, 2nd edition, 2017)
Theory and Problems of Data Structures — Lipschutz S. (Schaum's Series, 2nd edition, 2014)

Frequently Asked Questions

How many credits is KTU Data Structures Lab (PCCSL307)?

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

How many modules are in the PCCSL307 syllabus?

1 modules.

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

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

What are the recommended textbooks for PCCSL307?

Fundamentals of Data Structures in C (Ellis Horowitz, Sartaj Sahni and Susan Anderson-Freed); Introduction to Algorithms (Thomas H Cormen, Charles Leiserson, Ronald L Rivest, Clifford Stein).

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

This Semester 3 course is listed under Group A at KTU under the 2024 Scheme — check the course header above for which branches it's common to.

Need help with KTU Data Structures Lab?

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

Explore BTech CSE Tuition