Description
This book provides an in-depth introduction to data structures and its uses had also lucid analysis of algorithms. It explains how the abstractions can be made concrete by using a programming language C. Each data structure is implemented in a variety of ways that provides the real choice for programmers and all programs are executed successfully. With the extensive use of figures and examples, the successive stages of an algorithm are explained in a much easier and understandable manner.
Table of Contents
Chapter 1: Basic Terminology.
Chapter 2: Stacks.
Chapter 3: Recursion.
Chapter 4: Queues.
Chapter 5: Linked List.
Chapter 6: Trees.
Chapter 7: Searching & Hashing.
Chapter 8: Sorting.
Chapter 9: Graphs.
Chapter 10: Files.
Program List
Multiple Choice Questions
Question Paper
Author
Anish Gupta
Anish Gupta is presently working as an Assistant Professor in the Department of Computer Science and Engineering at ITS Engineering College, Greater Noida. He has obtained B.Tech & M. Tech. (Computer Science & Engineering) and having 8 years of teaching experience.
![Mathematics I Calculus and Linear Algebra [For Non Computer Science Engineering Branches] (English)](https://khannabooks.com/wp-content/uploads/2023/10/978-93-91505-17-2.jpg)
![Mathematics I Calculus and Linear Algebra [For Non Computer Science Engineering Branches] (Hindi)](https://khannabooks.com/wp-content/uploads/2023/10/978-93-5538-157-6.jpg)
Reviews
There are no reviews yet.