Language : English
Published : 2018
Pages : 154
IT Project Failures: Lessons from the Ashes
About the Book
This book examines eight high-profile cases of IT project failures. Each case is discussed on the basis of eight facets of IT project management, namely, scope, time, cost, quality, human resource, communications, risk and outsourcing, where applicable. Actual ground situations are juxtaposed against theories to help readers gain both practical and theoretically robust insights into key IT project management issues. The case-ending pedagogy includes questions for discussion that are intended to spark critical thinking, debate and discussion about best practices.
“MATLAB: An Introduction with Applications 5th Edition” walks readers through the ins and outs of this powerful software for technical computing. The text describes basic features of the program and shows how to use it in simple arithmetic operations with scalars. The topic of arrays (the basis of MATLAB) is examined, along with a wide range of other applications.” MATLAB: An Introduction with Applications 5th Edition” is presented gradually and in great detail, generously illustrated through computer screen shots and step-by-step tutorials, and applied in problems in mathematics, science, and engineering.
Developed as the text for the basic computer architecture course at MIT, this book integrates a thorough coverage of digital logic design with a comprehensive presentation of computer architecture. It spans the entire range of topics from analog circuit design to operating systems. The authors seek to demystify the construction of computing hardware by illustrating systematically how it is built up from digital circuits through higher-level components to processors and memories, and how its design is affected by its intended uses. “Computation Structures” is unusually broad in scope, considering many real-world problems and trade-off decisions faced by practicing engineers. These difficult choices are confronted and given careful attention throughout the book. Topics addressed include the digital abstraction; digital representations and notation; combinational devices and circuits; sequence and state; synthesis of digital systems; finite state machines; control structures and disciplines; performance measures and trade offs; communication; interpretation; micro-interpreter architecture; microprogramming and microcode; single sequence machines; stack architectures; register architectures; reduced instruction set computers; memory architectures; processes and processor multiplexing; process synchronization; interrupts, priorities, and real time; directions and trends.
Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called “Divide-and-Conquer”), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added for this edition. As of the third edition, this textbook is published exclusively by the MIT Press. The hardcover edition does not include a dust jacket.
About the Author
Thomas H. Cormen is Professor of Computer Science and former Director of the Institute for Writing and Rhetoric at Dartmouth College. He is the coauthor (with Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein) of the leading textbook on computer algorithms, Introduction to Algorithms (third edition, MIT Press, 2009). Charles E. Leiserson is Professor of Computer Science and Engineering at the Massachusetts Institute of Technology. Ronald L. Rivest is Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology. Clifford Stein is Professor of Industrial Engineering and Operations Research at Columbia University.