DATASTRUTCTURES. TRAINERS REQUIRED IN ELEGANT IT SERVICES IN INDIA

DataStrutctures. trainers Required in elegant it services good salary in partime Intriduction to DataStrutctures. ->Types of DataStructures. 2.Introduction to Recursion. ->difference b/w recursion and iteration. ->factorial of a number using recursion. ->fibonacci sequence problem using recursion. ->LCM of a given number using recursion. ->GCD of a given number using recursion. 3.Linked Lists ->Linked List Concepts. ->Types of Linked Lists. ->Single Linked List ->Example for Single Linked List. ->Douple Linked List ->Example for Douple Linked List. ->Circle Single Linked List ->Example for Circle Single Linked List. ->Circle Douple Linked List ->Example for Circle Douple Linked List. 3.Stacks ->Representation of stack. ->Program to demonstrate a stack,using array. ->Program to demonstrate a stack,using linked list. ->Converting expressions using stack. ->Examples on converions.(infix to postfix,infix to prefix,postfix to infix,postfix to prefix etc) ->Applications of Stacks. 4.Queue ->Representation of Queue. ->Program to demonstrate a Queue,using array. ->Program to demonstrate a Queue,using linked list. ->Applications of Queues. 5.Circular Queue ->Representation of stack. 6.Dequeue 7.Binary Trees. ->Introduction to trees. ->Traversal Techniques ->Full Binary Tree ->Complete Binary Tree. ->Depth first search.(DFS) ->Breadth first search.(BFS) 8.Sparse Matrices 9.Graphs ->Intriduction to Graphs. ->Represenation of Graphs. ->Minimum Spanning Tree ->Kruskal's Algorithm ->Prim's Algorithm ->Depth first search.(DFS) ->Breadth first search.(BFS) 10.Searching ->Linear Search with program. ->Binary Search with program. 11.Sorting ->Bubble Sort with program. ->Selection Sort with program. ->Quick Sort with program. ->Heap Sort with program. Thanks&Regards Elegant IT Services, #nd Floor,Aswath Nagar Varthur main road,Near Railway Fly Over Maratha halli,Land mark: Chemmunar Jewellers,