LEADER 00750nam 2200277 450 001 996235745603316 005 20171102083546.0 100 $a20171102d1975----km y0itay5003 ba 101 0 $aspa 102 $aMX 105 0 $ay 00 y 200 1 $a<> eterno femenino$efarsa$fRosario Castellanos 210 $aMe?xico$cFondo de Cultura Econo?mica$d1975 215 $a204 p.$d17 cm 225 2 $aColeccio?n Popular$v144 410 0$aColeccio?n Popular$v144 606 0 $2BNCF 676 $a863 700 1$aCASTELLANOS,$bRosario$0554843 801 0 $aIT$bsalbc$gISBD 912 $a996235745603316 951 $aVI.7.A. 245$bISLA$cVI.7.A.$d404472 959 $aBK 969 $aISLA 996 $aEterno femenino$91492672 997 $aUNISA LEADER 05477oam 2200529 450 001 9910735400503321 005 20190911103509.0 010 $a1-4302-6401-2 024 7 $a10.1007/978-1-4302-6401-9 035 $a(OCoLC)878127597 035 $a(MiFhGG)GVRL6UWA 035 $a(EXLCZ)993710000000031168 100 $a20140410d2013 uy 0 101 0 $aeng 135 $aurun|---uuuua 181 $ctxt 182 $cc 183 $acr 200 10$aAdvanced topics in C $ecore concepts in data structures /$fNoel Kalicharan 205 $a1st ed. 2013. 210 1$aNew York :$cApress,$d2013. 215 $a1 online resource (xviii, 292 pages) $cillustrations 225 0 $aThe expert's voice in C Advanced topics in C 300 $aIncludes index. 311 $a1-4302-6400-4 320 $aIncludes bibliographical references and index. 327 $a""Advanced Topics in C""; ""Contents at a Glance""; ""Contents""; ""About the Author""; ""About the Technical Reviewer""; ""Preface""; ""Chapter 1: Sorting, Searching, and Merging""; ""1.1 Sorting an Array: Selection Sort""; ""1.1.1 Analysis of Selection Sort""; ""1.2 Sorting an Array: Insertion Sort""; ""1.2.1 Analysis of Insertion Sort""; ""1.3 Inserting an Element in Place""; ""1.4 Sorting an Array of Strings""; ""1.5 Sorting Parallel Arrays""; ""1.6 Binary Search""; ""1.7 Searching an Array of Strings""; ""1.8 Example: Word Frequency Count""; ""1.9 Merging Ordered Lists"" 327 $a""1.9.1 Implementing the Merge""""Chapter 2: Structures""; ""2.1 Defining Structures""; ""2.2 How to Declare a Structure""; ""2.2.1 typedef""; ""2.3 Working with an Array of Structures""; ""2.4 Searching an Array of Structures""; ""2.5 Sorting an Array of Structures""; ""2.6 How to Read, Search, and Sort a Structure""; ""2.7 Nested Structures""; ""2.8 Working with Fractions""; ""2.8.1 Manipulating Fractions""; ""2.9 A Voting Problem""; ""2.10 Passing Structures to Functions""; ""Chapter 3: Pointers""; ""3.1 Defining Pointers""; ""3.2 Passing Pointers as Arguments"" 327 $a""3.3 More on Passing an Array as an Argument""""3.4 Character Pointers""; ""3.5 Pointer Arithmetic""; ""3.6 Pointers to Structures""; ""3.7 Pointers to Functions""; ""3.8 Void Pointers""; ""Chapter 4: Linked Lists""; ""4.1 Defining Linked Lists""; ""4.2 Basic Operations on a Linked List""; ""4.2.1 Counting the Nodes in a Linked List""; ""4.2.2 Searching a Linked List""; ""4.2.3 Finding the Last Node in a Linked List""; ""4.3 Dynamic Storage Allocation: malloc, calloc, sizeof, free""; ""4.3.1 malloc""; ""4.3.2 calloc""; ""4.3.3 sizeof""; ""4.3.4 free"" 327 $a""4.4 Building a Linked List: Adding New Item at the Tail""""4.5 Insertion into a Linked List""; ""4.6 Building a Linked List: Adding a New Item at the Head""; ""4.7 Deletion from a Linked List""; ""4.8 Building a Sorted Linked List""; ""4.9 Example: Palindrome""; ""4.10 Saving a Linked List""; ""4.11 Arrays vs. Linked Lists""; ""4.12 Storing a Linked List Using Arrays""; ""4.13 Merging Two Sorted Linked Lists""; ""4.14 Circular and Two-Way Linked Lists""; ""4.14.1 Circular Lists""; ""4.14.2 Two-Way (Doubly Linked) Lists""; ""Chapter 5: Stacks and Queues""; ""5.1 Abstract Data Types"" 327 $a""5.2 Stacks""""5.2.1 Implementing a Stack Using an Array""; ""5.2.2 Implementing a Stack Using a Linked List""; ""5.3 Creating a Stack Header File""; ""5.4 A General Stack Type""; ""5.4.1 Example: Convert from Decimal to Binary""; ""5.5 Converting Infix to Postfix""; ""5.5.1 Evaluating a Postfix Expression""; ""5.6 Queues""; ""5.6.1 Implementing a Queue Using an Array""; ""5.6.2 Implementing a Queue Using a Linked List""; ""Chapter 6: Recursion""; ""6.1 Recursive Definition""; ""6.2 Writing Recursive Functions in C""; ""6.3 Converting a Decimal Number to Binary Using Recursion"" 327 $a""6.4 Printing a Linked List in Reverse Order"" 330 $aC is the most widely used programming language of all time. It has been used to create almost every category of software imaginable and the list keeps growing every day. Cutting-edge applications, such as Arduino, embeddable and wearable computing are ready-made for C.   Advanced Topics In C teaches concepts that any budding programmer should know. You'll delve into topics such as sorting, searching, merging, recursion, random numbers and simulation, among others. You will increase the range of problems you can solve when you learn how to manipulate versatile and popular data structures such as binary trees and hash tables.   This book assumes you have a working knowledge of basic programming concepts such as variables, constants, assignment, selection (if..else) and looping (while, for). It also assumes you are comfortable with writing functions and working with arrays.  If you study this book carefully and do the exercises conscientiously, you would become a better and more agile programmer, more prepared to code today's applications  (such as the Internet of Things) in C. 410 0$aExpert's voice in C. 606 $aC (Computer program language) 615 0$aC (Computer program language) 676 $a0006.312 676 $a004 676 $a005.133 676 $a006.3/12 700 $aKalicharan$b Noel$4aut$4http://id.loc.gov/vocabulary/relators/aut$0846188 801 0$bMiFhGG 801 1$bMiFhGG 906 $aBOOK 912 $a9910735400503321 996 $aAdvanced Topics in C$93415173 997 $aUNINA