About Data Structures and Algorithms (PCCST303)
Data Structures and Algorithms (PCCST303) is a third-semester course in the KTU B.Tech 2024 scheme, common to CSE and its allied branches such as AI & DS, CSE (Data Science) and Cyber Security. It teaches how to organise data efficiently in a program and how to choose the right algorithm for a task, the foundation for almost every later computer science subject and for coding interviews.
Syllabus
- Module 1: Basics and complexity analysis (Big O, Omega, Theta), arrays, polynomials and sparse matrices, stacks and queues, and infix to postfix conversion and evaluation.
- Module 2: Linked lists (singly, doubly and circular), stacks and queues using linked lists, and memory allocation schemes (first-fit, best-fit, worst-fit).
- Module 3: Trees, binary trees and traversals, binary search trees, binary heaps, and graphs with depth-first and breadth-first search.
- Module 4: Sorting (selection, insertion, quick, merge, heap and radix sort), linear and binary search, and hashing with collision resolution.
Exam pattern
The end-semester exam is for 60 marks: 8 short questions of 3 marks each, plus 4 questions of 9 marks each, one from each module. Internal assessment adds 40 marks.
Study tips
Trace algorithms by hand on small examples: tree traversals, BST insertion and deletion, heap operations, sorting passes and hash table insertions are common exam questions. Write the algorithms in pseudocode or C, and solve previous question papers to spot repeated topics.
Notes and resources
Find module-wise notes, solved problems, previous year question papers and the syllabus for PCCST303 here, shared by KTU students and teachers.