Preview

Open Education

Advanced search

ALGORITHM FOR COMPETITIVE SELECTION OF CANDIDATES FOR ADMISSION TO THE UNIVERSITY FOR THE SECOND AND SUBSEQUENT YEARS OF STUDY TO THE CONDITION THAT THE SET OF ORDERED PRIORITY AREAS FOR THE PREPARATION OF THE STATEMENT

https://doi.org/10.21686/1818-4243-2013-6(101-65-70

Abstract

In this paper the problem is formalized competitive selection and admission to the following courses 2 and the example of the admission campaign in Southwest State University, an algorithm of solving the problem. 

About the Authors

Oleg V. Ovchinkin
Southwestern State University
Russian Federation

programmer

Tel.: (919) 214-90-45

http://ee.swsu.ru/, www.swsu.ru


Aleksey I. Pykhtin
Southwestern State University
Russian Federation

the department the Southwestern State University

Candidate of Science (Engineering), Head

Tel.: (4712) 52-38-01

http://ee.swsu.ru, www.swsu.ru



References

1. Пыхтин А.И. Метод и алгоритм решения задачи конкурсного отбора и зачисления в вуз / А.И. Пыхтин, Е.А. Спирин, И.С. Захаров // Телекоммуникации. – М., 2008. – № 5. – С. 12–19.

2. Овчинкин О.В. Алгоритм процесса управления приемом лиц на второй и последующие курсы в вузах / О.В. Овчинкин, А.И. Пыхтин, И.П. Емельянов // Известия ЮЗГУ. – Курск, 2013. – № 1(46). – С. 34–39.

3. А.с. 2013611295 Российская Федерация. Программа для управления документооборотом и поддержки принятия решений при приеме граждан на второй и последующий курсы / О.В. Овчинкин, А.И. Пыхтин // Роспатент. – № 2013611295; заявл. 13.12.2012; опубл. 09.01.2013.


Review

For citations:


Ovchinkin O.V., Pykhtin A.I. ALGORITHM FOR COMPETITIVE SELECTION OF CANDIDATES FOR ADMISSION TO THE UNIVERSITY FOR THE SECOND AND SUBSEQUENT YEARS OF STUDY TO THE CONDITION THAT THE SET OF ORDERED PRIORITY AREAS FOR THE PREPARATION OF THE STATEMENT. Open Education. 2013;(6(101):65-70. (In Russ.) https://doi.org/10.21686/1818-4243-2013-6(101-65-70

Views: 658


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.


ISSN 1818-4243 (Print)
ISSN 2079-5939 (Online)