bitcoin core – does getblockcount return the correct number of blocks when running in prune mode?

I currently run a bitcoin node with plum = 550.

The getBlockCount of $ bitcoin-cli getblockcount does not match https://blockexplorer.com/api/status?q=getBlockCount. As I understand it, bitcoind is still synchronizing the node since the number of blockcoin-cli getblock is increasing at a steady pace.

Will the getblock number of a node working with prune = 550 possibly match the official getblockcount number?

Running jupyter notebook on the cloud

Suppose my computer does not have enough configuration to run Anaconda Navigator. In this case, how can I run Anaconda Navigator on a cloud platform and which cloud platform would be best in this case?

Explaining some services running in the Google Play service

Can any one explain what … PlaceDetectionAsyncService is? I've found in development options, services running, Google Play services. I wanted to know if it was just a site provider .. etc too
DeviceConnectionWatcher? What are they and what are they for?

Tap to continue running Python code

Hello Is there a Python command or function to slowly execute the code, ie. Set stitches that continue to press a button or click with the mouse? I need to create something like this in my code!

algorithms – running at a BFS flood with multiple centers?

If we have a filler algorithm that, on a number of centers taking pixels on an image, performs a BFS fill on them, checking the neighboring 4 pixels, changing their colors and adding them to the queue for that their own neighbors are treated. they were not there. What is the duration of execution, it seems that it would be O (n) where n is the number of pixels but some sources have said that it should be O (4 ^ n). And how would this runtime change if the number of centers was changed, so that it would be a multiple or a fraction of n.

storage – Running a NAS on a university campus

We want to create and manage network-connected storage on our university campus to share the files that students are constantly downloading. Instead of uploading the files to the university's website, we wish to have a shared folder.
However, we have some problems:

  • Our budget can not afford servers
  • Multiple clients (approximately 50 at a time) may request to download a shared file.

I looked for solutions and I found FreeNAS that turns a normal computer into a server. This can be useful, but it requires almost 10 GB of RAM.

Any other ideas?

algorithms – Upper limit for the complexity of running LOOP programs

Recently, I discovered LOOP programs, which always end and have the same computational power as primitive recursive functions.
In addition, recursive primitive functions can (as far as I know) compute anything that does not grow faster than $ Ack (n) $.

Does this mean that the superior complexity of running at the limit of LOOP programs is $ O (Ack (n)) $? And are there functions similar to the Ackermann function, which can not be computed by primitive recursive functions, but grow slower than $ Ack (n) $?

(sorry for spelling and grammar)

<y code is running in the mess

This is my code, please excuse the bad layout.
I teach myself / learn from youtube. I'm trying to edit the code you sometimes, but in this case I did not do it, but the code does not run properly. it must request a number, user input, request an operator, user input, request a number again, user input.

but gives me the text below as can be seen, the second number entry message comes after the number has been entered.

! (enter the description of the image here

#include 
#include 

/*Calculator that can add sub div and mult, user defined*/


int main()
{
 double num1;
 char op;
 double num2;


 printf("Enter a number:   n");
 scanf("%lf", &num1);

 printf("Enter the operator:   n");
 scanf(" %c ", &op);

 printf("Enter a number:   n");
 scanf("%lf", &num2);


 if(op == '+')
 {
     printf("%f", num1 + num2);
 }
 else if (op == '-')
 {

     printf("%f", num1 - num2);
 }
 else if (op == '/')
 {

     printf("%f", num1 / num2);
 }

 else if(op == '*')
    {

    printf("%f", num1 * num2);
 }

 else
 {
     printf("im sorry your input was incorrect");
 }

    return 0;
}

shell – Android AOSP 5.1 Unable to connect "logcat", "dmesg" in a file running from an INIT script as a service

I'm trying to log "logcat", "dmesg" into a file from a custom shell script launched as a service with the help of init.project.rc. Using the lines below in the script (monitintf.sh), I can not save to a file test.txt. This is not even creating the file. Hints about this?

monitintf.sh:

mkdir /data/local/tmp/test 2>/dev/null
echo "Issue Observed with IP at `date`" >> /data/local/tmp/test/test.txt
dmesg >> /data/local/tmp/test/test.txt
timeout -t 10 logcat -v time -f /data/local/tmp/test/logcat.txt

init.project.rc:

service ethmon /system/xbin/monitintf
    class main
    user root
    group root
    oneshot 
on property:dev.bootcomplete=1
    start monitintf

preload_script.sh:

cp -f $SOURCE_FOLDER/monitintf.sh $OUT/system/xbin/monitintf

I'm new to AOSP, I'm missing some permissions to add for that.

NOTE: Other lines of code (ifconfig eth0 down/up, netcfg) work well in the same script.

Apple watches all sports trackers (running, training)?

I was looking for all sports trackers for Apple Watch.
I do all kinds of sports like running, crossfit, cycling, hiking, swimming ..
I would like to have an application that would store my work plans for the coming months, record training sessions, let me describe them and then analyze them at best.
Do you know something like, please?