Computer Science

& IT

Programming and
Data Structures

Comprehensive Theory
with Solved Examples and Practice Questions

Publications
 Publications

MADE EASY Publications

Corporate Office: 44-A/4, Kalu Sarai (Near Hauz Khas Metro Station), New Delhi-110016
E-mail: [email protected]
Contact: 011-45124660, 8860378007
Visit us at: www.madeeasypublications.org

Programming and Data Structures

© Copyright by MADE EASY Publications.
All rights are reserved. No part of this publication may be reproduced, stored in or introduced
into a retrieval system, or transmitted in any form or by any means (electronic, mechanical,
photo-copying, recording or otherwise), without the prior written permission of the above
mentioned publisher of this book.

First Edition: 2015

Second Edition : 2016
Third Edition : 2017
Fourth Edition : 2018
Fifth Edition : 2019
Sixth Edition : 2020

© All rights reserved by MADE EASY PUBLICATIONS. No part of this book may be reproduced or utilized in any form without the
written permission from the publisher.
Contents
Programming & Data Structures

Chapter 1 3.6 Average Stack Lifetime of an Element................ 105

3.7 Applications of Stack................................................. 106

Programming Methodology������������������������� 2
3.8 Tower of Hanoi............................................................. 116
1.1 Data Segments in Memory.......................................... 2
Student Assignments.................................................. 119
1.2 Scope of Variable............................................................. 4

1.3 C Variable............................................................................ 6 Chapter 4

1.4 Operators in C................................................................... 9 Queue��������������������������������������������������� 127
1.5 Address arithmetic in C...............................................16 4.1 Introduction.................................................................. 127
1.6 Value of Variable in C Language...............................16 4.2 Operations of Queue................................................. 127
1.7 Flow Control in C............................................................17 4.3 Application of Queue................................................ 129
1.8 Function............................................................................25 4.4 Circular Queue............................................................. 129
1.9 Recursion..........................................................................31 4.5 Implement Queue using Stacks............................ 130
1.10 C Scope Rules..................................................................34 4.6 Implement Stack Using Queues............................ 131
1.11 Storage Class...................................................................37 4.7 Average Lifetime of an Element in Queue......... 134
1.12 Pointers..............................................................................45 4.8 Types of Queue............................................................ 134
1.13 Sequence Points in C....................................................58 4.9 Double Ended Queue (Dequeue)......................... 135
1.14 Declarations and Notations.......................................60 4.10 Priority Queue.............................................................. 136
1.15 Const Qualifier................................................................61 Student Assignments.................................................. 139

1.16 Strings in C.......................................................................62

Chapter 5
Student Assignments.....................................................64
Linked Lists...........................................147
Chapter 2 5.1 Introduction.................................................................. 147
Arrays�������������������������������������������������������79 5.2 Linked Lists.................................................................... 148
2.1 Definition of Array.........................................................79
5.3 Uses of Linked lists..................................................... 148
2.2 Declaration of Array......................................................79
5.4 Singly Linked List or One Way Chain................... 148
2.3 Properties of Array.........................................................80
5.5 Circular Single Linked List........................................ 157
2.4 Accessing Elements of an Array................................83
5.6 Doubly Linked Lists or Two-way chain................ 159
Student Assignments.....................................................92
5.7 List Implementation of Queues............................. 164
Chapter 3
5.8 List Implementation of Stacks................................ 165
Stack��������������������������������������������������������98
5.9 List Implementation of Priority Queues............. 166
3.1 Introduction.....................................................................98
5.10 Other operation on Linked List.............................. 166
3.2 Operation on Stack.......................................................98
5.11 Polynomial Addition Using Linked List............... 167
3.3 Simple Representation of a Stack......................... 100

3.4 ADT of Stack.................................................................. 100 5.12 Polynomial Multiplication Using Linked List.... 168

3.5 Operations of Stack.................................................... 100 Student Assignments.................................................. 170

(iii)
Chapter 6 Chapter 7
Trees ..................................................181 Hashing Techniques.............................236
6.1 Introduction.................................................................. 181 7.1 Introduction.................................................................. 236

6.2 Glossary.......................................................................... 181 7.2 Hash Function.............................................................. 236

6.3 Applications of Tree................................................... 182 7.3 Collisions........................................................................ 237

6.4 Tree Traversals for Forests........................................ 183 7.4 Collision Resolution Techniques............................ 237

6.5 Binary Trees................................................................... 184 7.5 Hashing Function........................................................ 244

6.6 Types of Binary Trees................................................. 184 7.6 Comparison of Collision Resolution

6.7 Applications of Binary Tree...................................... 186 Techniques.................................................................... 246

6.8 Internal and External Nodes................................... 190 7.7 Various Hash Function.............................................. 246

6.9 Expression Trees.......................................................... 192 Student Assignments.................................................. 248

6.10 Binary Tree Representations................................... 193

. nnnn
6.11 Implicit Array Representation of Binary Trees....... 194

6.12 Threaded Binary Trees............................................... 196

6.13 Representing Lists as Binary Trees........................ 196

6.14 Binary Search Tree...................................................... 199

6.15 AVL Tree (Adelson Velski Landis)........................... 208

Student Assignments.................................................. 223

(iv)