DBATU SY IT syllabus

DBATU · Second Year B.Tech Information Technology · NEP 2020

Data Structures

25AF1246PC302 · Semester III · 3 credits · Continuous assessment 20 + mid-semester 20 + end-semester 60

All notes for this subject
  1. Unit 1: Introduction to Data Structures

    5 hours

    Abstract data types; linear and non-linear, static and dynamic data structures; recursion with the Tower of Hanoi.

    Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then

    • Data structures and abstract data types
    • Classification of data structures
    • Recursion and the Tower of Hanoi
  2. Unit 2: Stack and Queue

    7 hours

    Static and dynamic stacks, push, pop and display; infix-to-postfix conversion and expression evaluation; queues and their operations; circular, double-ended and priority queues and their applications.

    Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then

    • Stack implementation with arrays and linked lists
    • Stack applications: recursion and expression conversion
    • Evaluating postfix and prefix expressions
    • Queue, circular queue and deque
    • Priority queues
  3. Unit 3: Linked List

    7 hours

    Static and dynamic representation; singly, doubly and circular lists; insertion and deletion at the beginning, a given position and the end; applications.

    Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then

    • Singly linked list
    • Doubly and circular linked lists
  4. Unit 4: Tree

    7 hours

    Terminology; binary trees, binary search trees and AVL trees; insertion, deletion and search in binary trees; traversals; applications.

    Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then

    • Binary trees and their representation
    • Binary tree traversals
    • Binary search trees
    • AVL and 2-3 trees
  5. Unit 5: Graph, Searching and Sorting

    9 hours

    Types of graph; adjacency matrix and list; depth-first and breadth-first traversal; minimum spanning trees; linear and binary search; insertion, selection, merge and quick sort.

    Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then

    • Graph representation, BFS and DFS
    • Minimum spanning trees: Prim's and Kruskal's
    • Linear and binary search
    • Bubble, selection and insertion sort
    • Divide and conquer: merge sort and quick sort

Unit contents are summarised from the official DBATU syllabus . AiCanCode.org is not affiliated with Dr. Babasaheb Ambedkar Technological University (DBATU).