DBATU Final Year E&TC syllabus

DBATU · Final Year B.Tech Electronics & Telecommunication Engineering · Non-NEP

Data Structure & Algorithms Using Java Programming

BTETOE704C · Elective III · Semester VII · 4 credits · Continuous assessment 20 + mid-semester 20 + end-semester 60

One of the Elective III options.

All notes for this subject
  1. Unit 1: Introduction

    7 hours

    Elementary data organisation and operations; algorithm analysis, asymptotic notation and time-space trade-off; linear and binary search and their complexity.

    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
    • Time and space complexity, asymptotic notation
    • Linear and binary search
  2. Unit 2: Stacks and Queues

    7 hours

    The stack ADT, its operations and applications; the queue ADT; simple, circular and priority queues and their operations.

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

    • Stack and its array implementation
    • Infix to postfix conversion
    • Queue and its array implementation
    • Circular queue
    • Priority queue and applications of queues
  3. Unit 3: Linked Lists

    7 hours

    Singly linked lists in memory with traversal, search, insertion and deletion; linked stacks and queues; header nodes; doubly and circular linked lists and their analysis.

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

    • Singly linked list operations
    • Doubly and circular linked lists
    • Stack and queue using linked lists
  4. Unit 4: Trees

    7 hours

    Tree terminology; binary, threaded binary, binary search and AVL trees with their operations; applications of binary trees; B-trees and B+ trees.

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

    • Tree terminology and binary trees
    • Binary tree representation and traversals
    • Threaded binary trees
    • Binary search tree operations
    • AVL trees and rotations
    • B-trees and B+ trees
  5. Unit 5: Sorting, Hashing and Graphs

    7 hours

    Selection, bubble, insertion, quick, merge and heap sort compared; hashing; graph terminology, representation and traversal.

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

    • Bubble, selection and insertion sort
    • Quick sort and merge sort
    • Heap sort
    • Hashing and collision resolution
    • Graph terminology and representation
    • BFS and DFS traversal

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