Open Access. Powered by Scholars. Published by Universities.®
Programming Languages and Compilers Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- CS1 (1)
- Classroom automation (1)
- Code generation (1)
- Computer science; Dynamic programming; Matrices (1)
- Function factoring (1)
-
- Graph theory (1)
- Intelligent tutoring system (1)
- Internet programming (1)
- Matching theory (1)
- Parallel half approximation (1)
- Programming languages (Electronic computers) (1)
- Systems programming (Computer science) (1)
- Test case generation (1)
- Vertex-weighted matching (1)
- Web site development (1)
- Weighted matching (1)
Articles 1 - 4 of 4
Full-Text Articles in Programming Languages and Compilers
Automation In Cs1 With The Factoring Problem Generator, Joshua B. Parker
Automation In Cs1 With The Factoring Problem Generator, Joshua B. Parker
Master's Theses
As the field of computer science continues to grow, the number of students enrolled in related programs will grow as well. Though one-on-one tutoring is one of the more effective means of teaching, computer science instructors will have less and less time to devote to individual students. To address this growing concern, many tools that automate parts of an instructor’s job have been proposed. These tools can assist instructors in presenting concepts and grading student work, and they can help students learn to program more effectively. A growing group of intelligent tutoring systems attempts to tie all of this functionality …
A Survey Of Monge Properties, Swetha Sethumadhavan
A Survey Of Monge Properties, Swetha Sethumadhavan
UNLV Theses, Dissertations, Professional Papers, and Capstones
Monge properties play an important role in theoretical computer science. Many greedy algorithms are based on such properties, as is speedup in dynamic programming. Monge properties are simple monotonicity properties which are observed and used in various settings such as resource optimization, computational geometry, statistical sampling, computational biology and coding.
Algorithms For Vertex-Weighted Matching In Graphs, Mahantesh Halappanavar
Algorithms For Vertex-Weighted Matching In Graphs, Mahantesh Halappanavar
Computer Science Theses & Dissertations
A matching M in a graph is a subset of edges such that no two edges in M are incident on the same vertex. Matching is a fundamental combinatorial problem that has applications in many contexts: high-performance computing, bioinformatics, network switch design, web technologies, etc. Examples in the first context include sparse linear systems of equations, where matchings are used to place large matrix elements on or close to the diagonal, to compute the block triangular decomposition of sparse matrices, to construct sparse bases for the null space or column space of under-determined matrices, and to coarsen graphs in multi-level …
An Investigation Into Student Reactions Towards Rad Versus Traditional Programming Environments For Novice Developers, Pansy Colkers
An Investigation Into Student Reactions Towards Rad Versus Traditional Programming Environments For Novice Developers, Pansy Colkers
Theses : Honours
The traditional approach to programming using text editors is widely used in many institutions to teach introductory programming. These types of traditional programming environments provide fundamental programming concepts for learning, especially in the context of novice developers. In recent years, teaching institutions have seen a trend towards the introduction of visual "drag-and-drop" rapid application development (RAD) environments for teaching novice programmers. These 'environments capture student interest in programming by allowing the construction of workable programs within a short time frame based on minimal pre-existing coding knowledge. However, some have argued that these visual RAD environments might not be suitable for …