Data structures using C : a practical approach for beginners /: a practical approach for beginners. (2021)

• Record Type: Book
• Further Information: Note: Amol M. Jagtap, Ajit S. Mali.
• Authors: Jagtap, Amol M; Mali, Ajit S
• Contents: 1. Fundamental Principles of Algorithm and Recursion. 1.1. Algorithm, its Pseudo-Code Representation and Flow Chart. 1.2. Abstract Data type. 1.3. Data Structure. 1.4. Algorithm Efficiency or Performance Analysis of an Algorithm. 1.5. Recursion and Design of Recursive Algorithms with Appropriate Examples. 1.6. Interview Questions. 1.7. Multiple Choice Questions. 2. Sequential Representation of Linear Data Structures 2.1. Distinction between Linear Data Structure and Non-Linear Data Structure. 2.2. Operations on Stack. 2.3. Applications of Stack. 2.4. Implementing Stack Applications. 2.5. Queue. 2.6. Applications of the Queue Data Structure. 2.7. Differences between Stack and Queue Data Structure. 2.8. Interview Questions. 2.9. Multiple Choice Questions. 3. Void pointer and Dynamic Memory Management. 3.1 Void Pointer. 3.2. Pointer and Structure Data Type. 3.3. Dynamic Memory Allocation. 3.4. Memory Leakage. 3.5. Dangling Pointer. 3.6. Interview Questions. 3.7. Multiple Choice Questions. 4. Linked Representation of Linear Data Structures. 4.1. Limitations of Static Memory Allocation and Advantages of Dynamic Memory Management. 4.2. Concept of Linked List. 4.3. Types of Linked List. 4.4. Singly Linear Linked list. 4.5. Singly Circular Linked List. 4.6. Doubly Linear Linked List (DLLL). 4.7. Doubly Circular Linked List. 4.8. Stack Implementation using Linked List. 4.9. Linear Queue Implementation Using Linked List. 4.10. Circular Queue Implementation Using Linked List. 4.11. Interview Questions. 4.12. Multiple Choice Questions. 5. Nonlinear Data Structures: Trees 5.1. Basic Concept and Tree Terminology. 5.2. Data Structure for Binary Trees. 5.3. Algorithms for Tree Traversals. 5.4. Construct a Binary Tree from given Traversing Methods. 5.5. Binary Search Trees (BST). 5.6. Binary Search Tree (BST) Algorithms. 5.7. Applications of Binary Search Tree (BST). 5.8. Heaps. 5.9. AVL tree. 5.10. B trees.5.11. B+ trees. 5.12. Interview Questions. 5.13. Multiple Choice Questions. 6. Nonlinear Data Structures: Graph. 6.1. Concepts and terminology of graph. 6.2. Representation of Graph Using Adjacency Matrix and Adjacency List. 6.3. Graph traversal Techniques (Breath first search and Depth first search). 6.4. Applications of Graph as Shortest Path Algorithm and Minimum Spanning Tree. 6.5. Interview Questions. 6.6. Multiple Choice Questions. 7. Searching and Sorting Techniques. 7.1. Need of searching and sorting. 7.2. Sequential Search. 7.3. Binary Search. 7.4. Analysis of Searching Techniques (Best, Average and worst case). 7.5. Hashing Techniques. 7.6. Types of Hash Functions. 7.7. Collision resolution techniques. 7.8. Open and closed hashing. 7.9. Sorting. 7.10. Interview Questions. 7.11. Multiple Choice Questions.
• Edition: 1st
• Publisher Details: Boca Raton : Chapman & Hall/CRC
• Publication Date: 2021
• Extent: 1 online resource, illustrations (black and white)
• Subjects: 005.73; Data structures (Computer science); C (Computer program language)
• Languages: English
• ISBNs: 9781000470741; 9781000470710; 9781003105800
• Related ISBNs: 9780367616311
• Notes: Note: Includes bibliographical references and index.; Note: Description based on CIP data; resource not viewed.
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.