JPS58215681A - Electronic learning apparatus - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to an improvement of an electronic learning machine such as a so-called multiplication table practice machine.

In recent years, with the development of electronic technology, a large number of Simi Puppy learning machines have been commercialized, one of which is a multiplication table practice machine for memorizing multiplication tables, which is an important basis of arithmetic. However, with the conventional method, you start learning after specifying which level you want to practice, input the answers to the multiplication table questions for that level sequentially, and output the correct/incorrect answers for that level. It's about memorizing the multiplication tables. Then, once all the questions for that stage have been asked, how many times did you answer correctly for that stage, or 10
The score is 0, and it ends with a display indicating whether or not you got a fine score. When I tried to practice the next multiplication table in the above row,
Since you have to specify which step you want to practice and start again, you don't have to worry about resetting each step when you want to practice 1st step, 2nd step, 3rd step, etc. This results in a decrease in the desire to memorize multiplication tables.

Moreover, for things like multiplication tables that have a strong memorization element to a certain extent, it is more effective to memorize them by going through the 1st row, 2nd row, and 30th row with a light sense of rhythm. If it is interrupted at each stage, the effect will not be as good.

In view of these points, the present invention achieves a predetermined accuracy rate (
For example, if you answered all questions correctly), that stage will be memorized and the questions will automatically move on to the next stage.On the other hand, if you did not reach the prescribed correct answer rate for a certain stage (for example, you failed) KL allows you to practice the row again (if you get a correct answer), and allows you to practice multiplication smoothly.

An embodiment of the present invention will be described with reference to the drawings. FIG. 1 is a block diagram showing the configuration of a multiplication table practice machine which is an electronic learning machine to which this embodiment is applied. The arithmetic processing circuit 4 receives various signals from the keyboard 7 having a numeric key 7-1 and a learning start key 7-2, and depending on the contents, the ROM is
(Pad 0nly Memory) 5 is controlled by a program built in in advance, and l'(A
M (几andom Access Memory)
6(7) It is configured to perform arithmetic processing on data, etc., send the resulting data to the display register 3, and drive the display 1 via the decoder driver 2 using the data.

Inside this box OM 5 is the 1st stage multiplication table, 1 x 0.1 x L
IX2・・・1×9.20-level multiplication table, 2×012
Multiplication problems for each stage are stored in the format x1.2x2...2x9.

Therefore, by reading out a multiplication problem using the control procedure shown in FIG. 2 and inputting this problem to the arithmetic processing circuit 4, the arithmetic processing circuit 4 calculates the input problem and uses the calculation result as the correct answer. It is stored in RAM6. The arithmetic processing circuit 4 then determines whether or not the answer entered from the keyboard 7 matches the correct answer.

Next, an example of a program for the multiplication table training machine stored in the ROM 5 will be explained with reference to the flowchart shown in FIG.

9 is a start step. In this step, enter the number key 7-1 to start the multiplication (for example, 5), then press the learning start key 7-2. (For example, 5×0) will ask you a multiplication problem.

10 is a step of display processing the display data. 1
Step 1 is a step for determining whether or not a numeric key has been pressed; if there is no key input, the process returns to display step 10;
This state will continue until key personnel are available. If there is a key human power, it is determined in step 12 whether the input answer is correct (Yes) or incorrect (No), and if it is NO, the process proceeds to step 13 where the number of incorrect answers is counted. A counting counter is incremented and the correct answer is then displayed in step 14. In order to display this correct answer for a certain period of time,
In the next timer step 15, it is determined whether a certain period of time has elapsed or not, and if the answer is NO, it waits until it becomes YES, and the display is continued during this period.The correct answer is then displayed after a certain period of time has passed.

If it is determined that the answer is correct in step 12, step 1
At step 7, the correct answer is displayed, but in order to continue this display for a certain period of time, the process proceeds to timer step 15.

In this manner, when the timer step is displayed for a certain period of time (if YES), the process proceeds to the next step 16, and it is determined whether all the questions in that row have been asked.

If it is determined in step 16 that there are still questions remaining for a certain stage (if No), the process advances to step 21 where the next problem for that stage is read out from the ROM, and the read problem is returned to display step 10. be done. Also, if you decide that a certain level of questions has been completed (if Yes), proceed to step 1.
By determining whether the counter of 3 is 0 or other than 0, it is determined in determination step 18 whether there is an incorrect answer in that row, and if there is one or more incorrect answers (if Yes) Also, proceed to step 20 to process the questions from the beginning of the same column.
The questions read from the ROM 5 are returned to the display block 10 and displayed.

If there is no incorrect answer in that row, if the answer is No, the process advances to step 19 to proceed to the next step and process the questions, and the questions read here are returned to display step 10 and displayed.

Y in step 16 to determine whether one step has been completed
It is also possible to provide a block for displaying the score on the way from es to step 18, and a timer block for displaying the score for a certain period of time, so as to display the number of times for which the answer was correct in that stage.

As explained above, according to the present invention, each time a certain stage is completed, there is no need to re-set what stage to perform next, and if the correct answer rate for that stage is higher than that for a fixed number of stages, then You can move on to the next level smoothly, and if the correct answer rate is low, you can learn the same level repeatedly, and you will not lose your motivation to learn due to the hassle of operating the learning machine, and you will be able to learn multiplication. It will be extremely useful as it will be able to provide an ever-improving electronic learning machine.

[Brief explanation of drawings]

FIG. 1 is a block diagram of an electronic learning machine to which the present invention is applied, and FIG. 2 is a flowchart showing the operation of the electronic learning machine shown in FIG. Here, 1 is a display, 4 is an arithmetic processing circuit, 5 is a ROM,
6t-JRAM, 7 is the keyboard, 13 is the miscount step, 19 is the step for asking the next stage, 2
0 is a step in which questions are asked from the beginning of the same column. Patent Applicant Canon Co., Ltd. Agent Patent Attorney Yasunori Inuzuka v-4<. Figure 1-2

Claims (1)

[Claims] A fixed number of multiplication problems are asked by fixing the multiplicand and changing the multipliers sequentially.The problem progresses to the multiplicand of poetry that has a predetermined correct answer rate, and if the predetermined correct answer rate is not reached, questions regarding the multiplicand are asked again. Electronic learning machine.