scholarly journals Impact of Mathematics on the Theoretical Computer Science Course Units in the General Degree Program in Computer Science at Sri Lankan State Universities

10.28945/4007 ◽  
2018 ◽  
Vol 15 ◽  
pp. 001-014
Author(s):  
Sritharan Thambithurai
Keyword(s):  
Academic Performance ◽  
Computer Science ◽  
Degree Program ◽  
Theoretical Computer Science ◽  
State Universities ◽  
Sri Lankan ◽  
Theoretical Computer ◽  
Advanced Level ◽  
And Mathematics ◽  
Mathematics Course

Aim/Purpose: The purpose of this study is to identify how Advanced level Mathematics and Mathematics course units offered at university level do impact on the academic performance of theoretical Computer Science course units. Background: In Sri Lankan state universities, students have been enrolled only from the Physical Science stream to do a degree program in Computer Science. In addition to that, universities have been offering some course units in Mathematics to provide the required mathematical maturity to Computer Science undergraduates. Despite of this it is observed that the failure rates in fundamental theoretical Computer Science course units are much higher than other course units offered in the general degree program every year. Methodology : Academic records comprised of all 459 undergraduates from three consecutive batches admitted to the degree program in Computer Science from a university were considered for this study. Contribution: This study helps academics in identifying suitable curricula for Mathematics course units to improve students’ performance in theoretical Computer Science courses. Findings: Advanced level Mathematics does not have any significant effect on the academic performance of theoretical Computer Science course units. Even though all Mathematics course units offered were significantly correlated with academic performance of every theoretical Computer Science course unit, only the Discrete Mathematics course unit highly impacted on the academic performance of all three theoretical Computer Science course units. Further this study indicates that the academic performance of female undergraduates is better than males in all theoretical Computer Science and Mathematics course units. Future Research: Identifying other critical success factors contributing to the students’ academic performance of the theoretical Computer Science through empirical studies

scholarly journals Impact of Mathematics on the Theoretical Computer Science Course Units in the General Degree Program in Computer Science at Sri Lankan State Universities

10.28945/4057 ◽  
2018 ◽  
Keyword(s):  
Academic Performance ◽  
Computer Science ◽  
Degree Program ◽  
Theoretical Computer Science ◽  
Discrete Mathematics ◽  
Sri Lankan ◽  
Theoretical Computer ◽  
Advanced Level ◽  
And Mathematics ◽  
Mathematics Course

[This Proceedings paper was revised and published in the 2018 issue of the journal Issues in Informing Science and Information Technology, Volume 15] ABSTRACT Mathematics is fundamental to the study of Computer Science. In Sri Lankan state universities, students have been enrolled only from the Physical Science stream with minimum ‘C’ grade in Mathematics in the advanced level examination to do a degree program in Computer Science. In addition to that universities have been offering some course units in Mathematics covering basis in Discrete Mathematics, Calculus, and Algebra to provide the required mathematical maturity to Computer Science under-graduates. Despite of this it is observed that the failure rate in fundamental theoretical Computer Science course units are much higher than other course units offered in the general degree program every year. The purpose of this study is to identify how Advanced level Mathematics and Mathematics course units offered at university level do impact on the academic performance of theoretical Computer Science course units and to make appropriate recommendations based on our findings. Academic records comprised of 459 undergraduates from three consecutive batches admitted to the degree program in Computer Science from a university was considered for this study. Results indicated that Advanced level Mathematics does not have any significant effect on the academic performance of theoretical Computer Science course units. Even though all Mathematics course units offered in the first and second year of studies were significantly correlated with academic performance of every theoretical Computer Science course unit, only the Discrete Mathematics course unit highly impact-ed on the academic performance of all three theoretical Computer Science course units. Further this study indicates that the academic performance of female undergraduates is better than males in all theoretical Computer Science and Mathematics course units.

scholarly journals Introduction: special issue ICICTA 2012

2014 ◽  
Vol 24 (5) ◽  
Author(s):  
ZHIXIANG HOU
Keyword(s):  
Computer Science ◽  
Software Design ◽  
Category Theory ◽  
Theoretical Computer Science ◽  
Special Issue ◽  
Theoretical Computer ◽  
Mathematical Structures ◽  
And Mathematics

Mathematical Structures in Computer Science bridges the gap between theoretical computer science and software design. By publishing original perspectives from all areas of computing, the journal stresses applications from logic, algebra, geometry, category theory and other areas of logic and mathematics. Through issues such as this special issue, the journal also plans to play an occasional, but important role in the fields of intelligent computation and automation.

scholarly journals Signs Are Taken for Wonders

Mnemosyne ◽  
2018 ◽  
pp. 12
Author(s):  
Catrinel Mădălina Popa
Keyword(s):  
Social Science ◽  
Computer Science ◽  
Measure Theory ◽  
Philosophy Of Mathematics ◽  
Theoretical Computer Science ◽  
Theoretical Computer ◽  
Self Knowledge ◽  
Complex Relationships ◽  
And Mathematics ◽  
Unity Of Knowledge

Solomon Marcus was a Romanian scientist, whose fields of research span mathematical analysis, theoretical computer science, measure theory and general topology, linguistics, history and philosophy of mathematics, poetics, semiotics and applications of mathematics social science etc. From the very beginning of his career, Marcus showed a deep interest in analyzing the complex relationships between literature and science (mathematics), trying to identify those arguments which plead for what might be called “the unity of knowledge”. In his book on mathematical poetics the scientist has demonstrated that poetry and mathematics are both routes towards self-knowledge (as well as modalities of creating ideal objects). Moreover, his work as a whole underscores the increasing importance of aesthetics in the field of “hard” sciences. This article will focus on those strategies used by Marcus in his essays as neutralisers of the tensions between self-reading and world-reading.      

scholarly journals Optimization Over the Boolean Hypercube Via Sums of Nonnegative Circuit Polynomials

2021 ◽  
Author(s):  
Mareike Dressler ◽  
Adam Kurpisz ◽  
Timo de Wolff
Keyword(s):  
Computer Science ◽  
Affine Transformation ◽  
Optimization Problems ◽  
Polynomial Optimization ◽  
Theoretical Computer Science ◽  
Sums Of Squares ◽  
Theoretical Computer ◽  
Complexity Bounds ◽  
Polynomial Optimization Problems ◽  
Transformation Of Variables

AbstractVarious key problems from theoretical computer science can be expressed as polynomial optimization problems over the boolean hypercube. One particularly successful way to prove complexity bounds for these types of problems is based on sums of squares (SOS) as nonnegativity certificates. In this article, we initiate optimization problems over the boolean hypercube via a recent, alternative certificate called sums of nonnegative circuit polynomials (SONC). We show that key results for SOS-based certificates remain valid: First, for polynomials, which are nonnegative over the n-variate boolean hypercube with constraints of degree d there exists a SONC certificate of degree at most $$n+d$$ n + d . Second, if there exists a degree d SONC certificate for nonnegativity of a polynomial over the boolean hypercube, then there also exists a short degree d SONC certificate that includes at most $$n^{O(d)}$$ n O ( d ) nonnegative circuit polynomials. Moreover, we prove that, in opposite to SOS, the SONC cone is not closed under taking affine transformation of variables and that for SONC there does not exist an equivalent to Putinar’s Positivstellensatz for SOS. We discuss these results from both the algebraic and the optimization perspective.

Sign in / Sign up

Export Citation Format

Share Document