JAS -ANZ accredited An ISO 9001: 2008 & 9001 : 2015 Certified Autonomous Body | A National Programme of Information Technology Education & Development.

Datastructure Course

Course Detail



A data structure is a specialized format for organizing and storing data. General data structure types include the array, the file, the record, the table, the tree, and so on. Any data structure is designed to organize data to suit a specific purpose so that it can be accessed and worked with in appropriate ways. In computer programming, a data structure may be selected or designed to store data for the purpose of working on it with various algorithms’++ Program Components.

We have the best courses for you!

Enroll today and learn something new.


Module 1
  • Definition
  • Classification of data structures: primitive and non-primitive
  • Operations on data structures
  • Dynamic memory allocation and pointers
  • Definition Accessing the address of a variable
  • Declaring and initializing pointers
  • Accessing a variable through its pointer
  • Meaning of static and dynamic memory allocation
  • Memory allocation functions: Malloc, calloc, free and realloc
Module 2
  • Definition
  • Recursion in C
  • Writing Recursive programs Binomial coefficient
  • Fibonacci
  • GCD
  • Searching and Sorting Search
  • Basic Search Techniques
  • Search algorithm searching techniques
  • sequential search
  • Binary search – Iterative and Recursive methods
  • Comparison between sequential and binary search
Module 3
  • General Background
  • Definition
  • different types
  • Bubble sort
  • Selection sort
  • Merge sort
  • Insertion sort
  • Quick sort
  • Definition
  • Array representation of stack,
  • Operations on stack
  • Infix, prefix and postfix notations Conversion of an arithmetic expression from Infix to postfix.
  • Applications of staks.
Module 4
  • Definition,
  • Array representation of queue,
  • Types of queue: Simple queue, circular queue, double ended queue (deque) priority queue, operations on all types of Queues.
  • Definition,
  • Components of linked list,
  • Representation of linked list,
  • Advantages and Disadvantages of linked list.
  • Types of linked list: Singly linked list, doubly linked list, Circular linked list and circular doubly linked list.
  • Operations on singly linked list: creation, insertion, deletion, search and display.

Career Opportunities

  • Data scientist
  • Data analyst
  • Business analyst
  • Web designer
  • Quality assurance engineer
  • Server engineer
  • Software engineer
  • Data warehouse architect

Entry Qualification

  • Candidates will be admitted on the basis of interviews and / or group discussions.
  • 20% of the total seats will be reserved for SC, ST and OBC candidates.If the reserved seats are not filled within the specified period, the vacant seats will be offered to the general candidates.

Course Features

Industry Experienced Trainer
4.9 (Google Review)
Study Mode
Offline & Online
6 month
English, Bengali, Hindi
100% Job Assistance
Free & Paid
Course Price
Click to Know

Our Students Testimonials

Oxford Global Academy of Excellence Courses

MD Kashid Hossain

   I am MD Kasid Hossain. I am a student of Oxford Global Academy of Excellence, Kolkata. Here I am doing Spoken English class. Oxford Global Academy of Excellence is a very advantage platform by spoken English, computer course and more. There sirs, madams are very Helpful. All time they Support and guide us. I always enjoy my classes.