Imagen del editor

The universities computer experiments and Practice Series demonstration materials: data structures and algorithms Experimental Practice Guide(Chinese Edition)


ISBN 10: 7302300666 / ISBN 13: 9787302300663
Nuevos Condición: New Encuadernación de tapa blanda
Librería: liu xing (JiangSu, JS, China)

Librería en AbeBooks desde: 7 de abril de 2009 Valoración librería Valoración 5 estrellas

Cantidad disponible: 1

Comprar nuevo
Precio: EUR 51,19 Convertir moneda
Gastos de envío: Gratis De China a Estados Unidos de America Destinos, gastos y plazos de envío
Añadir al carrito


Ship out in 2 business day, And Fast shipping, Free Tracking number will be provided after the shipment.Paperback. Pub Date: December 2012 Pages: 217 Language: Chinese in Publisher: Tsinghua University Press series of demonstrations of experiments and practice of institutions of higher learning computer textbooks: data structures and algorithms experimental practice tutorial of 9 chapters including program testing measure of the running time. the realization of its application of the linear table and string. stack and queue implementations and applications. recursion. binary tree implementations and applications. Implementation and Application Find Sort Implementation and Application. graph algorithms and their applications and standards Template Library STL About us. Each chapter for commonly used data structures and algorithms. design examples and exercises. some exercises in the book with reference to the answer. Contents: Chapter 1 program testing and run-time metrics the 1.1 program specification program's specifications and test 1.1.1 Description 1.1.2 Programming Exercise: Sort function specification 1.1.3 program testing 1.1.4 programming exercises: Sort test 1.1.6 1.1.5 random number generation automation test 1.1.7 Programming Exercise: Sort the automatic test 1.2 program run-time metrics 1.2.1 obtain 1.2.2 statistical sorting function of the CPU time is running 1.2.3 Programming practice: Sorting the run-time metrics 1.2.4 understand the algorithm time complexity 1.2.5 programming practice: Implementation and Application of the largest contiguous subsequence algorithm computing time comparison Summary Chapter 2 linear table and string 2.1 standard library data structure vector list the 2.1.1 standard library the data structure vector2.1.2 linear table vector applications 2.1.3 Programming practice: vector applications 2.1.4 standard library data structure list2.1.5 linear table application 2.1.6 Programming to practice: line the sexual table Application 2.1.7 Programming Exercise: polynomial representation and arithmetic 2.1.8 programming exercises: 2.2 linear form of abstract data types. set operations achieve its test 2.2.1 Linear table abstract data type definition 2.2.2 Programming practice: the use of an array of linear Table 2.2.3 linear Table 2.2.4 Programming practice: familiar single linked list 2.2.5 Programming to practice: single linear table 2.3 Applications 2.3.1 string data structure linked list using single linked list string string2.3.2 programming practice: the generation of the index table 2.3.3 programming practice: a line editor to achieve Summary Chapter 3 the use of stack and queue implementation and application of the 3.1 standard library stack 3.1.1 STL template class stack3.1.2 programming Exercise: familiar with the operation of the stack and stack 3.2 stack implementation of the 3.2.1 stack of definition 3.2.2 Programming to practice: stack implementation 3.3 Application 3.3.1 STL queue template queue queue3.3.2 queue application examples 3.4 queue 3.4 3.4.2 .1 queue definition programming exercises: queue implementation 3.5.2 3.5 stack and queue the application 3.5.1 compartment scheduling problems programming exercises: compartments scheduling problem 3.5.3 programming exercises: service the queue simulation problems Summary Chapter 4 recursive 4.1 recursive algorithm 4.1.1 recursive function example 4.1.2 a stack of pancakes sort 4.1.3 Programming practice: recursion 4.2 Governing Law 4.2.1 Tower of Hanoi 4.2.2 merge sort 4.2.3 programming exercises: merge sort implementation 4.2.4 recursive algorithm analysis 4.3.3 programming exercises 4.3 backtracking 4.3.1 The eight queens problem 4.3.2 maze problem: backtracking . Chapter 5 Chapter 6 binary tree implementation and application Find Implementation and Application of Chapter 7 sorted Implementation and Application of Chapter 8 Figure algorithm and its application of Chapter 9 of the Standard Template Library STL Introduction Append. N° de ref. de la librería NE042844

Hacer una pregunta a la librería

Detalles bibliográficos

Título: The universities computer experiments and ...

Encuadernación: paperback

Condición del libro:New

Acerca de



"Sobre este título" puede pertenecer a otra edición de este libro.

Descripción de la librería

Thank you for visiting My bookstore! We are an online bookstore, and Is the China's largest online book sales. Generally our books are from China, with reasonable price and decent printing quality. We are always trying our best to satisfy customer's needs!

Ver la página web de la librería

Condiciones de venta:

We guarantee the condition of every book as it's described on the Abebooks web sites. If you're dissatisfied with your purchase (Incorrect Book/Not as Described/Damaged) or if the order hasn't arrived, you're eligible for a refund within 30 days of the estimated delivery date. If you've changed your mind about a book that you've ordered, please use the Ask bookseller a question link to contact us and we'll respond within 2 business days. Please Note:We don't sell any international Edition to you...

Más información
Condiciones de envío:

Most orders are shipped within 24 hours. We will delivery these items to you by AIRMAIL, EUB, EMS, TNT etc.

Todos los libros de esta librería

Métodos de pago
aceptados por la librería

Visa Mastercard American Express Carte Bleue

PayPal Transferencia Bancaria