Automated System for Teaching Computational Complexity of Algorithms Course

This article describes problems of designing automated teaching system for “Computational complexity of algorithms” course. This system should provide students with means to familiarize themselves with complex mathematical apparatus and improve their mathematical thinking in the respective area. The...

Full description

Saved in:
Bibliographic Details
Published in:Modelirovanie i analiz informacionnyh sistem Vol. 24; no. 4; pp. 481 - 495
Main Authors: Roublev, Vadim S., Yusufov, Murad T.
Format: Journal Article
Language:English
Published: Yaroslavl State University 01.08.2017
Subjects:
algorithm complexity analysis
algorithm’s symbol scroll table
automated learning
normal system of symbol transformations
ISSN:1818-1015, 2313-5417
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract This article describes problems of designing automated teaching system for “Computational complexity of algorithms” course. This system should provide students with means to familiarize themselves with complex mathematical apparatus and improve their mathematical thinking in the respective area. The article introduces the technique of algorithms symbol scroll table that allows estimating lower and upper bounds of computational complexity. Further, we introduce a set of theorems that facilitate the analysis in cases when the integer rounding of algorithm parameters is involved and when analyzing the complexity of a sum. At the end, the article introduces a normal system of symbol transformations that allows one both to perform any symbol transformations and simplifies the automated validation of such transformations. The article is published in the authors’ wording.
AbstractList This article describes problems of designing automated teaching system for “Computational complexity of algorithms” course. This system should provide students with means to familiarize themselves with complex mathematical apparatus and improve their mathematical thinking in the respective area. The article introduces the technique of algorithms symbol scroll table that allows estimating lower and upper bounds of computational complexity. Further, we introduce a set of theorems that facilitate the analysis in cases when the integer rounding of algorithm parameters is involved and when analyzing the complexity of a sum. At the end, the article introduces a normal system of symbol transformations that allows one both to perform any symbol transformations and simplifies the automated validation of such transformations. The article is published in the authors’ wording.
Author Yusufov, Murad T.
Roublev, Vadim S.
Author_xml – sequence: 1
  givenname: Vadim S.
  orcidid: 0000-0002-0252-9958
  surname: Roublev
  fullname: Roublev, Vadim S.
– sequence: 2
  givenname: Murad T.
  orcidid: 0000-0002-0362-2951
  surname: Yusufov
  fullname: Yusufov, Murad T.
BookMark eNo9kMtqwzAQRUVJoWmaf3A_QK3G0ljSMoQ-QgNdNF0L2ZYSF9sKsgLN39dJSlbDnRnOhXNPJn3oHSGPwJ5A5YjPoEBRYIA0ZyCpoEIBFRpvyDTnwCkKkBMyvb7dkfkwNCUTQiLnKKfkY3FIobPJ1dnXcUiuy3yI2cbZatf022wZuv0h2dSE3rbn1LrfJh2z4LNFuw2xSbtuGA-HOLgHcuttO7j5_5yR79eXzfKdrj_fVsvFmlZQSKQFcsC8xNryoigEuKqwUinGlGO6RKU8eJujExIUL4SoVK1FCZWTWDoLms_I6sKtg_0x-9h0Nh5NsI05L0LcGhtTU7XOFEpLn-dyLJMCcq2c9CjQO6uFkgpHlr6wqhiGITp_5QEzZ8nmZM-c7JmTZCPMKNmMkvkfd-RwZw
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.18255/1818-1015-2017-4-481-495
DatabaseName CrossRef
DOAJ Open Access Full Text
DatabaseTitle CrossRef
DatabaseTitleList
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Open Access Full Text
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 2313-5417
EndPage 495
ExternalDocumentID oai_doaj_org_article_6897f2275da741298e7f545fea948785
10_18255_1818_1015_2017_4_481_495
GroupedDBID 5VS
642
AAFWJ
AAYXX
ADBBV
ALMA_UNASSIGNED_HOLDINGS
BCNDV
CITATION
GROUPED_DOAJ
IPNFZ
KQ8
RIG
ID FETCH-LOGICAL-c1675-653152b5da366641ec6a788008e09b588f1fa25e47183644c8d94b1ce75bea193
IEDL.DBID DOA
ISSN 1818-1015
IngestDate Fri Oct 03 12:50:51 EDT 2025
Sat Nov 29 02:26:05 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c1675-653152b5da366641ec6a788008e09b588f1fa25e47183644c8d94b1ce75bea193
ORCID 0000-0002-0362-2951
0000-0002-0252-9958
OpenAccessLink https://doaj.org/article/6897f2275da741298e7f545fea948785
PageCount 15
ParticipantIDs doaj_primary_oai_doaj_org_article_6897f2275da741298e7f545fea948785
crossref_primary_10_18255_1818_1015_2017_4_481_495
PublicationCentury 2000
PublicationDate 2017-08-01
PublicationDateYYYYMMDD 2017-08-01
PublicationDate_xml – month: 08
  year: 2017
  text: 2017-08-01
  day: 01
PublicationDecade 2010
PublicationTitle Modelirovanie i analiz informacionnyh sistem
PublicationYear 2017
Publisher Yaroslavl State University
Publisher_xml – name: Yaroslavl State University
SSID ssib044753357
ssib009050552
ssib059259322
ssib006738434
ssj0001879522
Score 1.995924
Snippet This article describes problems of designing automated teaching system for “Computational complexity of algorithms” course. This system should provide students...
SourceID doaj
crossref
SourceType Open Website
Index Database
StartPage 481
SubjectTerms algorithm complexity analysis
algorithm’s symbol scroll table
automated learning
normal system of symbol transformations
Title Automated System for Teaching Computational Complexity of Algorithms Course
URI https://doaj.org/article/6897f2275da741298e7f545fea948785
Volume 24
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Open Access Full Text
  customDbUrl:
  eissn: 2313-5417
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001879522
  issn: 1818-1015
  databaseCode: DOA
  dateStart: 20120101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2313-5417
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044753357
  issn: 1818-1015
  databaseCode: M~E
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3PS8MwFA4yRLz4W5y_iOC1bE2bJjlO2RDU4WHKbqFpEh3oJlsnePFv9720G7158VJoIIV-ecn3vib9HiHXhVXKGCUjywseYQIf5QZUiuA-E0limAv_V7w8iOFQjsfqqVHqC8-EVfbAFXCdTCrhGRPc5kB-TEknPLC-d7mCXFsG99KuUA0xVe0vJrJpfKawYBtfEzm63CUNIzauQAUktZFd-DqDNbjDFgQwIPqfxnyLXOEKA4qKd9aNEGSwyqdRKkGJYY2KBrk1agAEshrskZ06y6S96u32yYabHpDdVQUHWk_oQ3LfW5YzyFmdpZV1OYUclo7qE5a06lB_Lgx3aJ9ZftOZp73319l8Ur59LCjWvVu4I_I86I9u76K6vEJUxCATogymH2cGgE1Aw6SxK7IcBDEkBa6rDJfSxz5n3CF9JZA2FdKq1MSFE9y4HBK_Y9KazqbuhFAleGy71mYe2I7h2JtY-Nw5QNU4ptqErXDRn5WLhkb1gWBqBBNPmnGNYOpUA5gawGyTG0Rw3QGNsEMDhIeuw0P_FR6n__GQM7Idxjmc-zsnrXK-dBdks_gqJ4v5ZYg8uD7-9H8BMvHQNA
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Automated+System+for+Teaching+Computational+Complexity+of+Algorithms+Course&rft.jtitle=Modelirovanie+i+analiz+informacionnyh+sistem&rft.au=Roublev%2C+Vadim+S.&rft.au=Yusufov%2C+Murad+T.&rft.date=2017-08-01&rft.issn=1818-1015&rft.eissn=2313-5417&rft.volume=24&rft.issue=4&rft.spage=481&rft.epage=495&rft_id=info:doi/10.18255%2F1818-1015-2017-4-481-495&rft.externalDBID=n%2Fa&rft.externalDocID=10_18255_1818_1015_2017_4_481_495
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1818-1015&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1818-1015&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1818-1015&client=summon