Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Dougherty, Ryan E."'
Autor:
Dougherty, Ryan E.
Theory of Computing (ToC) is an important course in CS curricula because of its connections to other CS courses as a foundation for them. Traditional ToC course grading schemes are mostly exam-based, and sometimes a small weight for traditional proof
Externí odkaz:
http://arxiv.org/abs/2410.01712
Finite State Machines are a concept widely taught in undergraduate theory of computing courses. Educators typically use tools with static representations of FSMs to help students visualize these objects and processes; however, all existing tools requ
Externí odkaz:
http://arxiv.org/abs/2409.17207
Large Language Models (LLMs) have had considerable difficulty when prompted with mathematical questions, especially those within theory of computing (ToC) courses. In this paper, we detail two experiments regarding our own ToC course and the ChatGPT
Externí odkaz:
http://arxiv.org/abs/2407.07757
Autor:
Dougherty, Ryan E.
Best practices in programming need to be emphasized in a CS1 course as bad student habits persist if not reinforced well. The C++ programming language, although a relatively old language, has been regularly updated with new versions since 2011, on th
Externí odkaz:
http://arxiv.org/abs/2311.07807
Autor:
Dougherty, Ryan E.
The design of any technical Computer Science course must involve its context within the institution's CS program, but also incorporate any new material that is relevant and appropriately accessible to students. In many institutions, theory of computi
Externí odkaz:
http://arxiv.org/abs/2311.07803
Factors within a large-scale software system that simultaneously interact and strongly impact the system's response under a configuration are often difficult to identify. Although screening such a system for the existence of such interactions is impo
Externí odkaz:
http://arxiv.org/abs/2310.07448
Autor:
Dougherty, Ryan E.
Theory of computing (ToC) courses are a staple in many undergraduate CS curricula as they lay the foundation of why CS is important to students. Although not a stated goal, an inevitable outcome of the course is enhancing the students' technical read
Externí odkaz:
http://arxiv.org/abs/2310.01977
Autor:
Calbert, Mason R., Dougherty, Ryan E.
A \emph{covering array} is an $N \times k$ array of elements from a $v$-ary alphabet such that every $N \times t$ subarray contains all $v^t$ tuples from the alphabet of size $t$ at least $\lambda$ times; this is denoted as $\CA_\lambda(N; t, k, v)$.
Externí odkaz:
http://arxiv.org/abs/2211.01209
Publikováno v:
Theoret. Comput. Sci. 800 (2019), 31-41
Column replacement techniques for creating covering arrays rely on the construction of perfect and distributing hash families with few rows, having as many columns as possible for a specified number of symbols. To construct distributing hash families
Externí odkaz:
http://arxiv.org/abs/2101.02343
Autor:
Dougherty, Ryan E.
It is imperative for testing to determine if the components within large-scale software systems operate functionally. Interaction testing involves designing a suite of tests, which guarantees to detect a fault if one exists among a small number of co
Externí odkaz:
http://arxiv.org/abs/2002.05421