2011, ISBN: 9788120331280

Gebundene Ausgabe

Anmol Publications Pvt. Ltd., 2004. Hardcover. New. Applications of Computer in Chemistry are now a part of curriculum in B.Sc. and M.Sc. classes of most of the Universities. This porti… Mehr…

Anmol Publications Pvt. Ltd., 2004. Hardcover. New. Applications of Computer in Chemistry are now a part of curriculum in B.Sc. and M.Sc. classes of most of the Universities. This portion has been introduced by U.G.C. in the model course curriculum as well. The present book focuses on the use of this electronic machine in dealing with the problems of chemistry. Main attention has been focused on development of programming logic and technique particularly dealing with the problems of Chemistry, which should be the most important part before actually writing any Computer program. Fundamentals of three languages viz. BASIC, FORTRAN and C-Language, have been included in this book. Most of the programs in this book are given in BASIC language as it is easy to learn and interactive too. Ample programs are also given in FORTRAN and C-Language. It is has been tried to include all the programs in this book with their outputs. Hope this book will serve the purpose and will prove to be useful for the students pursuing studies in Chemistry at B.Sc. or M.Sc. level. CONTENTS Introduction to Computers; Fundamental Concepts of Programming; Ms-Dos and its Use; Fundamentals of Basic Programming; Fundamentals of FORTRAN Programming; Fundamentals of C-Language; some Useful Programs in Chemistry; etc. Printed Pages: 320., Anmol Publications Pvt. Ltd., 2004, McGraw Hill Education, 2003. First edition. Softcover. New. Ever wondered... What role does the compiler-driver play in the build process? What does scatter-loading mean? Why do we need memory pools instead of the humble malloc in many cases? How do we tackle spurious interrupts?; How does rate monotonic scheduling work? What has Mars Rover to do with unbounded priority inversion? How did railway traffic control influence computer science to tackle resource synchronization? How do data-centric, call-and-return architecture patterns help us in designing software for embedded systems? Find out the answers in this excellent book on: Embedded Realtime Systems Programming This is an interestingly conceived book that explains what an embedded realtime system is, the various types of embedded systems, techniques for programming, them and more significantly, the important concepts that are required to be mastered for efficient design and implementation of embedded system software. Written by two young engineers, keeping in perspective the emerging needs of programmers, the book focuses on: Embedded realtime fundamentals from a practitioner`s perspective; Engineering perspective to the nitty-gritty (build process, memory management, interrupts) of embedded systems; Healthy mix of concepts of realtime theory and RTOS; Software engineering principles related to requirements, architecture, design and testing. The book contains lots of exercises, case studies, examples and problems. It is adequately peppered with tips, hints and points to ponder. Table of contents Section I : Introduction Chapter 1. Introduction to Embedded Realtime Systems Section II: Embedded nitty-gritty Chapter 2. The Build Process for Embedded Systems Chapter 3. Types of Memory Chapter 4. Memory Management in Embedded Realtime Systems Chapter 5. Interrupts and ISRs Section III: Correctness is not enough Chapter 6. Introduction to Realtime Theory Chapter 7. Realtime Operating Systems Section IV: But, I know this already! Chapter 8. Requirement Engineering Chapter 9. Architecture and Design of an Embedded System Chapter 10. Implementation Aspects in Embedded Systems Chapter 11. Estimation Modelling in Embedded Software Chapter 12. Validation and Debugging of Embedded Systems Printed Pages: 340., McGraw Hill Education, 2003, Wiley India Pvt. Ltd, 2011. Softcover. New. Formal Languages and Automata theory presents the theoretical aspects of computer science, and helps define infinite languages in finite ways; construct algorithms for related problems and decide whether a string is in language or not. These are of practical importance in construction of compilers and designing of programming languages, thus establishing the course as a core paper in third/fourth year of various universities. This book adopts a holistic approach to learning from fundamentals of formal languages to undecidability problems. Its organization follows the order in which the course is taught over the years, and is well-accepted by the student community. The contents of each topic motivate the reader to easily understand the concepts rather than remember and reproduce. 1 Mathematical Preliminaries for Finite Automata and Formal Languages Learning Objectives 1.1 Sets 1.2 Relations and Functions 1.3 Graphs and Trees 1.4 Mathematical Induction 1.5 Mathematical Logic 1.6 Formal Language 1.7 Chomsky Hierarchy Languages (CHL) 1.8 Automata Theory 1.9 Applications of Automata Worked-Out Problems Summary Key Terms Exercises 2 Regular Expressions and Regular Languages Learning Objectives 2.1 Regular Expressions 2.2 Regular Languages and Regular Grammar 2.3 Applications of REs Worked-Out Problems Summary Key Terms Exercises 3 Finite State Automata Learning Objectives 3.1 Deterministic Finite Automata 3.2 Non-Deterministic Finite Automata 3.3 NFA and Regular Expressions 3.4 Conversion of Finite Automata to Regular Expression 3.5 Conversion of NFA to DFA 3.6 NFA with e-Transitions (?-NFA) 3.7 Conversion from e-NFA to NFA 3.8 Conversion from e-NFA to DFA 3.9 Output Associated with Finite Automata 3.10 Moore and Mealy Machines 3.11 Minimization of Automata 3.12 Applications of FA Worked-Out Problems Summary Key Terms Exercises 4 Properties of Regular Languages Learning Objectives 4.1 Pumping Lemma for Regular Languages 4.2 Closure Properties of Regular Languages 4.3 Decision Properties of Regular Languages Summary Key Terms Exercises 5 Context-Free Grammars and Languages Learning Objectives 5.1 Definition of Context-Free Grammar 5.2 Leftmost and Rightmost Derivations 5.3 Derivation Tree 5.4 Ambiguity in Grammar 5.5 Parsing 5.6 Removal of Useless Symbols and Unit Productions 5.7 Removal of e-productions 5.8 Normal Forms for CFG Specification Worked-Out Problems Summary Key Terms Exercises 6 Pushdown Automata Learning Objectives 6.1 Definition of PDA 6.2 Non-deterministic PDA 6.3 Instantaneous Description of PDA 6.4 Graphical Notations for PDA 6.5 Languages of PDA 6.6 Equivalence of PDAS and CFGS 6.7 Deterministic PDA Worked-Out Problems Summary Key Terms Exercises 7 Properties of Context-Free Languages Learning Objectives 7.1 Pumping Lemma for CFLs 7.2 Applications of Pumping Lemma 7.3 Linear Context-Free Languages 7.4 Ogden’s Lemma and its Applications 7.5 Closure Properties of CFLS 7.7 Decision Properties of CFLs Worked-Out Problems Summary Key Terms Exercises 8 Turing Machines Learning Objectives 8.1 Problems that Computers Cannot Solve 8.2 Basic Model of the Turing Machine 8.3 Representation of a Turing Machine 8.4 Language of Turing Machine 8.5 Computable Languages and Functions 8.6 Programming Techniques of Turing Machine 8.7 Variations of Turing Machines 8.8 Universal Turing Machine Worked-Out Problems Summary Key Terms Exercises 9 Undecidability Learning Objectives 9.1 Computers and Turing Machine 9.2 Recursively Enumerable Languages 9.3 Halting Problem 9.4 Rice theorem 9.5 Post-Correspondence Problem Summary Key Terms Exercises Model Question Paper 1 Model Question Paper 2 Bibliography Index Printed Pages: 252., Wiley India Pvt. Ltd, 2011, PHI Learning, 2009. First edition. Softcover. New. This comprehensive book deals with the theoretical aspects of operations research, and explains the concepts with practical examples. It begins by focusing on the need and prerequisites of operations research and moves on to discuss topics such as linear programming, integer programming, nonlinear programming, assignment problems, and inventory models in sufficient detail. Besides, this text also explains how to achieve different goals in the order of priority to optimize the objective function, various criteria of decision making under certainty, uncertainty and risk, and different techniques of analyzing the time involved in completing the project and the related cost. KEY FEATURES : Gives well-defined algorithms to illustrate the different techniques of operations research. Inventory problems are discussed with calculus. Provides worked-out examples in each chapter to illustrate the concepts discussed. This text is intended for the undergraduate and postgraduate students of Mathematics, Statistics, Engineering, and postgraduate students of Computer Applications and Business Administration. In addition, practising executives, consultants and managers will also find the book very useful. CONTENTS: Preface 1. WHY OPERATIONS RESEARCH? 2. PREREQUISITE FOR OPERATIONS RESEARCH 3. LINEAR PROGRAMMING 4. INTEGER PROGRAMMING 5. GOAL PROGRAMMING 6. NON-LINEAR PROGRAMMING 7. GEOMETRIC PROGRAMMING 8. TRANSPORTATION PROBLEM 9. ASSIGNMENT PROBLEM 10. DECISION ANALYSIS 11. INVENTORY PROBLEMS 12. QUEUING THEORY 13. REPLACEMENT MODELS 14. DYNAMIC PROGRAMMING 15. PROJECT MANAGEMENT 16. SEQUENCING 17. SIMULATION 18. GAME THEORY Printed Pages: 576., PHI Learning, 2009<

2009, ISBN: 9788120331280

PHI Learning. 2nd edition. Softcover. New. Database Management System (DBMS) and Oracle are essentially a part of the curriculum for undergraduate and postgraduate courses in Computer S… Mehr…

PHI Learning. 2nd edition. Softcover. New. Database Management System (DBMS) and Oracle are essentially a part of the curriculum for undergraduate and postgraduate courses in Computer Science, Computer Applications, Computer Science and Engineering, Information Technology and Management. The book is organized into three parts to introduce the theoretical and programming concepts of DBMS. Part I (Basic Concepts and Oracle SQL) deals with DBMS basic, software analysis and design, data flow diagram, ER model, relational algebra, normal forms, SQL queries, functions, subqueries, different types of joins, DCL, DDL, DML, object constraints and security in Oracle. Part II (Application Using Oracle PL/SQL) explains PL/SQL basics, functions, procedures, packages, exception handling, triggers, implicit, explicit and advanced cursors using suitable examples. This part also covers advanced concepts related to PL/SQL, such as collection, records, objects, dynamic SQL and performance tuning. Part III (Advanced Concepts and Technologies) elaborates on advanced database concepts such as query processing, file organization, distributed architecture, backup, recovery, data warehousing, online analytical processing and data mining concepts and their techniques. All the chapters include a large number of examples. To further reinforce the concepts, numerous objective type questions and workouts are provided at the end of each chapter. Key Features • Explains each topic in a step-by-step detail. • Includes about 300 examples to illustrate the concepts. • Offers about 400 objective type questions to quiz students on key points. • Provides about 100 challenging workouts that invite deeper analysis and interpretation of the subject matter. New to the Second Edition • The book reorganized into three parts for better understanding of DBMS concepts. • All the existing chapters thoroughly revised and eight new chapters added. • New chapters discuss Oracle PL/SQL advanced programming concepts, data warehousing, OLTP, OLAP and data mining concepts. • Additional examples, questions and workouts in each chapter. Contents: Contents: Preface • Acknowledgements Part I: Database Management System: Basic Concepts and Oracle SQL—1. Database Basics, Software Analysis and Design, Data Flow Diagram and ER Model. 2. Relational Algebra and Normal Forms. 3. Sql Basics, Functions, Sub Query and Joins. 4. Data Manipulation Language, Objects, Constraints and Security in Oracle. Part II: Database Management System: Application Using Oracle PL/SQL—5. Introduction to Pl/Sql Programming. 6. Oracle Function, Procedure and Package. 7. Oracle Exception Handler and Database Triggers. 8. Implicit and Explicit Cursors. 9. Advance Cursors. 10. PL/SQL Collections and Records. 11. Oracle Objects and Dynamic SQL. 12. PL/SQL Optimization Techniques. Part III: Database Management System: Advanced Concepts and Technologies—13. Query Processing, File Organization, and Distributed Processing. 14. Transaction Processing, Concurrency Control, Oracle Architecture, Backup and Recovery. 15. Data Warehousing. 16. Online Analytical Processing and Materialized Views. 17. Data Mining Overview. 18. Data Mining Techniques. Appendix A: Advanced Databases • Appendix B: Answers • Index. Printed Pages: 576., PHI Learning, PHI Learning, 2009. First edition. Softcover. New. This comprehensive book deals with the theoretical aspects of operations research, and explains the concepts with practical examples. It begins by focusing on the need and prerequisites of operations research and moves on to discuss topics such as linear programming, integer programming, nonlinear programming, assignment problems, and inventory models in sufficient detail. Besides, this text also explains how to achieve different goals in the order of priority to optimize the objective function, various criteria of decision making under certainty, uncertainty and risk, and different techniques of analyzing the time involved in completing the project and the related cost. KEY FEATURES : Gives well-defined algorithms to illustrate the different techniques of operations research. Inventory problems are discussed with calculus. Provides worked-out examples in each chapter to illustrate the concepts discussed. This text is intended for the undergraduate and postgraduate students of Mathematics, Statistics, Engineering, and postgraduate students of Computer Applications and Business Administration. In addition, practising executives, consultants and managers will also find the book very useful. CONTENTS: Preface 1. WHY OPERATIONS RESEARCH? 2. PREREQUISITE FOR OPERATIONS RESEARCH 3. LINEAR PROGRAMMING 4. INTEGER PROGRAMMING 5. GOAL PROGRAMMING 6. NON-LINEAR PROGRAMMING 7. GEOMETRIC PROGRAMMING 8. TRANSPORTATION PROBLEM 9. ASSIGNMENT PROBLEM 10. DECISION ANALYSIS 11. INVENTORY PROBLEMS 12. QUEUING THEORY 13. REPLACEMENT MODELS 14. DYNAMIC PROGRAMMING 15. PROJECT MANAGEMENT 16. SEQUENCING 17. SIMULATION 18. GAME THEORY Printed Pages: 576., PHI Learning, 2009<

2009, ISBN: 9788120331280

PHI Learning, 2009. First edition. Softcover. New. This comprehensive book deals with the theoretical aspects of operations research, and explains the concepts with practical examples. … Mehr…

PHI Learning, 2009. First edition. Softcover. New. This comprehensive book deals with the theoretical aspects of operations research, and explains the concepts with practical examples. It begins by focusing on the need and prerequisites of operations research and moves on to discuss topics such as linear programming, integer programming, nonlinear programming, assignment problems, and inventory models in sufficient detail. Besides, this text also explains how to achieve different goals in the order of priority to optimize the objective function, various criteria of decision making under certainty, uncertainty and risk, and different techniques of analyzing the time involved in completing the project and the related cost. KEY FEATURES : Gives well-defined algorithms to illustrate the different techniques of operations research. Inventory problems are discussed with calculus. Provides worked-out examples in each chapter to illustrate the concepts discussed. This text is intended for the undergraduate and postgraduate students of Mathematics, Statistics, Engineering, and postgraduate students of Computer Applications and Business Administration. In addition, practising executives, consultants and managers will also find the book very useful. CONTENTS: Preface 1. WHY OPERATIONS RESEARCH? 2. PREREQUISITE FOR OPERATIONS RESEARCH 3. LINEAR PROGRAMMING 4. INTEGER PROGRAMMING 5. GOAL PROGRAMMING 6. NON-LINEAR PROGRAMMING 7. GEOMETRIC PROGRAMMING 8. TRANSPORTATION PROBLEM 9. ASSIGNMENT PROBLEM 10. DECISION ANALYSIS 11. INVENTORY PROBLEMS 12. QUEUING THEORY 13. REPLACEMENT MODELS 14. DYNAMIC PROGRAMMING 15. PROJECT MANAGEMENT 16. SEQUENCING 17. SIMULATION 18. GAME THEORY Printed Pages: 576., PHI Learning, 2009<

2009, ISBN: 9788120331280

PHI Learning, 2009. First edition. Softcover. New. This comprehensive book deals with the theoretical aspects of operations research, and explains the concepts with practical examples. … Mehr…

PHI Learning, 2009. First edition. Softcover. New. This comprehensive book deals with the theoretical aspects of operations research, and explains the concepts with practical examples. It begins by focusing on the need and prerequisites of operations research and moves on to discuss topics such as linear programming, integer programming, nonlinear programming, assignment problems, and inventory models in sufficient detail. Besides, this text also explains how to achieve different goals in the order of priority to optimize the objective function, various criteria of decision making under certainty, uncertainty and risk, and different techniques of analyzing the time involved in completing the project and the related cost. KEY FEATURES : Gives well-defined algorithms to illustrate the different techniques of operations research. Inventory problems are discussed with calculus. Provides worked-out examples in each chapter to illustrate the concepts discussed. This text is intended for the undergraduate and postgraduate students of Mathematics, Statistics, Engineering, and postgraduate students of Computer Applications and Business Administration. In addition, practising executives, consultants and managers will also find the book very useful. CONTENTS: Preface 1. WHY OPERATIONS RESEARCH? 2. PREREQUISITE FOR OPERATIONS RESEARCH 3. LINEAR PROGRAMMING 4. INTEGER PROGRAMMING 5. GOAL PROGRAMMING 6. NON-LINEAR PROGRAMMING 7. GEOMETRIC PROGRAMMING 8. TRANSPORTATION PROBLEM 9. ASSIGNMENT PROBLEM 10. DECISION ANALYSIS 11. INVENTORY PROBLEMS 12. QUEUING THEORY 13. REPLACEMENT MODELS 14. DYNAMIC PROGRAMMING 15. PROJECT MANAGEMENT 16. SEQUENCING 17. SIMULATION 18. GAME THEORY Printed Pages: 576., PHI Learning, 2009<