9787300101552 (1 resultados)
- Tapa blanda
Librería: liu xing, Nanjing, JS, Chinaliu xing
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 49,99
Envío por EUR 15,82Se envía de China a Estados Unidos de AmericaCantidad disponible: 10 disponibles
paperback. Condición: New. Ship out in 2 business day, And Fast shipping, Free Tracking number will be provided after the shipment.Pages Number: 225 Publisher: China Renmin University Press Pub. Date :2009-02. According to the book institutions of higher learning computer science data structures course syllabus requirements. fro…m front-line teachers. education experts and well-written. into the author s many years of teaching experience. Courses of instruction in accordance with the order book to explain the linear table. stacks and queues. strings and arrays. trees and binary. maps. search. sort and so on. Focus on practical and readable book. accurately described the principles of the concept. refined. easy to understand; in the basic algorithm described data structure. not only introduced the idea of ??algorithms. more attention to the program implementation process; have been the source machine verification. accurate; end of each chapter are equipped with a large number of exercises. and in the Appendix gives a detailed reference to the answer. so that students can deepen their understanding of basic concepts. improve problem analysis. problem-solving abilities. Reference document mentioned in the book are available from http:www. Khp.com.cn free download. so that the reader is referred. the rapid increase in programming capability. This book can be used as application-oriented. demonstration vocational and computer training schools computer-related curriculum materials. or as a computer professional adult education. self-examination materials. Contents: Chapter 1 Introduction 1.1 The logical data structure data structure 1.1.1 1.1.2 1.1.3 Data storage data structure data structures and data operations 1.1.4Four Satisfaction guaranteed,or money back.
