Data structures & algorithms using JavaScript
By: Jain, Hemant
Publisher: Bhopal, India : Hemant Jain, 2017.Edition: 1st ed.Description: 427 p. : ill., ; 28 cm.ISBN: 9781544911144Program: CSCI336Other title: Problem solving in Data structures and algorithms using JavaScript.Subject(s): Programming language | AlgorithmsDDC classification: 005.73 JA DA Online resources: Location MapItem type | Home library | Call number | Status | Notes | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
REGULAR | University of Wollongong in Dubai Main Collection | 005.73 JA DA (Browse shelf) | Available | Mar2018 | T0059142 | ||
REGULAR | University of Wollongong in Dubai Main Collection | 005.73 JA DA (Browse shelf) | Available | T0059143 |
, Shelving location: Main Collection Close shelf browser
005.73 BL PA Patterns of data modeling | 005.73 CO DA Data structures and the Java collections framework / | 005.73 GO DA Data structures and algorithms in Java / | 005.73 JA DA Data structures & algorithms using JavaScript | 005.73 JA DA Data structures & algorithms using JavaScript | 005.73 LE DA Data structures & their algorithms / | 005.73 LE OB Object-orientation, abstraction, and data structures using Scala |
Table of Contents
Chapter 0: How to use this book.
Chapter 1: Introduction - Programming Overview
Chapter 2: Algorithms Analysis
Chapter 3: Approach to solve algorithm design problems
Chapter 4: Abstract Data Type
Chapter 5: Searching
Chapter 6: Sorting
Chapter 7: Linked List
Chapter 8: Stack
Chapter 9: Queue
Chapter 10: Tree
Chapter 11: Priority Queue
Chapter 12: Hash-Table
Chapter 13: Graphs
Chapter 14: String Algorithms
Chapter 15: Algorithm Design Techniques
Chapter 16: Brute Force Algorithm
Chapter 17: Greedy Algorithm
Chapter 18: Divide & Conquer
Chapter 19: Dynamic Programming
Chapter 20: Backtracking
Chapter 21: Complexity Theory
Chapter 22: Interview Strategy
Chapter 23: System Design
This book is designed for interviews so in Chapter 0, various preparation plans are proposed. Then in chapters 1, a brief introduction of the programming language and concept of recursion is explained. A number of problems based on recursion and array are explained.
Then in the coming chapter, we will be looking into complexity analysis. Then we will be looking into Sorting & Searching techniques.
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.
Then we will be looking into algorithm analysis, we will be looking into Brute Force algorithms, Greedy algorithms, Divide & Conquer algorithms, Dynamic Programming, 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.
CSCI336