Results 161 to 170 of about 15,138 (216)
$T_2$ (Clone Theory and Discrete Mathematics・Algebra and Logic Related to Computer Science)
$T_2$ (Clone Theory and Discrete Mathematics・Algebra and Logic Related to Computer Science)openaire
Olympiad in Computer Science and Discrete Mathematics [PDF]
, 2015 Many ideas of theoretical computer science is not yet included in the practice of school teaching. To test the methods of learning new ideas one can use the format of school Olympiads which form a circle of ideas and objectives which can be included in the future general curriculum.
Athit Maytarttanakhon +2 more
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Concept inventories in computer science for the topic discrete mathematics
Working group reports on ITiCSE on Innovation and technology in computer science education - ITiCSE-WGR '06, 2006This report describes concept inventories, specialized assessment instruments that enable educational researchers to investigate student (mis)understandings of concepts in a particular domain. While students experience a concept inventory as a set of multiple-choice items taken as a test, this belies its purpose, its careful development, and its ...
Vicki L. Almstrum +7 more
openaire +2 more sources
Reading up books: Discrete mathematics for computer science: Studying this branch of mathematics can provide you with a solid background for computer theory and applications [PDF]
IEEE Potentials, 1985 The importance of mathematics to the study of both electrical engineering and computer science and engineering is well understood by educators and students alike. The topics learned in mathematics courses are often reviewed in engineering courses that partly focus on relevant mathematical concepts.
Murali Varanasi, Oscar N. Garcia
openaire +1 more source
Proceedings of the 2019 7th International Conference on Information and Education Technology, 2019
The famous Swiss psychologist and the founder of the theory of cognitive development Jean Piaget in his works [12, 13] on intelligence formation, expresses the idea that the last (highest) stage of intelligence development is the mastery of formal operations. In his opinion, this usually happens by the age of 12.
Ruzan E. Mirzakhanyan +1 more
openaire +2 more sources
The famous Swiss psychologist and the founder of the theory of cognitive development Jean Piaget in his works [12, 13] on intelligence formation, expresses the idea that the last (highest) stage of intelligence development is the mastery of formal operations. In his opinion, this usually happens by the age of 12.
Ruzan E. Mirzakhanyan +1 more
openaire +2 more sources
PROBLEMS OF TEACHING ELEMENTS OF DISCRETE MATHEMATICS TO FUTURE COMPUTER SCIENCE TEACHERS
BULLETIN Series of Physics & Mathematical Sciences, 2021The article deals with the problem of integrated teaching of discrete mathematics elements to the content of the main specialized disciplines in the preparation of future computer science teachers. The ways of solving some problems in the preparation of future computer science teachers on the elements of discrete mathematics and the need for its ...
B.G. Bostanov, Z.T. Suranchiyeva
openaire +1 more source
Journal on Educational Resources in Computing, 2005
CDM, for computational discrete mathematics, is a course that attempts to teach a number of topics in discrete mathematics to computer science majors. The course abandons the classical definition-theorem-proof model, and instead relies heavily on computation as a source of motivation and also for experimentation and illustration.
openaire +2 more sources
CDM, for computational discrete mathematics, is a course that attempts to teach a number of topics in discrete mathematics to computer science majors. The course abandons the classical definition-theorem-proof model, and instead relies heavily on computation as a source of motivation and also for experimentation and illustration.
openaire +2 more sources
De Bruijn Sequences—A Model Example of the Interaction of Discrete Mathematics and Computer Science
Mathematics Magazine, 1982Combinatorics, graph theory, and abstract algebra can all be applied to the same algorithmic problem.
openaire +2 more sources
Oberwolfach Reports, 2015
The p-Laplacian operators have a rich analytical theory and in the last few years they have also offered efficient tools to tackle several tasks in machine learning. During the workshop mathematicians and theoretical computer scientists working on models based on p-Laplacians on graphs and manifolds have presented the latest theoretical developments ...
Matthias Hein +2 more
openaire +2 more sources
The p-Laplacian operators have a rich analytical theory and in the last few years they have also offered efficient tools to tackle several tasks in machine learning. During the workshop mathematicians and theoretical computer scientists working on models based on p-Laplacians on graphs and manifolds have presented the latest theoretical developments ...
Matthias Hein +2 more
openaire +2 more sources
ACM SIGCSE Bulletin, 1986
During the 1983-84 academic year, the University of Scranton instituted an experimental two semester discrete mathematics course for freshman students majoring in computer science. Approximately one-third of them were enrolled in this sequence while the remaining freshmen were enrolled in a traditional algebra-calculus mathematics sequence.
openaire +2 more sources
During the 1983-84 academic year, the University of Scranton instituted an experimental two semester discrete mathematics course for freshman students majoring in computer science. Approximately one-third of them were enrolled in this sequence while the remaining freshmen were enrolled in a traditional algebra-calculus mathematics sequence.
openaire +2 more sources