Data Structures Using C
Home > Computing and Information Technology > Computer programming / software engineering > Data Structures Using C
7%
Data Structures Using C

Data Structures Using C

|
     0     
5
4
3
2
1




Out of Stock


Notify me when this book is in stock
About the Book

This second edition of Data Structures Using C has been developed to provide a comprehensive and consistent coverage of both the abstract concepts of data structures as well as the implementation of these concepts using C language. It begins with a thorough overview of the concepts of C programming followed by introduction of different data structures and methods to analyse the complexity of different algorithms. It then connects these concepts and applies them to the study of various data structures such as arrays, strings, linked lists, stacks, queues, trees, heaps, and graphs. The book utilizes a systematic approach wherein the design of each of the data structures is followed by algorithms of different operations that can be performed on them, and the analysis of these algorithms in terms of their running times. Each chapter includes a variety of end-chapter exercises in the form of MCQs with answers, review questions, and programming exercises to help readers test their knowledge.

Table of Contents:
1. INTRODUCTION TO C; 1.1 INTRODUCTION; 1.2 IDENTIFIERS AND KEYWORDS; 1.3 BASIC DATA TYPES; 1.4 VARIABLES AND CONSTANTS; 1.5 WRITING THE FIRST C PROGRAM; 1.6 INPUT AND OUTPUT FUNCTIONS; 1.7 OPERATORS AND EXPRESSIONS; 1.8 TYPE CONVERSION AND TYPECASTING; 1.9 CONTROL STATEMENTS; 1.10 FUNCTIONS; 1.11 POINTERS; 2. INTRODUCTION TO DATA STRUCTURES AND ALGORITHMS; 2.1 BASIC TERMINOLOGY; 2.2 CLASSIFICATION OF DATA STRUCTURES; 2.3 OPERATIONS ON DATA STRUCTURES; 2.4 ABSTRACT DATA TYPE; 2.5 ALGORITHMS; 2.6 DIFFERENT APPROACHES TO DESIGNING AN ALGORITHM; 2.7 CONTROL STRUCTURES USED IN ALGORITHMS; 2.8 TIME AND SPACE COMPLEXITY; 2.9 BIG O NOTATION; 2.10 OMEGA NOTATION (?); 2.11 THETA NOTATION (Q); 2.12 OTHER USEFUL NOTATIONS; 3. ARRAYS; 3.1 INTRODUCTION; 3.2 DECLARATION OF ARRAYS; 3.3 ACCESSING THE ELEMENTS OF AN ARRAY; 3.4 STORING VALUES IN ARRAYS; 3.5 OPERATIONS ON ARRAYS; 3.6 PASSING ARRAYS TO FUNCTIONS; 3.7 POINTERS AND ARRAYS; 3.8 ARRAYS OF POINTERS; 3.9 TWO-DIMENSIONAL ARRAYS; 3.10 OPERATIONS ON TWO-DIMENSIONAL ARRAYS; 3.11 PASSING TWO-DIMENSIONAL ARRAYS TO FUNCTIONS; 3.12 POINTERS AND TWO-DIMENSIONAL ARRAYS; 3.13 MULTI-DIMENSIONAL ARRAYS; 3.14 POINTERS AND THREE-DIMENSIONAL ARRAYS; 3.15 SPARSE MATRICES; 3.16 APPLICATIONS OF ARRAYS; 4. STRINGS; 4.1 INTRODUCTION; 4.2 OPERATIONS ON STRINGS; 4.3 ARRAYS OF STRINGS; 4.4 POINTERS AND STRINGS; 5. STRUCTURES AND UNIONS; 5.1 INTRODUCTION; 5.2 NESTED STRUCTURES; 5.3 ARRAYS OF STRUCTURES; 5.4 STRUCTURES AND FUNCTIONS; 5.5 SELF-REFERENTIAL STRUCTURES; 5.6 UNIONS; 5.7 ARRAYS OF UNION VARIABLES; 5.8 UNIONS INSIDE STRUCTURES; 6. LINKED LISTS; 6.1 INTRODUCTION; 6.2 SINGLY LINKED LISTS; 6.3 CIRCULAR LINKED LISTS; 6.4 DOUBLY LINKED LISTS; 6.5 CIRCULAR DOUBLY LINKED LISTS; 6.6 HEADER LINKED LISTS; 6.7 MULTI-LINKED LISTS; 6.8 APPLICATIONS OF LINKED LISTS; 7. STACKS; 7.1 INTRODUCTION TO STACKS; 7.2 ARRAY REPRESENTATION OF STACKS; 7.3 OPERATIONS ON A STACK; 7.4 LINKED REPRESENTATION OF STACKS; 7.5 OPERATIONS ON A LINKED STACK; 7.6 MULTIPLE STACKS; 7.7 APPLICATIONS OF STACKS; 8. QUEUES; 8.1 INTRODUCTION TO QUEUES; 8.2 ARRAY REPRESENTATION OF QUEUES; 8.3 LINKED REPRESENTATION OF QUEUES; 8.4 TYPES OF QUEUES; 8.5 APPLICATIONS OF QUEUES; 9. TREES; 9.1 INTRODUCTION; 9.2 TYPES OF TREES; 9.3 CREATING A BINARY TREE FROM A GENERAL TREE; 9.4 TRAVERSING A BINARY TREE; 9.5 HUFFMAN'S TREE; 9.6 APPLICATIONS OF TREES; 10. EFFICIENT BINARY TREES; 10.1 BINARY SEARCH TREES; 10.2 OPERATIONS ON BINARY SEARCH TREES; 10.3 THREADED BINARY TREES; 10.4 AVL TREES; 10.5 RED-BLACK TREES; 10.6 SPLAY TREES; 11. MULTI-WAY SEARCH TREES; 11.1 INTRODUCTION TO M-WAY SEARCH TREES; 11.2 B TREES; 11.3 B+ TREES; 11.4 2-3 TREES; 11.5 TRIE; 12. HEAPS; 12.1 BINARY HEAPS; 12.2 BINOMIAL HEAPS; 12.3 FIBONACCI HEAPS; 12.4 COMPARISON OF BINARY, BINOMIAL,AND FIBONACCI HEAPS; 12.5 APPLICATIONS OF HEAPS; 13. GRAPHS; 13.1 INTRODUCTION; 13.2 GRAPH TERMINOLOGY; 13.3 DIRECTED GRAPHS; 13.4 BI-CONNECTED COMPONENTS; 13.5 REPRESENTATION OF GRAPHS; 13.6 GRAPH TRAVERSAL ALGORITHMS; 13.7 TOPOLOGICAL SORTING; 13.8 SHORTEST PATH ALGORITHMS; 13.9 APPLICATIONS OF GRAPHS; 14. SEARCHING AND SORTING; 14.1 INTRODUCTION TO SEARCHING; 14.2 LINEAR SEARCH; 14.3 BINARY SEARCH; 14.4 INTERPOLATION SEARCH; 14.5 JUMP SEARCH; 14.6 INTRODUCTION TO SORTING; 14.7 BUBBLE SORT; 14.8 INSERTION SORT; 14.9 SELECTION SORT; 14.10 MERGE SORT; 14.11 QUICK SORT; 14.12 RADIX SORT; 14.13 HEAP SORT; 14.14 SHELL SORT; 14.15 TREE SORT; 14.16 COMPARISON OF SORTING ALGORITHMS; 14.17 EXTERNAL SORTING; 15. HASHING AND COLLISION; 15.1 INTRODUCTION; 15.2 HASH TABLES; 15.3 HASH FUNCTIONS; 15.4 DIFFERENT HASH FUNCTIONS; 15.5 COLLISIONS; 15.6 PROS AND CONS OF HASHING; 15.7 APPLICATIONS OF HASHING; 16. FILES AND THEIR ORGANIZATION; 16.1 INTRODUCTION; 16.2 DATA HIERARCHY; 16.3 FILE ATTRIBUTES; 16.4 TEXT AND BINARY FILES; 16.5 BASIC FILE OPERATIONS; 16.6 FILE ORGANIZATION; 16.7 INDEXING


Best Sellers


Product Details
  • ISBN-13: 9780198099307
  • Publisher: OUP India
  • Publisher Imprint: OUP India
  • Edition: Revised edition
  • Language: English
  • Returnable: N
  • Weight: 692 gr
  • ISBN-10: 0198099304
  • Publisher Date: 09 Oct 2014
  • Binding: Paperback
  • Height: 243 mm
  • No of Pages: 560
  • Spine Width: 22 mm
  • Width: 183 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Data Structures Using C
OUP India -
Data Structures Using C
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Data Structures Using C

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!