Problem Solving in Data Structures & Algorithms Using Python: Programming Interview Guide

534 Pages·2016·6.62 MB·English

by  Hemant Jain

Problem Solving in
Data Structures &
Algorithms Using
Python
First Edition

By Hemant Jain
Problems Solving in Data Structures & Algorithms Using Python
Hemant Jain

Copyright © 2016 by HEMANT JAIN. All Right Reserved.

No part of this publication may be reproduced, distributed, or transmitted in any
form or by any means, including photocopying, recording, or other electronic or
mechanical methods, or by any information storage and retrieval system without
the prior written permission of the author, except in the case of very brief
quotations embodied in critical reviews and certain other non-commercial uses
permitted by copyright law.
ACKNOWLEDGEMENT

The author is very grateful to GOD ALMIGHTY for his grace and blessing.

Deepest gratitude for the help and support of my brother Dr. Sumant Jain. This
book would not have been possible without the support and encouragement he
provided.

I would like to express profound gratitude to my guide/ my friend Naveen
Kaushik for his invaluable encouragement, supervision and useful suggestion
throughout this book writing work. His support and continuous guidance enable
me to complete my work successfully.

Last but not least, I am thankful to Anil Berry and Others who helped me
directly or indirectly in completing this book.

Hemant Jain
T C
ABLE OF ONTENTS
TABLE OF CONTENTS
CHAPTER 0: HOW TO USE THIS BOOK
W
HAT THIS BOOK IS ABOUT
P P
REPARATION LANS
S
UMMARY
CHAPTER 1: INTRODUCTION - PROGRAMMING OVERVIEW
I
NTRODUCTION
F P P
IRST YTHON ROGRAM
C , O & V
LASS BJECTS ARIABLES
B D T
ASIC ATA YPES
S
TRING
M
ETHODS
P P
ARAMETER ASSING
L
IST
T
UPLE
D
ICTIONARY
C L
ONDITIONS AND OOPS
A C & M
BSTRACT LASS ETHODS
N C
ESTED LASS
R
ELATIONSHIP
K V
INDS OF ARIABLES
T M
YPES OF ETHODS
M O
ORE ABOUT BJECTS
E
NUMS
L I Q
IST NTERVIEW UESTIONS
C S
ONCEPT OF TACK
S M C
YSTEM STACK AND ETHOD ALLS
R F
ECURSIVE UNCTION
E
XERCISES
CHAPTER 2: ALGORITHMS ANALYSIS
I
NTRODUCTION
A
SYMPTOTIC ANALYSIS
B -O N
IG OTATION
O -Ω N
MEGA OTATION
T -Θ N
HETA OTATION
C
OMPLEXITY ANALYSIS OF ALGORITHMS
T C O
IME OMPLEXITY RDER
D R F A
ERIVING THE UNTIME UNCTION OF AN LGORITHM
T C E
IME OMPLEXITY XAMPLES
M T
ASTER HEOREM
M M
ODIFIED ASTER THEOREM
E
XERCISE
CHAPTER 3: APPROACH TO SOLVE ALGORITHM DESIGN
PROBLEMS
I
NTRODUCTION
C
ONSTRAINTS
I G
DEA ENERATION
C
OMPLEXITIES
C
ODING
T
ESTING
E
XAMPLE
S
UMMARY
CHAPTER 4: ABSTRACT DATA TYPE & PYTHON COLLECTIONS
A (ADT)
BSTRACT DATA TYPE
D -S
ATA TRUCTURE
P C F
YTHON OLLECTION RAMEWORK
L
IST
L L
INKED IST
S
TACK
Q
UEUE
T
REES
B T
INARY REE
B S T (BST)
INARY EARCH REES
P Q (H )
RIORITY UEUE EAP
H T
ASH ABLE
D / S T
ICTIONARY YMBOL ABLE
G
RAPHS
G A
RAPH LGORITHMS
S A
ORTING LGORITHMS
C S
OUNTING ORT
E
ND NOTE
CHAPTER 5: SEARCHING
I
NTRODUCTION
W S ?
HY EARCHING
D S A
IFFERENT EARCHING LGORITHMS
L S – U I
INEAR EARCH NSORTED NPUT
L S – S
INEAR EARCH ORTED
B S
INARY EARCH
S S A
TRING EARCHING LGORITHMS
H S T
ASHING AND YMBOL ABLES
H S A ?
OW SORTING IS USEFUL IN ELECTION LGORITHM
P S
ROBLEMS IN EARCHING
E
XERCISE
CHAPTER 6: SORTING
I
NTRODUCTION
T S
YPE OF ORTING
B S
UBBLE ORT
M ( ) B S
ODIFIED IMPROVED UBBLE ORT
I S
NSERTION ORT
S S
ELECTION ORT
M S
ERGE ORT
Q S
UICK ORT
Q S
UICK ELECT
B S
UCKET ORT
G B S
ENERALIZED UCKET ORT
H S
EAP ORT
T S
REE ORTING
E S (E M S )
XTERNAL ORT XTERNAL ERGE ORT
C .
OMPARISONS OF THE VARIOUS SORTING ALGORITHMS
S B S A
ELECTION OF EST ORTING LGORITHM
E
XERCISE
CHAPTER 7: LINKED LIST
I
NTRODUCTION
L L
INKED IST
T L
YPES OF INKED LIST
S L L
INGLY INKED IST
D L L
OUBLY INKED IST
C L L
IRCULAR INKED IST
D C
OUBLY IRCULAR LIST
E
XERCISE
CHAPTER 8: STACK
I
NTRODUCTION
T S A D T
HE TACK BSTRACT ATA YPE
S L
TACK USING IST
S
TACK USING LINKED LIST
P S
ROBLEMS IN TACK
P .
ROS AND CONS OF LIST AND LINKED LIST IMPLEMENTATION OF STACK
U S
SES OF TACK
E
XERCISE
CHAPTER 9: QUEUE
I
NTRODUCTION
T Q A D T
HE UEUE BSTRACT ATA YPE
Q U L
UEUE SING IST
Q U
UEUE SING LINKED LIST
P Q
ROBLEMS IN UEUE
E
XERCISE
CHAPTER 10: TREE
I
NTRODUCTION
T
ERMINOLOGY IN TREE
B T
INARY REE
T B
YPES OF INARY TREES
P B T
ROBLEMS IN INARY REE
B S T (BST)
INARY EARCH REE
P B S T (BST)
ROBLEMS IN INARY EARCH REE
E
XERCISE
CHAPTER 11: PRIORITY QUEUE
I
NTRODUCTION
T H
YPES OF EAP
H ADT O
EAP PERATIONS
O H
PERATION ON EAP
H S
EAP ORT
U H
SES OF EAP
P H
ROBLEMS IN EAP
E
XERCISE
CHAPTER 12: HASHTABLE
I
NTRODUCTION
H T
ASH ABLE
H O A
ASHING WITH PEN DDRESSING
H
ASHING WITH SEPARATE CHAINING
P H
ROBLEMS IN ASHING
E
XERCISE
CHAPTER 13: GRAPHS
I
NTRODUCTION
G R
RAPH EPRESENTATION
A M
DJACENCY ATRIX
A L
DJACENCY IST
G
RAPH TRAVERSALS
D F T
EPTH IRST RAVERSAL
B F T
READTH IRST RAVERSAL
P G
ROBLEMS IN RAPH
D A G
IRECTED CYCLIC RAPH
T S
OPOLOGICAL ORT
M S T (MST)
INIMUM PANNING REES
S P A G
HORTEST ATH LGORITHMS IN RAPH
E
XERCISE
CHAPTER 14: STRING ALGORITHMS
I
NTRODUCTION
S M
TRING ATCHING
D / S T
ICTIONARY YMBOL ABLE
P S
ROBLEMS IN TRING
E
XERCISE
CHAPTER 15: ALGORITHM DESIGN TECHNIQUES
I
NTRODUCTION
B F A
RUTE ORCE LGORITHM
G A
REEDY LGORITHM
D - -C , D - -C
IVIDE AND ONQUER ECREASE AND ONQUER
D P
YNAMIC ROGRAMMING
R / T - -C
EDUCTION RANSFORM AND ONQUER
B
ACKTRACKING
B - -
RANCH AND BOUND
A* A
LGORITHM
C
ONCLUSION
CHAPTER 16: BRUTE FORCE ALGORITHM
I
NTRODUCTION
P B F A
ROBLEMS IN RUTE ORCE LGORITHM
C
ONCLUSION
CHAPTER 17: GREEDY ALGORITHM
I
NTRODUCTION
P G A
ROBLEMS ON REEDY LGORITHM
CHAPTER 18: DIVIDE-AND-CONQUER, DECREASE-AND-CONQUER
I
NTRODUCTION
G D - -C R
ENERAL IVIDE AND ONQUER ECURRENCE
M T
ASTER HEOREM
P D - -C A
ROBLEMS ON IVIDE AND ONQUER LGORITHM
CHAPTER 19: DYNAMIC PROGRAMMING
I
NTRODUCTION
P D A
ROBLEMS ON YNAMIC PROGRAMMING LGORITHM
CHAPTER 20: BACKTRACKING
I
NTRODUCTION
P B A
ROBLEMS ON ACKTRACKING LGORITHM