C and datastructures

Divided into three separate sections, C & Data Structures covers C programming, as well as the implementation of data structures and an analysis of advanced data structure problems. Beginning with the basic concepts of the C language (including the operators, control structures, and functions), the book progresses to show these concepts through practical application with data structures such as linked lists and trees, and concludes with the integration of C programs and advanced data structure problem-solving. The book covers a vast ...
Nội dung trích xuất từ tài liệu:
C and datastructuresC & Data Structures C & Data Structures P. S. Deshpande O. G. Kakde CHARLES RIVER MEDIA, INC. Hingham, MassachusettsPage 2/174 C & Data Structures Table of ContentsCHAPTER 0: INTRODUTION..................................................................................................5 1. What This Book Is About ...............................................................................................5 2. What Do We Mean by Data? ..........................................................................................5 3. Data Abstraction .............................................................................................................5 4. Data Structures................................................................................................................7 5. Overview of Data Structures.........................................................................................12 6. Exercises .......................................................................................................................13 E2. Write a program to finf maximum value of 4 numbers. Using 2 types of data structures: array of 4 numbers, 4 int numbers seperated. .......................................................................13 E3. Imagine a group of data you would like to put in a computer so it could be accessed and manipulated. For example, if you collect old CDROMs, you might want to catalog them so you could search for a particular author or a specific date... ................................................13CHAPTER 1: C LANGUAGE .................................................................................................14 1. ADDRESS ....................................................................................................................14 2. POINTERS ...................................................................................................................15 3. ARRAYS ......................................................................................................................16 4. ADDRESS OF EACH ELEMENT IN AN ARRAY....................................................17 5. ACCESSING AN ARRAY USING POINTERS .........................................................18 6. MANIPULATING ARRAYS USING POINTERS .....................................................19 7. ANOTHER CASE OF MANIPULATING AN ARRAY USING POINTERS ...........20 8. TWO-DIMENSIONAL ARRAY .................................................................................22 9. POINTER ARRAYS ....................................................................................................24 10. STRUCTURES.........................................................................................................25 11. STRUCTURE POINTERS .......................................................................................26 12. Exercises ...................................................................................................................27CHAPTER 2: FUNCTION & RECURSION ...........................................................................30 1. FUNCTION ..................................................................................................................30 2. THE CONCEPT OF STACK .......................................................................................31 3. THE SEQUENCE OF EXECUTION DURING A FUNCTION CALL......................32 4. PARAMETER PASSING.............................................................................................33 5. CALL BY REFERENCE..............................................................................................34 6. RESOLVING VARIABLE REFERENCES ................................................................35 7. RECURSION................................................................................................................36 8. STACK OVERHEADS IN RECURSION ...................................................................39 9. WRITING A RECURSIVE FUNCTION.....................................................................40 10. TYPES OF RECURSION ........................................................................................42 11. Exercises ...................................................................................................................44CHAPTER 3: SEARCHING TECHNIQUES ..........................................................................46 1. SEARCHING TECHNIQUES: LINEAR OR SEQUENTIAL SEARCH ...................46 2. BINARY SEARCH ............................................................. ...