Data Structures for top MNC interviews course details

1 Reviews

APHB Colony, Hyderabad

Course ID: 28537

APHB Colony, Hyderabad

Students Interested 0 (Seats Left 0)

1 Reviews

Date and Time

Not decided yet.

Sree

M.Tech(CSE), IIT Roorkee

About Sree

Software professional with 12 yrs experience in Data structures/C/C++/PERL/UNIX/MPI(parallel programming).

visit https://sites.google.com/site/algorithmclass
G

Gautam

Attended Data Structures for top MNC interviews course details

I have attended for data structures training for my exams. He explains in simple way and easy to understand. It really helped me in my preparation of my exams.

About the Course

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.


Topics Covered


stacks recusrion queues linked lists trees BST AVL tree B tree Sorting Searching Arrays TRIES Suffix Trees TSTs Tournament tree Divide and conquer dynamic programming graphs


Who should attend


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.


Pre-requisites


prior knowledge on data structures


What you need to bring


in class or online training


Key Takeaways


This course would be very useful for in/off campus placements. You will get lot of confidence on programming.


 


Data Structures and Algorithm for Interviews



Data Structures for interviews course at Algorithm Class 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


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 Us

 

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

 

Course Content


 






























































































































 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



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



 Searching



Linear Search
Binary search


 

 

 

 

Related to searching



  1. Sorted array with duplicates write a function that returns the lowest index of an element x in that array

  2.  ... etc



 



13



Hashing



Open Hashing


Closed hashing


linear probing


   

14



TRIES



node Structure

 

getNode()

 

insert()

 

search()

2 problems  

15



Suffix trees



introduction

 

explanation with example

   

16



Ternary Search Tree



node Structure

 

getNode()

 

insert()

 

search()

   

17



Tournament Tree


introduction    

18



B Tree



introduction to

 

node Structure

 

getNode()

 

insert()

 

search()

   

19



Divide and Conquer



Merge Sort


Quick Sort


time complexity  

20



Graphs



 

Adjacency matrix

 

Adjacency list

 

BFS

 

DFS

 

Disjaskra shortest path

 

Floyd shortest path

 

Spanning tree


Detect Cycle in a graph

 

Topological sorting

 

check the given graph is tree or not

 

Find the number of islands

 

 

 

.. etc

 

 

21



Dynamic Programming



 

Introduction to dyn

Reviews (1) See all Reviews

G

Gautam

Attended Data Structures for top MNC interviews course details

I have attended for data structures training for my exams. He explains in simple way and easy to understand....

Discussions

Students Interested 0 (Seats Left 0)

Post your requirement and let us connect you with best possible matches for Java Training Classes Post your requirement now

Enquire

Submit your enquiry for Data Structures for top MNC interviews course details

Please enter valid question or comment

Please enter your name.

Please enter valid Phone Number

Please enter the Pin Code.

By submitting, you agree to our Terms of use and Privacy Policy

Connect With Algorithm Class

You have reached a limit!

We only allow 20 Tutor contacts under a category. Please send us an email at support@urbanpro.com for contacting more Tutors.

You Already have an UrbanPro Account

Please Login to continue

Please Enter valid Email or Phone Number

Please Enter your Password

Please enter the OTP sent to your registered mobile number.

Please Enter valid Password or OTP

Forgot Password? Resend OTP OTP Sent

Sorry, we were not able to find a user with that username and password.

We have sent you an OTP to your register email address and registered number. Please enter OTP as Password to continue

Further Information Received

Thank you for providing more information about your requirement. You will hear back soon from the trainer

UrbanPro.com is India's largest network of most trusted tutors and institutes. Over 25 lakh students rely on UrbanPro.com, to fulfill their learning requirements across 1,000+ categories. Using UrbanPro.com, parents, and students can compare multiple Tutors and Institutes and choose the one that best suits their requirements. More than 6.5 lakh verified Tutors and Institutes are helping millions of students every day and growing their tutoring business on UrbanPro.com. Whether you are looking for a tutor to learn mathematics, a German language trainer to brush up your German language skills or an institute to upgrade your IT skills, we have got the best selection of Tutors and Training Institutes for you. Read more