Practical Approach to Data Structures and Algorithms
The aim of the book is to serve as a text for students learning programming in 'C' on Data Structures such as array, linked list, stack, queue, trees, graph and sorting and searching methodology. The book illustrates in detail the methods, algorithms, functions and implementation of each a...
Saved in:
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
London
New Academic Science
2009
|
| Edition: | 1 |
| Subjects: | |
| ISBN: | 1781831769, 9781781831762, 9781906574048, 1906574049 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | The aim of the book is to serve as a text for students learning programming in 'C' on Data Structures such as array, linked list, stack, queue, trees, graph and sorting and searching methodology. The book illustrates in detail the methods, algorithms, functions and implementation of each and every concept of data structures. Algorithms are written in pseudo syntax i.e., near to 'C' language for easy understanding. It contains worked examples to amplify the material, and enhance the pedagogy. The content is not overburdened with math, and instead pays attention to the key components of the subject, especially link listing. By discussing the practical applications of the subject, the author has lessened the dry theory involved, and made the book more approachable. |
|---|---|
| AbstractList | The aim of the book is to serve as a text for students learning programming in 'C' on Data Structures such as array, linked list, stack, queue, trees, graph and sorting and searching methodology. The book illustrates in detail the methods, algorithms, functions and implementation of each and every concept of data structures. Algorithms are written in pseudo syntax i.e., near to 'C' language for easy understanding. It contains worked examples to amplify the material, and enhance the pedagogy. The content is not overburdened with math, and instead pays attention to the key components of the subject, especially link listing. By discussing the practical applications of the subject, the author has lessened the dry theory involved, and made the book more approachable. |
| Author | Pahuja Sanjay |
| Author_xml | – sequence: 1 fullname: Pahuja, Sanjay |
| BookMark | eNotjl1LwzAYhSN-oJv9D70Rrwb5eJsml7XbVBg4mF6Xt2nqSrumpqngv7cyrw4PPOdwFuSqd729IJFOFUu4YExpoS_Jgs2sBEulvpmBgtJcgIRbEo1jU1IhVCpYAncE9h5NaAx2cTYM3qE5xsHFawwYH4KfTJi8HWPsqzjrPp1vwvE03pPrGrvRRv-5JB_bzXv-stq9Pb_m2W6FkqewKoWusUplSatKgJXaSLBoENFCnfC64pIpXqOWHJgytAKacDSUQ81Rzp0leTzvzse-JjuGwpbOtcb2wWNXbJ7yBDRVUs3mw9lse_dtu2LwzQn9T_GnF-2wz9aHjFImfgF2tVbp |
| ContentType | eBook |
| Copyright | 2009 |
| Copyright_xml | – notice: 2009 |
| DEWEY | 005.1 |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9781523118939 1523118938 1781831769 9781781831762 |
| Edition | 1 |
| ExternalDocumentID | EBC5490868 book_kpPADSA001 |
| GroupedDBID | AAWZI ACXXF ALMA_UNASSIGNED_HOLDINGS CMZ K-E TD3 |
| ID | FETCH-LOGICAL-a6274-b39fad76b0dd34e69c64eacaaae4f52fd26182fa962418c0d4052ac024f2a6dd3 |
| IEDL.DBID | CMZ |
| ISBN | 1781831769 9781781831762 9781906574048 1906574049 |
| IngestDate | Tue Jan 23 03:47:43 EST 2024 Sat Nov 23 13:56:41 EST 2024 |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCallNum_Ident | QA76.9.A43 .P348 2009 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a6274-b39fad76b0dd34e69c64eacaaae4f52fd26182fa962418c0d4052ac024f2a6dd3 |
| OCLC | 1048923464 |
| PQID | EBC5490868 |
| PageCount | 573 |
| ParticipantIDs | proquest_ebookcentral_EBC5490868 knovel_primary_book_kpPADSA001 |
| PublicationCentury | 2000 |
| PublicationDate | 2009 |
| PublicationDateYYYYMMDD | 2009-01-01 |
| PublicationDate_xml | – year: 2009 text: 2009 |
| PublicationDecade | 2000 |
| PublicationPlace | London |
| PublicationPlace_xml | – name: London |
| PublicationYear | 2009 |
| Publisher | New Academic Science |
| Publisher_xml | – name: New Academic Science |
| SSID | ssib033873154 ssib032111627 |
| Score | 1.827093 |
| Snippet | The aim of the book is to serve as a text for students learning programming in 'C' on Data Structures such as array, linked list, stack, queue, trees, graph... |
| SourceID | proquest knovel |
| SourceType | Publisher |
| SubjectTerms | Computer algorithms-Textbooks General References Software Engineering |
| TableOfContents | Title Page
Preface
Table of Contents
1. Introduction to Data Structures and Algorithms
2. Built-in Data Structure
3. Unordered and Ordered Arrays
4. Linear Data Structure - Linked List
5. Algorithms on Stack
6. Algorithms on Queue
7. Non-Linear Data Structure: Trees
8. Non-Linear Data Structure: Graphs
9. Sorting Algorithms and Their Analysis
10. Searching Techniques
11. File Structures
Appendix: Conceptual Problem Solutions
Index
CD-Index
Copyright Cover -- Preface -- Contents -- Chapter 1: Introduction to Data Structures and Algorithms -- 1.1 Introduction to data representation -- 1.2 Review of data structures-Array, Pointer, Structure, Lists, Trees and Graphs -- 1.3 What is an Algorithm? -- 1.4 Designing Algorithms -- 1.5 Analyzing Algorithms -- 1.6 Mathematical Notation and Functions -- 1.7 Asymptotic Notation (O,θ,Ω) -- 1.8 Performance Measurement -- Chapter 2: Built-in Data Structure -- 2.1 Abstract Data Type -- 2.2 Arrays -- 2.3 Functions -- 2.4 Structures and Unions -- 2.5 Pointers -- 2.6 Memory Management in 'C' -- Chapter 3: Unordered and Ordered Arrays -- 3.1 One Dimensional Arrays -- 3.2 Two-Dimensional Arrays -- 3.3 Multidimensional Arrays -- 3.4 Ordered Arrays -- 3.5 Sparse Matrix -- Chapter 4: Linear Data Structure-Linked List -- 4.1 Linear Linked List and Operations -- 4.2 Circular Linked Linear Lists and Operations -- 4.3 Doubly Linear Linked Lists and Operations -- 4.4 Applications of Linked Lists -- 4.4.1 Polynomial Manipulation -- 4.4.2 Multiple-Precision Arithmetic -- 4.5 Set Operation on Linked List -- Chapter 5: Algorithms on Stack -- 5.1 Representation: Using Array and Linked List -- 5.2 Push and Pop Operations -- 5.3 Representation of expression: Infix, Postfix and Prefix -- 5.4 Evaluation of the Postfix expression -- 5.5 Transforming Infix Expression into Postfix Expression -- 5.6 Recursion -- Chapter 6: Algorithms on Queue -- 6.1 Representation: Using Array and Linked List -- 6.2 Insertion and Deletion Operations -- 6.3 Circular Queue -- 6.4 Double Ended Queues (DEQues) -- 6.5 Priority Queue -- 6.6 Multiple Queues -- Chapter 7: Non-Linear Data Structure: Trees -- 7.1 General Concept -- 7.2 Binary Tree -- 7.3 Sequential and Linked List Representation of Binary Tree -- 7.4 Binary Tree Traversal Algorithm: Recursive and Non-recursive 7.5 Threaded Binary Tree Traversal -- 7.6 General Tree and Its Conversion -- 7.7 Binary Search Tree (BST) -- 7.8 Height Balanced Trees: AVL -- 7.9 B-Trees -- 7.10 Applications of Trees -- Chapter 8: Non-Linear Data Structure: Graphs -- 8.1 Properties of Graphs -- 8.2 Representation of Graphs -- 8.3 Traversal Algorithms-Depth First Search, Breadth First Search -- 8.4 Minimum Cost Spanning Tree -- 8.5 Biconnectivity -- 8.6 Strong Connectivity -- 8.7 Transitive Closure Algorithm -- 8.8 Shortest Path Algorithms -- 8.9 Applications of Graph -- Chapter 9: Sorting Algorithms and Their Analysis -- 9.1 Internal and External Sorting -- 9.2 Sorting Problem -- 9.2.1 Bubble Sort -- 9.2.2 Selection Sort -- 9.2.3 Insertion Sort -- 9.2.4 Shell Sort -- 9.2.5 Address Calculation Sort -- 9.2.6 Radix Sort -- 9.2.7 Merge Sort -- 9.2.8 Quick Sort -- 9.2.9 Heap Sort -- Chapter 10: Searching Techniques -- 10.1 Sequential Search -- 10.2 Binary Search -- 10.3 Hashing -- 10.3.1 Hash Functions -- 10.3.2 Collision Resolution Techniques -- 10.4 Dynamic Memory Allocation -- Chapter 11: File Structures -- 11.1 Definition and Concept -- 11.2 File Organization -- 11.3 Files in 'C' -- Appendix: Conceptual Problem Solutions -- Index -- CD-Index |
| Title | Practical Approach to Data Structures and Algorithms |
| URI | https://app.knovel.com/hotlink/toc/id:kpPADSA001/practical-approach-data/practical-approach-data?kpromoter=Summon https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=5490868 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwzV3NS8MwFA8yPXhSUXF-jBy8xnVtlrReZO4DQR2DKQwvJWkSHZtt2er-fl_SFg8yvHoppNAXkj7e7728935B6BogW3s6EQTQDwKUQAdESD8kTEpuIqopN45n9omPx-FsFk0qio21q-_KbxZpttFLZ6Y_ssImMttFlrTn6naRT3qDac_SBlVNRGJJavJtYmsqt72_W-SuvA3Uozxe2jKhNeYes7Vh_ee3WjEhjOMB-Bq2MYwDwgHmsqjii6rHPkBYKeeXVXdQNTr4P4s8RLvatlIcoR2dHiM6qcXhXiUOFxkegEQ8dSy2XxD6Y5Eq3Fu-Z6t58fG5PkGvo-FL_4FUdzYQYW_xITKIjFCcSU-pgGoWJYyCbRdCaGq6vlEQsYW-ERED1yFMPAUOoy8S8BSMLxh8c4oaaZbqM4Q7vuSqYyjXilIZKKk8TwhpQLO6nUCKJmqVa4rzkpgjtnFJ_LN9TYTrHxG71HNV7xoP7_tdm_Bk4flfMi7Qfpk_socul6gB26Gv0F6yKebrVctpCTwfyfAbeqDpbg |
| linkProvider | Knovel |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Practical+Approach+to+Data+Structures+and+Algorithms&rft.au=Pahuja+Sanjay&rft.date=2009-01-01&rft.pub=New+Academic+Science&rft.isbn=9781781831762&rft.externalDocID=book_kpPADSA001 |
| thumbnail_s | http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fcontent.knovel.com%2Fcontent%2FThumbs%2Fthumb11084.gif |