niklas

Since 2025-02-24 · 600 days · Last sync 2026-08-21 10:17

Overview
12,200
Reviews
86.7%
Retention
0
Day Streak
45.4h
Study Time
5,043
Cards
1,112
Mature
13.4s
Avg Time
93.1d
Avg Interval
36d
Best Streak
1,297
Due Now
Activity
Review Activity — Last 12 Months
Study Hours (All Time)
Upcoming Reviews 1,295 overdue
Card Analysis
Card States
Answer Buttons
Interval Distribution
Card Progress by Deck 48.8% overall
Deck Introduced New Left Total Progress
ETH2. SemesterPProg 390 564 954
40.9%
ETH2. SemesterAnalysis 254 406 660
38.5%
ETH2. SemesterDDCA 20 406 426
4.7%
ETHScience in PerspectiveAdvanced Finance 0 84 84
0.0%
ETHMajor: Information and Data ProcessingIML 0 23 23
0.0%
ETH2. SemesterA&W 664 18 682
97.4%
ETH1. SemesterLinAlg 465 0 465
100.0%
ETH1. SemesterA&D 529 0 529
100.0%
ETH1. SemesterEProg 205 0 205
100.0%
ETH1. SemesterDiskMat 1,015 0 1,015
100.0%
Memory Model
56.7d
Avg Stability
2.76 / 10
Avg Difficulty
4.1%
Avg Retrievability
60.8%
At Risk (1,923 cards)
35.7d
Median Stability
51d
Memory Half-Life
Stability Distribution
Difficulty Distribution
Retrievability Snapshot — Right Now
Memory by Deck
Deck Cards Avg Stability Avg Difficulty Avg Retrievability
ETH::2. Semester::PProg 364 98.8d 2.98 0%
ETH::2. Semester::Analysis 252 74.1d 2.78 0%
ETH::1. Semester::A&D 496 60.8d 2.97 2.9%
ETH::1. Semester::DiskMat 945 51.3d 2.4 2.3%
ETH::2. Semester::A&W 517 51.1d 3.45 0%
ETH::1. Semester::EProg 205 47.4d 1.78 12.6%
ETH::1. Semester::LinAlg 362 26.9d 2.64 5.2%
ETH::2. Semester::DDCA 20 4.2d 4.33 0%
FSRS Model — Initial Stability by Deck
Review Insights
Review Time vs Answer Button
Speed by Deck
Deck Reviews Median Avg <3s 3–10s 10–20s 20–30s 30s+ Trend
ETH1. SemesterDiskMat 3,745 9.5s 13.4s 4.2% 48.2% 29.4% 9.4% 8.8%
ETH2. SemesterA&W 2,146 10.3s 15.6s 5.6% 41.9% 28.9% 10.1% 13.4%
ETH1. SemesterA&D 2,103 9.7s 15.0s 4.3% 46.6% 27.9% 8.5% 12.6%
ETH2. SemesterPProg 1,298 6.4s 9.0s 10.2% 64.7% 18.2% 2.7% 4.2%
ETH1. SemesterLinAlg 1,187 9.3s 13.3s 6.7% 46.1% 30.1% 8.3% 8.8%
ETH2. SemesterAnalysis 1,078 10.0s 14.4s 4.6% 44.8% 31.0% 9.6% 10.0%
ETH1. SemesterEProg 598 6.0s 7.9s 9.4% 68.1% 18.1% 2.7% 1.8%
ETH2. SemesterDDCA 45 7.2s 11.6s 20.0% 53.3% 13.3% 6.7% 6.7%
Sessions
221
Sessions
16.7m
Avg Session
Session Length Distribution
Intra-Session Fatigue Curve
Fun Stats
Evening Fucker
6,898 reviews 6-11pm
11.1%
Human — 690 lapses across all reviews
Balanced
9.0s median — 5.7% under 3s, 9.4% over 30s
3
Mostly Chill — sessions ending in 3+ consecutive fails
0
Cards Buried — 0 by you, 0 by scheduler
64.9m
Machine — 219 cards on 2026-01-16
22:00
Peak Study Hour
19.5%
Reviews After Midnight
0.3
Lapses / Mature Card
5.7%
Sub-3s Reviews
12.6m
Avg Session (5m gap)
3
Worst Again Streak
0
User Buried Now
0
Sched Buried Now
Review Speed Distribution
Marathon Session Types
Fastest Cards
Front Avg Time Ease Interval Reviews
\[ {{c1::\sin^2\theta + \cos^2\theta :: \text{Identity} }} = {{c2::1}} \] 1.6s 280% 272d 3
Hat ein Ikosaeder einen Hamiltonkreis? 2.7s 280% 95d 6
A statement or instruction is {{c1::(truly) atomic}} if it is executed by the CPU in a {{c2::single, 2.8s 265% 36d 3
Every Java program has at least one execution thread: the {{c1::main thread}}. 2.9s 280% 570d 3
{{c1::synchronized}} is a Java keyword, enforcing {{c2::mutual exclusion for a critical section via 2.9s 280% 665d 3
{{c1::\(\sum_{i = 1}^{n} \sum_{i = 1}^{n} 1\)::Sum}} \(=\) {{c2:: \(n^2\)}} 3.0s 265% 239d 2
What is \(\log x\) in AuD classes? 3.0s 265% 120d 3
Creating a Thread object does not {{c1::start}} a thread. 3.0s 280% 604d 3
Tasks:Execute code{{c1::Spawn other tasks (= start in JT, submit in ExS, fork i 3.1s 265% 30d 3
\[ \sin\!\left(\frac{3\pi}{2}\right) = {{c1::-1}} \] 3.2s 280% 288d 3
Zwei Blöcke schneiden sich - wenn überhaupt - immer in {{c1::einem Artikulationsknoten}}. 3.2s 280% 263d 3
{{c1::image-occlusion:rect:left=.3945:top=.0588:width=.1655:height=.1476:oi=1}}{{c2::image-occlu 3.2s 280% 75d 4
Threads can have a priority between {{c1::1}} and {{c1::10}}. 3.2s 265% 290d 3
In graph theory, a {{c2::closed walk (Zyklus)}} is a {{c1::walk where \(v_0 = v_n\) (sta 3.3s 265% 233d 4
Maximum und Minimum sind {{c1::eindeutig bestimmte Kenngrössen}} einer Menge, sofern {{c2::si 3.3s 280% 326d 4
Hardest Cards
Front Lapses Ease Interval Reviews
Ein Graph \(G = (V, E)\) heisst {{c1::\(k\)-zusammenhängend}}, falls {{c2::\(|V| \geq k + 1\) 6 205% 3d 28
Dreiecksungleichung (Subtraktion) 5 135% 2d 17
Für alle \( k \) gilt: jeder \( k \)-reguläre bipartite Graph enthält {{c1::ein perfektes Mat 5 180% 12d 24
A program has a {{c1::data race}} if, {{c2::during any possible execution, a memory location could b 5 195% 9d 21
A program has a {{c1::race condition}} if, {{c2::during any possible execution with the same inputs, 5 195% 11d 14
{{c3::image-occlusion:rect:left=.1591:top=.8923:width=.7185:height=.0742}}{{c2::image-occlusion: 5 210% 13d 19
Eine Folge {{c1::konvergiert}} \(\Longleftrightarrow\) Sie ist {{c2:: eine Cauchy-F 4 170% 1d 15
Sei \(G = (V, E)\) ein Graph. Dann gilt: {{c1::\(G\) is \(k\)-knoten-zusa 4 185% 19d 16
Choose a tight bound!\({{c1::O(n)}} \leq {{c2::O(\log(n!))}}\) 4 200% 8d 12
Seien \(A_1, \ldots, A_n\) paarweise disjunkte Ereignisse und sei \(B \subseteq A_1 \cup \cdots \cup 4 200% 2d 16
Es gilt immer:{{c1::(Knoten-)Zusammenhang}} ≤ {{c1::Kanten-Zusamm 4 215% 11d 18
In \( k \)-regulären bipartiten Graphen kann man in Zeit \( O({{c1::|E|}}) \) ein perfektes Matching 4 230% 9d 16
Formale Definition der low-Werte:\(low[v] = {{c1::\min \left( dfs[v], \min_{(v,w) \in E} \be 4 260% 10d 19
{{c1:: \(\sum_{i = 1}^{n} i^3\)::Sum}}  \(=\) {{c2::\(\frac{n^2(n + 1)^2}{4}\)}}  3 190% 2d 14
\[ \tan\!\left(\frac{5\pi}{3}\right) = {{c1::-\sqrt{3} }} \] 3 190% 16d 14