CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY (A)
  • Data Structures and Algorithms - IT2 - 2020-2021
    0%
  • Previous
  • Course data
    General
    Announcements
    DSA - Slip Test -1 BE (IT2)
    DSA Sliptest 2
    BE IT2 2020 Assignment 1 & 2
    Sliptest 3
    UNIT-1
    UT1-Insertion Linked List-13-08-20
    UT1- Array_Linked List-10-08-20
    UT1-Linked List- Find(), delete(), Display(), traverse() 14-08-20202
    Single Linked List
    UT1- ADT, DLL insertion() 17-08-2020
    Doubly Inked list Deletion, reverse()
    Doubly Linked List
    UT1-DSA-Circular Linked List create(), insert(), display() 20-08-2020
    UT1- Circular Linked List deletion(), Display()
    Circular Linked List
    UT1- Introduction to Analysis of Algorithms
    Introduction to Algorithmic Analysis
    UT1-Asymptotic Notation Big Oh,Omega,theta 27-8-2020
    material on asymptotic-analysis
    Examples on Asymptotic notations 28-08-2020
    UNIT-2
    UT2- Stacks-Arrays 
    UT2 - Stack using arrays infix to post fix and parenthesis matching
    UT2- Postfix Evaluation, Stack- Linked List 03-09-2020
    UT2 Queues -Arrays
    UT2-Circular Queue Array
    UT2 Circular Linked List 08-09-2020
    UT2-Deques- Arrays 11-09-2020
    Simple Queue, Circular Queue, Deque- Arrays and Linked List
    Deques-Linked List 14-09-2020 at 1.00 to 2.00 pm
    UT2-STL-Iterators -Containers 14-09-2020 2.30 to 3.30
    UNIT-3
    UT-3 General Trees 15-09-2020
    UT3-TREE-Binary tree and traversals 18-09-2020
    UT3 Binary Trees traversals 21-09-2020
    UT3 - Vector based structure for BT 22-09-2020
    Binary Trees Unit-3
    UT3-Binary Tree array & LL implementation 26-09-2020 (2020-09-25 at 22:36 GMT-7)
    UT3-Pattern Matching- Brute Force 28-0-2020
    UT3-Pattern Matching- Boyer-Moore 29-09-
    U3-KMP algorithm 05-10-20
    UT3- Standard Tries 06-10-2020
    UT3-Compressed and Suffix Tries 10-10-20
    Pattern matching
    UNIT 4
    UT4-Binary Search Trees
    UT4- BST Time Complexities
    binary search trees
    UT4- AVL Trees 23-10-2020
    UT4 Deletion of AVL Tree
    AVL TREE
    Heap -Creation and Deletion (extra class) (2020-10-29 at 22:35 GMT-7)
    UT4- Priority Queues -Heap Sort Program 02-11-2020
    UT4 Selection and Insertion sort 03-11-2020
    UT4 quick sort 06-11-2020 at 11.00 to 12.00
    UT4 Radix, Shell sort
    heap
    selection insertion
    Graphs
    UNIT 5
    UT5-Graphs
    UT5-DSA-Graphs Edgelist,Adjacency Matrix Friday, November 13
    UT5-BFS, Program_DFS and BFS
    UT5-Minimum Spanning Trees
    UT5-Hashing Intro
    UT5-Collision Techniques
    UT5-Load factor and Rehashing
    Hashing
  • Next
  CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY (A)
    • Log in
      Forgot Password?
    Data Structures and Algorithms - IT2 - 2020-2021
    Home
    Skip to main content

    Course info

    1. Home
    2. Courses
    3. Information Technology
    4. UG
    5. Academic Year 2020-2021
    6. III Semester
    7. Data Structures and Algorithms - IT2 - 2020-2021
    8. Summary

    Data Structures and Algorithms - IT2 - 2020-2021

    • Teacher: Dr. M. Trupthi Assistant Professor
    Skill Level: Beginner

    Follow Us

    Chaitanya Bharathi Institute of Technology(Autonomous), Hyderabad
    You are not logged in. (Log in)
    Get the mobile app