*Note, this is a series of posts, it is recommended to read the last post first, if you didn’t read it.

All of us want to be good at our jobs, but how good do we really want to be?

• Quite good.
• Good.
• Very good.
• The best in our field.
• The best in the world.

Talent helps, but it won’t take you as far as ambition. (That’s what i tried to say at the start of this post)

Everybody wants to be good, but not many are prepared to make that sacrifices it takes to be great.

-

To many people, being nice in order to be liked is more important. There’s equal merit in that, but you must not confuse being good with being liked.

-

Most people are looking for a solution, a way to become good.  There’s no instant solution, the only way to learn is through experience and mistakes.

-

You’ll become whoever you want to be.

Thomas Edison wake up one day, had his breakfast, decided to invent the electric light, and had his dinner in the same day on the light of first electric lamp in the world.

Well, here we are! we just proved that this is also wrong way to invent what we all dream of.

*Note, this is a series of posts, it is recommended to read the last post first, if you didn’t read it.

-

Your vision of where or who you want to be is the greatest asset you have.

Without having a goal, it’s difficult to score. ~Paul Arden

–

Although the author mentioned that “It’s difficult to score”, I see that “It’s impossible to score”, after mentioning that the most important step is “wanting to change”, we have to mention now that wanting something without putting a goal to achieve it is totally useless and leads to big fat fail;

-

“I want to lose weight!”

-

This is great, this is what do you want from your heart, but this is not a goal.

Here’s a good tip for goal setting:

-

Set SMART goals!

You have probably heard of “SMART goals” already. But do you always apply the rule? The simple fact is that for goals to be powerful, they should be designed to be SMART. There are many variations of what SMART stands for, but the essence is this – goals should be:

Specific; not Fuzzy one.

Measurable; so, you can say anytime “I’ve successfully finished xx% from my goal”.

Attainable; Make sure that it’s possible to achieve the goal you set.

Relevant; Goals should be relevant to the direction you want your life and career to take.

Time Bound; You goals must have a deadline.

-

Let’s see how should the previous hope be modified to be a SMART goal

-

“In order to lose weight, my goal is to be 75 KG by the end of next November”

-

Do you want to change yourself? So, do you have SMART goals to change yourself?

-

-

Nearly all rich and powerful people are not notably talented, educated, charming or good-looking.
They become rich and powerful by wanting to be rich and powerful. ~ Paul Arden

-

“by wanting to be rich and powerful” … the first and most important step on the road of change is “wanting to change”; this deep inner need to change is your engine on the road, is your weapon fighting your obstacles while moving forward.
-

“I want to be successful”
“I want to be the best in my college”
“I want to work in Google”
“I want to have my own business”
“I want ….”

-

Who do you want to be? pick up a pen and paper -may be google document -
and start thinking; “Who do i want to beee?”

-

You must not let the life decides for you! simply, you’ll become one day who you want to be today, nothing else.

-

Don’t let this post pass without starting to answer this question.

-

-

-

-

Introduction and Definition

Hmmmm, do you love colors?! Seems interesting! Yes it is! Graph coloring is one of the most interesting topics in the graph theory, here’s a simplified problem definition for graph coloring:

Graph coloring is to give each node a color such that no two adjacent nodes have the same color.

It seems easy from the first look, “why not to give each node a unique color?!” … seems okay, but the real challenge appears when we say

Give each node a color such that no two adjacent nodes have the same color using the minimum number of colors. This is the real challenge!

-
Applications – Map Coloring

One of the most interesting applications on the graph coloring is to color a map; giving each region a color such that no to adjacent regions -having a common side- have the same color. We can translate the map into a graph by representing each region by a node, and making an edge between two nodes if the two regions having a common side.

Here’s an example:

Given this map of A, B, C, D, E and F regions:

We can translate it to be a graph as the following:

We can now apply a graph coloring algorithm:

So, we can color our map only using four colors, here it is:

It’s nice to know that, there is a theorem called Four Color Theorem states that:

Given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colors are required to color the regions of the map so that no two adjacent regions have the same color.

Here’s an example of a map-coloring to the states of United States.
It shows clearly that the minimum number of used colors is four.

-
Other Applications

There are many other applications on graph coloring like:

• Suduko generator, we can simply generate suduko boards by representing each cell as a node and link nodes in the same row and the same column and the same inner square, here’s an example of what cell (1,1) should be linked with
  
• Scheduling events
  Scheduling events that have common participants to find the minimum number of time slots to hold these events is a problem that can be solved graph coloring by representing each event by a node and link two nodes if they have common participant.

-
Algorithms

Greedy Algorithm:

Greedy graph coloring is very simple, it starts with any node, flooding from this node and giving each reached vertex the first available color, here the availability means that there’s no adjacent node has the color.

Here’s a trace for the greedy algorithm applied to the above example:

Starting with node (A) giving it blue color.
Go to node (B) and give it a new color –green- because it is adjacent to node (A) which has blue color.
Now, go to node (C) and also give it a new color – red-.
Coloring node (E) with the first available color in the used colors list, we’ll pick up the blue.
Now (D), picking the first available color –green-.
Coloring (F) with a new color –yellow- because its adjacent nodes has all the used colors.

Greedy algorithm is not the only one existed for solving the graph coloring problem; it’s good also to read about DOM algorithm

-
Do you know?!

Do you know that graph coloring is an NP complete problem; this means that no polynomial-time algorithm is found till now to solve this problem optimally. Do you know also that finding a solution for one of the NP Complete problems qualifies you to win the Nobel Prize! WOW! Why not to think about that : D
-
-

This is very old one, I’m just confused, Where is Goofy’s hat?!!! : D

-

-

-

-

-

-

Only people who know me very well know that how I’m very care about my friends and my social relations! How I consider losing one of my friends as losing a treasure!

But the rules become different when you ask one of your friends

“If I mean any importance for you, tell me what to do?”

and let him for some time to think and reply

“No! No you don’t mean any importance for me!”

-
Losing such persons and remove them from your lists ……..

-
Put suitable description over the dots! What do you think about that?

-

-

As any normal person, this was my first program to write in C++, it was about 4 years ago : )

#include <iostream>
using namespace std;
int main(){
	cout << "Hello Amr!";
	return 0;
}

-

I still remember when my brother Ahmed explained a lot in C++ for me and then he asked me to write a simple program that adds two numbers and prints their sum and after a long time of thinking and trying I couldn’t solve it!

-

I still also remember when I was so nervous after  the practical session of SUPPORT training for 1st year students because our team failed to get the prize!, and we asked our mentor Zikas to give us an extra challenge before the next session, and he asked us to make a program that converts from decimal  numbers to roman numbers (i, ii, iii, iv, …), and we also weren’t able to solve it in time.

-

Some people look at me now as a successful person, we were the same one day : ), Do your best and

TRY AGAIN!

Success Is Not a Gift!

-