Aj’s Guide To algorithm and Data Structure in C/ C++: First Edition: 1 - Softcover

J, A

Softcover

ISBN 10: 1698807732 ISBN 13: 9781698807737

Verlag: Independently published, 2019

Inhaltsangabe

IntroductionChapter 1: Introduction to algorithm and their typesChapter 2: Performance analysis of an algorithm: Space ComplexityChapter 3: Performance analysis of an algorithm: Time ComplexityChapter 4: Asymptotic NotationsChapter 5: Asymptotic Notation Big OChapter 6: Asymptotic Notation Big Omega and ThetaSorting Algorithms:1: Bubble sort2: Selection Sort3: Insertion Sort4: Merge Sort5: Quick Sort6: Pigeonhole Sort7: 3-Way Quicksort (Dutch National Flag) algorithm8: Cocktail Sort9: Radix Sort10: Bucket Sort11: Counting Sort12: Shell Sort13: Topological sort14: Comb sortSearching Algorithm1: Linear Search2: Binary Search3: Jump Search4: Interpolation Search5: Exponential Search6: Ternary SearchBasic Data Structures:1: Stack Data structure and Implementation using arrays.2: Stack Data structure and Implementation using Linked List.3: Singly Linked List.4: Doubly Linked List [DLL] .5: Circular Singly Linked List.6: Circular Doubly Linked List.7: Queue Data Structure with implementation using arrays.8: Queue Data Structure with implementation using linked list.9: Circular Queues Data structure with Implementation using arrays.10: Circular Queue Data structure with Implementation using Linked List.Trees Data Structure Tutorials:1. Tree Data Structure Introduction2. Introduction to Binary Tree3. Binary Tree Traversal4. Binary Search Tree Introduction5. Implementation of BST6. Implementation of Binary tree7. TRIE Data structure8. Heaps9. Priority Queue10. AVL tree11. Introduction to segment trees12. Performing minimum Range query in Segment Tree and implementation13. Lazy propagation of segment trees14. Fenwick trees and implementationGraph Data Structure Tutorials:1. Graph Introduction2. Graph Representation Adjacency Matrix3. Graph Representation Adjacency List4. Graph Traversal5. Graph Traversal using Stack and Queue6. Bipartite graph7. Graph coloring problem8. Isomorphic Graph9. Euler Graph10. Hamiltonian GraphDifferent types of problem solving technique1. Brute force approach2. Recursion3. Dynamic programming approach4. Backtracking approach5. Greedy approach6. Two pointer approachMinimum Spanning Tree:1. Introduction to minimum spanning tree2. Kruskal’s algorithm3. Prims AlgorithmFind shortest path algorithm1. Bellman ford2. Dijkstra’s3. Floyd warshallsString matching algorithms1. Knuth Morris Pratt String matching algorithm2. Rabin Karp algorithm3. Boyer–Moore string-search algorithmKnapsack Problem:1. Fractional knapsack2. KnapsackAdditional Problems:1. P, NP, NP hard, NP Complete2. Tower of Hanoi3. Sieve of Eratosthenes4. Kadane Algorithm5. Sliding Window Approach6. Travelling Salesman problem7. Minimum Coin Change Problem8. Total number of ways to get denomination of coins.9. Job Sequencing problem10. Activity Selection Problem11. House Robber ProblemHR Interview questions and tips to answer them1. Expectations on oncoming topics2. Mistakes to avoid in an interview.3. Tell me about yourself4. Why should we hire you?5. Why do you want to work for us?6. What are your greatest strengths and weakness?7. What are your greatest achievements/ accomplishments?8. Any questions for us?9. Where do you want to see yourself in 5 years?10. How to you work under pressure?11. How do you make important decisions?12. What motivates you to do the best on job?13. Do you prefer working alone or in a team?14. What do you know about our company?15. Are you planning for further studies?16. What is your salary expectations?Tips for Developers to improve their skills1. How to prepare for coding interview in 3 months.2. Tips to solve coding interview questions3. How to write a resume for coding interview?4. Tips to become good at programming

Details zur Ausgabe

• Verlag: Independently published
• Erscheinungsdatum: 2019
• Sprache: Englisch
• ISBN 10: 1698807732
• ISBN 13: 9781698807737
• Einband: Tapa blanda
• Anzahl der Seiten: 525
• Kontakt zum Hersteller: Nicht verfügbar
• Verantwortliche Person: Nicht verfügbar