Patent US3780450A successfully refreshed from Google Patents.
← Back to Patent Explorer
US3780450A Expired / Lapsed US ⏱️ 0.0 years remaining

Teaching machine preferably for studying foreign languages

Assignee: Individual
•
Filing: 1972-06-05
•
Granted: 1973-12-25
•
Expires: 1992-06-05
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A teaching machine preferably for teaching foreign languages using a program containing a set of algorithmic exercises is provided with a detachable decoder having indication means intended to indicate the locations of correct answers on the program-carrier containing the program of algorithmic exercises.

Inventors

  • 👤 B Podkopaev
  • 👤 A Bobkov
  • 👤 L Chervyakova

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-06 10:33
CPC Classifications
G; G09; G09B; G09B7/00; G09B7/06; G09B19/00; G09B19/06

Claims Analysis

Total Claims: 3
Claim 1
Independent Claim 287 words
A teaching machine for teaching students, preferably foreign languages, comprising: task unit means for presetting in the machine a program of sequenced algorithmic exercises, said task unit means having a memory means for storing coded answers to said exercises, and a program panel means for holding a program carrier having said program recorded thereon; answer unit means having an input and an output, said input being connected to said memory means said answer unit means having a set of operable keys which when depressed by a student supplies said machine with said answers; estimation unit means for determining whether said supplied answers are correct, said estimation unit means having two inputs one of which is connected to said task unit means, the other connected to said answer unit means; reference means for providing a correct answer to a student assuming the answer provided by the student to a question in said program is incorrect and providing reference data corresponding to said question and to every question in said program of sequenced algorithmic exercises; decoder means connected to said task unit means and having indicating means for indicating the locations of correct answers on said program carrier; control means for presetting a required mode of operation of said machine, said control means having two outputs and an input, one of said outputs being connected to said task unit means, the other to said reference means, said input being connected to said estimation unit means, said control means ensuring continued operation of said machine to a subsequent exercise of said program of sequenced algorithmic exercises when the student has supplied correct answers to preceding exercises in said program and operatively addressing said reference means when said answers are incorrect.
Claim 2
Dependent Claim 287 words
A teaching machine for teaching students, preferably foreign languages, comprising: task unit means for presetting in the machine a program of sequenced algorithmic exercises, said task unit means having a memory means for storing coded answers to said exercises, and a program panel means for holding a program carrier having said program recorded thereon; answer unit means having an input and an output, said input being connected to said memory means said answer unit means having a set of operable keys which when depressed by a student supplies said machine with said answers; estimation unit means for determining whether said supplied answers are correct, said estimation unit means having two inputs one of which is connected to said task unit means, the other connected to said answer unit means; reference means for providing a correct answer to a student assuming the answer provided by the student to a question in said program is incorrect and providing reference data corresponding to said question and to every question in said program of sequenced algorithmic exercises; decoder means connected to said task unit means and having indicating means for indicating the locations of correct answers on said program carrier; control means for presetting a required mode of operation of said machine, said control means having two outputs and an input, one of said outputs being connected to said task unit means, the other to said reference means, said input being connected to said estimation unit means, said control means ensuring continued operation of said machine to a subsequent exercise of said program of sequenced algorithmic exercises when the student has supplied correct answers to preceding exercises in said program and operatively addressing said reference means when said answers are incorrect.
Claim 3
Dependent Claim 74 words
A teaching machine as claimed in claim 1, in which said decoder means is operatively designed as a plug-in unit having pins and said indicator means the number of which is equal to that of the number of keys in said set of operable keys in said answer unit means, said pins electrically connecting said indicator means to contacts of said memory means which correspond to locations of correct answers on said program carrier.

References Cited (Backward Citations)

US3210864A Cited
US3292276A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1976-12-24 1977-06-25 1977-12-25 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1980-12-24 1981-06-25 1981-12-25 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1984-12-24 1985-06-25 1985-12-25 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag