ANNOUNCEMENTS‎ > ‎Courses‎ > ‎

Data Structures for interviews





Summary

This course is intended for those who has already completed academic course on Data Structures and who wants to prepare for top MNC interviews. This course would be very useful for in/off campus placements.

Concepts and 150+ problems

Duration:  ~ 50 hrs

Fee: Contact

Trainer:

Trainer Name          : Mr. Sree      (Algorithm Class founder)
Qualification            : M.Tech(CSE), IIT Roorkee
Experience              : Software professional with 12 yrs experience in Data                                                                      structures/C/C++/PERL/UNIX/MPI(parallel programming).


Note: All the topics and problems would be explained using PPTs, digital pen, VOIP

Green color : The topics that are to be covered in the current batch

 SNO  topic name  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. Check palindrome or 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 problem

Analysis 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 a) linked list

insertFront()
insertAfter()
insertEnd()
DelFirst()
DelEnd()
DeleAfter()


b) Circular linked list

insert()
remove()
stack as CLL
queue as CLL

c) Doubly linked list
setLeft()
setRight()
remove()
removeLeft()
RemoveRight()

 

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




7



















8





















9

 Trees




Binary Tree



















Binary Search Tree




















Balanced 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



AVL TREES 


Rotations
a) LR
b) RL
c) LL 
d) RR

 

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

 





3



















3




















1

 10






11
 Sorting






Array interview questions1

 Bubble sort
Insertion sort
Quick sort
Merge sort
Heap sort
Priority queue

Related to sorting

 






1.  given a binary digits like 001101 arrange the numbers such that zeroes should follow 1s ike 0001111.

2. Find Triplets of a+b+c=k in an array
etc
 2






1
 12





13






14









15









16








17





18





19








20















21


 



22









23




 Searching





Array interview questions2




Hash Table





Dictionary data structures
 
TRIES









suffix trees








Tournament Tree




Ternary Search Tree




B Tree








Graphs















Divide and conquer





Dynamic Programming











BT

Grd
Linear Search
Binary search




Related to searching
















node Structure

getNode()

insert()

search()



getNode()

insert()

search()










Introduction

insert()

search()

Introduction

insert()

search()

delete()


Adjacency matrix

Adjacency list

BFS

DFS

Disjaskra shortest path

Floyd shortest path

Spanning tree



Merge Sort

Quick Sort




Introduction to dynamic programming

memorization (top down)

tabulation  (Bottom up)

optimal sub structure














  
  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





































Detect Cycle in a graph

Topological sorting

check the given graph is tree or not

Find the number of islands



.. etc














rec sol DP solution of 

1 Longest common sub sequence

2 Longest increasing sequence

3 Knapsack problem

4 Coin change problem

5 factorial of a numer

6 fibanacci series


1



2






1









2









1







1

 



1














4










1













3








1







Google+ Badge

The gadget spec URL could not be found




Subpages (1): Contact Your Instructor
Comments