KBCNMU SY Computer syllabus

KBCNMU · Second Year B.E. Computer Engineering · NEP 2020

Data Structure and Algorithms

CS-401 · Semester IV · 3 credits · ISE 40 + ESE 60

  1. Unit 1: Introduction to Data Structures

    9 hours

    Data, data items, data types and data structures, their classification and operations; linear arrays — traversal, insertion and deletion; pointers and structures; static and dynamic memory management.

    Examined in the 60-mark end-semester paper

  2. Unit 2: Stacks and Queues

    9 hours

    Stacks and queues represented with arrays; stack applications in arithmetic expressions, recursion and the Tower of Hanoi; circular queues.

    Examined in the 60-mark end-semester paper

  3. Unit 3: Linked Lists

    9 hours

    Linked organisation and its representation in memory; singly, doubly and circular lists with creation, traversal, search, insertion and deletion; stacks and queues as linked lists.

    Examined in the 60-mark end-semester paper

  4. Unit 4: Trees

    9 hours

    Tree terminology, binary trees and their memory representation; binary search trees — search, insertion, deletion and stack-based traversals; AVL trees and rotations; heaps and heap sort.

    Examined in the 60-mark end-semester paper

  5. Unit 5: Algorithms and Searching

    9 hours

    Complexity of algorithms and asymptotic notation; linear and binary search with their time complexity; hash tables, hash functions and collision resolution.

    Examined in the 60-mark end-semester paper

Unit contents are summarised from the official KBCNMU syllabus . AiCanCode.org is not affiliated with Kavayitri Bahinabai Chaudhari North Maharashtra University (KBCNMU).