Data Structures and Algorithms (DSA)

May 27, 2020

TCS NQT Registration Steps Large

PrepInsta Data Structures & Algorithms

Below you will find all the important Data Structures code that are important for you to learn for Placements and College examinations.

Data Structures and Algorithm Learn Searching PrepInsta

Searching

Searching algorithms are easy to learn but are really important for college semester exams and companies offering package between 3 – 6 LPA would ask direct searching questions in online test/ interviews.

Sorting

Sorting algorithms are easy to learn but are really important for college semester exams and companies offering package between 3 – 6 LPA would ask direct searching questions in online test/ interviews.

Data Structures and Algorithm Learn Sorting

Linked Lists

Linked List is one of the most crucial topics which is easy once understood thoroughly. This topic is very important for both your college semester examinations as well as for placement purposes.

Singly Linked List

  • Introduction to Linked List
  • Insertion in singly Linked List  – C | C++ | Java
  • Deletion in singly Linked List  – C | C++ | Java
  • Reverse a linked list without changing links between nodes (Data reverse only) – C | C++ | Java
  • Reverse a linked list by changing links between nodes – C | C++ | Java
  • Print reverse of a linked list without actually reversing – C |C++ | Java
  • Search an element in a linked list – C | C++ | Java
  • Insertion in a Sorted Linked List – C | C++ | Java
  • Delete alternate nodes of a Linked List – C | C++ | Java
  • Find middle of the linked list – C | C++ | Java
  • Reverse a linked list in groups of given size – C | C++ | Java
  • Find kth node from end of the linked list – C | C++ | Java
  • Append the last n nodes of a linked list to the beginning of the list – C | C++ | Java
  • Check whether linked list is palindrome or not – C | C++ | Java
  • Fold a Linked List – C | C++ | Java

Doubly Linked List

Circular Linked List

Operating System Process Synchornization
Data structures and Algorithms: Stack

Stacks and Queues

Stack is a topic that consists of easy to grasp concepts which help you score better in the college semester examinations as well as online tests/ interviews conducted by various companies. 

Stacks

Queues

Trees

Trees are one of the most crucial topics in Data Structure which are a little complicated than the other topics in C. Questions from this topic are often asked in college semester examinations as well as Company interviews and online tests which are of a good difficulty level and have more weight age than other questions.

Introduction to Trees

Binary Trees

Binary Search Trees

Traversals

  • Traversal in Trees
  • Tree Traversals: Breadth-First Search (BFS)
  • Tree Traversals: Depth First Search (BFS)
  • Construct a Binary Tree from Postorder and Inorder

B – Trees

AVL Trees

Complete Programs for Trees

  • Depth First Traversals – C | C++ | Java
  • Level Order Traversal – C | C++ | Java
  • Construct Tree from given Inorder and Preorder traversals – C | C++ | Java
  • Construct Tree from given Postorder and Inorder traversals – C | C++ | Java
  • Construct Tree from given Postorder and Preorder traversal – C | C++ | Java
  • Find size of the Binary tree – C | C++ | Java
  • Find the height of binary tree – C | C++ | Java
  • Find maximum in binary tree – C | C++ | Java
  • Check whether two tree are identical- C| C++| Java
  • Spiral Order traversal of Tree- C | C++| Java
  • Level Order Traversal LIne by Line – C | C++| Java
  • Hand shaking lemma and some Impotant Tree Properties.
  • Check If binary tree if Foldable or not.- C| C++| Java
  • check whether tree is Symmetric  C| C++| Java.
  • Check for Children-Sum in Binary Tree- C|C++| Java
  • Sum of all nodes in Binary Tree- C | C++ | Java
  • Lowest Common Ancestor in Binary Tree. C | C++ | Java
Data structure and Algorithms: Trees
Data Structures and algorithms: Array

Arrays

Arrays are one of the most frequently asked topics in both the college semester examinations and companies offering packages between 3.5 – 6 LPA often ask direct questions from this topic in the various online test/ interviews.

  • Introduction to Arrays – C | C++ | Java
  • Array Rotation – C | C++ | Java
  • Reverse an array or string- C | C++ | Java
  • Searching in Rotated-Sorted array – C | C++ | Java
  • Find missing number in array – C | C++ | Java
  • Find pairs in array with given sum – C | C++ | Java
  • Sort the array in Waveform – C | C++ | Java
  • Majority Element in Array – C | C++ | Java
  • Boyer-Moore’s Voting Algorithm – C | C++ | Java
  • K-pairs with smallest sum in 2 arrays – C | C++ | Java
  • Largest Sum Contigous SubArray – C | C++ | Java
  • Maximum Average Sub-array of K length – C | C++ | Java
  • Size of sub-array with max sum – C | C++ | Java
  • Sub-array with given sum – C | C++ | Java
  • Triplet that sum to a given value – C | C++ | Java
  • Segregate 0’s and 1’s in array – C | C++ | Java
  • Segregate 0’s 1’s and 2’s in array – C | C++ | Java
  • Sort elements in array by frequency – C | C++ | Java
  • Finding pythagorean triplets in an array – C | C++ | Java
  • Reorder array using given indexes – C | C++ | Java
  • Merging two sorted arrays – C | C++ | Java
  • Minimum number of Merge Operations to make an Array Palindrome – C | C++ | Java
  • Find Zeros to be Flipped so that number of Consecutive 1’s is maximized – C | C++ | Java

Tower of Hanoi

Stack is a topic that consists of easy to grasp concepts which help you score better in the college semester examinations as well as online tests/ interviews conducted by various companies. 

Tower  of  Hanoi: Representation, Working and Example.

Please Login/Signup to comment