It is great pleasure for me to present book on subject of data structure algorithms and analysis. Book b. Sc. Information technology and computer science class text book as per syllabus effective 2019-2020 compulsory subject has been designed to help students of information technology and computer science. The book is introduction to all topics of the syllabus, taking small steps from the basics to more involved and varied topics. I have mixed tutorials, guide, q and a, cookbook, mcq and pocket reference styles to explain new terms and ideas. I have also taken care that not too many new concepts are introduced at once. In our examination system, often definitions of basic terms are asked. Most exam oriented definitions have been given in bold letters. Many topics where students are expected to answer point wise, explanations have been given with bullets. All codes, given here, have been run and successful output have been checked. Some selected examples have been presented with screen shot, which should give students confidence of running these programs on their own. Even though this is an introduction, i include some topics that might seem advanced. For example, red and black tree, heap and median of medians algorithm, tower of hanoi, etc. These topics have been included because they can solve some problems in easier way. Theoretical concept of data structure, algorithm analysis, applications of all topics, big-o notation, divide and conquer to name a few. A sincere attempt has been made to cover b. Sc. Information technology and computer science syllabus effective 2019-2020, a compulsory subject. This book is for students, teachers, and professionals for the subject of data structure and algorithms analysis. The book does require previous knowledge of computing language python and some mathematical skills are essential. The book has been divided in to nine chapters as per requirement of the syllabus. This will help to prepare for examinations.