DSA online

Demo Video

Demo video1:   Delete a node in BST

Demo video2:   Delete first node in CLL

Submit your query here

or  SMS  to +91-6309754771

Data Structures and Algorithms

Data Structures for interviews course at Algorithm Training training institute requires prior knowledge from students on Data Structures and Algorithms. This training targets top MNC interviews. This Training would be very useful for in and off campus placements for students from IITs, NITs, BITs, IIITs, Universities and other top engineering students. Here we are going to discuss and implement the problems. Hence this is one of the Best Data structures And Algorithms Training In Bangalore or Data Structures and Algorithms Training In Hyderabad

Course Details:

Duration: 8 weeks

time : 7.30 pm

Mode :  Online

Course Fee: 400 USD

Demo:

Demo video1:   Delete a node in BST
Demo video2:   Delete first node in CLL

Trainer Details:

Trainer Name          : Mr. Srihari
Qualification            : M.Tech(CSE), IIT Roorkee
Experience              : Software professional with 14 yrs experience in Data structures/C/C++/JAVA/Python/PERL/UNIX/MPI(parallel programming).

Course Content

SNO Topic Sub topic Sample questions No. of hrs
1 Algorithm Analysis How to analyse a program

Big O notation

Theta notation

Omega notation

1
2 Stacks a)Array and linked list implementation of a stack

create stack()

isempty()

push()

pop()

b) infix to post fix conversion

c) evaluate postfix expression

1.Check for balanced parentheses in an expression

2, Manage 2 stacks in an array

3. Checkpalindromeor not

4. Reverse a string

5. Sort stack

6 Get MIN in O(1) time

7. Find next greater element...etc

2
3 Recursion Recursion analysis using stack frames

Recursion tree

Analysis of
factorial problemAnalysis of
fib series
1
4 queues a)Array and linked list implementation of a queue

create queue()

isempty()

insert()

remove()

b) circular queue

c) double ended queue

1. Queue using

2 stacks

2. Sort queue

3. Reverse Queue ...etc

1
5 Linked Lists  linked listi

nsertFront()

insertAfter()

\insertEnd()

DelFirst()

DelEnd()

DeleAfter()

35 + problems on LL

questions like
  1. Find common node which is common to both the lists. You are allowed to traverse both the lists only once.
  2. delete a node p given in a linked list efficiently .....
  3. Find kth element from last
  4. Swap Kth node from beginning with Kth node from end in a Linked List
  5. Alternating split of a given Singly Linked List
  6. check whether linked list polyndrome or not
  7. pair wise swap
  8. delete N nodes after M nodes
  9. reverse alternate k nodes
  10. Delete alternate nodes of a Linked Listet ...etc
7
 6 Circular linked list insert()

remove()

stack as CLL

queue as CLL

 7 Doubly linked list setLeft()

setRight()

remove()

removeLeft()

RemoveRight()

8 Binary Tree   and Binary Search trees a) Tree terminology

b) General tree

a) expression tree

b)Binary Tree

e) Tree traversal

PreTraversal()

postTraversal()

inorderTrav()

f) Construct original tree from given pre order and in order traversals.
g) Construct original tree from given post order and in order traversals.

a) createtree()

b) setleft()

c) setRight()

d) createTree()

e) disposeTree()

f) FindKey)_

g) findMin()

h) findMax()

i) find inorder successor, predecessor
j) Tree delete operation
35 + problems on trees

questions like
  1. Find number of full nodes in a tree.
  2. Function to return 1 if there exists a path from the root to a leaf whose values sum is S otherwise ...etc
331
 9 AVL tree
Rotations
a) LR
b) RL
c) LL
d) RR
 10  Sorting  Bubble sort

Insertion sort

Quick sort

Merge sort

Heap sort

Priority queue

 11 Sorting Array interview questions1  Related to sorting 1. given a binary digits like001101 arrange the numbers such that zeroes should follow 1sike 0001111.

2. Find Triplets of a+b+c=k in an array
etc
2 1
12 searching Linear Search

Binary search

  1. Sorted array with duplicates write a function that returns the lowest index of an element x in that array
  2. ... etc
2 problems on tries
13 Hashing open hashing

closed hashing

implementation of hash table
14 Tries introduction

node structure

insert

search

2 problems on TRIES
15 Suffix Trees
16 Ternary Search Tree introduction

node structure

insert

search

17  B tree introduction

node structure

insert (algorithm)

search (algorithm)

18 Tournament Tree
19 Divide and conquer
Merge Sort
Quick Sort
20 Graphs
Adjacency matrix
Adjacency list
BFS
DFS
Spanning tree
Detect Cycle in a graph
Topological sorting
check the given graph is tree or not
Find the number of islands
.. etc
21 Greedy Method
Kruskals spanning tre
Primes spanning tree
Disjaskra shortest path
Knapsack problem
Min cost path Matrix
Coin change problem
Longest common sub sequence
21 Dynamic Programming
Introduction to dynamic programming
memorization (top down)
tabulation (Bottom up)
optimal sub structure
rec solDP solution of
1 Longest common sub sequence
2 Min cost path Matrix
3 Knapsack problem
4 Coin change problem
5 factorial of a numer
6 fibanacci series