tailieunhanh - 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 . | C Data Structures Page 2 174 C Data Structures Table of Contents CHAPTER 0 1. What This Book Is 2. What Do We Mean by Data .5 3. Data 4. Data 5. Overview of Data 6. E2. Write a program to finf maximum value of 4 numbers. Using 2 types of data structures array of 4 numbers 4 int numbers 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 CHAPTER 1 C 1. 2. 3. ARRAYS .16 4. ADDRESS OF EACH ELEMENT IN AN 5. ACCESSING AN ARRAY USING 6. MANIPULATING ARRAYS USING 7. ANOTHER CASE OF MANIPULATING AN ARRAY USING 8. TWO-DIMENSIONAL 9. POINTER 10. 11. STRUCTURE POINTERS .26 12. Exercises .27 CHAPTER 2 FUNCTION 1. 2. THE CONCEPT OF STACK .31 3. THE SEQUENCE OF EXECUTION DURING A FUNCTION 4. PARAMETER 5. CALL BY 6. RESOLVING VARIABLE 7. 8. STACK OVERHEADS IN 9. WRITING A RECURSIVE 10. TYPES OF 11. CHAPTER 3 SEARCHING 1. SEARCHING TECHNIQUES Linear or sequential 2. BINARY 3. Uses a recursive method to implement binary 4. COMPLEXITY OF 5. CHAPTER 4 SORTING 1. BUBBLESORT. 56 2. INSERTION 3. SELECTION 4. QUICK 5. CHAPTER 5 STACKS AND Page 3 174 C Data Structures 1 THE CONCEPT OF STACKS AND 2. 3. APPLICATIONS OF 4. 5. implementation of 6. IMPLEMENTATION OF A QUEUE USING LINKED 7. APPLICATIONS OF 8. CHAPTER 6 LINKED 1. THE CONCEPT OF THE .