PAHSU SY CSE syllabus

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.

  1. Unit 1: Introduction to Data Structures and Searching-Sorting

    6 hours

    Types 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

  2. Unit 2: Hashing

    5 hours

    Hash 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

  3. Unit 3: Stack and Queue

    6 hours

    Stacks: 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

  4. Unit 4: Lists

    6 hours

    Singly, doubly and circular linked lists; stacks and queues using linked lists; adding and subtracting two polynomials.

    Examined in the 70-mark end-semester paper

  5. Unit 5: Trees

    6 hours

    Binary trees and binary search trees: traversal, linked implementation and operations; threaded binary trees.

    Examined in the 70-mark end-semester paper

  6. Unit 6: Multiway Trees

    6 hours

    Multiway 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
  7. Unit 7: Height-Balanced Trees

    6 hours

    AVL trees: definition, height, insertion and deletion; single and double rotations.

    Examined in the 70-mark end-semester paper

    • AVL trees and rotations
  8. Unit 8: Graphs

    7 hours

    Undirected 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

Unit contents are summarised from the official PAHSU syllabus . AiCanCode.org is not affiliated with Punyashlok Ahilyadevi Holkar Solapur University (PAHSU).