It happens because your eyes follow the same path over and over. And it can get worse the longer you continue the movement. When you work at a computer, your eyes have to focus and refocus all the time. They move back and forth as you read. You may have to look down at papers and then back up to type. Your eyes react to changing images on the screen to create so your brain can process what you’re seeing. All these jobs require a lot of effort from your eye muscles. And to make things worse, unlike a book or piece of paper, the screen adds contrast, flicker, and glare.
You’re more likely to have problems if you already have eye trouble, if you need glasses but don't have them, or if you wear the wrong prescription for computer use.
Computer work gets harder as you age and the lenses in your eyes becomes less flexible. Somewhere around age 40, your ability to focus on near and far objects will start to go away. Your eye doctor will call this condition presbyopia.
You should specify what language you're using in these types of questions. Here's an example in C++, which is fairly easy to understand, so you should be able to transfer the concept to another language to problem.
int x = 2, y = 1, z = 3, min;
if (x < y && x < z)
min = x;
else if (y < x && y < z)
min = y;
else if (z < x && z < y)
min = z;
else
std::cout << "There is no minimum";
Answer:
B.O(n).
Explanation:
If the graph is represented by adjacency matrix then we can find all the neighbors of a given vertex in O(n) time because each row in adjacency matrix consists the track of the neighbors.If the other vertex is a neighbor then it contains 1 in adjacency matrix if not it contains 0.So we have to iterate over that row of the vertex to find the neighbors.
Dsl is quite high speed, dial up is very low speed (lower then edge on mobile)
but they works via telephone line both