10 Ways to Achieve your Goals Simply

Robot, Postit, Note, To Do, Sticky Notes

They considered 10 important key actions that once taken will make you closer to the goal. They also compiled how often and well people take these action items. The key actions are pretty neat. The results are shocking:

Make all your dreams real by first identifying and then focusing on specific, tangible targets for what you want.
Maintain at least one clearly defined goal for every major interest and role in your life.
Set your goals so they are directly aligned with your life’s mission, purpose and passion.
Create goals high enough to ignite your spirit and inspire you to take action.
Write down all your goals in specific, measurable detail.
Absolutely, unconditionally commit to hitting each of your targets.
Share your goals with others for mutual accomplishment.
Set a whole series of related daily, weekly and long-term goals, complete with starting times and completion dates.
Take 10 minutes every day to imagine how terrific it will feel when your goals are actually realized.
Take an action step toward the attainment of at least one goal every day.

Maybe most of them do not know how to achieve their goals, or they never plan their goals. Without a way to walk closer to your goal, you will only be dreaming about the achievement. You have to be a dreamer as well as a doer to taste the achievement in reality.

Regards

Amrut Gupta

Comments

Instruction Pipelining

Amu_Ke_Fundye Instruction Pipelining Parallel processing provides simultaneous data processing tasks for the purpose of increasing the computational speed of a computer system rather than each instruction is processed sequentially, a parallel processing system is able to perform concurrent data processing to achieve faster execution time and increase throughput. There are more advantages with parallel processing but it has some issues also. Due to parallel processing, the amount of hardware increases and the cost of system increases. Parallel processing is established by distributing the data among the multiple functional units. Flynn’s Classification Flynn introduced the parallel processing classification. This classification considers the organisation of a computer system by the number of instructions and data items that are manipulated simultaneously. The sequence of instructions read from the memory constitutes an instruction stream. The operations perfo...

ALU and Data Path

Amu_Ke_Fundye ALU and Data Path The CPU can be divided into a data section and a control section. The data section , which is also called the datapath. Datapath The registers, the ALU, and the interconnecting bus are collectively referred to as the datapath. Each bit in datapath is functionally identical. The datapath is capable of performing certain operations on data items. The control section is basically the control unit , which issues control signals to the datapath . Bus : A Bus is a collection of wires or distinct lines meant to carry data, address and control information. Data Bus : it is used for transmission of data. The number of data lines corresponds to the number of bits in a word. Address Bus : it carries the address of the main memory location from where the data can be accessed. Control Bus : it is used to indicate the direction of data transfer and to coordinate the timing of ...

Undecidability

Amu_Ke_Fundye Undecidability Decidable Problem If there is a Turing machine that decides the problem, called as Decidable problem. A decision problem that can be solved by an algorithm that halts on all inputs in a finite number of steps. A problem is decidable, if there is an algorithm that can answer either yes or no. A language for which membership can be decided by an algorithm that halts on all inputs in a finite number of steps. Decidable problem is also called as totally decidable problem, algorithmically solvable, recursively solvable. Undecidable Problem A problem that cannot be solved for all cases by any algorithm whatsoever. Equivalent Language cannot be recognized by a Turing machine that halts for all inputs. The following problems are undecidable problems: Halting Problem: A halting problem is undecidable problem. There is no general method or algorithm which can solve the halting problem for all possible inputs. Emptyness Problem:...

Amu_Ke_Fundye

Search This Blog