000			01891nam a22001937a 4500
999			_c30786 _d30786
001			nam a22 7a 4500
020			_a9781539724124
082			_a005.133 JA PR
100			_aJain, Hemant _9782
245			_aProblem solving in data structures & algorithms using JAVA / _cby Hemant Jain
260			_a[S.I] : _bIndependent Publishing _cc2016.
300			_a435 p. : _bill. ; _c28 cm.
520			_aThis book is about the usage of Data Structures and Algorithms in computer programming. Designing an efficient algorithm to solve a computer science problem is a skill of Computer programmer. This is the skill which tech companies like Google, Amazon, Microsoft, Adobe and many others are looking for in an interview. This book assumes that you are a JAVA language developer. You are not an expert in JAVA language, but you are well familiar with concepts of references, functions, lists and recursion. In the start of this book, we will be revising the JAVA language fundamentals. We will be looking into some of the problems in arrays and recursion too. Then in the coming chapter, we will be looking into complexity analysis. Then will look into the various data structures and their algorithms. We will be looking into a Linked List, Stack, Queue, Trees, Heap, Hash Table and Graphs. We will be looking into Sorting & Searching techniques. Then we will be looking into algorithm analysis, we will be looking into Brute Force algorithms, Greedy algorithms, Divide & Conquer algorithms, Dynamic Programming, Reduction, and Backtracking. In the end, we will be looking into System Design, which will give a systematic approach for solving the design problems in an Interview.
650			_aDynamic Programming _92437
650			_aAlgorithms _92438
650			_aData structures _9901
856			_uhttps://uowd.box.com/s/ah4wl11o8flmeu97e7xdd24ti2ks2v62 _zLocation Map
942			_cREGULAR