Items related to Analysis and design of algorithms. A critical comparison...

Analysis and design of algorithms. A critical comparison of different works on algorithms - Softcover

Kabanda, Gabriel

 
9783668983908: Analysis and design of algorithms. A critical comparison of different works on algorithms
Softcover
ISBN 10: 3668983909 ISBN 13: 9783668983908
Publisher: Grin Verlag, 2019

Synopsis

Academic Paper from the year 2019 in the subject Computer Science - Theory, grade: 4.00, ( Atlantic International University ), language: English, abstract: The paper presents an analytical exposition, a critical context, and an integrative conclusion on the six major text books on Algorithms design and analysis. Algorithms form the heart of Computer Science in general. An algorithm is simply a set of steps to accomplish or complete a task that is described precisely enough that a computer can run it. It is a sequence of unambiguous instructions for solving a problem, and is used for obtaining a required output for any legitimate input in a finite amount of time. Algorithms can be considered as procedural solutions to problems where the focus is on correctness and efficiency. The important problem types are sorting, searching, string processing, graph problems, combinatorial problems, geometric problems, and numerical problems.

"synopsis" may belong to another edition of this title.

About the Author

Professor Gabriel Kabanda is an exceptional strategist, seasoned academician, data scientist, expert evaluator, shrewd business consultant and leader talented with competences for dealing with business and with people. He is a Full Professor of Computer Science and Information Systems; a Professor of Applied Business Informatics (MIS/BIS) at the University of Zimbabwe Business School since January, 2000; an Adjunct Professor of Cybersecurity in USA at both California State University - Chico (Cybersecurity for Executives Program Faculty, Regional and Continuing Education) [https://rce.csuchico.edu/cybersecurity-for-executives/faculty] and Ithaca College (New York; and the former Pro Vice Chancellor (Research, Innovation and Enterprise Development) of Zimbabwe Open University. He holds a Post-Doctorate of Science - D.Sc. (Atlantic International University, USA), Ph.D.(California, PWU), M.Sc. (Swansea University, UK) degrees in Computer Science, and a B.Sc. in Mathematics and Physics (University of Zimbabwe). Gabriel is a Fellow and the Secretary General of the Zimbabwe Academy of Sciences, Secretary General of the Africa-Asia-Dialogue Network [https://www.theaadn.org/aadn-executive-committee/], a Fellow of the African Scientific Institute (USA), and a member of the African Science, Research and Innovation Council (ASRIC) of the African Union. His international awards include Who's Who of Professionals (1997), the Golden Academic Excellence and Professional Achievement award (2013), the South African Department of Science and Technology's most accomplished African scientist and outstanding researcher (2017), and UNESCO's "Most Notable and Top Distinguished Professor of the 21st Century" (May, 2021). He is currently the Qualified Country Co-Investigator (CCI) for Zambia and Zimbabwe of the international Global Leadership and Organizational Behavior Effectiveness (GLOBE) 2020 Project, which is a unique large-scale study of cultural practices, leadership ideals, and generalized and interpersonal trust in more than 160 countries in collaboration with more than 500 researchers [https://globeproject.com/about]. Gabriel has published 100 research publications and has supervised 11 Ph.D theses and 100 Masters Dissertations.

From the Back Cover

Academic Paper from the year 2019 in the subject Computer Science - Theory, grade: 4.00, ( Atlantic International University ), language: English, abstract: The paper presents an analytical exposition, a critical context, and an integrative conclusion on the six major text books on Algorithms design and analysis. Algorithms form the heart of Computer Science in general. An algorithm is simply a set of steps to accomplish or complete a task that is described precisely enough that a computer can run it. It is a sequence of unambiguous instructions for solving a problem, and is used for obtaining a required output for any legitimate input in a finite amount of time. Algorithms can be considered as procedural solutions to problems where the focus is on correctness and efficiency. The important problem types are sorting, searching, string processing, graph problems, combinatorial problems, geometric problems, and numerical problems.

"About this title" may belong to another edition of this title.

Publisher
Grin Verlag
Publication date
2019
Language
English
ISBN 10 
3668983909
ISBN 13 
9783668983908
Binding
Paperback
Edition number
1
Number of pages
20