Scribd Logo
Upload

Welcome to Scribd!

  • 71 views

    Data Structure Syllabus

    Uploaded by

    Aditya Kumar Singh
    This document provides an overview of the Bachelor of Computer Applications course BCA207 on Data Structures. The course is worth 3 credits and involves 3 hours of lectures per week over 45 weeks, with midterm and final exams. The course covers fundamental data structures like arrays, linked lists, stacks, queues, trees, and graphs. It also covers algorithms for searching, sorting, tree traversal, and graph traversal. The textbook list includes several references on data structures using C and C++.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Data Structure Syllabus

    Uploaded by

    Aditya Kumar Singh
    71 views1 page
    This document provides an overview of the Bachelor of Computer Applications course BCA207 on Data Structures. The course is worth 3 credits and involves 3 hours of lectures per week over 45 weeks, with midterm and final exams. The course covers fundamental data structures like arrays, linked lists, stacks, queues, trees, and graphs. It also covers algorithms for searching, sorting, tree traversal, and graph traversal. The textbook list includes several references on data structures using C and C++.

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides an overview of the Bachelor of Computer Applications course BCA207 on Data Structures. The course is worth 3 credits and involves 3 hours of lectures per week over 45 weeks, with midterm and final exams. The course covers fundamental data structures like arrays, linked lists, stacks, queues, trees, and graphs. It also covers algorithms for searching, sorting, tree traversal, and graph traversal. The textbook list includes several references on data structures using C and C++.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    71 views1 page

    Data Structure Syllabus

    Uploaded by

    Aditya Kumar Singh
    This document provides an overview of the Bachelor of Computer Applications course BCA207 on Data Structures. The course is worth 3 credits and involves 3 hours of lectures per week over 45 weeks, with midterm and final exams. The course covers fundamental data structures like arrays, linked lists, stacks, queues, trees, and graphs. It also covers algorithms for searching, sorting, tree traversal, and graph traversal. The textbook list includes several references on data structures using C and C++.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 1

    Bachelor of Computer Applications

    Data Structures
    Course Code: BCA207 Credits: 3
    No. of Lectures (Hrs/Week): 3 Mid Sem. Exam Hours: 1
    Total No. of Lectures (Sem.): 45 End Sem. Exam Hours: 3

    UNIT I INTRODUCTION
    Basic Terminology, Elementary Data Organization, Algorithm, Efficiency of an Algorithm, Time and
    Space Complexity, Asymptotic notations: Big Oh, Big Theta and Big Omega, Time-Space trade-off.
    Abstract Data Types (ADT). Arrays: Definition, Single and Multidimensional Arrays, Representation of
    Arrays: Row Major Order, and Column Major Order, Sparse Matrices and their representations. Linked
    lists: Operations on a linked list, Insertion, Deletion, Traversal.

    UNIT II STACK AND QUEUE


    Stacks: Abstract Data Type, Primitive Stack operations: Push & Pop, Array and Linked Implementation
    of Stack in C, Application of stack: Prefix and Postfix Expressions. Queues: Operations on Queue:
    Create, Add, Delete, Full and Empty, Circular queues, Array and linked implementation of queues in C,
    De-queue and Priority Queue.

    UNIT III SEARCHING AND SORTING


    Searching: Concept of Searching, Sequential search, Index Sequential Search, Binary Search. Concept of
    Hashing & Collision resolution Techniques used in Hashing. Sorting: Insertion Sort, Selection, Bubble
    Sort, Quick Sort, Merge Sort, Heap Sort and Radix Sort.

    UNIT IV TREES
    Basic terminology used with Tree, Binary Trees, Binary Tree Representation, Binary Search Tree, Strictly
    Binary Tree ,Complete Binary Tree . A Extended Binary Trees, Tree Traversal algorithms: Inorder,
    Preorder and Postorder, Constructing Binary Tree from given Tree Traversal.

    UNIT V GRAPHS
    Terminology used with Graph, Data Structure for Graph Representations: Adjacency Matrices, Adjacency
    List. Graph Traversal: Depth First Search and Breadth First Search, Connected Component, Spanning
    Trees, Minimum Cost Spanning Trees: Prim’s and Kruskal’s algorithm.

    Text books:
    1. Aaron M. Tenenbaum, Yedidyah Langsam and Moshe J. Augenstein, “Data Structures Using C and C+
    +”, PHI Learning Private Limited, Delhi India
    2. Horowitz and Sahani, “Fundamentals of Data Structures”, Galgotia Publications Pvt Ltd Delhi India.
    3. Lipschutz, “Data Structures” Schaum’s Outline Series, Tata McGraw-hill Education (India) Pvt. Ltd.
    4. Thareja, “Data Structure Using C” Oxford Higher Education.
    5. AK Sharma, “Data Structure Using C”, Pearson Education India.
    6. Rajesh K. Shukla, “Data Structure Using C and C++” Wiley Dreamtech Publication.

    You might also like