Systems Analysis and Synthesis
eBook - ePub

Systems Analysis and Synthesis

Bridging Computer Science and Information Technology

  1. 512 pages
  2. English
  3. ePUB (mobile friendly)
  4. Available on iOS & Android
eBook - ePub

Systems Analysis and Synthesis

Bridging Computer Science and Information Technology

Book details
Table of contents
Citations

About This Book

Systems Analysis and Synthesis: Bridging Computer Science and Information Technology presents several new graph-theoretical methods that relate system design to core computer science concepts, and enable correct systems to be synthesized from specifications. Based on material refined in the author's university courses, the book has immediate applicability for working system engineers or recent graduates who understand computer technology, but have the unfamiliar task of applying their knowledge to a real business problem.

Starting with a comparison of synthesis and analysis, the book explains the fundamental building blocks of systems-atoms and events-and takes a graph-theoretical approach to database design to encourage a well-designed schema. The author explains how database systems work-useful both when working with a commercial database management system and when hand-crafting data structures-and how events control the way data flows through a system. Later chapters deal with system dynamics and modelling, rule-based systems, user psychology, and project management, to round out readers' ability to understand and solve business problems.

  • Bridges computer science theory with practical business problems to lead readers from requirements to a working system without error or backtracking
  • Explains use-definition analysis to derive process graphs and avoid large-scale designs that don't quite work
  • Demonstrates functional dependency graphs to allow databases to be designed without painful iteration
  • Includes chapters on system dynamics and modeling, rule-based systems, user psychology, and project management

Frequently asked questions

Simply head over to the account section in settings and click on “Cancel Subscription” - it’s as simple as that. After you cancel, your membership will stay active for the remainder of the time you’ve paid for. Learn more here.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Both plans give you full access to the library and all of Perlego’s features. The only differences are the price and subscription period: With the annual plan you’ll save around 30% compared to 12 months on the monthly plan.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes, you can access Systems Analysis and Synthesis by Barry Dwyer in PDF and/or ePUB format, as well as other popular books in Mathématiques & Mathématiques appliquées. We have over one million books available in our catalogue for you to explore.

Information

Year
2016
ISBN
9780128054499

Table of contents

  1. Cover image
  2. Title page
  3. Table of Contents
  4. Copyright
  5. Foreword
  6. Preface
  7. Acknowledgments
  8. List of Figures
  9. List of Tables
  10. List of Algorithms
  11. Chapter 1. Systems, analysis, and synthesis
  12. Chapter 2. Mathematical background
  13. Chapter 3. Atoms
  14. Chapter 4. Data-structure analysis
  15. Chapter 5. Kernel specifications
  16. Chapter 6. Database technology
  17. Chapter 7. Processes
  18. Chapter 8. Interfaces
  19. Chapter 9. Rules
  20. Chapter 10. System dynamics
  21. Chapter 11. Project management
  22. Appendix A. Regular expressions and finite-state automata
  23. Appendix B. Normalisation
  24. Appendix C. Answers to the exercises
  25. Index