000			04210 a2200313 4500
008			250318s########|||||||||||||||||||||||#d
020			_a0-13-199746-7
040			_aGAMADERO2 _bspa _cGAMADERO2
041			_hspa
050	0	0	_aLCC
100			_aAaron M. Tenenbaum
245			_aData structures using C /
250			_a1ERA EDICION
260			_bPrentice hall _aNew Jersey _c1990
300			_a662 _bIlustraciones, Graficos, Tablas _c24 CM
490	0		_aserie
504			_aEditorial Prentice Hall ISBN: 0-13-199746-7
505			_a"• PREFACE • CHAPTER 1 • INTRODUCTION TO DATA STRUCTURES • INFORMATION AND MEANING EXERCISES • ARRAYS IN C EXERCISES • STRUCTURES IN C EXERCISES • CHAPTER 2 THE STACK • 2.1 DEFINITION AND EXAMPLES EXERCISES • 2.2 REPRESENTING STACKS IN C EXERCISES • 2.3 AN EXAMPLE: INFIX, POSTFIX, AND PREFIX EXERCISES • CHAPTER 3 • RECURSION • 3.1 RECURSIVE DEFINITION AD PROCESSES EXERCISES • 3.2 RECURSION IN C EXERCISES • 3.3 WRITING RECURSIVE PROGRAMS EXERCISES • 3.4 SIMULATING RECURSION • EXERCISES • 3.5 EFFICIENCY OF RECURSION EXERCISES • CHAPTER 4 QUEUES AND LISTS • 4.1 - THE QUEUE AND ITS SEQUENTIAL REPRESENTATION EXERCISES • 4.2 LINKED LISTS • EXERCISES • 4.3 LISTS IN C • EXERCISES • 4.4 - AN EXAMPLE: SIMULATION USING LINKED LISTS • EXERCISES • 4.5 OTHER LIST STRUCTURES EXERCISES • CHAPTER 5 TREES • 5.1 BINARY TREES EXERCISES • 5.2- BINARY TREE REPRESENTATIONS • EXERCISES • 5.3 AN EXAMPLE: THE HUFFMAN ALGORITHM • EXERCISES • 5.4 REPRESENTING LISTS AS BINARY TREES • EXERCISES • 5.5 - TREES AND THEIR APPLICATIONS • EXERCISES • 5.6 - AN EXAMPLE: GAME TREES • EXERCISES • CHAPTER 6 SORTING • 6.1 GENERAL BACKGROUND EXERCISES • 6.2 EXCHANGE SORTS • EXERCISES • 6.3 SELECTION AND TREE SORTING • EXERCISE • 6.4 INSERTION SORTS EXERCISES • 6.5 MERGE AND RADIX SORTS EXERCISES • CHAPTER 7 SEARCHING • 7.1 BASIC SEARCH TECHNIQUES EXERCISES • 7.2 TREE SEARCHING EXERCISES • 7.3 GENERAL SEARCH TREES EXERCISES • 7.4 - HASHING EXERCISES • CHAPTER 8 GRAPHS AND THEIR APPLICATIONS • 8.1 - GRAPHS • EXERCISES • 8.2A FLOW PROBLEM • EXERCISES • 8.3- THE LINKED REPRESENTATION OF GRAPHS • EXERCISES • 8.4- GRAPH TRAVERSAL AND SPANNING FORESTS EXERCISES • CHAPTER 9 STORAGE MANAGEMENT • 9.1 GENERAL LISTS • EXERCISES • 9.2 AUTOMATIC LIST MANAGEMENT • EXERCISES • 9.3 DYNAMIC MEMORY MANAGEMENT • EXERCISES • BIBLIOGRAPHY AND REFERENCES • INDEX"
520			_a"C TEXTS LISTED IN THE BIBLIOGRAPHY. CHAPTER 1 ALSO PROVIDES INFORMATION NECESSARY FOR SUCH STUDENTS TO ACQUAINT THEMSELVES WITH C. CHAPTER 1 IS AN INTRODUCTION TO DATA STRUCTURES. SECTION 1.1 INTRODUCES THE CON- CEPT OF AN ABSTRACT DATA STRUCTURE AND THE CONCEPT OF AN IMPLEMENTATION. SECTIONS 1.2 AND 1.3 INTRODUCE ARRAYS AND STRUCTURES IN C. THE IMPLEMENTATIONS OF THESE TWO DATA STRUCTURES AS WELL AS THEIR APPLICATIONS ARE COVERED. CHAPTER 2 DISCUSSES STACKS AND THEIR C IMPLEMENTATION. SINCE THIS IS THE FIRST NEW DATA STRUCTURE INTRODUCED, CONSID-ERABLE DISCUSSION OF THE PITFALLS OF IMPLEMENTING SUCH A STRUCTURE IS INCLUDED. SECTION 2.3 INTRODUCES POSTFIX, PREFIX, AND INFIX NOTATIONS. CHAPTER 3 COVERS RECURSION, ITS APPLICATIONS, AND ITS IMPLEMENTATION. CHAPTER 4 INTRODUCES QUEUES, PRIORITY QUEUES AND LINKED LISTS AND THEIR IMPLEMENTATIONS BOTH USING AN ARRAY OF AVAILABLE NODES AS WELL AS USING DYNAMIC STORAGE. CHAPTER 5 DISCUSSES TREES, CHAPTER 6 INTRODUCES O NOTATION AND COVERS SORTING, WHILE CHAPTER 7 COVERS BOTH INTERNAL AND EXTERNAL SEARCHING. CHAPTER 8 INTRODUCES GRAPHS, AND CHAPTER 9 DISCUSSES STORAGE MANAGE-MENT."
526			_aIngeniería en Tecnologías de la Información y Comunicación
650		0	_aIngeniería en tecnologias de la información y comunicaciones _9585
700			_aYedidyah Langsam
700			_aMoshe J. Augenstein
942			_cLIB _2ddc _ePrimera edicion
945			_a1 _badmin _c1261 _dJenny Viridiana Quiroz Linares
999			_c1966 _d1966