Data Structure


Data Structure

  • Description
  • Curriculum

Data Structure with Algorithms & Problem Solving Skills (DS-APS)
(University Syllabus + Practical’s + Technical Interview)

Any successful IT software product will always produced with the lots of efforts from team of good software engineers. A good software engineer must possess good problem solving skills. Most of the product companies like Google, Wallmart labs, Yahoo, Facebook, MicroSoft, Adobe, Rediff, Amazon, Fair Issac, D E Shaw, QualComm, ComVault, Oracle etc..., need software engineers who had excellent problem solving skills.

The “Data Structure with Algorithms & Problem Solving Skills (DS-APS)” course is a platform to improve your problem solving skills besides providing strong fundamental knowledge on Data Structures and Algorithms. The course focuses more on discussions in the class which allows the participants to come up with new ideas.

Objective of DS-APS course:

Upon successful completion of “DS-APS course” training, participants will be able to:

  • Enhance Thinking process
  • Crack any product company interview/written tests
  • Understand the practical application of problems & their impact on software products
  • Think through the solution techniques to any problem
  • Improve the analysis skills of the algorithms generated by themselves/others
  • Enhance the coding skills to maximum possible level
  • Target Audience

Any under-graduate/graduate students from Universities, RECs, NITs, IIITs and IITs Self motivated candidates from any college who want to crack big companies Students who already had job offer(s) and aspire to join Big League Students who want in-depth knowledge in Data Structures, Algorithms & Programming Working software professionals who are looking for better opportunities in product based software companies Any passionate student/working professional who wants to understand the fundamentals of computer science which are mandatory for any software developer.

DS-APS programming -Beginner to Corporate syllabus


  • Characteristics of a Data Structure
  • Need for Data Structure
  • Execution Time Cases
  • Basic Terminology

Algorithms ─ Basics

  • Characteristics of an Algorithm
  • How to Write an Algorithm?
  • Algorithm Analysis
  • Algorithm Complexity
  • Space Complexity
  • Time Complexity

Greedy Algorithms

  • Counting Coins

Divide & Conquer

  • Divide/Break
  • Conquer/Solve
  • Merge/Combine

Dynamic Programming

  • Basic Concepts
  • Data Definition
  • Data Object
  • Data Type
  • Basic Operations


  • Array Representation
  • Basic Operations
  • Insertion Operation
  • Array Insertions
  • Insertion @ Beginning of an Array
  • Insertion @ Given Index of Array
  • Insertion After Given Index of an Array
  • Insertion Before Given Index of an Array
  • Deletion Operation
  • Search Operation
  • Update Operation


  • Linked List ─ Basics

  • Linked List Representation
  • Types of Linked List
  • Basic Operations
  • Insertion Operation
  • Deletion Operation
  • Reverse Operation
  • Linked List Program in C

  • Doubly Linked List

  • Doubly Linked List Representation
  • Basic Operations
  • Insertion Operation
  • Deletion Operation
  • Insertion at the End of an Operation
  • Doubly Linked List Program in C

  • Circular Linked List

  • Singly Linked List as Circular
  • Doubly Linked List as Circular
  • Basic Operations
  • Insertion Operation
  • Deletion Operation
  • Display List Operation
  • Circular Linked List Program in C


  • Stack Representation
  • Basic Operations
  • peek()
  • isfull()
  • isempty()
  • Push Operation
  • Pop Operation
  • Stack Program in C


  • Queue Basic Operations
  • peek()
  • isfull()
  • isempty()
  • Enqueue Operation
  • Dequeue Operation
  • Queue Program in C


  • Linear Search
  • Linear Search Program in C
  • Binary Search
  • How Binary Search Works?
  • Binary Search Program in C
  • Interpolation Search
  • Positioning in Binary Search
  • Interpolation Search Program in C

Hash Table

  • Hashing
  • Linear Probing
  • Basic Operations
  • Data Item
  • Hash Method
  • Search Operation
  • Insert Operation
  • Delete Operation
  • Hash Table Program in C


  • Sorting Algorithm
  • In-place Sorting and Not-in-place Sorting
  • Stable and Not Stable Sorting
  • Adaptive & Non-Adaptive Sort Algorithm

  • Bubble Sort Algorithm

  • How Bubble Sort Works?
  • Bubble Sort Program in C

  • Insertion Sort

  • How Insertion Sort Works?
  • Insertion Sort Program in C
  • Selection Sort
  • How Selection Sort Works?
  • Selection Sort Program in C

  • Merge Sort Algorithm

  • How Merge Sort Works?
  • Merge Sort Program in C

  • Shell Sort

  • How Shell Sort Works?
  • Shell Sort Program in C

  • Quick Sort

  • Partition in Quick Sort
  • Quick Sort Algorithm
  • Quick Sort Program in C


  • Graphs
  • Graph Data Structure
  • Basic Operations