Data Structure in Hindi

Data Structure in Hindi

5 out of 5 based on 1 customer rating

Rs. 300.00

Pages : 433
Format : PDF
Type : Softcopy EBook
Author : Kuldeep Mishra
Contact : 097994-55505
Demo : Download Free Chapters
Category: Tags: , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , ,

Product Description

विभिन्‍न प्रकार के Data Structures के बारे में आपकी समझ जितनी अच्‍छी होती है, आप उतने अच्‍छे Programmer माने जाते हैं। इसलिए यदि आप एक अच्‍छा Programmer बनना चाहते हैं, तो आपको विभिन्‍न प्रकार के Data Structures पर अच्‍छी पकड बनानी चाहिए और इस जरूरत को पूरा करने के लिए ये पुस्‍तक निश्‍चत रूप से आपके लिए काफी उपयोगी होगी।

क्‍योंकि इस पुस्‍तक में काफी सरल व आसानी से समझने योग्‍य Examples के माध्‍यम से C Language Programs का प्रयोग करते हुए विभिन्‍न प्रकार के Data Structures को Implement किया गया है व इस बात काे भी समझाया गया है, कि किस प्रकार के Data Structure को किस प्रकार की जरूरत को पूरा करने के लिए Develop किया गया है और उसे Efficiently कैसे Use किया जाता है। इस पुस्‍तक में Include किए गए Contents निम्‍नानुसार हैं:

Table of Contents

Data Structure Fundamentals and Arrays

Data – Field, Record and File
Data Structures
      Linear Data Structure
      Non-Linear Data Structure
Algorithm : Time – Space Tradeoff and Complexity
Algorithms
      Analysis of Algorithm
      Rate of Growth
      Complexity ( Big O Notation )
      Properties of “O” Notation
Analyzing Algorithms
Inserting and Deleting
      Algorithm of Inserting
Sorting
      Bubble Sort
      Selection Sort
      Insertion Sort
Searching
      Internal Search
      External Search
      Linear Searching
      Binary Searching
String Operations and Data Structure
Pattern Matching Algorithms
Algebra of Matrix
      Addition of Matrixes
      Subtraction of Matrixes
      Multiplication of Matrix
      Transpose of Matrix
      Orthogonal Matrix
      Symmetric Matrix
      Sparse Matrix

Linked Lists

Linked List
Creating Linked List
Memory Allocation
Garbage Collection
Overflow and Underflow
INSERTING New NODE at the End of the LIST
INSERTING New NODE at the BEGINNING of the LIST
INSERTING New NODE at any MIDDLE Position of the LIST
Searching in a Linked List
      LIST is Unsorted
      LIST is Sorted
Sorting
Inserting into a Sorted Linked List
Deleting from a Linked List
      Deletion of First Node
      Deletion of Last Node
      Deletion Any NODE from a Linked List
      Deleting the Node with a Given ITEM of Information
Header Linked List
Grounded Header
Circular Header
      Creating a Circular Linked List
      Traversing a Circular Linked List
Two – Way Lists OR Doubly Linked List
      CREATION of Doubly Linked List
      INSERTING NODE After Specific Node Number
      DELETION In Doubly Linked List
      DELETION of Specified NODE of the Doubly Linked List
Circular Doubly Linked List

Stack and Queue

STACK
      PUSH
      POP
      Postponed Decisions
      ARRAY Representation of Stack
      PUSH Algorithm For Array Stack
      POP Algorithm For Array Stack
      Linked List Representation of STACK
Arithmetic Expressions and POLISH Notations
      Evaluation of a Postfix Expression
      Transforming Infix Expression into Postfix Expression
Quick Sort
      Complexity fo the Quick Sort Algorithm
Queues
      Representation of Queues
      PUSH Algorithm For Array Queue
      POP Algorithm For Array Queue
      Linked Representation of Queues
Circular QUEUE
DEQUE
Priority Queue

Trees

Binary Tree
Terminology
A Complete Binary Tree
Extended Binary Tree or 2 – Tree
Representation of Binary Tree
      Sequential Representation
      Linked List Representation
Traversing Binary Tree
      Preorder Traversing
      Inorder Traversing
      Postorder Traversing
CREATING Binary Tree
INSERTING in a Binary Tree
Creating Binary Tree Array Representation
Binary Search Tree (BST)
      SEARCHING and INSERTING in Binary Search Tree
      Complexity of the Searching Algorithm
      DELETING from Binary Search Tree
      Complexity of Binary Search Tree
Balanced Binary Tree
      AVL Tree ( Height Balanced Tree )
      Tree Rotation
      Insertion a Node in AVL Tree
      Deletion From an AVL Tree
M – Way Search Tree
      Searching in M – Way Tree
      Insertion in M – Way Tree
      Deletion from M – Way Tree
B – Tree

Graph

Basic Concepts and Definitions
Path
Sequential Representation
Adjacency Matrix
Path Matrix
Shortest Path Algorithm
Warshall Algorithm
Warshall’s Modified Algorithm
Dijkstra’s Algorithm
Floyd’s Technique
Linked List Representation of Graph (Adjacency List)
Operations on GRAPHS
      Inserting in a GRAPH
      Deleting From a GRAPH
      Traversing A GRAPH
Breadth First Search
Depth First Search
Partially Ordered Set (POSETS)
Topological Sorting
Minimum Spanning Tree (MST)
Kruskal’s Algorithm

Searching and Sorting

Searching
Data Modification
      Sorted Array
      Linked List
      Binary Search Tree
Linear and Binary Searching
Hash Table
      Hashing
      Hash Function
Collision Resolution
Open Addressing : Linear Probing(Key Comparisons) and Modifications
      Clustering
      Quadratic Probing
      Double Hashing
      Deletion
      Rehashing
      Bucket And Chaining
      Selecting Good Hash Function

File Structure

File System
Basic Concepts of File and File System
      File Data Storage and Retrieval
      File Naming and File Attribute Maintenance
      File System Application Program Interface (API)
Disk Space Allocation
FAT File System (MS-DOS)
Directory System
UNIX File System
      i-node File System (Flat File System)
      Directory File System
      Primary Key
      System Architecture
Primary and Secondary Structure
Secondary Storage Devices
      Hard Disk Drives
      Disk Capacity
      Disk Access