Pinned Repositories
dead-time-logic-of-nuclear-detectors
For detection systems that record discrete events, such as particle and nuclear detectors, the dead time is the time after each event during which the system is not able to record another event. An everyday life example of this is what happens when someone takes a photo using a flash, another picture cannot be taken immediately afterward because the flash needs a few seconds to recharge. This code is focused on dead time and the subsequent count loss estimation in radiation detection systems. The dead time is the minimum amount of time required between two events to permit detection of those events individually by a radiation detection system. If events occur during the system dead time, they are lost. Such lost information can be important in many applications including high-precision spectroscopy, positron emission tomography (PET), and the scanning of spent nuclear fuel. Understanding of the behavior of radiation detection systems is important; thus this work included a comprehensive review of dead time and pulse pile-up models and methods.
Basic-Theorems-in-C-
replecament, summation and decision theorems implemented on C#
FIFO
FIFO data structure
fifo2
simple fifo data structure
file-operation-and-sentence-cutting
file-operations2
read from file, convert variables, write to file
finding-prime-numbers
This program takes a positive integer from user and stores it in variable n. Then, for loop is executed which checks whether the number entered by user is perfectly divisible by i or not. The foor loop initiates with an initial value of i equals to 2 and increasing the value of i in each iteration. If the number entered by user is perfectly divisible by i then, isPrime is set to false and the number will not be a prime number. But, if the number is not perfectly divisible by i until test condition i <= n/2 is true means, it is only divisible by 1 and that number itself. So, the given number is a prime number.
iteration-tasks
Complete 12 different iteration excesises with menu structure as a command line application.
Kartaly-Bela-1
first c++ lesson
memory-allocation
1 and 2 dimension memory allocation
AndrewPhysics's Repositories
AndrewPhysics/programing-theorems-in-CPP
12 basic programming theorems implemented in CPP language.
AndrewPhysics/memory-allocation
1 and 2 dimension memory allocation
AndrewPhysics/file-operations2
read from file, convert variables, write to file
AndrewPhysics/file-operation-and-sentence-cutting
AndrewPhysics/sentence-cutting-program
This program will read sentences from consol window, then cut it to separate words using pointer arithmetic procedure.
AndrewPhysics/Basic-Theorems-in-C-
replecament, summation and decision theorems implemented on C#
AndrewPhysics/PRIME-numbers
AndrewPhysics/Kartaly-Bela-1
first c++ lesson
AndrewPhysics/fifo2
simple fifo data structure
AndrewPhysics/FIFO
FIFO data structure
AndrewPhysics/prime-factorization
This program calculates the prime factors of a given integer number.
AndrewPhysics/unit-test
testing of function input arguments
AndrewPhysics/finding-prime-numbers
This program takes a positive integer from user and stores it in variable n. Then, for loop is executed which checks whether the number entered by user is perfectly divisible by i or not. The foor loop initiates with an initial value of i equals to 2 and increasing the value of i in each iteration. If the number entered by user is perfectly divisible by i then, isPrime is set to false and the number will not be a prime number. But, if the number is not perfectly divisible by i until test condition i <= n/2 is true means, it is only divisible by 1 and that number itself. So, the given number is a prime number.
AndrewPhysics/quadratic-equation-solver
This code can solve quadratic equations with constants: a,b,c
AndrewPhysics/dead-time-logic-of-nuclear-detectors
For detection systems that record discrete events, such as particle and nuclear detectors, the dead time is the time after each event during which the system is not able to record another event. An everyday life example of this is what happens when someone takes a photo using a flash, another picture cannot be taken immediately afterward because the flash needs a few seconds to recharge. This code is focused on dead time and the subsequent count loss estimation in radiation detection systems. The dead time is the minimum amount of time required between two events to permit detection of those events individually by a radiation detection system. If events occur during the system dead time, they are lost. Such lost information can be important in many applications including high-precision spectroscopy, positron emission tomography (PET), and the scanning of spent nuclear fuel. Understanding of the behavior of radiation detection systems is important; thus this work included a comprehensive review of dead time and pulse pile-up models and methods.
AndrewPhysics/iteration-tasks
Complete 12 different iteration excesises with menu structure as a command line application.