Data Structures Algorithms and Applications in C With Microsoft Compiler 2nd Edition by Sartaj Sahni ISBN 0929306325 9780929306322
Original price was: $50.00.$35.00Current price is: $35.00.
Authors:Sartaj Sahni , Series:IT & Computer [263] , Tags:Computers; Languages; C , Author sort:Sahni, Sartaj , Ids:Google; 9780072362268 , Languages:Languages:eng , Published:Published:Jul 1999 , Publisher:McGraw-Hill Higher Education , Comments:Comments:This text provides students with an introduction to data structures and algorithms. It emphasizes algorithm analysis and the development of efficient code, and includes important background material. Divided into three parts, the text features Data Structure Application sections at the end of each chapter in part two, Algorithm Application sections in each design method chapter in part three, and a gradual development of C++ features not found in C to help students with either a background in C or C++ to comprehend topics in the book.
Data Structures Algorithms and Applications in C With Microsoft Compiler 2nd Edition by Sartaj Sahni- Ebook PDF Instant Download/Delivery. 0929306325 ,9780929306322
Full download Data Structures Algorithms and Applications in C With Microsoft Compiler 2nd Edition after payment
Product details:
ISBN 10: 0929306325
ISBN 13: 9780929306322
Author: Sartaj Sahni
Data Structures Algorithms and Applications in C With Microsoft Compiler 2nd Edition Table of contents:
Chapter 1: Introduction to Data Structures
- What are Data Structures?
- Classification of Data Structures
- Linear vs. Nonlinear Data Structures
- The Role of Algorithms in Data Structures
- Using C and the Microsoft Compiler for Implementation
Chapter 2: C Programming Language Overview
- Introduction to C Language Features
- Pointers and Dynamic Memory Allocation
- Functions and Recursion in C
- Structs and Unions
- File I/O and Working with the Microsoft Compiler
- Best Practices for C Programming
Chapter 3: Arrays
- Introduction to Arrays
- One-Dimensional and Multi-Dimensional Arrays
- Array Representation in Memory
- Searching and Sorting Arrays
- Dynamic Arrays and Memory Allocation
- Applications of Arrays
Chapter 4: Linked Lists
- Introduction to Linked Lists
- Singly Linked Lists
- Doubly Linked Lists
- Circular Linked Lists
- Operations on Linked Lists (Insertion, Deletion, Traversal)
- Memory Management in Linked Lists
- Applications of Linked Lists
Chapter 5: Stacks
- Introduction to Stacks
- Stack Operations (Push, Pop, Top)
- Array-Based and Linked List-Based Implementations
- Applications of Stacks (Expression Evaluation, Backtracking)
- Recursion and Stack Usage
Chapter 6: Queues
- Introduction to Queues
- Queue Operations (Enqueue, Dequeue, Front, Rear)
- Circular Queues
- Priority Queues
- Double-Ended Queues (Deque)
- Queue Implementations in C
- Applications of Queues (Scheduling, Networking)
Chapter 7: Trees
- Introduction to Trees
- Binary Trees
- Binary Search Trees (BST)
- Tree Traversals (Inorder, Preorder, Postorder)
- AVL Trees and Balanced Trees
- B-Trees and Multi-Way Trees
- Applications of Trees in Searching and Sorting
Chapter 8: Graphs
- Introduction to Graphs
- Representation of Graphs (Adjacency Matrix, Adjacency List)
- Graph Traversal Algorithms (Depth-First Search, Breadth-First Search)
- Shortest Path Algorithms (Dijkstra, Bellman-Ford)
- Minimum Spanning Tree Algorithms (Prim’s, Kruskal’s)
- Applications of Graphs in Networks and Social Media
Chapter 9: Searching Algorithms
- Introduction to Searching Algorithms
- Linear Search and Binary Search
- Hashing and Hash Tables
- Collision Resolution Techniques
- Searching in Trees and Graphs
- Time Complexity of Searching Algorithms
Chapter 10: Sorting Algorithms
- Introduction to Sorting Algorithms
- Bubble Sort, Selection Sort, Insertion Sort
- Merge Sort and Quick Sort
- Heap Sort and Radix Sort
- Sorting in External Memory
- Time and Space Complexity Analysis
Chapter 11: Advanced Data Structures
- Heaps and Priority Queues
- B-Trees and Red-Black Trees
- Splay Trees and Treaps
- Tries and Suffix Trees
- Disjoint Set Union (Union-Find)
- Applications of Advanced Data Structures
Chapter 12: Algorithm Design Techniques
- Divide and Conquer Algorithms
- Greedy Algorithms
- Dynamic Programming
- Backtracking Algorithms
- Branch and Bound
- Analysis and Optimization of Algorithms
Chapter 13: Graph Algorithms
- Minimum Spanning Tree Algorithms
- Shortest Path Algorithms (Dijkstra, Floyd-Warshall)
- Topological Sorting
- Maximum Flow Algorithms (Ford-Fulkerson, Edmonds-Karp)
- Applications of Graph Algorithms
Chapter 14: String Algorithms
- String Matching Algorithms
- Knuth-Morris-Pratt (KMP) Algorithm
- Rabin-Karp Algorithm
- Suffix Arrays and Suffix Trees
- Applications of String Algorithms
Chapter 15: Computational Geometry
- Introduction to Computational Geometry
- Line and Polygon Intersection
- Convex Hulls
- Voronoi Diagrams and Delaunay Triangulation
- Applications of Computational Geometry
Chapter 16: Advanced Topics in Algorithms
- Randomized Algorithms
- Approximation Algorithms
- Parallel Algorithms
- Streaming Algorithms
- Cryptography and Security Algorithms
- NP-Completeness and Approximation Algorithms
People also search for Data Structures Algorithms and Applications in C With Microsoft Compiler 2nd Edition:
borrow data structures algorithms and applications in c++
data structures algorithms and applications in java
data structures algorithms and applications in java sartaj sahni pdf
data structures algorithms and applications in java pdf
You may also like…
