Data Structure is a way of collecting and organizing data in such a way that we can perform operations on these data in an effective way. Data Structures is about rendering data elements in terms of some relationship, for better organization and storage.

Introduction – Data Structure and Algorithms

In this “Introduction – Data Structure and Algorithms” you will learn about the following topics:

  1. Introduction of Data Structure and Algorithms (DSA)
  2. Characteristics of Data Structure, Execution Time Cases, Characteristics of Algorithm
  3. Types of Data Structure
  4. Primitive Data Structures, Non-primitive Data Structures
  5. Abstract Data Types (ADTs)
  6. Scope of Abstract Data Types
  7. Abstract Data Type Model
  8. ADT Data Structure
  9. ADT Operations
  10. Types of Abstract Data Types (ADTs)
  11. List ADT, Stack ADT, Queue ADT, Tree ADT
  12. Brief Introduction to Recursion




==== Point to Note ====

If you like to contribute, you can mail us BCA Notes, BCA Question Collections, BCA Related Information, and Latest Technology Information at [email protected].

See your article appearing on BCA Notes (Pokhara University) main page with your designation and help other BCA Students to excel.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

BCA 3rd Semester Data Structure and Algorithms (DSA) Notes Pdf: