Buy used Bachelor of Technology (B.Tech) books online in India
Buy Second Hand Books, Used Books Online In India
Pc dumir book
Divided into 22 sections, this pocket-sized volume is an exhaustive 'quick reference' of up-to-date engineering data and rules. Contents: Essential Mathematics; Units; Engineering design Processes and Principles; Basic Mechanical Design; Motion; Mechanics of Materials; Material Failure; Thermodynamics; Fluid Mechanisms; Fluid Equipment; Pressure Vessels; Materials; Machine Elements; Design and Production Tools; Project Engineering; Computer-Aided Engineering; Welding; Non-Destructive Examination; Corrosion; Surface Protection; Metallurgical Terms; Engineering Associations and Organizations.
Vector mechanics for engineers
NOTE: This loose-leaf, three-hole punched version of the textbook gives you the flexibility to take only what you need to class and add your own notes -- all at an affordable price. For loose-leaf editions that include MyLab(tm) or Mastering(tm), several versions may exist for each title and registrations are not transferable. You may need a Course ID, provided by your instructor, to register for and use MyLab or Mastering products. For courses in chemistry. Actively engage students to become expert problem solvers and critical thinkers Nivaldo Tro's Chemistry: A Molecular Approach presents chemistry visually through multi-level images--macroscopic, molecular, and symbolic representations--to help students see the connections between the world they see around them, the atoms and molecules that compose the world, and the formulas they write down on paper. Interactive, digital versions of select worked examples instruct students how to break down problems using Tro's unique "Sort, Strategize, Solve, and Check" technique and then complete a step in the example. To build conceptual understanding , Dr. Tro employs an active learning approach through interactive media that requires students to pause during videos to ensure they understand before continuing. The 5th Edition pairs digital, pedagogical innovation with insights from learning design and educational research to create an active, integrated, and easy-to-use framework. The new edition introduces a fully integrated book and media package that streamlines course set up, actively engages students in becoming expert problem solvers, and makes it possible for professors to teach the general chemistry course easily and effectively. Also available with Mastering Chemistry By combining trusted author content with digital tools and a flexible platform, MyLab [or Mastering] personalizes the learning experience and improves results for each student.The fully integrated and complete media package allows instructors to engage students before they come to class, hold them a
Let us c by Yashwant kanthekar
Description: ""Simplicity""- That has been the hallmark of this book in not only its previous fourteen English editions, but also in the Hindi, Guajarati, Japanese, Korean, Chinese and US editions. This book does not assume any programming background. It begins with the basics towards the end of the book. Each Chapter Contains: Lucid explanation of the concept well thought-out, fully working programming examples End of chapter exercises that would help you practise the learned in the chapter Hand crafted ""kanNotes"" that would help you remember and revise the concepts covered in each chapter. Table of Contents: Getting Started C Instructions Decision Control Instruction More Complex Decision Making Loop Control Instruction More Complex Repetitions Case Control Instruction Functions Pointers Recursion Data Types Revisited The C Preprocessor Arrays Multidimensional Arrays Strings Handling Multiple Strings Structures Console Input/ Output File Input/ Output More Issues in Input/ Output Operations on Bits Miscellaneous Features C Under Linux Interview FAQ's Appendix A- Compilation and Execution Appendix B- Precedence table Appendix C-Chasing the Bugs Appendix D- ACII Chart Periodic Tests I to IV Index
Introduction to algorithms by cormen
A comprehensive update of the leading algorithms text, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics.Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers, with self-contained chapters and algorithms in pseudocode. Since the publication of the first edition, Introduction to Algorithms has become the leading algorithms text in universities worldwide as well as the standard reference for professionals. This fourth edition has been updated throughout.New for the fourth edition New chapters on matchings in bipartite graphs, online algorithms, and machine learningNew material on topics including solving recurrence equations, hash tables, potential functions, and suffix arrays140 new exercises and 22 new problemsReader feedback-informed improvements to old problemsClearer, more personal, and gender-neutral writing styleColor added to improve visual presentationNotes, bibliography, and index updated to reflect developments in the fieldWebsite with new supplementary materialWarning: Avoid counterfeit copies of Introduction to Algorithms by buying only from reputable retailers. Counterfeit and pirated copies are incomplete and contain errors.
Pointers in C Yashwant kanethkar
A C programmer without knowledge of pointers is like a fish which doesn't know how to swim. He needs command over pointers to be able to exploit their immense potential. Pointers are all about power and punch and this book covers everything that has anything to do with pointers in a simple, way to understand way. The topics covered include: Pointers and Arrays Pointers and Structures Pointers and Dynamic Memory Allocation Pointers to Functions Pointers and Variable Argument Lists Practical use of Pointers Pointers and Doubly linked Lists Pointers and Circular Lists Pointers and Binary Trees Pointers and Threaded Binary Trees
Clean code
Even bad code can function. But if code isn't clean, it can bring a development organization to its knees. Every year, countless hours and significant resources are lost because of poorly written code. But it doesn't have to be that way. Noted software expert Robert C. Martin presents a revolutionary paradigm with Clean Code: A Handbook of Agile Software Craftsmanship . Martin has teamed up with his colleagues from Object Mentor to distill their best agile practice of cleaning code "on the fly" into a book that will instill within you the values of a software craftsman and make you a better programmer-but only if you work at it. What kind of work will you be doing? You'll be reading code-lots of code. And you will be challenged to think about what's right about that code, and what's wrong with it. More importantly, you will be challenged to reassess your professional values and your commitment to your craft. Clean Code is divided into three parts. The first describes the principles, patterns, and practices of writing clean code. The second part consists of several case studies of increasing complexity. Each case study is an exercise in cleaning up code-of transforming a code base that has some problems into one that is sound and efficient. The third part is the payoff: a single chapter containing a list of heuristics and "smells" gathered while creating the case studies. The result is a knowledge base that describes the way we think when we write, read, and clean code.
Operating system concepts
Written in an easy-to-understand style, this textbook, now in its third edition, continues to discuss in detail important concepts and major developments in network security and management. It is designed for a one-semester course for undergraduate students of Computer Science, Information Technology, and undergraduate and postgraduate students of Computer Applications. Students are first exposed to network security principles, organizational policy and security infrastructure, and then drawn into some of the deeper issues of cryptographic algorithms and protocols underlying network security applications. Encryption methods, secret key and public key cryptography, digital signature and other security mechanisms are emphasized. Smart card, biometrics, virtual private networks, trusted operating systems, pretty good privacy, database security, and intrusion detection systems are comprehensively covered. An in-depth analysis of technical issues involved in security management, risk management and security and law is presented. In the third edition, two new chapters—one on Information Systems Security and the other on Web Security—and many new sections such as digital signature, Kerberos, public key infrastructure, software security and electronic mail security have been included. Additional matter has also been added in many existing sections. KEY FEATURES : Extensive use of block diagrams throughout helps explain and clarify the concepts discussed. About 250 questions and answers at the end of the book facilitate fruitful revision of the topics covered. Includes a glossary of important terms. KEY FEATURES : Extensive use of block diagrams throughout helps explain and clarify the concepts discussed. About 250 questions and answers at the end of the book facilitate fruitful revision of the topics covered. Includes a glossary of important terms.
