Learnizo - Online Tuition Platform Logo
Chat with us on WhatsAppCall Learnizo

KTU 2024 Scheme · Semester 3 · Common to CS/CA/CM/CD/CR/AI/AM/AD/CB/CN/CC/CU/CI/CG

Data Structures and Algorithms (PCCST303) Syllabus

Official KTU 2024 Scheme syllabus for Data Structures and Algorithms, Semester 3, Common to CS/CA/CM/CD/CR/AI/AM/AD/CB/CN/CC/CU/CI/CG (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

PCCST303

Credits

4

Teaching Hours

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

CIE Marks

40

ESE Marks

60

Exam Duration

2 Hrs 30 Min

Prerequisites

UCEST105 (Algorithmic Thinking with Python)

Semester

Semester 3

Course Objective

To provide the learner a comprehensive understanding of data structures and algorithms, and to prepare them for advanced studies or professional work in computer science and related fields.

Module-wise Syllabus

Module 1

11 contact hours

Basic Concepts of Data Structures: definitions, data abstraction, performance analysis — time and space complexity, asymptotic notations. Polynomial representation using arrays, sparse matrix (tuple representation). Stacks and Queues: stacks, multi-stacks, queues, circular queues, double ended queues. Evaluation of Expressions: infix to postfix, evaluating postfix expressions.

Module 2

11 contact hours

Linked List and Memory Management: singly linked list — operations, stacks and queues using linked list, polynomial representation using linked list; doubly linked list; circular linked list; memory allocation — first-fit, best-fit and worst-fit allocation schemes; garbage collection and compaction.

Module 3

11 contact hours

Trees and Graphs: trees — representation, binary trees (types and properties, representation, operations, traversals), expression trees, binary search trees, binary heaps (operations, priority queue). Graphs — definitions, representation, depth-first search and breadth-first search, applications of graphs (single source all destination).

Module 4

11 contact hours

Sorting and Searching: sorting techniques — selection sort, insertion sort, quick sort, merge sort, heap sort, radix sort. Searching techniques — linear search, binary search, hashing (hashing functions: mid square, division, folding, digit analysis; collision resolution: linear probing, quadratic probing, double hashing, open hashing).

Course Outcomes

  • CO1Identify appropriate data structures for solving real world problems.
  • CO2Describe and implement linear data structures such as arrays, linked lists, stacks, and queues.
  • CO3Describe and implement non-linear data structures such as trees and graphs.
  • CO4Select appropriate searching and sorting algorithms to be used in specific circumstances.

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

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. and 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 and Algorithms (PCCST303)?

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

How many modules are in the PCCST303 syllabus?

4 modules, 44 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 textbooks for PCCST303?

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 Common to CS/CA/CM/CD/CR/AI/AM/AD/CB/CN/CC/CU/CI/CG at KTU under the 2024 Scheme — check the course header above for which branches it's common to.

Need help with KTU Data Structures and Algorithms?

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

Explore BTech CSE Tuition