BAMU SY Computer syllabus

BAMU · Second Year B.E./B.Tech Computer Science and Engineering · NEP 2020

Data Structures

PCCT-1 · Semester III · 3 credits · CIA 40 + SEE 60

All notes for this subject
  1. Module 1: Introduction to Data Structures; Queues and Linked Lists

    15 hours

    Data structure operations, ADTs, arrays, structures, pointers, dynamic memory and asymptotic notation; stacks and their applications to infix, postfix and prefix; queues, circular queues, deques and priority queues; singly, header, circular and doubly linked lists and buddy systems.

    Examined in the 60-mark end-semester paper

  2. Module 2: Trees; Sorting

    15 hours

    Binary trees and their memory representation, traversals, header nodes, threaded binary trees and binary search trees (search, insert, delete) with applications; bubble, merge, quick, radix, insertion, selection and heap sort, with their performance compared.

    Examined in the 60-mark end-semester paper

  3. Module 3: Searching and Hashing; Graphs

    15 hours

    Sequential and binary search, hash tables, hash functions and collision resolution, with the complexity of searching; graph terminology, adjacency and path matrices, DFS and BFS, Warshall's and Dijkstra's algorithms, topological sorting and Prim's and Kruskal's spanning trees.

    Examined in the 60-mark end-semester paper

Module contents are summarised from the official BAMU syllabus . AiCanCode.org is not affiliated with Dr. Babasaheb Ambedkar Marathwada University (BAMU).