Marc 21
|
001 |
|
134 |
003 |
|
BfC |
005 |
|
24112023135737 |
006 |
$m |
24112023135737 |
020 |
|
978-1539724124 |
090 |
|
J26 |
100 |
|
JAIN,HEMANT |
|
$q |
HEMANT JAIN |
245 |
|
PROBLEM SOLVING IN DATA STRUCTURES ALGORITHMS USING JAVA |
|
$b |
Incluye portada |
260 |
|
: CreateSpace Independent Publishing Platform; 21 octubre 2016. |
|
$b |
CreateSpace Independent Publishing Platform |
|
$c |
21 octubre 2016 |
300 |
|
546 p. |
|
$a |
546 p. |
500 |
$3 |
1 |
520 |
|
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 |
521 |
|
Cualquier público |
546 |
|
Inglés |
650 |
|
JAVA; SOLUCION; ERRORES;ESTRUCTURA; DATOS; ALGORITMOS; CODIGO;GRAFOS;LINKED LIST;HASH-TABLE;TREE;STACK; BACKTRACKING |
850 |
|
Biblioteca de Computación y Telecomunicaciones |
856 |
|
public/libros/134BfC/html/index.html |