1)
In the last lessons of Informatics we have been learning about Algorithms: what they are and how they work, and to do this we saw a few videos to help us understand.
Algorithms are everywhere and they are essential our daily life. They are ancient and are a set of instructions that writes on itself. We can’t live without them. Even when we are baking a cake or playing chess we are following an Algorithm. They can be described as a set of rules for solving a problem in a finite number of steps.
In the videos we saw examples to types of algorithms like the sorting algorithm (merge sort, bubble sort, etc) and ways to solve algorithms such as the pseudocode.
2)
The Von-Neumann architecture describes the stored-program computer where instructions and data are stored in memory and the machine works by changing its internal state, i.e an instruction operates on some data and modifies the data. So inherently, there is state maintained in the system.
The Turing machine architecture works by manipulating symbols on a tape. i.e A tape with infinite number of slots exists, and at any one point in time, the Turing machine is in a particular slot. Based on the symbol read at that slot, the machine can change the symbol and move to a different slot. All of this is deterministic.
3)
GROUP: A2
No comments:
Post a Comment