RTMNU SY E&TC syllabus

RTMNU · Second Year B.Tech Electronics & Telecommunication Engineering · NEP 2020

Data Structure and Algorithms

BMD4T02 · Semester IV · 2 credits · College 30 + university 70

The multidisciplinary-minor course for E&TC students in Semester IV.

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

    6 hours

    Data structures and why they are needed, abstract data types and their types; linear and binary search; bubble, insertion and selection sort; divide and conquer with merge sort and quick sort, and the complexity of sorting methods.

    Examined in the 70-mark end-semester paper

    • Data structures and abstract data types
    • Time and space complexity, asymptotic notation
    • Linear and binary search
    • Bubble, selection and insertion sort
    • Quick sort and merge sort
  2. Unit 2: Arrays, Stacks and Queues

    6 hours

    Single and multidimensional arrays in row-major and column-major order and their applications; stacks with push and pop, infix, prefix and postfix conversion and evaluation, multiple stacks; queues, circular queues and priority queues.

    Examined in the 70-mark end-semester paper

    • Arrays and their storage representation
    • Stack and its array implementation
    • Infix to postfix conversion
    • Postfix expression evaluation
    • Queue and its array implementation
    • Circular queue
    • Priority queue and applications of queues
  3. Unit 3: Linked Lists and Trees

    7 hours

    Dynamic memory allocation; singly, doubly and circular linked lists and their operations, polynomial representation; trees and their traversals, binary trees, BST insertion and deletion, expression trees, AVL trees and heap trees.

    Examined in the 70-mark end-semester paper

    • Pointers and dynamic memory allocation
    • Singly linked list operations
    • Doubly and circular linked lists
    • Polynomial representation and addition with linked lists
    • Binary tree representation and traversals
    • Binary search tree operations
    • AVL trees and rotations
    • Heap sort
  4. Unit 4: Graphs and Hashing

    7 hours

    Graph data structures, adjacency matrix and list, traversals and their applications, weighted graphs, shortest paths with Dijkstra's algorithm, minimum spanning trees and Hamiltonian paths; symbol tables, hash tables and functions, collision resolution and overflow handling.

    Examined in the 70-mark end-semester paper

    • Graph terminology and representation
    • BFS and DFS traversal
    • Dijkstra's shortest path algorithm
    • Minimum spanning tree: Prim's algorithm
    • Minimum spanning tree: Kruskal's algorithm
    • Hashing and collision resolution

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