Spelling suggestions: "subject:"exploratory programming"" "subject:"xploratory programming""
1 |
Code duplication and reuse in Jupyter notebooksKoenzen, Andreas Peter 21 September 2020 (has links)
Reusing code can expedite software creation, analysis and exploration of data. Expediency can be particularly valuable for users of computational notebooks, where duplication allows them to quickly test hypotheses and iterate over data, without creating code from scratch. In this thesis, I’ll explore the topic of code duplication and the behaviour of code reuse for Jupyter notebooks; quantifying and describing snippets of code and explore potential barriers for reuse. As part of this thesis I conducted two studies into Jupyter notebooks use. In my first study, I mined GitHub repositories, quantifying and describing code duplicates contained within repositories that contained at least one Jupyter notebook. For my second study, I conducted an observational user study using a contextual inquiry, where my participants solved specific tasks using notebooks, while I observed and took notes. The work in this thesis can be categorized as exploratory, since both my studies were aimed at generating hypotheses for which further studies can build upon. My contributions with this thesis is two-fold: a thorough description of code duplicates contained within GitHub repositories and an exploration of the behaviour behind code reuse in Jupyter notebooks. It is my desire that others can build upon this work to provide new tools, addressing some of the issues outlined in this thesis. / Graduate
|
2 |
Explorativní editace zdrojových textů / Explorative Source Code EditorŠomlo, Ivan January 2011 (has links)
The thesis discusses the tools commonly used by developers in exploratory environments of languages Smalltalk and Self. These languages free their users from using plain unstructured source code. Moreover, they contain tools with richer features. The thesis consists of an analysis, a design proposal, and a description of Object Viewer, a Self based tool designed for languages C and C++. The tool graphically displays fragments of a program (objects and pointers) and allows for manipulating them during debugging. The conclusion consists of a summary and a recommendation for additional new features.
|
3 |
Fábula PXP - a técnica de Programação Exploratória (PXP): projetos de criação e desenvolvimento de jogos digitaisLemes, David de Oliveira 17 April 2015 (has links)
Made available in DSpace on 2016-04-29T14:23:36Z (GMT). No. of bitstreams: 1
David de Oliveira Lemes.pdf: 762934 bytes, checksum: 50e7e21a7cb2e27f5b3da0707887c572 (MD5)
Previous issue date: 2015-04-17 / The development of digital games is an activity that grows exponentially as the many game
supporting devices become popular. Under the game development perspective, nowadays,
several tools "promise" to make the most inexperienced programmer able to create and develop
a digital game.
This research presents a work model that seeks to introduce the importance of narrative into
games, the way the ideas are organized to produce a digital game and, overall, a programming
technique that will help the game designer, or digital games designer to understand how a
calculations, the computer, may enhance or hinder the use of ideas and original narrative of
a project / O desenvolvimento de jogos digitais é uma atividade exponencialmente em ascensão à medida
que os mais diversos dispositivos os quais suportam os games se popularizam. Sob o olhar
do desenvolvimento de games, nos dias atuais, diversas ferramentas possibilitam que o mais
inexperiente programador possa criar e desenvolver um jogo digital.
Esta pesquisa apresenta um modelo de trabalho que busca apresentar a importância da
narrativa nos jogos, como as ideias são organizadas para a produção de um jogo digital e,
sobretudo, uma técnica de programação que ajudará o game designer, ou o projetista de jogos
digitais a entender como uma máquina de cálculos, o computador, pode ampliar ou limitar
os uso das ideias e narrativas originais do projeto
|
Page generated in 0.0784 seconds