kristoferssolo/testing-spring-2024
1
0
Fork 0
mirror of https://github.com/jorenchik/testing-spring-2024.git synced 2025-10-21 20:10:36 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

remove file added by accident

Browse Source
This commit is contained in:
Jorens Shtekels 2024-03-10 16:21:45 +02:00
parent 2c5a74ff2e
commit b0a3a4dbb7
1 changed files with 0 additions and 31 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

31
src/memoryCalculations.md
View File

@ -1,31 +0,0 @@
struct Muitnieks {
uint employeeAvailable ID 4b
uint timeToServe 4b
}
struct Citizen {
uint timeArrived; 4b
uint timeFinish; 4b
}
size for Employee:
Worker count: 99
Citizen count: 4'000'000
99 * 8b + 4'000'000 * 8b = 792b + 32'000'000b =
=
How to determine the amount of time which can lie about
the queue?
Maximum time of serving is 100'000
Lets say we start serving someone at x:
How can we be sure that no one would be faster?
It must be 100001 lower than current time,
so if the time will be less by this time there will and
it will we in priority