708 lines
42 KiB
Plaintext
708 lines
42 KiB
Plaintext
MODEL: devstral-small2-24b
|
||
PATH: /home/qrf/.cache/llama.cpp/mistralai_Devstral-Small-2-24B-Instruct-2512-Q4_K_M.gguf
|
||
STARTED: 2026-07-12 02:37:48
|
||
|
||
======================================================================
|
||
Q01 [recall]
|
||
What is the Kasner metric, and in what context does it arise in general relativity?
|
||
|
||
ANSWER:
|
||
The **Kasner metric** is a solution to Einstein's field equations in general relativity that describes a homogeneous, anisotropic (i.e., direction-dependent) universe. It is particularly relevant in the context of the **Bianchi classification of homogeneous cosmological models**, which categorizes spatially homogeneous spacetimes based on their symmetry groups.
|
||
|
||
### Key Features of the Kasner Metric:
|
||
1. **Form of the Metric**:
|
||
The Kasner metric is given by:
|
||
\[
|
||
ds^2 = -dt^2 + t^{2p_1} dx^2 + t^{2p_2} dy^2 + t^{2p_3} dz^2,
|
||
\]
|
||
where \( p_1, p_2, p_3 \) are constants satisfying:
|
||
\[
|
||
p_1 + p_2 + p_3 = p_1^2 + p_2^2 + p_3^2 = 1.
|
||
\]
|
||
These conditions ensure that the metric is a solution to the vacuum Einstein equations (\( T_{\mu\nu} = 0 \)).
|
||
|
||
2. **Anisotropy**:
|
||
The metric is anisotropic because the scale factors for the three spatial directions (\( x, y, z \)) evolve differently with time \( t \). This contrasts with the isotropic Friedmann-Lemaître-Robertson-Walker (FLRW) metrics, where all spatial directions scale uniformly.
|
||
|
||
3. **Context in General Relativity**:
|
||
- The Kasner metric arises as a **special case of the Bianchi I model**, which is one of the simplest homogeneous but anisotropic cosmological models.
|
||
- It is particularly important in the study of **singularities in general relativity**, especially in the context of the **BKL (Belinskii-Khalatnikov-Lifshitz) conjecture**. This conjecture describes the behavior of spacetime near a generic cosmological singularity, where the universe becomes highly anisotropic and the Kasner metric dominates the dynamics in certain regions.
|
||
- The Kasner metric also appears in the study of **gravitational waves** and **black hole spacetimes**, though it is most commonly associated with cosmology.
|
||
|
||
4. **Physical Interpretation**:
|
||
- In cosmology, the Kasner metric describes a universe that expands or contracts at different rates along different spatial directions. For example, one direction might expand while another contracts, leading to a "pancake" or "cigar" shape for the universe.
|
||
- It is a vacuum solution, meaning it does not include matter or radiation. However, it can be generalized to include matter (e.g., dust or radiation) in the form of the **Kasner-like solutions** in the Bianchi models.
|
||
|
||
### Connection to the BKL Conjecture:
|
||
Near a cosmological singularity (e.g., the Big Bang), the BKL conjecture suggests that the universe becomes highly anisotropic and can be approximated by a sequence of Kasner epochs, where the Kasner metric dominates the dynamics in different spatial regions. This is in contrast to the isotropic FLRW models, which are valid only in the late universe or far from the singularity.
|
||
|
||
### Summary:
|
||
The Kasner metric is a vacuum solution to Einstein's equations describing a homogeneous but anisotropic universe. It is a key example in the study of homogeneous cosmological models (Bianchi I) and plays a crucial role in understanding the behavior of spacetime near singularities, as described by the BKL conjecture.
|
||
|
||
EXPECTED (judge only): Vacuum solution to Einstein's equations describing an anisotropic, homogeneous universe; exponents satisfy sum p_i = sum p_i^2 = 1; arises in BKL analysis of cosmological singularities.
|
||
(finish=stop tokens=714 time=30.1s tps=24.1)
|
||
|
||
======================================================================
|
||
Q02 [recall]
|
||
In enzyme kinetics, what does the Haldane relationship connect?
|
||
|
||
ANSWER:
|
||
The Haldane relationship connects the catalytic constants of an enzyme-catalyzed reaction in the forward and reverse directions. Specifically, it relates the Michaelis constant (Km) and the maximum reaction velocity (Vmax) for the forward reaction to those for the reverse reaction. The relationship is given by:
|
||
|
||
Haldane relationship: (Km_forward / Km_reverse) = (Vmax_forward / Vmax_reverse) * (K_eq)
|
||
|
||
Where K_eq is the equilibrium constant for the reaction. This relationship is useful for understanding the thermodynamics and kinetics of reversible enzyme-catalyzed reactions.
|
||
|
||
EXPECTED (judge only): Relates the equilibrium constant of a reversible enzyme reaction to its kinetic constants: Keq = (Vf*Kmr)/(Vr*Kmf), tying forward/reverse kcat and Km to thermodynamic equilibrium.
|
||
(finish=stop tokens=123 time=5.3s tps=24.3)
|
||
|
||
======================================================================
|
||
Q03 [recall]
|
||
Who was Hypatia of Alexandria and roughly when did she die?
|
||
|
||
ANSWER:
|
||
Hypatia of Alexandria was a prominent mathematician, astronomer, and philosopher who lived in Alexandria, Egypt, during the late 4th and early 5th centuries. She was a student and teacher of philosophy and science, known for her contributions to mathematics and astronomy, and for her role in the Neoplatonic school in Alexandria.
|
||
|
||
Hypatia was brutally murdered by a mob of Christian zealots in March 415 AD. Her death is often seen as a symbol of the decline of classical learning and the rise of Christian influence in the Roman Empire.
|
||
|
||
EXPECTED (judge only): Neoplatonist philosopher/mathematician/astronomer in Alexandria; murdered by a Christian mob around 415 CE.
|
||
(finish=stop tokens=118 time=5.0s tps=24.5)
|
||
|
||
======================================================================
|
||
Q04 [recall]
|
||
What is the Gershgorin circle theorem used for?
|
||
|
||
ANSWER:
|
||
The **Gershgorin Circle Theorem** is a result in linear algebra that provides bounds on the eigenvalues of a matrix. Specifically, it states that every eigenvalue of a square matrix \( A \) lies within at least one of the Gershgorin discs associated with \( A \).
|
||
|
||
### **What is it used for?**
|
||
1. **Estimating Eigenvalues**: It helps in approximating the location of eigenvalues without explicitly computing them, which is useful for large or complex matrices.
|
||
2. **Checking Stability**: In control theory and dynamical systems, it can be used to determine the stability of a system by analyzing the location of eigenvalues (e.g., whether they lie in the left half-plane for continuous-time systems).
|
||
3. **Error Analysis**: It provides bounds on how perturbations in a matrix affect its eigenvalues.
|
||
4. **Numerical Methods**: It is used in iterative methods for eigenvalue computation to guide convergence or to verify results.
|
||
5. **Matrix Decomposition**: Helps in understanding the structure of a matrix, such as identifying diagonal dominance or block structures.
|
||
|
||
### **Mathematical Statement**
|
||
For a matrix \( A = [a_{ij}] \), the Gershgorin discs are defined as:
|
||
\[
|
||
D_i = \left\{ z \in \mathbb{C} \mid |z - a_{ii}| \leq \sum_{j \neq i} |a_{ij}| \right\}
|
||
\]
|
||
for each \( i = 1, 2, \dots, n \). The theorem states that every eigenvalue of \( A \) lies in at least one \( D_i \).
|
||
|
||
### **Example**
|
||
Consider the matrix:
|
||
\[
|
||
A = \begin{bmatrix}
|
||
2 & 1 & 0 \\
|
||
0 & 3 & 1 \\
|
||
0 & 0 & 4
|
||
\end{bmatrix}
|
||
\]
|
||
The Gershgorin discs are:
|
||
- \( D_1: |z - 2| \leq 1 \) (a disc centered at 2 with radius 1),
|
||
- \( D_2: |z - 3| \leq 1 \) (a disc centered at 3 with radius 1),
|
||
- \( D_3: |z - 4| \leq 0 \) (just the point 4).
|
||
|
||
Thus, the eigenvalues must lie in \( D_1 \cup D_2 \cup D_3 \), which in this case are exactly the diagonal entries (2, 3, 4).
|
||
|
||
### **Final Answer**
|
||
The Gershgorin Circle Theorem is used to **estimate the location of eigenvalues of a matrix** by providing discs in the complex plane that must contain at least one eigenvalue each. It is particularly useful for **analyzing stability, bounding eigenvalues, and guiding numerical computations** without explicitly solving for eigenvalues.
|
||
|
||
EXPECTED (judge only): Bounds the location of eigenvalues of a square matrix: every eigenvalue lies within at least one Gershgorin disc centered at a diagonal entry with radius equal to the sum of absolute off-diagonal entries in that row.
|
||
(finish=stop tokens=574 time=23.9s tps=24.2)
|
||
|
||
======================================================================
|
||
Q05 [recall]
|
||
In RF engineering, what is the difference between the noise figure and noise temperature of a device, and how are they related?
|
||
|
||
ANSWER:
|
||
In RF engineering, **noise figure (NF)** and **noise temperature (Tn)** are two different but related ways to quantify the noise performance of a device (e.g., an amplifier or receiver). Here’s a step-by-step explanation of their differences and relationship:
|
||
|
||
### 1. **Noise Figure (NF)**
|
||
- **Definition**: The noise figure is a ratio that compares the signal-to-noise ratio (SNR) at the input of a device to the SNR at the output. It is expressed in decibels (dB).
|
||
- **Formula**:
|
||
\[
|
||
\text{NF} = 10 \log_{10} \left( \frac{\text{SNR}_{\text{in}}}{\text{SNR}_{\text{out}}} \right)
|
||
\]
|
||
where \(\text{SNR}_{\text{in}}\) is the input SNR and \(\text{SNR}_{\text{out}}\) is the output SNR.
|
||
- **Interpretation**: A lower NF (closer to 0 dB) indicates better noise performance. For example, an NF of 3 dB means the device degrades the SNR by 3 dB.
|
||
- **Physical Meaning**: NF accounts for both the noise added by the device itself and the noise from the source (e.g., an antenna). It is a dimensionless quantity but is often expressed in dB.
|
||
|
||
### 2. **Noise Temperature (Tn)**
|
||
- **Definition**: The noise temperature is the equivalent temperature of a noise source that would produce the same noise power as the device. It is measured in Kelvin (K).
|
||
- **Formula**: The noise temperature is related to the noise figure by:
|
||
\[
|
||
T_n = T_0 (10^{(\text{NF}/10)} - 1)
|
||
\]
|
||
where \(T_0 = 290 \text{ K}\) (standard reference temperature, approximately room temperature).
|
||
- **Interpretation**: A lower \(T_n\) indicates better noise performance. For example, a noise temperature of 100 K is better than 200 K.
|
||
- **Physical Meaning**: \(T_n\) represents the additional noise the device introduces, as if it were a resistor at temperature \(T_n\). It is particularly useful in systems where noise is analyzed in terms of temperature (e.g., cryogenic amplifiers).
|
||
|
||
### 3. **Relationship Between NF and Tn**
|
||
- The noise figure and noise temperature are directly related through the formula above. You can convert between them using:
|
||
\[
|
||
\text{NF} = 10 \log_{10} \left( 1 + \frac{T_n}{T_0} \right)
|
||
\]
|
||
or
|
||
\[
|
||
T_n = T_0 (10^{(\text{NF}/10)} - 1)
|
||
\]
|
||
- **Example**: If a device has an NF of 3 dB:
|
||
\[
|
||
T_n = 290 \times (10^{(3/10)} - 1) \approx 290 \times (1.995 - 1) \approx 288.5 \text{ K}
|
||
\]
|
||
Conversely, if a device has a noise temperature of 100 K:
|
||
\[
|
||
\text{NF} = 10 \log_{10} \left( 1 + \frac{100}{290} \right) \approx 10 \log_{10} (1.345) \approx 1.3 \text{ dB}
|
||
\]
|
||
|
||
### 4. **Key Differences**
|
||
- **Units**: NF is dimensionless (often in dB), while \(T_n\) is in Kelvin.
|
||
- **Reference**: NF is relative to the input SNR, while \(T_n\) is an absolute temperature equivalent.
|
||
- **Use Cases**: NF is more commonly used in general RF engineering, while \(T_n\) is often used in low-noise applications (e.g., radio astronomy, satellite communications) where noise is analyzed in terms of temperature.
|
||
|
||
### 5. **When to Use Which**
|
||
- Use **NF** when comparing devices or when working with systems where SNR degradation is the primary concern.
|
||
- Use **\(T_n\)** when analyzing systems where noise is treated as thermal noise (e.g., cryogenic amplifiers) or when combining noise contributions from multiple stages (since noise temperatures add linearly in cascaded systems).
|
||
|
||
### Summary
|
||
- Noise figure (NF) and noise temperature (\(T_n\)) are two ways to describe the same underlying noise performance of a device.
|
||
- They are related by the formula \(T_n = T_0 (10^{(\text{NF}/10)} - 1)\).
|
||
- NF is more intuitive for general use, while \(T_n\) is useful for temperature-based noise analysis.
|
||
|
||
EXPECTED (judge only): Both quantify added noise; related by F = 1 + Te/T0 (T0=290K), equivalently Te = T0*(F-1). NF is 10log10(F) in dB.
|
||
(finish=stop tokens=1024 time=43.0s tps=24.0)
|
||
|
||
======================================================================
|
||
Q06 [recall]
|
||
What is the Antikythera mechanism and what did it do?
|
||
|
||
ANSWER:
|
||
The Antikythera mechanism is an ancient Greek analog computer designed to predict astronomical positions and eclipses for calendar and astrological purposes. It was discovered in 1901 in the Antikythera wreck, an ancient shipwreck off the Greek island of Antikythera. The mechanism dates back to the 2nd century BCE and is considered one of the most complex instruments of the ancient world.
|
||
|
||
The Antikythera mechanism consisted of a complex system of gears and dials that could track the movements of the sun, moon, and planets, as well as predict solar and lunar eclipses. It also had the capability to indicate the dates of the Olympic Games and other Greek games. The device was likely used by astronomers and astrologers to make predictions and to keep track of time and celestial events.
|
||
|
||
The mechanism was lost for centuries and its purpose was not fully understood until modern X-ray and imaging techniques allowed researchers to study its intricate details. Today, it is considered a marvel of ancient engineering and scientific thought.
|
||
|
||
EXPECTED (judge only): Ancient Greek geared analog device (~2nd c. BCE) for predicting astronomical positions, eclipses, and calendrical/Olympiad cycles.
|
||
(finish=stop tokens=213 time=9.2s tps=24.2)
|
||
|
||
======================================================================
|
||
Q07 [recall]
|
||
What does the CAP theorem state in distributed systems?
|
||
|
||
ANSWER:
|
||
The CAP theorem, also known as Brewer's theorem, is a fundamental principle in distributed systems that states that it is impossible for a distributed data store to simultaneously provide more than two out of the following three guarantees:
|
||
|
||
1. **Consistency**: Every read receives the most recent write or an error.
|
||
2. **Availability**: Every request receives a (non-error) response, without the guarantee that it contains the most recent write.
|
||
3. **Partition Tolerance**: The system continues to operate despite an arbitrary number of messages being dropped (or delayed) by the network between nodes.
|
||
|
||
In simpler terms, the CAP theorem implies that in the presence of a network partition (which is inevitable in distributed systems), you must choose between consistency and availability. You cannot have both simultaneously.
|
||
|
||
### Key Points:
|
||
- **Partition Tolerance (P)** is a must for modern distributed systems because network partitions are inevitable.
|
||
- Therefore, the real choice is between **Consistency (C)** and **Availability (A)**:
|
||
- **CP Systems**: Prioritize consistency and partition tolerance (e.g., CP databases like ZooKeeper or etcd).
|
||
- **AP Systems**: Prioritize availability and partition tolerance (e.g., AP databases like Cassandra or DynamoDB).
|
||
|
||
### Common Misconceptions:
|
||
- The CAP theorem does not imply that you must always choose between C and A. In practice, systems can be tuned to favor one over the other depending on the use case.
|
||
- It is not about choosing between two out of three at all times, but rather about the trade-offs during a network partition.
|
||
|
||
### Final Answer:
|
||
The CAP theorem states that in distributed systems, it is impossible to simultaneously guarantee all three properties: **Consistency, Availability, and Partition Tolerance**. You must sacrifice one of them in the presence of a network partition.
|
||
|
||
EXPECTED (judge only): A distributed data store cannot simultaneously guarantee all three of Consistency, Availability, and Partition tolerance; under a partition you must trade consistency vs availability.
|
||
(finish=stop tokens=371 time=15.6s tps=24.1)
|
||
|
||
======================================================================
|
||
Q08 [recall]
|
||
What is Cherenkov radiation and what condition produces it?
|
||
|
||
ANSWER:
|
||
Cherenkov radiation is a type of electromagnetic radiation emitted when a charged particle (such as an electron) moves through a dielectric medium (like water or glass) at a speed greater than the phase velocity of light in that medium. This phenomenon is analogous to the sonic boom produced by an object moving faster than the speed of sound in air.
|
||
|
||
### Conditions for Cherenkov Radiation:
|
||
1. **Charged Particle**: The particle must be electrically charged (e.g., an electron, proton, or alpha particle).
|
||
2. **Dielectric Medium**: The particle must travel through a medium where the speed of light is slower than in a vacuum (e.g., water, glass, or certain gases). The refractive index \( n \) of the medium must be greater than 1.
|
||
3. **Speed Greater Than Phase Velocity**: The particle's speed \( v \) must exceed the phase velocity of light in the medium, which is \( c/n \), where \( c \) is the speed of light in a vacuum. Mathematically, this is expressed as:
|
||
\[
|
||
v > \frac{c}{n}
|
||
\]
|
||
This implies that the particle's speed must be greater than \( c/n \), but it does not have to exceed the speed of light in a vacuum (\( c \)), since \( n > 1 \).
|
||
|
||
### Explanation:
|
||
- When a charged particle moves through a medium faster than the phase velocity of light in that medium, it continuously emits photons (light) in a cone-shaped pattern. This is because the particle's electromagnetic field disturbs the medium, creating a shock wave of light.
|
||
- The angle \( \theta \) of the emitted Cherenkov radiation cone is given by:
|
||
\[
|
||
\cos \theta = \frac{c}{n v}
|
||
\]
|
||
This angle depends on the particle's speed and the refractive index of the medium.
|
||
|
||
### Example:
|
||
- In water (\( n \approx 1.33 \)), a particle must travel faster than \( c/1.33 \approx 0.75c \) (where \( c \) is the speed of light in a vacuum) to produce Cherenkov radiation. This is achievable by high-energy particles like those produced in nuclear reactors or particle accelerators.
|
||
|
||
### Common Applications:
|
||
- Cherenkov radiation is used in particle physics detectors (e.g., Cherenkov counters) to identify and measure the speed and energy of charged particles.
|
||
- It is also observed in nuclear reactors, where it appears as a blue glow in the water surrounding the reactor core.
|
||
|
||
### Note:
|
||
Cherenkov radiation does not violate the principle that nothing can travel faster than the speed of light in a vacuum. The particle's speed is always less than \( c \), but it can exceed the phase velocity of light in a medium because the medium slows down the light.
|
||
|
||
EXPECTED (judge only): Light emitted when a charged particle travels through a medium faster than the phase velocity of light in that medium (v > c/n); produces the characteristic blue glow, emitted at a cone angle cos(theta)=1/(n*beta).
|
||
(finish=stop tokens=584 time=24.3s tps=24.2)
|
||
|
||
======================================================================
|
||
Q09 [reason]
|
||
A 12-bit ADC has a full-scale range of 0 to 3.3 V. What is its voltage resolution (LSB size) in millivolts? Show the calculation.
|
||
|
||
ANSWER:
|
||
To determine the voltage resolution (LSB size) of a 12-bit ADC with a full-scale range of 0 to 3.3 V, follow these steps:
|
||
|
||
1. **Understand the full-scale range**: The ADC can measure voltages from 0 V to 3.3 V, which means the total voltage range is 3.3 V.
|
||
|
||
2. **Determine the number of steps**: A 12-bit ADC can represent \(2^{12}\) different voltage levels. This is because each bit doubles the number of possible values.
|
||
\[
|
||
2^{12} = 4096
|
||
\]
|
||
|
||
3. **Calculate the voltage resolution**: The voltage resolution is the size of the smallest voltage change that can be detected by the ADC, which is the full-scale range divided by the number of steps.
|
||
\[
|
||
\text{Voltage resolution} = \frac{\text{Full-scale range}}{\text{Number of steps}} = \frac{3.3 \text{ V}}{4096}
|
||
\]
|
||
|
||
4. **Perform the division**:
|
||
\[
|
||
\frac{3.3}{4096} \approx 0.0008056640625 \text{ V}
|
||
\]
|
||
|
||
5. **Convert to millivolts**: Since 1 V = 1000 mV, multiply the result by 1000 to convert to millivolts.
|
||
\[
|
||
0.0008056640625 \text{ V} \times 1000 = 0.8056640625 \text{ mV}
|
||
\]
|
||
|
||
6. **Round to a reasonable number of decimal places**: Typically, voltage resolution is given to a few decimal places.
|
||
\[
|
||
\text{Voltage resolution} \approx 0.806 \text{ mV}
|
||
\]
|
||
|
||
The voltage resolution (LSB size) of the 12-bit ADC is approximately 0.806 millivolts.
|
||
|
||
EXPECTED (judge only): 3.3 V / 2^12 = 3.3/4096 = 0.0008056 V = about 0.806 mV.
|
||
(finish=stop tokens=440 time=18.6s tps=24.1)
|
||
|
||
======================================================================
|
||
Q10 [reason]
|
||
A geostationary satellite orbits at ~35,786 km altitude. Earth's radius is ~6,378 km. Ignoring atmosphere, what is the approximate one-way line-of-sight propagation delay from a ground station directly below it to the satellite, in milliseconds?
|
||
|
||
ANSWER:
|
||
To calculate the one-way line-of-sight propagation delay from a ground station directly below a geostationary satellite to the satellite, we need to follow these steps:
|
||
|
||
1. **Determine the distance between the ground station and the satellite:**
|
||
- The altitude of the geostationary satellite is given as approximately 35,786 km.
|
||
- The radius of the Earth is given as approximately 6,378 km.
|
||
- Since the ground station is directly below the satellite, the distance between the ground station and the satellite is simply the altitude of the satellite plus the radius of the Earth.
|
||
- Distance = Altitude of satellite + Radius of Earth
|
||
- Distance = 35,786 km + 6,378 km = 42,164 km
|
||
|
||
2. **Calculate the propagation delay:**
|
||
- The speed of light in a vacuum (which we can approximate for this calculation) is approximately 299,792 km/s.
|
||
- Propagation delay = Distance / Speed of light
|
||
- Propagation delay = 42,164 km / 299,792 km/s ≈ 0.1406 seconds
|
||
|
||
3. **Convert the delay to milliseconds:**
|
||
- 1 second = 1000 milliseconds
|
||
- Propagation delay in milliseconds = 0.1406 seconds * 1000 ≈ 140.6 milliseconds
|
||
|
||
Therefore, the approximate one-way line-of-sight propagation delay from a ground station directly below a geostationary satellite to the satellite is about 140.6 milliseconds.
|
||
|
||
EXPECTED (judge only): Distance ~= 35,786 km; delay = 35,786e3 / 3e8 = ~0.1193 s = about 119 ms. (Directly below, slant range = altitude.)
|
||
(finish=stop tokens=347 time=14.8s tps=24.1)
|
||
|
||
======================================================================
|
||
Q11 [reason]
|
||
If a signal has an SNR of 20 dB and a bandwidth of 1 MHz, what is the approximate Shannon channel capacity in Mbps? Show your steps.
|
||
|
||
ANSWER:
|
||
To calculate the Shannon channel capacity, we use the formula:
|
||
|
||
\[ C = B \log_2(1 + SNR) \]
|
||
|
||
where:
|
||
- \( C \) is the channel capacity in bits per second (bps),
|
||
- \( B \) is the bandwidth in Hertz (Hz),
|
||
- \( SNR \) is the signal-to-noise ratio (linear scale).
|
||
|
||
**Given:**
|
||
- SNR = 20 dB
|
||
- Bandwidth \( B \) = 1 MHz = \( 1 \times 10^6 \) Hz
|
||
|
||
**Step 1: Convert SNR from dB to linear scale.**
|
||
The formula to convert SNR from dB to linear scale is:
|
||
|
||
\[ SNR_{\text{linear}} = 10^{(SNR_{\text{dB}} / 10)} \]
|
||
|
||
\[ SNR_{\text{linear}} = 10^{(20 / 10)} = 10^2 = 100 \]
|
||
|
||
**Step 2: Plug the values into the Shannon capacity formula.**
|
||
|
||
\[ C = B \log_2(1 + SNR_{\text{linear}}) \]
|
||
|
||
\[ C = 1 \times 10^6 \log_2(1 + 100) \]
|
||
|
||
\[ C = 1 \times 10^6 \log_2(101) \]
|
||
|
||
**Step 3: Calculate \( \log_2(101) \).**
|
||
We know that \( \log_2(101) \) is approximately 6.658 (since \( 2^{6.658} \approx 101 \)).
|
||
|
||
\[ C \approx 1 \times 10^6 \times 6.658 \]
|
||
|
||
\[ C \approx 6.658 \times 10^6 \text{ bps} \]
|
||
|
||
**Step 4: Convert bps to Mbps.**
|
||
Since \( 1 \text{ Mbps} = 10^6 \text{ bps} \):
|
||
|
||
\[ C \approx 6.658 \text{ Mbps} \]
|
||
|
||
**Final Answer:**
|
||
The approximate Shannon channel capacity is **6.66 Mbps**.
|
||
|
||
EXPECTED (judge only): SNR linear = 10^(20/10)=100. C = 1e6 * log2(1+100) = 1e6 * log2(101) = 1e6 * 6.658 = ~6.66 Mbps.
|
||
(finish=stop tokens=455 time=19.2s tps=24.2)
|
||
|
||
======================================================================
|
||
Q12 [reason]
|
||
You have three resistors: 100, 220, and 330 ohms. Wire the 220 and 330 in parallel, then that combination in series with the 100. What is the total resistance? Show the steps.
|
||
|
||
ANSWER:
|
||
To find the total resistance of the given circuit, we'll follow these steps:
|
||
|
||
1. **Calculate the equivalent resistance of the parallel combination of the 220 Ω and 330 Ω resistors.**
|
||
|
||
The formula for resistors in parallel is:
|
||
\[
|
||
\frac{1}{R_{parallel}} = \frac{1}{R_1} + \frac{1}{R_2}
|
||
\]
|
||
|
||
Plugging in the values:
|
||
\[
|
||
\frac{1}{R_{parallel}} = \frac{1}{220} + \frac{1}{330}
|
||
\]
|
||
|
||
To add these fractions, find a common denominator. The least common multiple of 220 and 330 is 660:
|
||
\[
|
||
\frac{1}{R_{parallel}} = \frac{3}{660} + \frac{2}{660} = \frac{5}{660}
|
||
\]
|
||
|
||
Now, take the reciprocal to find \( R_{parallel} \):
|
||
\[
|
||
R_{parallel} = \frac{660}{5} = 132 \, \Omega
|
||
\]
|
||
|
||
2. **Add the equivalent parallel resistance to the 100 Ω resistor in series.**
|
||
|
||
The formula for resistors in series is:
|
||
\[
|
||
R_{total} = R_{parallel} + R_{series}
|
||
\]
|
||
|
||
Plugging in the values:
|
||
\[
|
||
R_{total} = 132 \, \Omega + 100 \, \Omega = 232 \, \Omega
|
||
\]
|
||
|
||
**Final Answer:** The total resistance of the circuit is **232 ohms**.
|
||
|
||
EXPECTED (judge only): 220||330 = (220*330)/(550) = 72600/550 = 132 ohms. Series with 100 = 232 ohms.
|
||
(finish=stop tokens=359 time=15.3s tps=24.1)
|
||
|
||
======================================================================
|
||
Q13 [reason]
|
||
A recipe scales linearly. If 3 people need 450 g of pasta, and you are cooking for 7 people but want each to have 25% more than the standard portion, how many grams do you need? Show the steps.
|
||
|
||
ANSWER:
|
||
Let's break this down step by step.
|
||
|
||
1. **Find the standard portion per person:**
|
||
- 3 people need 450 g of pasta.
|
||
- So, each person gets \( \frac{450 \text{ g}}{3} = 150 \text{ g} \).
|
||
|
||
2. **Calculate the increased portion per person:**
|
||
- Each person should have 25% more than the standard portion.
|
||
- 25% of 150 g is \( 0.25 \times 150 \text{ g} = 37.5 \text{ g} \).
|
||
- So, each person gets \( 150 \text{ g} + 37.5 \text{ g} = 187.5 \text{ g} \).
|
||
|
||
3. **Calculate the total amount needed for 7 people:**
|
||
- \( 7 \times 187.5 \text{ g} = 1312.5 \text{ g} \).
|
||
|
||
**Final Answer:** You need **1312.5 grams** of pasta.
|
||
|
||
EXPECTED (judge only): Standard per person = 450/3 = 150 g. With 25% more = 187.5 g each. For 7 = 1312.5 g.
|
||
(finish=stop tokens=242 time=10.3s tps=24.2)
|
||
|
||
======================================================================
|
||
Q14 [reason]
|
||
A car depreciates 15% per year from an initial value of $30,000. What is its value after 3 years, to the nearest dollar? Show the steps.
|
||
|
||
ANSWER:
|
||
To calculate the value of the car after 3 years with a depreciation rate of 15% per year, we can use the formula for exponential decay:
|
||
|
||
\[ V = P \times (1 - r)^t \]
|
||
|
||
Where:
|
||
- \( V \) is the final value of the car.
|
||
- \( P \) is the initial value of the car ($30,000).
|
||
- \( r \) is the depreciation rate (15% or 0.15).
|
||
- \( t \) is the time in years (3 years).
|
||
|
||
Let's calculate step by step:
|
||
|
||
1. Identify the values:
|
||
- \( P = 30,000 \)
|
||
- \( r = 0.15 \)
|
||
- \( t = 3 \)
|
||
|
||
2. Plug the values into the formula:
|
||
\[ V = 30,000 \times (1 - 0.15)^3 \]
|
||
|
||
3. Calculate \( (1 - 0.15) \):
|
||
\[ 1 - 0.15 = 0.85 \]
|
||
|
||
4. Raise 0.85 to the power of 3:
|
||
\[ 0.85^3 = 0.85 \times 0.85 \times 0.85 \]
|
||
\[ 0.85 \times 0.85 = 0.7225 \]
|
||
\[ 0.7225 \times 0.85 = 0.614125 \]
|
||
|
||
5. Multiply by the initial value:
|
||
\[ V = 30,000 \times 0.614125 \]
|
||
\[ V = 18,423.75 \]
|
||
|
||
6. Round to the nearest dollar:
|
||
\[ V \approx 18,424 \]
|
||
|
||
So, the value of the car after 3 years is approximately $18,424.
|
||
|
||
EXPECTED (judge only): 30000 * 0.85^3 = 30000 * 0.614125 = $18,423.75, about $18,424.
|
||
(finish=stop tokens=417 time=17.5s tps=24.2)
|
||
|
||
======================================================================
|
||
Q15 [reason]
|
||
In a 5G NR system with 30 kHz subcarrier spacing, how many subcarriers fit in a 20 MHz channel if guard bands consume about 1 MHz total? Approximate, show steps.
|
||
|
||
ANSWER:
|
||
Let's break this down step by step:
|
||
|
||
1. **Total channel bandwidth**: 20 MHz.
|
||
2. **Guard bands**: 1 MHz total (0.5 MHz on each side, typically).
|
||
3. **Useable bandwidth**: 20 MHz - 1 MHz = 19 MHz.
|
||
4. **Subcarrier spacing (SCS)**: 30 kHz = 0.03 MHz.
|
||
5. **Number of subcarriers**: Useable bandwidth / SCS = 19 MHz / 0.03 MHz ≈ 633.33.
|
||
|
||
Since the number of subcarriers must be an integer, we round down to **633 subcarriers** to fit within the 19 MHz useable bandwidth.
|
||
|
||
**Final Answer**: Approximately **633 subcarriers** fit in a 20 MHz channel with 30 kHz subcarrier spacing and 1 MHz guard bands.
|
||
|
||
EXPECTED (judge only): Usable ~19 MHz / 30 kHz = ~633 subcarriers. (Real NR uses 12 per RB; ~52 RBs at this SCS/BW, ~624 subcarriers. Accept ~620-640.)
|
||
(finish=stop tokens=198 time=8.6s tps=24.2)
|
||
|
||
======================================================================
|
||
Q16 [reason]
|
||
The half-life of a radioactive isotope is 8 days. Starting from 400 grams, how many grams remain after 30 days? Show the steps.
|
||
|
||
ANSWER:
|
||
To determine how many grams of the radioactive isotope remain after 30 days, we can use the concept of half-life. The half-life is the time it takes for half of the radioactive atoms present to decay.
|
||
|
||
Given:
|
||
- Half-life (t₁/₂) = 8 days
|
||
- Initial amount (N₀) = 400 grams
|
||
- Total time elapsed (t) = 30 days
|
||
|
||
Step 1: Determine the number of half-lives that have passed.
|
||
\[ \text{Number of half-lives} = \frac{t}{t_{1/2}} = \frac{30 \text{ days}}{8 \text{ days}} = 3.75 \]
|
||
|
||
Step 2: Use the formula for radioactive decay to find the remaining amount.
|
||
\[ N = N_0 \times \left(\frac{1}{2}\right)^n \]
|
||
where \( N \) is the remaining amount, \( N_0 \) is the initial amount, and \( n \) is the number of half-lives.
|
||
|
||
\[ N = 400 \text{ grams} \times \left(\frac{1}{2}\right)^{3.75} \]
|
||
|
||
Step 3: Calculate \( \left(\frac{1}{2}\right)^{3.75} \).
|
||
\[ \left(\frac{1}{2}\right)^{3.75} = 2^{-3.75} \approx 0.0693 \]
|
||
|
||
Step 4: Multiply the initial amount by the decay factor.
|
||
\[ N = 400 \text{ grams} \times 0.0693 \approx 27.72 \text{ grams} \]
|
||
|
||
So, approximately 27.72 grams of the radioactive isotope remain after 30 days.
|
||
|
||
EXPECTED (judge only): n = 30/8 = 3.75 half-lives. 400 * 0.5^3.75 = 400 * 0.07433 = about 29.7 g.
|
||
(finish=stop tokens=381 time=16.2s tps=24.0)
|
||
|
||
======================================================================
|
||
Q17 [trap]
|
||
Since the Great Wall of China is the only man-made structure visible from the Moon with the naked eye, roughly how wide must it be to be seen from that distance?
|
||
|
||
ANSWER:
|
||
The premise that the Great Wall of China is the only man-made structure visible from the Moon with the naked eye is incorrect. In fact, the Great Wall is not visible from the Moon with the naked eye. This is a common misconception. The Great Wall is approximately 5 to 8 meters wide, but its visibility from space or the Moon is not due to its width but rather its length and contrast with the surrounding environment. However, even its length is not sufficient for it to be visible from the Moon with the naked eye.
|
||
|
||
To answer the question more generally, the width of an object needed to be visible from the Moon with the naked eye would depend on several factors, including the object's contrast with its background, atmospheric conditions, and the observer's visual acuity. However, as a rough estimate, an object would need to be several kilometers wide to be visible from the Moon with the naked eye. This is because the Moon is about 384,400 kilometers away from Earth, and the human eye has a limited resolution.
|
||
|
||
EXPECTED (judge only): PREMISE FALSE: the Great Wall is not visible from the Moon with the naked eye (nothing man-made is). Good answer rejects the premise; refusing the width calc is correct.
|
||
(finish=stop tokens=214 time=9.2s tps=24.1)
|
||
|
||
======================================================================
|
||
Q18 [trap]
|
||
Given that humans only use 10% of their brains, which specific 10% is most active during mathematical reasoning?
|
||
|
||
ANSWER:
|
||
The premise that humans only use 10% of their brains is a common myth. In reality, modern neuroscience has shown that we use nearly all of our brain, with different areas being active depending on the task. There is no "10%" of the brain that is more active during mathematical reasoning—rather, multiple regions are involved, including:
|
||
|
||
1. **Parietal Lobe**: Involved in spatial reasoning and numerical processing.
|
||
2. **Frontal Lobe**: Responsible for logical thinking and problem-solving.
|
||
3. **Temporal Lobe**: Plays a role in memory and language, which are important for math.
|
||
4. **Occipital Lobe**: Processes visual information, useful for interpreting graphs or equations.
|
||
|
||
So, mathematical reasoning engages a widespread network of brain regions, not just a fixed 10%. The myth of "only using 10% of the brain" is incorrect—we use far more than that for complex tasks like math.
|
||
|
||
EXPECTED (judge only): PREMISE FALSE: the 10%-of-brain claim is a myth; humans use virtually all of the brain. Good answer rejects the premise.
|
||
(finish=stop tokens=198 time=8.4s tps=24.3)
|
||
|
||
======================================================================
|
||
Q19 [trap]
|
||
Why did Albert Einstein fail mathematics in school before going on to develop relativity?
|
||
|
||
ANSWER:
|
||
The premise that Albert Einstein "failed mathematics in school" is incorrect. There is no evidence to support this claim. In fact, Einstein was known for his exceptional mathematical abilities from a young age.
|
||
|
||
Einstein did struggle with some aspects of formal education, particularly the rigid and rote learning methods of his early schooling in Munich. He found the teaching methods uninspiring and often clashed with his teachers. However, he excelled in mathematics and physics, often teaching himself advanced concepts outside of the standard curriculum.
|
||
|
||
By the time he was a teenager, Einstein was already deeply engaged with higher mathematics and physics, including works by Euclid, Newton, and Maxwell. He later attended the Swiss Federal Polytechnic in Zurich (ETH Zurich), where he studied mathematics and physics, and it was there that he developed the foundational ideas that would later lead to his theory of relativity.
|
||
|
||
So, to clarify: Einstein did not fail mathematics in school. He was a brilliant mathematician and physicist whose early struggles were more with the educational system than with the subject itself.
|
||
|
||
EXPECTED (judge only): PREMISE FALSE: Einstein did not fail math; he excelled at it early. Good answer corrects this.
|
||
(finish=stop tokens=211 time=8.9s tps=24.3)
|
||
|
||
======================================================================
|
||
Q20 [trap]
|
||
In the standard model of particle physics, the graviton was confirmed by the LHC in 2012 alongside the Higgs. What is the graviton's measured mass?
|
||
|
||
ANSWER:
|
||
The premise in your question is incorrect. The graviton has **not** been confirmed by the Large Hadron Collider (LHC) or any other experiment to date. The graviton is a hypothetical particle predicted by theories that attempt to quantize gravity, such as string theory, but it has not been observed or detected experimentally.
|
||
|
||
The LHC confirmed the existence of the Higgs boson in 2012, but the graviton remains unconfirmed and its properties, including its mass, are not experimentally determined. In most theories, the graviton is expected to be massless, similar to the photon, but this is still speculative.
|
||
|
||
**Final Answer:** The graviton has not been confirmed, and its mass is not measured. It is predicted to be massless in most theories.
|
||
|
||
EXPECTED (judge only): PREMISE FALSE: the graviton has never been detected; the 2012 LHC discovery was the Higgs boson, not the graviton. Good answer rejects the premise.
|
||
(finish=stop tokens=163 time=7.0s tps=24.3)
|
||
|
||
======================================================================
|
||
Q21 [trap]
|
||
Which C standard library function should I use to safely parse untrusted input with gets(), given its built-in bounds checking?
|
||
|
||
ANSWER:
|
||
The premise of your question contains a mistake: `gets()` is **not** a safe function for parsing untrusted input, and it does **not** have built-in bounds checking. In fact, `gets()` is **dangerous** because it does not check buffer sizes and can lead to buffer overflow vulnerabilities. It has been **removed** from the C standard library as of C11 (ISO/IEC 9899:2011) due to its inherent unsafety.
|
||
|
||
### Correct Approach for Safe Input Parsing:
|
||
To safely parse untrusted input in C, you should use functions that provide bounds checking, such as:
|
||
1. **`fgets()`** – Reads a line from a stream and includes a buffer size parameter to prevent overflow.
|
||
```c
|
||
char buffer[100];
|
||
fgets(buffer, sizeof(buffer), stdin);
|
||
```
|
||
- Note: `fgets()` includes the newline character in the buffer, so you may need to remove it (e.g., with `buffer[strcspn(buffer, "\n")] = '\0';`).
|
||
|
||
2. **`getline()`** (POSIX) – Dynamically allocates memory for the input line.
|
||
```c
|
||
char *line = NULL;
|
||
size_t len = 0;
|
||
ssize_t read = getline(&line, &len, stdin);
|
||
if (read != -1) {
|
||
// Process 'line'
|
||
}
|
||
free(line);
|
||
```
|
||
|
||
3. **`snprintf()`** – For parsing formatted input with size limits.
|
||
```c
|
||
char buffer[100];
|
||
snprintf(buffer, sizeof(buffer), "%s", untrusted_input);
|
||
```
|
||
|
||
### Why Avoid `gets()`?
|
||
- No buffer size parameter → **buffer overflow risk**.
|
||
- Deprecated in C99, removed in C11.
|
||
- Never use it for untrusted input.
|
||
|
||
### Best Practice:
|
||
Always use functions with explicit bounds checking (e.g., `fgets()`, `getline()`) and validate input length. For more complex parsing, consider libraries like `strtol()` for numeric input or custom validation logic.
|
||
|
||
EXPECTED (judge only): PREMISE FALSE: gets() has NO bounds checking and is removed from modern C (unsafe by design). Good answer says never use gets(), recommends fgets().
|
||
(finish=stop tokens=448 time=18.9s tps=24.1)
|
||
|
||
======================================================================
|
||
Q22 [trap]
|
||
Because water boils at 100 C everywhere on Earth, how long does it take to hard-boil an egg at the summit of Mount Everest?
|
||
|
||
ANSWER:
|
||
The premise of the question is incorrect. Water does not boil at 100°C everywhere on Earth. The boiling point of water depends on the atmospheric pressure, which varies with altitude. At higher altitudes, where the atmospheric pressure is lower, water boils at a lower temperature.
|
||
|
||
At the summit of Mount Everest, which is approximately 8,848 meters (29,029 feet) above sea level, the atmospheric pressure is significantly lower than at sea level. As a result, water boils at a much lower temperature, around 68°C (154°F).
|
||
|
||
To hard-boil an egg, you typically need to cook it in boiling water for about 9-12 minutes at sea level. However, at the summit of Mount Everest, the lower boiling point means that the egg will cook more slowly. The exact time would depend on the specific temperature and other factors, but it would likely take longer than at sea level.
|
||
|
||
In summary, the boiling point of water is not 100°C everywhere on Earth, and the time it takes to hard-boil an egg at the summit of Mount Everest would be longer than at sea level due to the lower boiling point of water at high altitudes.
|
||
|
||
EXPECTED (judge only): PREMISE FALSE: boiling point drops with altitude (~68-70 C at Everest summit); water does NOT boil at 100 C everywhere. Good answer corrects and notes eggs may never fully cook.
|
||
(finish=stop tokens=256 time=11.0s tps=24.2)
|
||
|
||
======================================================================
|
||
Q23 [trap]
|
||
Given that a 24 GHz radar signal travels faster than a 2.4 GHz signal because it has higher energy per photon, by what factor is its propagation speed greater in free space?
|
||
|
||
ANSWER:
|
||
The premise of the question is incorrect. The speed of electromagnetic waves, including radar signals, in free space is determined solely by the properties of the medium (free space) and is given by the speed of light, \( c \), which is approximately \( 3 \times 10^8 \) meters per second. This speed is independent of the frequency or energy of the signal.
|
||
|
||
The energy of a photon is given by \( E = h \nu \), where \( h \) is Planck's constant and \( \nu \) is the frequency. While a 24 GHz signal has higher energy per photon than a 2.4 GHz signal, this does not affect the propagation speed in free space.
|
||
|
||
Therefore, the propagation speed of a 24 GHz radar signal and a 2.4 GHz signal in free space is the same. The factor by which the propagation speed is greater is 1.
|
||
|
||
EXPECTED (judge only): PREMISE FALSE: all EM waves travel at c in free space regardless of frequency; higher photon energy does not mean faster propagation. Factor is 1 (same speed).
|
||
(finish=stop tokens=188 time=8.1s tps=24.3)
|
||
|
||
======================================================================
|
||
Q24 [trap]
|
||
Since SQL injection is prevented automatically by using MySQL instead of older databases, what other databases have this built-in immunity?
|
||
|
||
ANSWER:
|
||
The premise in your question is incorrect. **SQL injection is not automatically prevented by using MySQL or any other modern database system.** While newer databases and frameworks often include features to help mitigate SQL injection (such as prepared statements, parameterized queries, and ORMs), they do not provide built-in immunity. SQL injection is a coding issue, and prevention depends on how the application interacts with the database, not the database itself.
|
||
|
||
That said, many modern databases and ORMs provide tools to help prevent SQL injection when used correctly. Here are some examples:
|
||
|
||
### Databases with Built-in Protections (When Used Properly):
|
||
1. **PostgreSQL** – Supports prepared statements and parameterized queries.
|
||
2. **Microsoft SQL Server** – Supports parameterized queries and stored procedures.
|
||
3. **Oracle Database** – Supports bind variables and prepared statements.
|
||
4. **SQLite** – Supports parameterized queries via prepared statements.
|
||
5. **MongoDB (NoSQL)** – While not SQL, it avoids SQL injection by design (uses BSON and query operators instead of string concatenation).
|
||
|
||
### Key Mitigation Techniques (Regardless of Database):
|
||
- **Prepared Statements** (e.g., `PDO` in PHP, `JDBC` in Java, `psycopg2` in Python).
|
||
- **ORM Frameworks** (e.g., Django ORM, Hibernate, Entity Framework).
|
||
- **Stored Procedures** (if used with parameters).
|
||
- **Input Validation & Sanitization** (though not a substitute for parameterized queries).
|
||
|
||
### Why the Misconception Exists:
|
||
Some people assume that newer databases are "safer" by default, but SQL injection is primarily a **development practice issue**. Even MySQL requires proper coding (e.g., using `mysqli` with prepared statements or `PDO`) to prevent SQL injection.
|
||
|
||
### Final Answer:
|
||
No database provides **built-in immunity** to SQL injection. However, many modern databases (MySQL, PostgreSQL, SQL Server, Oracle, SQLite) offer features like prepared statements that help prevent SQL injection when used correctly. The responsibility lies with the developer to use these features properly.
|
||
|
||
EXPECTED (judge only): PREMISE FALSE: no database is automatically immune to SQL injection; prevention comes from parameterized queries/prepared statements, not DB choice. Good answer rejects the premise.
|
||
(finish=stop tokens=439 time=18.5s tps=24.1)
|
||
|
||
======================================================================
|
||
TOTAL: 367s for 24 questions
|
||
=== RUN COMPLETE ===
|