Basic computation principles of computer programming pdf

Made for sharing. Download files for later. Send to friends and colleagues. Modify, remix, and reuse just remember to cite OCW as the source. Particular attention is paid to concurrent and distributed systems. Topics covered include: specification and verification, concurrent algorithms, synchronization, naming, networking, replication techniques including distributed cache management , and principles and algorithms for achieving reliability.

Butler Lampson, and Martin Rinard. Spring Completeness includes the adequacy of a given set of axioms to capture all desired behaviors, functional adequacy of software and hardware systems, and the ability of a system to behave well under error conditions and unanticipated situations. Efficiency: measures of cost relative to resources such as space, time, money and people.

Examples include the theoretical assessment of the space and time complexity of an algorithm, feasibility, the efficiency with which a certain desirable result such as the completion of a project or the manufacture of a component can be achieved, and the efficiency of a given implementation relative to alternative implementations. Evolution: the fact of change and its implications. The impact of change at all levels and the resiliency and adequacy of abstractions, techniques and systems in the face of change.

Examples include the ability of formal models to represent aspects of systems that vary with time, and the ability of a design to withstand changing environmental demands and changing requirements, tools and facilities for configuration management.

Levels of Abstraction: the nature and use of abstraction in computing; the use of abstraction in managing complexity, structuring systems, hiding details, and capturing recurring patterns; the ability to represent an entity or system by abstractions having different levels of detail and specificity.

Examples include levels of hardware description, levels of specificity within an object hierarchy, the notion of generics in programming languages, and the levels of detail provided in a problem solution from specifications though code. Ordering in space: the concepts of locality and proximity in the discipline of computing.

In addition to physical location, as in networks or memory, this includes organizational location e. Ordering in time: the concept of time in the ordering of events. This includes time as a parameter in formal models e. Reuse: the ability of a particular technique, concept or systems to respond appropriately to be reused in a new context or situation.

Examples include probability, the reuse of software libraries and hardware components, technologies that promote reuse of software components, and language abstractions that promote the development of reusable software modules. Security: the ability of software and hardware systems to respond appropriately to and defend themselves against inappropriate and unanticipated requests; the ability of a computer installation to withstand catastrophic events e.

Examples include type-checking and other concepts in programming languages that provide protection against misuse of data objects and functions, data encryption, granting and revoking of privileges by a database management system, features in user interfaces that minimize user errors, physical security measures at computer facilities, and security mechanisms at various levels in a system.

Tradeoffs and consequences: the phenomenon of trade-offs in computing and the consequences of such trade-offs. The technical, economic, cultural and other effects of selecting one design alternative over another. Trade-offs are a fundamental fact of life at all levels and in all subject areas. Examples include space-time trade-offs in the study of algorithms, trade-offs inherent in conflicting design objectives e.

Remember me on this computer. Enter the email address you signed up with and we'll email you a reset link. Need an account? Click here to sign up. Download Free PDF. Quan Nguyen.

A short summary of this paper. Download Download PDF. Translate PDF. Your program and data are stored in RAM when you are using the computer. ROM is non-volatile.