All categories

3 years ago

What e-reader technology males a screen that is easy to read and extends battery life

1 answer:

6 0

I personally use the Kindle Paperwhite series, but any with an E-ink display will work great, as the display isn't very battery-consuming.

You might be interested in

Please explain this code line by line and how the values of each variable changes as you go down the code.

Scilla [17]

Answer:

hope this helps. I am also a learner like you. Please cross check my explanation.

Explanation:

#include

using namespace std;

int main()

{

int a[ ] = {0, 0, 0}; //array declared initializing a0=0, a1=0, a3=0

int* p = &a[1]; //pointer p is initialized it will be holding the address of a1 which means when p will be called it will point to whatever is present at the address a1, right now it hold 0.

int* q = &a[0]; //pointer q is initialized it will be holding the address of a0 which means when q will be called it will point to whatever is present at the address a0, right now it hold 0.

q=p; // now q is also pointing towards what p is pointing both holds the same address that is &a[1]

*q=1 ; //&a[0] gets overwritten and now pointer q has integer 1......i am not sure abut this one

p = a; //p is now holding address of complete array a

*p=1; // a gets overwritten and now pointer q has integer 1......i am not sure abut this one

int*& r = p; //not sure

int** s = &q; s is a double pointer means it has more capacity of storage than single pointer and is now holding address of q

r = *s + 1; //not sure

s= &r; //explained above

**s = 1; //explained above

return 0;

}

6 0

2 years ago

Nonverbal messages from the movie it

RUDIKE [14]

Answer:

ya you say right

Explanation:

5 0

3 years ago

Read 2 more answers

Get ready to be the Quizmaster! You are going to design your own Python game show in the style of a quiz.

marin [14]

Answer:

"Are apples Magenta?"\n(a) yes\n(b) sometimes\n (c) no\n\n",

"Are apples Teal?"\n(a) yes\n(b) sometimes\n (c) no\n\n",

"Are apples Gray?"\n(a) yes\n(b) sometimes\n (c) no\n\n",

"Are apples Green?"\n(a) yes\n(b) sometimes\n (c) no\n\n",

"Are apples Cyan?"\n(a) yes\n(b) sometimes\n (c) no\n\n",

]

Questions(Question prompts[0], "a")

Questions(Question prompts[1], "c")

Questions(Question prompts[2], "c")

Questions(Question prompts[3], "c")

Questions(Question prompts[4], "c")

Questions(Question prompts[5], "b")

Questions(Question prompts[6], "c")

Questions(Question prompts[7], "c")

Questions(Question prompts[8], "a")

Questions(Question prompts[9], "c")

Explanation:

6 0

2 years ago

A prime number is a number that is divisible only by itself and 1. Write a program that asks a user for an integer value and the

Rashid [163]

Answer:

The Solution Code is written in Java.

public class Main {
public static void main(String[] args) {
System.out.print("Please enter an integer: ");
Scanner input = new Scanner(System.in);
int number = input.nextInt();
System.out.print("Prime numbers less than or equal to " + number + " : ");
for(int i=2; i <= number; i++){
if(checkPrime(i)){
System.out.print(i + " ");
}
}
}
public static Boolean checkPrime(int num){
for(int i=2; i < num; i++)
{
if(num % i == 0){
return false;
}
}
return true;
}
}

Explanation:

Firstly, we create a function to check if a number is prime (Line 18 - 27).

This function will take one input value which is an integer, num.

To check if the input num is a prime, we can use modulus operator, %, to confirm if the num is divisible by any number starting from 2 to num - 1 (Line 19 - 24).

If the num is divisible by any number expect 1 and itself, it should equal to zero and return false to indicate it is not a prime number.

If all the num (except 1 and itself) is not divisible, the function will return true (Line 25).

Next, in our main program part (Line 3 - 16)

Prompt the user to input a number (Line 5 - 7)
Using a for-loop, we can keep calling the checkPrime() function by passing a current number (starting from 2 to input number) as argument (Line 12). The checkPrime() function will run and return true it the current number is prime, return false if it is not prime.
If the checkPrime() function return true, it will print the current number before proceed to the iteration of the for-loop to repeat the same check prime procedure (Line 13)
At the end all the prime numbers less than or equal to the input number will be printed out in the terminal

8 0

3 years ago

This is more a question for Brainly,

Mashutka [201]

Answer:

some questions may require links, however there should be a process that links have to be verified before they show.

Explanation:

8 0

3 years ago

Read 2 more answers