| Book Detail | |
| About The Author's | Prof. R. S. Salaria is an outstanding teacher, a prolific author, a great motivator, and a social reformer. He is alumni of IIT. Delhi. He is a Certified Software Quality Professional (CSQP) by Govt. of India; SUN Certified Programmer and Trainer by SUN Microsystems, USA. He is life member of Computer Society of India (CSI), Institution of Electronics and Telecommunication Engineers (IETE), Indian Society for Technical Education (ISTE), and Punjab Academy of Sciences (PAS). He has delivered enlightening sessions in numerous Faculty Development Programmes (FDPs)/Faculty Empowerment Workshops (FEWs) to empower the faculty to become passionate teachers. He has also delivered enlightening sessions for students pan India to empower them to become passionate learners, great professionals, and good human beings. He is also taking initiatives to empower people of various sections and age groups on various issues such as character building, women empowerment, female feticide, honour killings, and various dimensions of corruption in public and private life. |
| Category | Computer Science and Information Technology |
| What's special / Useful in this book | Salient Features - Compliant to New Education Policy-2020, Outcome sed Education, and Bloom's Тахопоту. • Comprehensive coverage of the syllabus. • Development of programs in an industry-oriented style. • Numerous ready-to-run programs for reference. • Numerous MCQs, review exercises, and programming exercises to test student's knowledge ofthe subject and skills acquired. • Lab manual to help students in implementing lab exercises. Frequently asked questions (FAQs) to ace the technical round of the PLACEMENT PROCESS. |
| Publication Year | 2022 |
| ISBN-13 | 9789392549281 |
| Edition | 1st |
| Pages | 290 |
| Preface | |
| Preface | The subject of data structures is of prime importance for the students of Computer Science and IT. It is of practical nature and requires a thorough understanding of the basic concepts of the subject before putting them into practice. It is important to mention here that the data structures are the backbone of any kind of software. Software is designed to store, manage and manipulate data ranging from small volumes to huge volumes. If the data is not organized properly and efficiently, the software will not be able to deliver the desired performance. Therefore, to build a kind of software, we need to have a thorough understanding of the basics and concepts of the subject of data structures. Therefore, keeping in mind the requirements of 21" Century, a special emphasis is laid on the following aspects: o Designed keeping in mind the objectives of NEW EDUCATIONAL POLICY-2020 and OUTCOME BASED EDUCTION. o Simple and lucid language enables even an average reader to grasp the fundamental concepts of the subject. o Numerous illustrative examples demonstrate the application of the concepts. o Numerous review and programming exercises for assessments as per BLOOM'S TAXONOMY. o Multiple choice questions (MCQs) provide an opportunity for self-assessment of the fundamental concepts learned o Frequently asked questions (FAQs) to conquer the technical round of the CAMPUS PLACEMENT PROCESS with flying colors. o Lab Manual is provided to guide the students in handling their laboratory work |
| Table of Contents | |
| Table of Contents | Chapter 1: Fundamental Notations Chapter 2: Arrays Chapter 3: Linked Lists Chapter 4: Stacks, Queues, and Recursion Chapter 5: Trees Chapter 6: Sorting and Searching. Chapter 7: Graphs List of practical’s Write programs in C to implement 1. Addition of two matrices using functions 2. Multiplication of two matrices 3. Push and pop operation in stack 4. Inserting and deleting elements in queue 5. Inserting and deleting elements in circular queue 6. Insertion and deletion of elements in linked list 7. Insertion and deletion of elements in doubly linked list 8. Factorial of a given number with recursion and without recursion 9. Fibonacci series with recursion and without recursion 10. Program for pre-order, post order and in order traversal of binary tree. 11. The selection sort technique 12. The bubble sort technique 13. The quick sort technique 14. The merge sort technique 15. The binary search procedures to search an element in a given list 16. The linear search procedures to search an element in a given list |