tomas

Since 2024-12-13 · 503 days · Last sync 2026-04-21 20:40

Overview
3,666
Reviews
92.7%
Retention
0
Day Streak
18.5h
Study Time
3,665
Cards
454
Mature
18.2s
Avg Time
46.5d
Avg Interval
34d
Best Streak
504
Due Now
Activity
Review Activity — Last 12 Months
Study Hours (All Time)
Upcoming Reviews 497 overdue
Card Analysis
Card States
Answer Buttons
Interval Distribution
Card Progress by Deck 37.2% overall
Deck Introduced New Left Total Progress
ETH2. SemesterA&W 80 298 378
21.2%
ETH2. SemesterAnalysis 72 262 334
21.6%
ETH2. SemesterPProg 210 242 452
46.5%
ETH2. SemesterDDCA 82 90 172
47.7%
ETH1. SemesterEProg 205 0 205
100.0%
ETH1. SemesterLinAlg 465 0 465
100.0%
ETH1. SemesterDiskMat 1,015 0 1,015
100.0%
ETH1. SemesterA&D 537 0 537
100.0%
ETHScience in PerspectiveAdvanced Finance 84 0 84
100.0%
ETHMajor: Information and Data ProcessingIML 23 0 23
100.0%
Memory Model
43.2d
Avg Stability
2.7 / 10
Avg Difficulty
29.5%
Avg Retrievability
63.6%
At Risk (662 cards)
28.4d
Median Stability
39d
Memory Half-Life
Stability Distribution
Difficulty Distribution
Retrievability Snapshot — Right Now
Memory by Deck
Deck Cards Avg Stability Avg Difficulty Avg Retrievability
ETH::1. Semester::A&D 231 80.4d 2.28 44.0%
ETH::1. Semester::EProg 15 65.9d 1.44 0%
ETH::1. Semester::LinAlg 101 59.2d 1.45 0%
ETH::Science in Perspective::Advanced Finance 84 56.1d 3.36 54.5%
ETH::2. Semester::PProg 202 30.9d 2.81 17.6%
ETH::2. Semester::Analysis 72 25.8d 4.39 22.9%
ETH::2. Semester::A&W 80 21.1d 3.96 19.2%
ETH::1. Semester::DiskMat 175 20.7d 1.9 0%
ETH::2. Semester::DDCA 81 16.4d 3.8 14.8%
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
ETH2. SemesterPProg 913 10.4s 13.2s 0.4% 45.1% 40.6% 8.5% 5.3%
ETH1. SemesterA&D 904 15.0s 20.3s 0.7% 26.2% 37.4% 15.5% 20.2%
ETHScience in PerspectiveAdvanced Finance 391 11.0s 13.6s 0.5% 43.2% 37.6% 12.8% 5.9%
ETH1. SemesterDiskMat 341 24.6s 27.3s 0.3% 9.4% 29.0% 21.7% 39.6%
ETH2. SemesterDDCA 303 10.1s 14.7s 1.0% 47.9% 28.1% 12.2% 10.9%
ETH2. SemesterA&W 288 17.0s 23.9s 0.7% 23.3% 33.0% 14.6% 28.5%
ETH2. SemesterAnalysis 269 13.3s 17.8s 0.4% 27.5% 44.2% 13.8% 14.1%
ETH1. SemesterLinAlg 233 18.0s 21.7s 1.3% 18.5% 36.1% 21.0% 23.2%
ETH1. SemesterEProg 24 10.0s 11.6s 0.0% 50.0% 41.7% 0.0% 8.3%
Sessions
125
Sessions
13.1m
Avg Session
Session Length Distribution
Intra-Session Fatigue Curve
Fun Stats
Night Owl
1,147 reviews 11pm-5am
6.8%
Sticky — 104 lapses across all reviews
Deep Thinker
13.3s median — 0.6% under 3s, 16.0% over 30s
0
Zen Master — sessions ending in 3+ consecutive fails
0
Cards Buried — 0 by you, 0 by scheduler
53.7m
Machine — 114 cards on 2026-01-03
23:00
Peak Study Hour
31.3%
Reviews After Midnight
0.2
Lapses / Mature Card
0.6%
Sub-3s Reviews
7.8m
Avg Session (5m gap)
0
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
What gate is this? 3.4s 250% 49d 4
A large shareholder is called a {{c1:: block holder}} 3.5s 250% 83d 4
What gates is this? 3.9s 250% 22d 3
\(A\bullet B\) signifies {{c1::"A and B"}}. 3.9s 250% 23d 3
\(A+B\) signifies {{c1::"A or B"}}. 4.1s 250% 21d 3
The shortest walk is always {{c1::a path}}. 4.2s 250% 43d 3
If a vertex has degree 0, what do we call it? 4.5s 265% 190d 3
In Java, each object can be used as a {{c1::lock}}. 4.5s 250% 29d 3
Path 4.6s 265% 221d 3
The strongest action the board can take is {{c1::firing the CEO}}. 4.6s 250% 83d 4
Which gate is this? 4.6s 250% 26d 3
Codetermination is prevalent in {{c1::Germany}} because {{c2::it is mandated by law}}. 4.7s 250% 45d 3
p-type transistors are good at pulling {{c1::up}} the voltage. 4.7s 250% 45d 4
With {{c1::fine granularity}}, work is split into {{c2::small tasks}}. This can be {{c3::parallelize 4.7s 250% 61d 4
Hat ein Ikosaeder einen Hamiltonkreis? 5.0s 250% 21d 3
Hardest Cards
Front Lapses Ease Interval Reviews
Process context includes:{{c1::CPU state (registers, program counter)}}{{c2::pr 4 170% 13d 17
In graph theory, a {{c2::cycle (Kreis)}} is a {{c1::closed walk without repeated vertices}} a 2 210% 50d 12
Runtime of operations in an adjacency matrix? 2 210% 30d 12
{{c1::Divide and conquer style parallelism (also called recursive splitting)}} means: solve a proble 2 210% 4d 7
The maximum possible speedup ({{c1::parallelism}}) is {{c2::\(\frac{T_1}{T_\infty} \)}}. 2 210% 12d 11
{{c1::Scheduling overhead}} is the {{c2::extra time spent by the system or the algorithm}} to distri 2 210% 9d 10
{{c1::Work partitioning}} is the {{c2::split-up of a program}} into smaller tasks that can be execut 2 210% 2d 8
Agency problems include a manager:{{c1:: not putting in sufficient effort}}{{c2 2 210% 2d 11
A graph \(G\) is {{c1::connected (Zusammenhängend)}} if {{c2::for every two vertice 1 230% 93d 7
In a directed graph, for the edge \(e = (u, v)\), \(u\) is the {{c1::direct predecess 1 230% 17d 8
The {{c1::out-degree \(\deg_{\text{out} }(v)\) (Ausgangsgrad)}} of a vertex in a di 1 230% 27d 5
What is the Cut-Property (Schnittprinzip)? 1 230% 19d 6
The distance \(d(u, v)\) in a directed graph is defined as {{c1:: shortest length of a wal 1 230% 46d 9
In BFS enter/leave ordering, the FIFO queue guarantees that {{c1:: the enter order 1 230% 57d 9
Find Closed Eulerian Path 1 230% 4d 5