Talk:Leitner system

This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Education Low‑importance This article is within the scope of WikiProject Education, a collaborative effort to improve the coverage of education and education-related topics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.EducationWikipedia:WikiProject EducationTemplate:WikiProject Educationeducation Low This article has been rated as Low-importance on the project's importance scale.

This is similar to priority queues in a simple operating system. When a task is suspended to run another one, it is put into one of several queues: queue[0] has the highest priority tasks, queue[1] the next lower priority and so on. To find a high priority jobs, the machine can check whether queue[0] is non-empty and pull out the first task. No searching has to be done. The advantage is similar to that of the paper card file, which ensures that all the cards in one file are of the same priority. In other words, the cards have a "priority" property, which has to change dynamically, and so is encoded by box position, rather than being written on or attached to the card. KazKylheku (talk) 17:32, 14 December 2010 (UTC)Reply

First the examples are a little difficult to understand.

From what I gather, (Example 2) says the user has 10 decks (it could be represented by x)

And the decks are numbered as follows with the numbers following = to the session for which they are studied. So far I can only understand how the first session number is determined and the second one is determined.

n = session number (starting at 0) x = number of decks for the user

To determine the first number of the session use session(n) = n

To determine the last number of the session use if n = min(x) = 0 then session(n) = max(x) else session(n) = n-1

The middle numbers seem haphazard...

BUT all this equally confusing stuff to say that other sources that describe this system seem to have a completely different model setup than that described here. (example: http://www.flashcardexchange.com/docs/leitner)

If this is a valid model than I suggest that a small *note be attached to let the reader know that it might not be the model they expect to see from most easily accessible examples. Else, perhaps it would be pest to alter the examples to fit the models presenting on that page, or any other page that seems similar.

The math I put is being cleaned out by wiki, click edit to see what I put in those sections, and or correct it since I don't know how. Thx.l

• 
  Leitner System animation

During Session 2, the student is attempting to answer questions A,C [Box 1] and B,D,E,F [Box 2]. The student correctly answers C [Box 1] and B,D [Box 2]. A remains in [Box 1], C moves to [Box 2].

What should happen next: E,F move back to [Box 1] and B,D move to [Box 3].
What the illustration shows: E,F move back to [Box 1] and B,D remain in [Box 2].

https://www.cardsystem.net/ This other system is similar, but more like a calendar. — Preceding unsigned comment added by 62.240.134.102 (talk) 10:02, 20 August 2023 (UTC)Reply

means decomposition by electricity through its aqueous @ 41.223.73.183 (talk) 12:49, 10 May 2023 (UTC)Reply