BCA Semester-IIIrd - Data Structure using C & C++ Syllabus

Here you will find the syllabus of second subject in BCA Semester-IIIrd, which is Data Structure using C and C++.

Important - The syllabus may vary from college to college.

Data Structure using C and C++ Units

This course/subject is divided into total of 6 units as given below:

  1. Array
  2. Stacks and Queues
  3. Lists
  4. Trees
  5. Binary Trees
  6. Sorting and Searching Techniques

Now let's expand the above listed units with its syllabus.

Unit-I Syllabus - Array

Here are the list of topics that comes under the syllabus of unit-I, that is array:

  • Representation of one dimensional (1D) array
  • Representation of multidimensional (2D and 3D) arrays
  • Sparse arrays - lower and upper triangular matrices and tridiagonal matrices with vector representation

Unit-II Syllabus - Stacks and Queues

Here are the list of topics that comes under the syllabus of unit-II, that is stacks and queues:

  • Introduction to stack
  • Primitive operations on stack
  • Stack application
  • Infix
  • Postfix
  • Prefix expressions
  • Evaluation of postfix expression
  • Conversion between
    • Prefix
    • Infix
    • Postfix
  • Introduction to queues
  • Primitive operation on queues
  • D-queues and priority queues

Unit-III Syllabus - Lists

Here are the list of topics that comes under the syllabus of unit-III, that is lists:

  • Introduction to linked lists
  • Sequential and linked lists
  • Operations such as
    • Traversal
    • Insertion
    • Deletion
    • Searching
  • Two way lists and Use of headers

Unit-IV Syllabus - Trees

Here are the list of topics that comes under the syllabus of unit-IV, that is trees:

  • Introduction to trees
  • Terminology in trees
  • Traversal of binary trees
  • Recursive algorithms for tree operations such as
    • Traversal
    • Insertion
    • Deletion
  • Binary Search Tree

Unit-V Syllabus - Binary Trees

Here are the list of topics that comes under the syllabus of unit-V, that is binary trees:

  • Introduction
  • The invention of B-Tree
  • Statement of the problem
  • Indexing with binary search trees
  • A better approach to tree indexes
  • Working up from the bottom
  • Example for creating a B-Tree

Unit-VI Syllabus - Sorting and Searching Techniques

Here are the list of topics that comes under the syllabus of unit-VI, that is sorting and searching techniques:

  • Insertion sort
  • Selection sort
  • Merge sort
  • Heap sort
  • Linear search
  • Binary search and hashing

« Previous Course Next Course »

Like/Share Us on Facebook 😋