CMSC-130 Introductory Computer Science, Lecture Notes

1993 ◽  
Author(s):  
Duane J. Jarc ◽  
Eric Fendler
2021 ◽  
Author(s):  
Francisco de Assis Zampirolli ◽  
Fernando Teubl ◽  
Guiou Kobayashi ◽  
Rogério Neves ◽  
Luiz Rozante ◽  
...  

Teaching programming logic by means of a single Programming Language (PL) may lead the whole process to a particular syntax and specific libraries. In order to let every student choose their preferred PL we have developed a method that includes didactic material in many PLs by means of notebooks in Colab. We created a filter that generates Lecture Notes in different combinations of PLs from these notebooks. Moreover, each student can choose different PLs to practice with exercises and send their solutions as programming codes, which are individualized because of the parametric questions generated with MCTest+Moodle+VPL. Herewith we present our method, which is easily adaptable, validated with 5 remote classes comprising a total of 221 students, whose average pass rate was 90%.


1994 ◽  
Vol 26 (1) ◽  
pp. 304-308 ◽  
Author(s):  
Roberta Evans Sabin ◽  
Edward P. Sabin

2015 ◽  
Vol 18 (1) ◽  
pp. 258-265 ◽  
Author(s):  
Jennifer S. Balakrishnan

The Coleman integral is a $p$-adic line integral that encapsulates various quantities of number theoretic interest. Building on the work of Harrison [J. Symbolic Comput. 47 (2012) no. 1, 89–101], we extend the Coleman integration algorithms in Balakrishnan et al. [Algorithmic number theory, Lecture Notes in Computer Science 6197 (Springer, 2010) 16–31] and Balakrishnan [ANTS-X: Proceedings of the Tenth Algorithmic Number Theory Symposium, Open Book Series 1 (Mathematical Sciences Publishers, 2013) 41–61] to even-degree models of hyperelliptic curves. We illustrate our methods with numerical examples computed in Sage.


1986 ◽  
Vol 18 (1) ◽  
pp. 257-264 ◽  
Author(s):  
Peter B. Henderson

Sign in / Sign up

Export Citation Format

Share Document