RTMNU SY Computer Engg syllabus

RTMNU · Second Year B.Tech Computer Engineering · NEP 2020

Data Structure

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

All notes for this subject
  1. Unit 1: Introduction to Algorithm; Sorting and Searching

    8 hours

    General concepts and types of data structures with their properties and operations; time and space analysis of algorithms with big-O, theta and omega notation; selection, insertion, radix and shell sort; linear and binary search.

    Examined in the 70-mark end-semester paper

  2. Unit 2: Stacks and Queues

    7 hours

    Stack operations and implementation, multiple stacks and stack applications; prefix and postfix expressions, infix-to-prefix and infix-to-postfix conversion and their evaluation; simple, circular, double-ended and priority queues and their applications.

    Examined in the 70-mark end-semester paper

  3. Unit 3: Linked Lists

    7 hours

    Linked-list operations and representation; singly, circular and doubly linked lists; polynomial addition and multiplication with linked lists.

    Examined in the 70-mark end-semester paper

  4. Unit 4: Trees

    7 hours

    Tree terminology and properties; binary trees and binary search trees and their operations; threaded binary trees; AVL trees and rotations, red–black trees, B-trees and B+ trees; tree traversals and their applications.

    Examined in the 70-mark end-semester paper

  5. Unit 5: Graphs and Hashing

    7 hours

    Graph representation and applications, DFS and BFS traversal; hash functions and hash tables, simple hash functions and collision handling.

    Examined in the 70-mark end-semester paper

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