Sachi Nandan Mohanty - Data Structure and Algorithms Using C++

1 Cover

2 Title Page

3 Copyright

4 Preface

5 1 Introduction to Data Structure1.1 Definition and Use of Data Structure 1.2 Types of Data Structure 1.3 Algorithm 1.4 Complexity of an Algorithm 1.5 Efficiency of an Algorithm 1.6 Asymptotic Notations 1.7 How to Determine Complexities 1.8 Questions

6 2 Review of Concepts of ‘C++’2.1 Array 2.2 Function 2.3 Pointer 2.4 Structure 2.5 Questions

7 3 Sparse Matrix3.1 What is Sparse Matrix 3.2 Sparse Matrix Representations 3.3 Algorithm to Represent the Sparse Matrix 3.4 Programs Related to Sparse Matrix 3.5 Why to Use Sparse Matrix Instead of Simple Matrix? 3.6 Drawbacks of Sparse Matrix 3.7 Sparse Matrix and Machine Learning 3.8 Questions

8 4 Concepts of Class4.1 Introduction to CLASS 4.2 Access Specifiers in C++ 4.3 Declaration of Class 4.4 Some Manipulator Used In C++ 4.5 Defining the Member Functions Outside of the Class 4.6 Array of Objects 4.7 Pointer to Object 4.8 Inline Member Function 4.9 Friend Function 4.10 Static Data Member and Member Functions 4.11 Constructor and Destructor 4.12 Dynamic Memory Allocation 4.13 This Pointer 4.14 Class Within Class 4.15 Questions

9 5 Stack5.1 STACK 5.2 Operations Performed With STACK 5.3 ALGORITHMS 5.4 Applications of STACK 5.5 Programming Implementations of STACK 5.6 Questions

10 6 Queue6.1 Queue 6.2 Types of Queue 6.3 Linear Queue 6.4 Circular Queue 6.5 Double Ended Queue 6.6 Priority Queue 6.7 Programs 6.8 Questions

11 7 Linked List 7.1 Why Use Linked List? 7.2 Types of Link List 7.3 Single Link List 7.4 Programs Related to Single Linked List 7.5 Double Link List 7.6 Programs on Double Linked List 7.7 Header Linked List 7.8 Circular Linked List 7.9 Application of Linked List 7.10 Garbage Collection and Compaction 7.11 Questions

12 8 TREE 8.1 Tree Terminologies 8.2 Binary Tree 8.3 Representation of Binary Tree 8.4 Operations Performed With the Binary Tree 8.5 Traversing With Tree 8.6 Conversion of a Tree From Inorder and Preorder 8.7 Types of Binary Tree 8.8 Expression Tree 8.9 Binary Search Tree 8.10 Height Balanced Tree (AVL Tree) 8.11 Threaded Binary Tree 8.12 Heap Tree 8.13 Huffman Tree 8.14 Decision Tree 8.15 B-Tree 8.16 B + Tree 8.17 General Tree 8.18 Red–Black Tree 8.19 Questions

13 9 Graph 9.1 Graph Terminologies 9.2 Representation of Graph 9.3 Traversal of Graph 9.4 Spanning Tree 9.5 Single Source Shortest Path 9.6 All Pair Shortest Path 9.7 Topological Sorting 9.8 Questions

14 10 Searching and Sorting 10.1 Linear Search 10.2 Binary Search 10.3 Bubble Sort 10.4 Selection Sort 10.5 Insertion Sort 10.6 Merge Sort 10.7 Quick Sort 10.8 Radix Sort 10.9 Heap Sort 10.10 Questions

15 11 Hashing 11.1 Hash Functions 11.2 Collisions 11.3 Collision Resolution Methods 11.4 Clustering 11.5 Questions

16 Index

17 End User License Agreement

1 Cover

2 Table of Contents

3 Title page

4 Copyright

5 Preface

6 Begin Reading

7 Index

8 End User License Agreement

1 v

2 ii

3 iii

4 iv

5 xi

6 1

7 2

8 3

9 4

10 5

11 6

12 7

13 8

14 9

15 10

16 11

17 12

18 13

19 15

20 16

21 17

22 18

23 19

24 20

25 21

26 22

27 23

28 24

29 25

30 26

31 27

32 28

33 29

34 30

35 31

36 32

37 33

38 34

39 35

40 36

41 37

42 38

43 39

44 40

45 41

46 42

47 43

48 44

49 45

50 46

51 47

52 49

53 50

54 51

55 52

56 53

57 54

58 55

59 56

60 57

61 58

62 59

63 60

64 61

65 62

66 63

67 64

68 65

69 66

70 67

71 68

72 69

73 70

74 71

75 72

76 73

77 74

78 75

79 76

80 77

81 78

82 79

83 80

84 81

85 82

86 83

87 84

88 85

89 86

90 87

91 88

92 89

93 91

94 92

95 93

96 94

97 95

98 96

99 97

100 98

101 99

102 100

103 101

104 102

105 103

106 104

107 105

108 106

109 107

110 108

111 109

112 110

113 111

114 112

115 113

116 114

117 115

118 116

119 117

120 118

121 119

122 120

123 121

124 122

125 123

126 124

127 125

128 126

129 127

130 129

131 130

132 131

133 132

134 133

135 134

136 135

137 136

138 137

139 138

140 139

141 140

142 141

143 142

144 143

145 144

146 145

147 146

148 147

149 148

150 149

151 150

152 151

153 152

154 153

155 154

156 155

157 156

158 157

159 158

160 159

161 160

162 161

163 162

164 163

165 164

166 165

167 167

168 168

169 169

170 170

171 171

172 172

173 173

174 174

175 175

176 176

177 177

178 178

179 179

180 180

181 181

182 182

183 183

184 184

185 185

186 186

187 187

188 188

189 189

190 190

191 191

192 192

193 193

194 194

195 195

196 196

197 197

198 198

199 199

200 200

201 201

202 202

203 203

204 204

205 205

206 206

207 207

208 208

209 209

210 210

211 211

212 212

213 213

214 214

215 215

216 216

217 217

218 218

219 219

220 220

221 221

222 222

223 223

224 224

225 225

226 226

227 227

228 228

229 229

230 230

231 231

232 232

233 233

234 234

235 235

236 236

237 237

238 238

239 239

240 240

241 241

242 242

243 243

244 244

245 245

246 246

247 247

248 249

249 250

250 251

251 252

252 253

253 254

254 255

255 256

256 257

257 258

258 259

259 260

260 261

261 262

262 263

263 264

264 265

265 266

266 267

267 268

268 269

269 270

270 271

271 272

272 273

273 274

274 275

275 276

276 277

277 278

278 279

279 280

280 281

281 282

282 283

283 284

284 285

285 286

286 287

287 288

288 289

289 290

290 291

291 292

292 293

293 294

294 295

295 296

296 297

297 298

298 299

299 300

300 301

301 302

302 303

303 304

304 305

305 306

306 307

307 308

308 309

309 310

310 311

311 312

312 313

313 314

314 315

315 316

316 317

317 318

318 319

319 320

320 321

321 322

322 323

323 324

324 325

325 326

326 327

327 328

328 329

329 330

330 331

331 332

332 333

333 334

334 335

335 336

336 337

337 338

338 339

339 340

340 341

341 342

342 343

343 344

344 345

345 346

346 347

347 349

348 350

349 351

350 352

351 353

352 354

353 355

354 356

355 357

356 358

357 359

358 360

359 361

360 362