RTMNU SY AI & DS syllabus

RTMNU · Second Year B.Tech Artificial Intelligence & Data Science · NEP 2020

Data Structure

BAD3T09 · Semester III · 3 credits · College 30 + university 70

All notes for this subject
  1. Unit 1: General Concepts and Linear Data Structures

    8 hours

    Abstract data structures, their properties and operations, and the time and space complexity of algorithms; linear and binary search; selection, bubble, merge and quick sort.

    Examined in the 70-mark end-semester paper

    • Abstract data types
    • Time and space complexity
    • Sequential and binary search
    • Insertion, bubble and selection sort
    • Merge sort and quick sort
  2. Unit 2: Stacks, Queues and Linked Lists

    7 hours

    Stacks using arrays and their applications; queues using arrays, circular queues, priority queues and deques; singly, circular and doubly linked lists, generalised lists, list operations and linked stacks and queues.

    Examined in the 70-mark end-semester paper

    • Stack ADT and operations
    • Queue ADT and operations
    • Circular queues
    • Deques and priority queues
    • Singly linked lists
    • Doubly linked lists
    • Generalised linked lists
    • Linked stacks and queues
  3. Unit 3: Trees

    7 hours

    General and binary trees, their representations and traversals, general trees as binary trees, binary search trees, balancing, AVL trees, B-trees, B+ trees and threaded binary trees.

    Examined in the 70-mark end-semester paper

    • Tree terminology and representation
    • Binary tree traversals
    • Binary search trees
    • AVL trees
    • B-trees and B+ trees
    • Threaded binary trees
  4. Unit 4: Graphs and Their Applications

    7 hours

    Graphs and digraphs, their representations, BFS and DFS traversals, shortest-path algorithms and minimum spanning trees.

    Examined in the 70-mark end-semester paper

    • Graph representation
    • DFS and BFS
    • Dijkstra's algorithm
    • Floyd-Warshall algorithm
    • Prim's and Kruskal's algorithms
  5. Unit 5: Hashing

    6 hours

    Hash functions, collision resolution techniques, the expected behaviour of hashing and its applications.

    Examined in the 70-mark end-semester paper

    • Hash functions and their applications
    • Hashing and collision resolution
    • Open addressing and perfect hashing

Unit contents are summarised from the official RTMNU syllabus . AiCanCode.org is not affiliated with Rashtrasant Tukadoji Maharaj Nagpur University (RTMNU).