Data Structure Using C

Data Structure Using C

2499 Views
MRP : ₹286.00
Price : ₹214.50
You will save : ₹71.50 after 25% Discount
Inclusive of all taxes
INSTANT delivery: Read it now on your device

Save extra with 2 Offers

Get ₹ 50

Instant Cashback on the purchase of ₹ 400 or above
SAVE05 Already Applied

Product Specifications

Publisher JSR Publishing House All MCA - Master of Computer Applications books by JSR Publishing House
ISBN 9789387684768
Author: Dr. Neetu Anand, Dhruvi Goyal
Number of Pages 256
Edition First Edition
Available
Available in all digital devices
  • Snapshot
  • About the book
  • Sample book
Data Structure Using C - Page 1 Data Structure Using C - Page 2 Data Structure Using C - Page 3 Data Structure Using C - Page 4 Data Structure Using C - Page 5

Data Structure Using C by Dr. Neetu Anand, Dhruvi Goyal
Book Summary:

Data structure, its algorithm and implementation in C is the requirement for all the computer science students. Any complex problem can be solving easily by using Data Structure and its applications. Data Structure also improves the logical thinking and capability to solve problems. The book comprises of seven chapters covers: Introduction to Arrays, Linked List, stacks, Queues, Trees, Sorting, Searching and hashing. The unique thing about this book is the novelty with which various programs for certain algorithms are implemented in different chapters. We have tried to implement the programs in an easily understandable, distinct and efficient manner. Programs are provided for each concept which students can easily understand and implement. This book serves as a useful guide to prepare for regular exam preparation and for interviews. The entire concept in this book is given in easy to understand way. Overall this book provides students and teachers with readymade reference material in a quiet easy and comprehensive manner.

Audience of the Book :
This book Useful for BCA,MCA Student.
Table of Content:

1. Introduction To Data Structure

2. Arrays

3. Linked List

4. Stack

5. Queue

6. Tree

7. Sorting, Searching And Hashing