SOME COMBINATORIAL PROBLEMS ON BINARY MATRICES IN PROGRAMMING COURSES
| Autor: | Krasimir Yordzhev |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2012 |
| Předmět: |
Discrete mathematics
FOS: Computer and information sciences Class (computer programming) Computer science Binary number combinatorial algorithms Combinatorial algorithms Education in programming motivation to study binary matrix stimulation of students' interest Computer Science - Data Structures and Algorithms FOS: Mathematics Mathematics - Combinatorics Logical matrix Data Structures and Algorithms (cs.DS) Combinatorics (math.CO) S-permutation matrices 97P50 68R05 05B20 lcsh:L lcsh:Education |
| Zdroj: | Ìnformacìjnì Tehnologìï v Osvìtì, Iss 12, Pp 39-43 (2012) ResearcherID Krasimir Yordzhev |
| ISSN: | 2306-1707 1998-6939 |
| Popis: | The study proves the existence of an algorithm to receive all elements of a class of binary matrices without obtaining redundant elements, e. g. without obtaining binary matrices that do not belong to the class. This makes it possible to avoid checking whether each of the objects received possesses the necessary properties. This significantly improves the efficiency of the algorithm in terms of the criterion of time. Certain useful educational effects related to the analysis of such problems in programming classes are also pointed out. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|