Explane with the help ofdiagram ,the concept of stored program computer?
Answers
Answered by
2
A computer based on the stored program concept stores both the program instructions and data in the computer memory.
As a result of which computers based on this concept are said to deal with data and instructions interchangeably or in a uniform manner.
The CPU does not distinguish in the way it deals with data or program. The read/write operations that are valid for data are valid for programming instructions as well.
Simply put the CPU addresses the memory, fetches the corresponding instruction from the memory, executes them and as per requirement addresses and then reads the data from the memory as well.
The Von Neumann Computer was the first computer to be based on the stored program concept. The architecture on which computers now are based is thus called the Von Neumann Architecture. This Architecture popularized the stored program concept.
The Von Neumann architecture is as shown in Figure 2:
Pl mark it as brainlist
As a result of which computers based on this concept are said to deal with data and instructions interchangeably or in a uniform manner.
The CPU does not distinguish in the way it deals with data or program. The read/write operations that are valid for data are valid for programming instructions as well.
Simply put the CPU addresses the memory, fetches the corresponding instruction from the memory, executes them and as per requirement addresses and then reads the data from the memory as well.
The Von Neumann Computer was the first computer to be based on the stored program concept. The architecture on which computers now are based is thus called the Von Neumann Architecture. This Architecture popularized the stored program concept.
The Von Neumann architecture is as shown in Figure 2:
Pl mark it as brainlist
Answered by
0
Explanation:
Branch and bound (BB, B&B, or BnB) is an algorithm design paradigm for discrete and combinatorial optimization problems, as well as mathematical optimization. A branch-and-bound algorithm consists of a systematic enumeration of candidate solutions by means of state space search: the set of candidate solutions is thought of as forming a rooted tree with the full set at the root. The algorithm explores branches of this tree, which represent subsets of the solution set. Before enumerating the candidate solutions of a branch, the branch is checked against upper and lower estimated bounds on the optimal solution, and is discarded if it cannot produce a better solution than the best one found so far by the algorithm.
Similar questions