PAHSU · Second Year B.Tech. Computer Science and Engineering · NEP 2020
Data Structure
CSEPCC-03 · Semester III · 4 credits · ISE 30 + ESE 70
4 credits with its lab (3 lecture + 1 practical); the lab adds ICA 25 and an oral/practical exam (POE) of 25.
Unit 1: Introduction to Data Structures and Searching-Sorting
6 hoursTypes of data structures: static, dynamic, primitive, non-primitive, linear and non-linear; time and space complexity; linear and binary search; bubble, insertion, merge, quick, selection, shell, radix and heap sort.
Examined in the 70-mark end-semester paper
Unit 2: Hashing
5 hoursHash functions and choosing one; collision resolution by open addressing (linear probing, quadratic probing, double hashing) and by chaining.
Examined in the 70-mark end-semester paper
Unit 3: Stack and Queue
6 hoursStacks: representation, operations, implementation and applications such as converting Polish notations and evaluating postfix expressions; queues: linear, circular and priority queues.
Examined in the 70-mark end-semester paper
Unit 4: Lists
6 hoursSingly, doubly and circular linked lists; stacks and queues using linked lists; adding and subtracting two polynomials.
Examined in the 70-mark end-semester paper
- Singly linked lists
- Circular and doubly linked lists
- Stacks and queues using linked lists
- Polynomial manipulation with linked lists
Unit 5: Trees
6 hoursBinary trees and binary search trees: traversal, linked implementation and operations; threaded binary trees.
Examined in the 70-mark end-semester paper
Unit 6: Multiway Trees
6 hoursMultiway search trees and balanced multiway trees; traversing and inserting into a multiway tree; B-trees and B+ trees.
Examined in the 70-mark end-semester paper
- B-trees and B+ trees
Unit 7: Height-Balanced Trees
6 hoursAVL trees: definition, height, insertion and deletion; single and double rotations.
Examined in the 70-mark end-semester paper
- AVL trees and rotations
Unit 8: Graphs
7 hoursUndirected and directed graphs and their terminology; computer representation of graphs; depth-first and breadth-first search; shortest paths using Dijkstra's algorithm.
Examined in the 70-mark end-semester paper
- Graph representation
- Graph traversal: DFS and BFS
- Dijkstra's shortest path and topological sorting
Unit contents are summarised from the official PAHSU syllabus . AiCanCode.org is not affiliated with Punyashlok Ahilyadevi Holkar Solapur University (PAHSU).