grammer fix module book

Author: MuhtasimTanmoy

books/accelerated c++.md

@@ -1,6 +1,6 @@
 # Accelerated C++
 
-- An expression asks the implementation to compute something. The computation yields a result, and may also have side effects-that is, it may affect the state of the program or the implementation in ways that are not directly part of
+- An expression asks the implementation to compute something. The computation yields a result, and may also have side effects that is, it may affect the state of the program or the implementation in ways that are not directly part of
 the result.
 
-- For example, 3+4 is an expression that yields 7 as its result, and has no side effects, and `std::cout << "Hello, world!" << std::endl` is an expression that, as its side effect, writes Hello, world! on the standard output stream and ends the current line.
+- For example, 3+4 is an expression that yields 7 as its result, and has no side effects, and `std::cout << "Hello, world!" << std::endl` is an expression that, as its side effect, writes Hello, world! On the standard output stream and ends the current line.

books/concurrennt programming in erlang.md

@@ -1,21 +1,21 @@
 # [Concurrent Programming in Erlang](https://erlang.org/download/erlang-book-part1.pdf)
 
-- Erlang has a process-based model of concurrency with asynchron- ous message passing. 
-- The concurrency mechanisms in Erlang are light- weight, i.e. processes require little memory, and creating and deleting processes and message passing require little computational effort.
+- Erlang has a process-based model of concurrency with asynchronous message passing. 
+- The concurrency mechanisms in Erlang are lightweight, i.e. processes require little memory, and creating and deleting processes and message passing require little computational effort.
 
 - Erlang is a symbolic programming language with a real-time garbage collector
 
-- The use of a pattern matching syntax, and the ‘single assignment’ property of Erlang variables, leads to clear, short and reliable programs.
+- The use of a pattern-matching syntax, and the ‘single assignment’ property of Erlang variables, leads to clear, short, and reliable programs.
 
 - Registered process which allows us to associate a name with a process.
 
-- Erlang has primitives for multi- processing: spawn starts a parallel computation (called a process); send sends a message to a process; and receive receives a message from a process.
+- Erlang has primitives for multi-processing: spawn starts a parallel computation (called a process); send sends a message to a process; and receive receives a message from a process.
 
-- The syntax Pid ! Msg is used to send a message.
+- The syntax Pid! Msg is used to send a message.
 
 - While we can think of send as sending a message and receive as receiving a message, a more accurate description would be to say that send sends a message to the mailbox of a process and that receive tries to remove a message from the mailbox of the current process.
 - Receive is selective, that is to say, it takes the first message which matches one of the message patterns from a queue of messages waiting for the attention of the receiving process. 
-- If none of the receive patterns matches then the process is suspended until the next message is received unmatched messages are saved for later processing.
+- If none of the received patterns matches then the process is suspended until the next message is received unmatched messages are saved for later processing.
 
 - Instead of evaluating the function, however, and returning the result as in apply, spawn/3 creates a new concurrent process to evaluate the function and returns the Pid (process identifier) of the newly created process.
 

books/design pattern - elements of reusable object oriented software.md

@@ -1,4 +1,4 @@
-# Design Pattern - Elements of reusable object oriented Software
+# Design Pattern - Elements of reusable object-oriented Software
 
 - Designing object-oriented software is hard, and designing reusable object-oriented software is even harder.
 
@@ -13,9 +13,9 @@
     - The Structural class patterns use inheritance to compose classes, while the Structural object patterns describe ways to assemble objects 
     - The Behavioral class patterns use inheritance to describe algorithms and flow of control, whereas the Behavioral object patterns describe how a group of objects cooperate to perform a task that no single object can carry out alone
 
-- Composite is often used with Iterator or Visitor. 
+- Composite is often used with an Iterator or Visitor. 
 - Some patterns are alternatives: Prototype is often an alternative to Abstract Factory.
 - Some patterns result in similar designs even though the patterns have different intents. For example, the structure diagrams of Composite and Decorator are similar.
 
 ![](./screen/Design%20Pattern.png)
-![](./screen/Design%20Pattern%20Relations.png)
+![](./screen/Design%20Pattern%20Relations.png)

books/distributed systems concept and design.md

@@ -7,12 +7,12 @@
     - lack of a global clock
     - independent failures of components
 
-- The largest online game, EVE Online, utilises a client-server architecture where a single copy of the state of the world is maintained on a centralized server and accessed by client programs running on players’ consoles or other devices.
+- The largest online game, EVE Online, utilizes a client-server architecture where a single copy of the state of the world is maintained on a centralized server and accessed by client programs running on players’ consoles or other devices.
 
 ### System Models
 
 - Computer clocks and timing events 
-    - Each computer in a distributed system has its own internal clock, which can be used by local processes to obtain the value of the current time.
+    - Each computer in a distributed system has its internal clock, which can be used by local processes to obtain the value of the current time.
     - Therefore two processes running on different computers can each associate timestamps with their events.
     - However, even if the two processes read their clocks at the same time, their local clocks may supply different time values. 
     - This is because computer clocks drift from perfect time and, more importantly, their drift rates differ from one another. 
@@ -27,15 +27,15 @@
 - Chapter 5 presents the request-reply protocol, which supports RMI.
 - Its failure characteristics depend on the failure characteristics of both processes and communication channels. 
 - The protocol can be built from either datagram or stream communication. 
-- The choice may be decided according to a consideration of simplicity of implementation, performance and reliability.
+- The choice may be decided according to a consideration of simplicity of implementation, performance, and reliability.
 
 - Chapter 17 presents the `two-phase commit` protocol for transactions. 
 - It is designed to complete in the face of well-defined failures of processes and communication channels.
 
 - The algorithm that we describe here is a `distance vector` algorithm. 
 - This will provide a basis for the discussion in Section 3.4.3 of the link-state algorithm that has been used since 1979 as the main routing algorithm in the Internet. 
 
-- Routing in networks is an instance of the problem of path finding in graphs. 
+- Routing in networks is an instance of the problem of pathfinding in graphs. 
 - Bellman’s shortest path algorithm, published well before computer networks were developed [Bellman 1957], provides the basis for the distance vector method. 
 
 - Bellman’s method was converted into a distributed algorithm suitable for implementation in large networks by Ford and Fulkerson [1962], and protocols based on their work are often referred to as ‘Bellman–Ford’ protocols. 
@@ -44,10 +44,10 @@
 
 - The remote procedure call (RPC) approach extends the common programming abstraction of the procedure call to distributed environments, allowing a calling process to call a procedure in a remote node as if it is local.
 
-- Remote method invocation (RMI) is similar to RPC but for distributed objects, with added benefits in terms of using object-oriented programming concepts in distributed systems and also extending the concept of an object reference to the global distributed environments, and allowing the use of object references as parameters in remote invocations.
+- Remote method invocation (RMI) is similar to RPC but for distributed objects, with added benefits in terms of using object-oriented programming concepts in distributed systems and also extending the concept of an object reference to the globally distributed environments, and allowing the use of object references as parameters in remote invocations.
 
 - Space uncoupling, in which the sender does not know or need to know the identity of the receiver(s), and vice versa. 
-- Because of this space uncoupling, the system developer has many degrees of freedom in dealing with change: participants (senders or receivers) can be replaced, updated, replicated or migrated.
+- Because of this space uncoupling, the system developer has many degrees of freedom in dealing with change: participants (senders or receivers) can be replaced, updated, replicated, or migrated.
 
 - Time uncoupling, in which the sender and receiver(s) can have independent lifetimes. In other words, the sender and receiver(s) do not need to exist at the same time to communicate. 
 - This has important benefits, for example, in more volatile environments where senders and receivers may come and go.
@@ -56,7 +56,7 @@
 Process manager: Creation of and operations upon processes. 
 
 - A process is a unit of resource management, including an address space and one or more threads.
-- Thread manager: Thread creation, synchronization and scheduling. 
+- Thread manager: Thread creation, synchronization, and scheduling. 
 
 - Threads are schedulable activities attached to processes and are fully described in Section 7.4.
 
@@ -67,14 +67,14 @@ Process manager: Creation of and operations upon processes.
 
 - Memory manager: Management of physical and virtual memory. Section 7.4 and Section 7.5 describe the utilization of memory management techniques for efficient data copying and sharing.
 
-- Supervisor: Dispatching of interrupts, system call traps and other exceptions; control of memory management unit and hardware caches; processor and floating-point unit register manipulations. 
+- Supervisor: Dispatching of interrupts, system call traps, and other exceptions; control of memory management unit and hardware caches; processor and floating-point unit register manipulations. 
 - This is known as the Hardware Abstraction Layer in Windows. The reader is referred to Bacon [2002] and Tanenbaum [2007] for a fuller description of the computer-dependent aspects of the kernel.
 
 - When a process executes application code, it executes in a distinct user-level address space for that application; when the same process executes kernel code, it executes in the kernel’s address space. 
 
 - The process can safely transfer from a user-level address space to the kernel’s address space via an exception such as an interrupt or a system call trap – the invocation mechanism for resources managed by the kernel. 
 
 - A system call trap is implemented by a machine-level TRAP instruction, which puts the processor into supervisor mode and switches to the kernel address space. 
-- When the TRAP instruction is executed, as with any type of exception, the hardware forces the processor to execute a kernel-supplied handler function, in order that no process may gain illicit control of the hardware.
+- When the TRAP instruction is executed, as with any type of exception, the hardware forces the processor to execute a kernel-supplied handler function, so that no process may gain illicit control of the hardware.
 
 - Programs pay a price for protection. Switching between address spaces may take many processor cycles, and a system call trap is a more expensive operation than a simple procedure or method call. We shall see in Section 7.5.1 how these penalties factor into invocation costs.

books/enterprise integration pattern - addison wisley.md

@@ -6,7 +6,7 @@
 - Messaging enables data or commands to be sent across the network using a “send and forget” approach where the caller sends the information and then goes on to other work while the information is transmitted by the messaging system. Optionally, the caller can later be notified of the result through a callback.
 - Fundamental challenges:
     - Networks are unreliable. Integration solutions have to transport data from one computer to another across networks. Compared to a process running on a single computer, distributed computing has to be prepared to deal with a much larger set of possible problems. 
-    - Often times, two systems to be integrated are separated by continents and data between them has to travel through phone-lines, LAN segments, routers, switches, public networks, and satellite links. Each of these steps can cause delays or interruptions.
+    - Oftentimes, two systems to be integrated are separated by continents, and data between them has to travel through phone lines, LAN segments, routers, switches, public networks, and satellite links. Each of these steps can cause delays or interruptions.
     - Networks are slow. Sending data across a network is multiple orders of magnitude slower than making a local method call. Designing a widely distributed solution the same way you would approach a single application could have disastrous performance implications.
     - Any two applications are different. Integration solutions need to transmit information between systems that use different programming languages, operating platforms, and data formats. 
     - An integration solution needs to be able to interface with all these different technologies.