Chat with us on WhatsAppCall Learnizo

KTU 2024 Scheme · Semester 3 · Program Core Lab — Information Technology

Data Structures Lab (PCITL308) Syllabus

Official KTU 2024 Scheme syllabus for Data Structures Lab, Semester 3, Program Core Lab — Information Technology (Information Technology).

This page compiles APJ Abdul Kalam Technological University's officially published 2024 Scheme syllabus for Information Technology, 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

PCITL308

Credits

2

Teaching Hours

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

CIE Marks

50

ESE Marks

50

Exam Duration

2 Hrs 30 Min

Prerequisites

GXEST204: Programming in C

Semester

Semester 3

Course Objective

To understand the importance of data structures, abstract data types and their usability in different applications; to implement basic searching, sorting and hashing algorithms; to implement linear and non-linear data structures using arrays and linked lists; to apply data structures such as stacks, queues, trees and graphs to computing problems; and to identify suitable data structures and algorithms for real-world problems.

Module-wise Syllabus

Module 1

1. Stack using an array. 2. Use a stack to convert an infix expression to postfix and evaluate a postfix expression. 3. Polynomial representation using arrays and polynomial addition. 4. Queue and circular queue using arrays. 5. Sorting algorithms - bubble, insertion, selection, quick and merge sort. 6. Linear search and binary search. 7. Hash tables using various mapping functions and collision resolution schemes. 8. Singly linked list operations - traversing, searching, insertion, deletion. 9. Doubly linked list operations - traversing, searching, insertion, deletion. 10. Polynomial representation using linked lists and polynomial addition. 11. Stack and queue using a linked list. 12. Preorder, inorder and postorder traversals on binary trees using recursive algorithms. 13. Binary search trees - creation, insertion, deletion, searching. 14. Heap sort. 15. Graph representation using adjacency list and adjacency matrix, and computing parameters such as in-degree and out-degree. 16. BFS and DFS for each graph representation. 17. Dijkstra's algorithm for finding the shortest path. 18. Any application program using trees.

Course Outcomes

  • CO1Perform operations on fundamental data structures such as arrays, stacks, queues, linked lists and hash tables.
  • CO2Implement and analyze various sorting and searching algorithms, understanding their efficiency and use cases.
  • CO3Solve complex problems involving tree and graph data structures.
  • CO4Analyze and optimize the performance of data structure operations, including polynomial representation and addition, using arrays and linked lists and different implementations of stacks and queues.

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

Continuous Internal Evaluation (CIE)

Attendance5
Preparation / Pre-Lab Work, Experiments, Viva, Timely Completion of Lab Reports / Record (Continuous Assessment)25
Internal Examination20

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

  • Classic Data Structures — Debasis Samanta (Prentice Hall, 2nd edition, 2008)
  • Data Structures Through C — Yashavant Kanetkar (BPB Publications, 3rd edition, 2019)

Reference Books

  • Data Structures and Algorithms — Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman (Pearson Education, 2nd edition, 2008)
  • Introduction to Algorithms — T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein (MIT Press, 4th edition, 2022)
  • Introduction to Data Structures with Applications — J. P. Tremblay, P. G. Sorenson (Tata McGraw Hill, 2nd edition, 2001)
  • Fundamentals of Data Structures in C — E. Horowitz, S. Sahni, D. Mehta (University Press, 2nd edition, 2008)

Frequently Asked Questions

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

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 PCITL308 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 PCITL308?

Classic Data Structures (Debasis Samanta); Data Structures Through C (Yashavant Kanetkar).

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

This Semester 3 course is listed under Program Core Lab — Information Technology 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 IT subjects — matched to your exact module and semester.