DOCSLIB.ORG

Online Collection of Algorithms

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Online Collection of Algorithms JOHANNES KEPLER UNIVERSITAT¨ LINZ JKU Faculty of Engineering and Natural Sciences Online Collection of Algorithms Master’s Thesis submitted in partial fulfillment of the requirements for the academic degree Diplom-Ingenieur in the Master’s Program Computer Science Submitted by Wolfgang K¨ullinger,BSc. At the Institut f¨urSystemsoftware Advisor a.Univ.-Prof. Dipl.-Ing. Dr. G¨untherBlaschek Linz, November 2015 Abstract This thesis presents an interactive web platform, that provides an online knowledge base for common algorithms. The main target are algorithms that are important for ongoing computer scientists. The platform offers the possibility to try algorithms immediately. Every execu- tion step can be analyzed. The changes in the memory are visualized. Run-time statistics are collected and can be used to compare similar algorithms. New algorithms can be added using a registered user account. An author can use a graphical programming language to define algorithms. Any kind of information can be attached. Using comments and annotations, an algorithm can be explained in more detail. In particular students could benefit from the visual presentation of important algorithms. A web browser and an internet connection is needed in order to use the platform. There is no need to install any tools on the computer. It is not required to register for the basic functionality. This thesis gives insights about the program's internals. Some implementation details are explained extensively. The basic architecture is discussed and sketched schematically. It is a guide through the possibilities of the web application. All areas are explained using examples and illustrations. It also serves as documentation. A detailed guideline describes the necessary steps in order to install the system on a web server. All the possible configuration settings are explained in detail. ii Kurzfassung Diese Abhandlung pr¨asentiert eine interaktive Web-Plattform, die eine Sammlung von ublichen¨ Algorithmen bereith¨alt. Haupts¨achlich werden jene Algorithmen ge- sammelt, die fur¨ Informatik-Studierende relevant sind. Die Plattform bietet die M¨oglichkeit, Algorithmen sofort zu probieren. Jeder Ausfuhrungsschritt¨ kann dabei analysiert werden. Anderungen¨ im Speicher werden visualisiert. Eine Laufzeit-Statistik wird aufbereitet und kann dafur¨ verwendet werden, ¨ahnliche Algorithmen zu vergleichen. Mittels eines registrierten Kontos k¨onnen neue Algorithmen hinzugefugt¨ werden. Es kann auf eine grafische Programmiersprache zuruck¨ gegriffen werden, um einen Algorithmus zu definieren. Hintergrundinformationen k¨onnen hinzugefugt¨ werden. Kommentare und Anmerkungen k¨onnen dazu verwendet werden, einen Algorith- mus noch weiter auszufuhren.¨ Vor allem Studierende k¨onnten von der visuellen Pr¨asentation wichtiger Algorithmen profitieren. Um die Plattform verwenden zu k¨onnen, werden ein Web-Browser und eine Internetverbindung ben¨otigt. Es mussen¨ keine zus¨atzlichen Werkzeuge installiert werden. Auch eine Anmeldung ist nicht n¨otig, um die Grundfunktionalit¨at nutzen zu k¨onnen. Die Abhandlung gew¨ahrt Einblicke in den Aufbau des Programms. Einige Imple- mentierungs-Details werden ausfuhrlich¨ erkl¨art und die grunds¨atzliche Architektur wird diskutiert und schematisch skizziert. Alle M¨oglichkeiten und Bereiche der Web-Anwendung werden exemplarisch beschrieben. Sie dient ebenso als Dokumentation. Genaue Anweisungen beschreiben die n¨o- tigen Schritte, um das Programm auf einem Web-Server zu installieren. Alle Kon- figurationsm¨oglichkeiten werden er¨ortert. iii Contents 1 Introduction 1 1.1 Motivation . 1 1.1.1 Assignment . 1 1.1.2 Target groups . 2 1.2 Results . 3 1.2.1 Outline . 3 1.2.2 Supported algorithms . 4 1.3 Overview . 5 2 Foundations 6 2.1 Related work . 6 2.2 Environment . 9 2.2.1 FLOSS principles . 9 2.2.2 Web application . 9 2.3 Diagrams . 10 3 Language 13 3.1 Design . 13 3.2 Data types . 13 3.2.1 Type conversion . 14 3.2.2 Variables . 14 3.3 Building block elements . 15 3.3.1 Annotation building blocks . 16 3.3.2 Operation building blocks . 17 3.3.3 Structure building blocks . 20 3.3.4 Value building blocks . 22 3.4 Example . 22 4 Usage 25 4.1 User interface . 25 4.2 Algorithm user interface . 26 4.2.1 View perspective . 27 4.2.2 Edit perspective . 29 iv Contents 4.3 Management user interface . 32 4.3.1 Algorithm management . 32 4.3.2 User management . 33 5 Architecture 35 5.1 Rationale . 35 5.2 Server & Client . 36 5.2.1 Communication . 36 5.2.2 Tasks . 37 5.3 Database . 38 6 Implementation 40 6.1 Data types . 40 6.1.1 Variables . 41 6.2 Tree structure . 41 6.2.1 Building blocks and Nodes . 42 6.2.2 Parsing . 43 6.3 Tree traversal . 43 6.3.1 Execution . 44 6.4 Storage . 46 6.5 Used technology . 48 7 Configuration 49 7.1 Installation . 49 7.1.1 Prerequisites . 49 7.1.2 File system preparations . 50 7.1.3 Database preparations . 50 7.2 Settings . 51 7.2.1 Optional settings . 51 7.2.2 Language settings . 53 7.2.3 Section settings . 54 8 Technical data 55 8.1 Test environment . 55 8.1.1 System configuration . 56 8.1.2 Test algorithm . 57 8.2 Benchmarks . 58 9 Review 60 Creation . 60 Acknowledgements . 61 v Contents List of Figures 63 List of Listings 64 Bibliography 65 A Benchmark data 67 vi 1 Introduction This chapter gives insights about the idea that led to the development of the software system. Target groups are identified and the expected outcome is defined. It also serves as a guide through the rest of the thesis. 1.1 Motivation Every computer scientist gets to know a lot of common algorithms during educa- tion. These are not always easy to understand. Simple diagrams can help. The static content of diagrams is not always able to make the flow of data understand- able. Yet the visualization of this flow is important. The idea is to provide an interactive system to simplify the learning process. 1.1.1 Assignment The idea of an \Online Collection of Algorithms" is a web-based system used for the management of and interaction with algorithms. Algorithms should be prepared by the community. On the one hand it should serve as a centralized knowledge base that contains information about basic algorithms. On the other hand it should be easy to try this knowledge immediately. Teachers should be able to describe common algorithms in a visual way. These algorithms should be executable step by step. The student should be able to follow the stages of the execution in every detail. The definition and description of new algorithms should work without any fur- ther tools. When looking at an algorithm, the intention of its author should be easily understandable. The playback functionality should be simple and clearly 1 Introduction arranged. Following the control and data flow should be intuitive and predictable. The values of community should be promoted through the possibility to share content among other users. One explicit requirement is the possibility to compare algorithms. This requires the introduction of algorithm statistics and metrics. Pseudo-code and annotations should be available in order to support the intentions of authors. Textual as well as graphical representation of an algorithm should be supported. Cross-referencing between algorithms should be possible. General background information as well as external references should be attachable. Users should interact with the system using web browsers. This makes the system independent of the users' operating systems. The aim is to create a system that can be run on most common server technology. An amount of predefined algorithms should demonstrate the functionality and the abilities of the system. These should preferably be algorithms that are impor- tant for computer science students. 1.1.2 Target groups The major target groups can be found in an academic context. The knowledge about fundamental algorithms is part of every computer scientist's education. Therefore the aim of this system is to support teachers on defining algorithms that can be presented in class. Students should be supported to understand algo- rithms more easily. Teachers are the first group that has contact with the system. Teachers for com- puter science do not necessarily need to have programming experience. Therefore the algorithm definition process has to be designed in a way that no program- ming skills are required. Computer scientists with experience concerning software development should also be able to define algorithms. This raises the idea of pro- viding a graphical system that is closely related to the usual textual way of writing algorithms. Students are the group that mainly uses algorithms that are already defined. The system should be aware of students that have little or no programming expe- rience. The relationship of the memory contents and the algorithm must be clearly 2 Introduction visible. If an instruction in the algorithm manipulates the contents of a memory cell, this must be obvious and easy to follow. The computation costs of selected operations are important for being able to compare algorithms. One basic use case can be concluded involving both major target groups. In order to prepare a lesson, a teacher defines an algorithm. Comments can be prepared and basic information attached. The algorithm can be either demonstrated to the students or students can play with the algorithm individually. Both alternatives can be directly applied in class. 1.2 Results The program that was developed in the course of this thesis is named \kartuli- mardikas". This is the Estonian name of the \Colorado potato beetle". The name serves as working title during development. The nominal association with a software bug is intended. It characterizes software products in general, especially those in development. It might also serve as reminder for the future authors of algorithms who use this system.
Load more

Recommended publications
  • An Affordable Modular Robotic Kit for Integrated Science, Technology, Engineering, and Math Education
    An Affordable Modular Robotic Kit for Integrated Science, Technology, Engineering, and Math Education © PHOTOCREDIT By Ekawahyu Susilo, Jianing Liu, Yasmin Alvarado Rayo, Ashley Melissa Peck, Pietro Valdastri, Justin Montenegro, and Mark Gonyea he demand for graduates in science, technology, Fischertechnik [6], are composed of libraries of engineering, and math (STEM) has steadily prefabricated parts that are not interoperable among kits increased in recent decades. In the United from different vendors. As recently surveyed in Kee [7], States alone, jobs for biomedical engineers are alternatives to these popular kits are either highly modular expected to increase by 62% by 2020, and jobs but very expensive (e.g., Kondo [8], Bioloid [9], Cubelets Tin software development and medical science are [10], K-Junior V2, and Kephera [11]) and unaffordable for expected to increase by 32% and 36%, respectively [1]. the majority of schools, or single-configuration and low- Combined with an insufficient number of students cost robots (e.g., AERObot [12], iRobot [13], and Boe-Bot enrolled in STEM fields, this will result in about 2.4 [14]) with a restricted number of activities possible. An million STEM job vacancies by 2018 [2]. Therefore, affordable solution that provides a number of increasing the number of STEM graduates is currently a interchangeable modules is littleBits [15]. This platform national priority for many IEEEgovernments worldwide. An offersProof a variety of sensing and actuation modules that use effective way to engage young minds in STEM disciplines is magnets to connect, but it lacks programmability, thus to introduce robotic kits into primary and secondary limiting students’ ability to learn about coding.
    [Show full text]
  • Code Girl Tracey Acosta Santa Clara University
    Santa Clara University Scholar Commons Computer Engineering Senior Theses Engineering Senior Theses 6-1-2015 Code girl Tracey Acosta Santa Clara University Amanda Holl Santa Clara University Paige Rogalski Santa Clara University Follow this and additional works at: https://scholarcommons.scu.edu/cseng_senior Part of the Computer Engineering Commons Recommended Citation Acosta, Tracey; Holl, Amanda; and Rogalski, Paige, "Code girl" (2015). Computer Engineering Senior Theses. 43. https://scholarcommons.scu.edu/cseng_senior/43 This Thesis is brought to you for free and open access by the Engineering Senior Theses at Scholar Commons. It has been accepted for inclusion in Computer Engineering Senior Theses by an authorized administrator of Scholar Commons. For more information, please contact [email protected]. Code Girl by Tracey Acosta Amanda Holl Paige Rogalski Submitted in partial fulfillment of the requirements for the degrees of Bachelor of Science Computer Science and Engineering Bachelor of Science in Web Design and Engineering School of Engineering Santa Clara University Santa Clara, California June 1, 2015 Code Girl Tracey Acosta Amanda Holl Paige Rogalski Computer Science and Engineering Web Design and Engineering Santa Clara University June 1, 2015 ABSTRACT Despite the growing importance of technology and computing, fewer than 1% of women in college today choose to major in computer science.[1] Educational programs and games created to interest girls in computing, such as Girls Who Code and Made With Code, have been successful in engaging girls with interactive and creative learning environments, but they are too advanced for young girls to benefit from. To address the lack of educational, computer science games designed specifically for young girls, we developed a web-based application called Code Girl for girls age five to eight to customize their own avatar using Blockly, an open-source visual coding editor developed by Google.
    [Show full text]
  • Robot Block-Based Programming
    Robot Block-Based Programming Teaching children how to program an interactive robot using a block-based programming language Robin van der Wal Jannelie de Vries Luka Miljak Marcel Kuipers Bachelor's Thesis Computer Science Delft University of Technology 1 This report is under embargo from July 2017 until February 2018 Delft University of Technology Bachelor end project Robot Block-based Programming Final Report Authors: Robin van der Wal Luka Miljak Jannelie de Vries Marcel Kuipers July 5, 2017 Bachelor Project Committee Coach name: Koen Hindriks Client name: Joost Broekens Cordinator name: Ir. O.W. Visser Abstract Robots play an increasingly large role in society and some material already exists that allows children to program robots in elementary school. However, this material often neglects the interactive capabilities of modern robots. The aim of this project is to teach children how to write interactive programs for a robot. For this purpose, a NAO robot is used, which is a humanoid robot with advanced features. Children can use a web interface to create programs in a Block-Based Programming Language, which is then sent and processed by the robot in an intelligent manner, using an agent-based sys- tem. Over the course of ten weeks, based on research done in the first two weeks, a web interface and an intelligent agent were developed. The BlocklyKids lan- guage implements many concepts you would expect from a programming lan- guage. Using these concepts, children can solve exercises that are presented to them in the web interface. Testing BlocklyKids in the classroom helped in the development of the product.
    [Show full text]
  • Ibtihaj Muhammad's
    Featuring 484 Industry-First Reviews of Fiction, Nonfiction, Children'sand YA Books KIRKUSVOL. LXXXVI, NO. 15 | 1 AUGUST 2018 REVIEWS U.S. Olympic medalist Ibtihaj Muhammad’s memoir, Proud, released simultaneously in two versions—one for young readers, another for adults—is thoughtful and candid. It’s also a refreshingly diverse Cinderella story at a time when anti-black and anti-Muslim sentiments are high. p. 102 from the editor’s desk: Chairman Excellent August Books HERBERT SIMON President & Publisher BY CLAIBORNE SMITH MARC WINKELMAN # Chief Executive Officer MEG LABORDE KUEHN [email protected] Photo courtesy Michael Thad Carter courtesy Photo Editor-in-Chief Winners Take All: The Elite Charade of Changing the World by Anana CLAIBORNE SMITH Giridharadas (Aug. 28): “Give a hungry man a fish, and you get to pat [email protected] Vice President of Marketing yourself on the back—and take a tax deduction. It’s a matter of some SARAH KALINA [email protected] irony, John Steinbeck once observed of the robber barons of the Gilded Managing/Nonfiction Editor ERIC LIEBETRAU Age, that they spent the first two-thirds of their lives looting the public [email protected] Fiction Editor only to spend the last third giving the money away. Now, writes politi- LAURIE MUCHNICK cal analyst and journalist Giridharadas, the global financial elite has [email protected] Children’s Editor reinterpreted Andrew Carnegie’s view that it’s good for society for VICKY SMITH [email protected] capitalists to give something back to a new formula: It’s good for busi- Young Adult Editor Claiborne Smith LAURA SIMEON ness to do so when the time is right, but not otherwise….A provocative [email protected] Staff Writer critique of the kind of modern, feel-good giving that addresses symptoms and not causes.” MEGAN LABRISE [email protected] Sweet Little Lies by Caz Frear (Aug.
    [Show full text]
  • Trabajo Fin De Grado
    UNIVERSIDAD AUTÓNOMA DE MADRID ESCUELA POLITÉCNICA SUPERIOR Grado en Ingeniería Informática TRABAJO FIN DE GRADO Aplicación web para ayuda en el aprendizaje de la gestión de memoria dinámica en programación con el lenguaje C Carlos Mesón de Arana Tutor: Marina De La Cruz Echeandía Ponente: Alfonso Ortega de La Puente JUNIO 2017 1 Aplicación web para ayuda en el aprendizaje de la gestión de memoria dinámica en programación con el lenguaje C AUTOR: Carlos Mesón de Arana TUTOR: Marina De La Cruz Echeandía Dpto. Ingeniería Informática Escuela Politécnica Superior Universidad Autónoma de Madrid Junio 2017 2 3 Resumen Este Trabajo Fin de Grado surge con objetivo de garantizar una herramienta que muestre visualmente mediante un formalismo de alto nivel distinto del lenguaje de programación C las peculiaridades de la gestión de la memoria dinámica para facilitar el aprendizaje de los estudiantes. Este proyecto nace de la reiteración de la experiencia observada en las aulas y los laboratorios del incremento de la competencia en la correcta gestión de la memoria dinámica de aquellos alumnos que son capaces de imaginar visualmente el proceso. El proyecto consistirá en el desarrollo de una aplicación web para facilitar la adquisición de esa imagen visual. Para ello se incorporará al sitio web un canvas en el que diseñar visualmente su algoritmo de gestión de memoria mediante bloques propios desarrollados con el lenguaje de bloques de Google Blockly, un canvas en el que se representará gráficamente la memoria del sistema y las modificaciones que las operaciones de gestión de memoria realicen sobre ella al ser ejecutadas y un área de texto en la que se mostrará la equivalencia en lenguaje C de las operaciones diseñadas de manera visual.
    [Show full text]
  • Blockly Manual © Revolution Education Ltd 2002-2016 V1.2.0 May Be Copied for Educational Use
    A guide to using Blockly to simulate and program a PICAXE microcontroller © Copyright Revolution Education Ltd 1999-2016. Copyright is waived in the following circumstances: a small number of copies may be made for use in the purchaser’s school/college for use alongside PICAXE hardware. These copies may not be sold or made available outside the purchaser’s school. Blockly Manual © Revolution Education Ltd 2002-2016 v1.2.0 May be copied for educational use. 1 Overview Blockly for PICAXE is a free powerful visual programming tool for generating PICAXE microcontroller programs. By stacking coloured blocks on top of each other a control program can be rapidly generated. This simple click’n’drag programming method allows students to rapidly develop control sequences for real life microcontroller projects. Blockly can be run in a web browser on almost any device that has an internet connection. For offline use Blockly is embedded within PICAXE Editor and is also available as a standalone Chrome app. Blockly can be used in 3 different ways: 1) Within PE6 (PICAXE Editor 6) which is the main PICAXE programming environment (Windows) 2) As a standalone app (Windows/Mac/Linux/Chromebook) 3) On the www.picaxecloud.com website (any browser) All 3 methods share exactly the same Blockly source code and so work in a similar way on all platforms. However PE6 does contain a more powerful simulation engine. The wide range of PICAXE specific blocks allows the user to control output devices, such as motors and LEDs that are connected to the PICAXE microcontroller. We can switch devices on or off in sequences using: timing, counting, repetition, and decisions based on signals from digital and analogue sensors that are connected to the PICAXE microcontroller.
    [Show full text]
  • As Easy As Click, Click, Code!
    As easy as click, click, code! v A motivational learning system Programming Reference Document 45284 Contents Interface Overview ..........................................................................................................................................................1 The Fable PC Interface – Blockly ...........................................................................................................................................................1 The Fable PC Interface – Python ...........................................................................................................................................................2 Simple-View Blocks ..........................................................................................................................................................3 Logic .................................................................................................................................................................................................................3 Actions .............................................................................................................................................................................................................4 Loops ................................................................................................................................................................................................................5 Colors ...............................................................................................................................................................................................................6
    [Show full text]
  • Resume 15 Years of Experience
    7/3/2019 Zulfa's Portfolio Resume 15 Years of Experience Zulfa Juniadi About Me Web Developer Name Age Education Mobile App Developer Game Developer Zulfa Juniadi 33 Years Old Universiti Teknologi Petronas About me Experience Home Award Resume Portfolio 15 Years Kajang, Selangor Developer Hero, 2016 github.com/zulfajuniadi Experience hailburns.itch.io twitter.com/zuljzul Sept 2018 - July 2019 August 2014 - August 2018 +60192727155 [email protected] Lead Developer Head of Software Development zulfajuniadi.com Grenapps Sdn Bhd Department Set up software division Train junior developers Sands Consulting Sdn. Bhd. (Merged with Grenapps Sdn. Bhd.) Maintain existing systems from Sands Consulting Sdn Bhd Planning time and human resource for upcoming projects Assisting junior developers through code review Consulting customers pre and post deployment August 2012 - July 2014 August 2009 - June 2012 Lead Programmer Presales Engineer Hasrimy Technologies Sdn Bhd Intisari Tuah Group Sdn Bhd Conversion of Illustrator / Sketch design to HTML / CSS Finding contracts and projects in networking services Design SQL database schema according to project requirements and Planning and proposing projects to prospective customers needs Consulting customers during deployment Lead the programming department February 2005 - May 2008 June 2008 - June 2009 Zultek Solutions DSA Networks Sdn Bhd Owner / CEO Sales Director Finding contracts and projects in IT services Negotiating contracts and projects in networking services Provided Streamyx registration, installation and networking services Specializing in enterprise wireless solution and leased line Internet Became top Streamyx reseller in Sabah access Community Work 2013 - Current 2013 - Current 2013 - Current Programming Laman Laravel Group Javascript Malaysia Web UI / UX Malaysia A Facebook group of Javascript coders in Malaysia.
    [Show full text]
  • Code Smell Prediction Employing Machine Learning Meets Emerging Java Language Constructs"
    Appendix to the paper "Code smell prediction employing machine learning meets emerging Java language constructs" Hanna Grodzicka, Michał Kawa, Zofia Łakomiak, Arkadiusz Ziobrowski, Lech Madeyski (B) The Appendix includes two tables containing the dataset used in the paper "Code smell prediction employing machine learning meets emerging Java lan- guage constructs". The first table contains information about 792 projects selected for R package reproducer [Madeyski and Kitchenham(2019)]. Projects were the base dataset for cre- ating the dataset used in the study (Table I). The second table contains information about 281 projects filtered by Java version from build tool Maven (Table II) which were directly used in the paper. TABLE I: Base projects used to create the new dataset # Orgasation Project name GitHub link Commit hash Build tool Java version 1 adobe aem-core-wcm- www.github.com/adobe/ 1d1f1d70844c9e07cd694f028e87f85d926aba94 other or lack of unknown components aem-core-wcm-components 2 adobe S3Mock www.github.com/adobe/ 5aa299c2b6d0f0fd00f8d03fda560502270afb82 MAVEN 8 S3Mock 3 alexa alexa-skills- www.github.com/alexa/ bf1e9ccc50d1f3f8408f887f70197ee288fd4bd9 MAVEN 8 kit-sdk-for- alexa-skills-kit-sdk- java for-java 4 alibaba ARouter www.github.com/alibaba/ 93b328569bbdbf75e4aa87f0ecf48c69600591b2 GRADLE unknown ARouter 5 alibaba atlas www.github.com/alibaba/ e8c7b3f1ff14b2a1df64321c6992b796cae7d732 GRADLE unknown atlas 6 alibaba canal www.github.com/alibaba/ 08167c95c767fd3c9879584c0230820a8476a7a7 MAVEN 7 canal 7 alibaba cobar www.github.com/alibaba/
    [Show full text]
  • Rapport De Stage DUT Informatique LORIA
    IUT Nancy-Charlemagne Université de Lorraine 2 ter Boulevard Charlemagne 54052 Nancy Cedex Dépt. Informatique Langage visuel pour un exerciseur Rapport de stage DUT informatique LORIA Baptiste MOUNIER 47ème promotion (2015) IUT Nancy-Charlemagne Université de Lorraine 2 ter Boulevard Charlemagne 54052 Nancy Cedex Dépt. Informatique Langage visuel pour un exerciseur Rapport de stage DUT informatique LORIA Campus Scientifique BP 239 54506 Vandœuvre-lès-Nancy Auteur : Baptiste MOUNIER Maîtres de stage : Gérald OSTER Matthieu NICOLAS Martin QUINSON Marraine : Isabelle DEBLED-RENNESSON Remerciements Il me semble judicieux avant de débuter ce rapport de remercier toutes celles et ceux qui m’ont permis de le réaliser ces conditions. Je commencerai par Matthieu Nicolas, Gérald Oster et Martin Quinson qui m’ont accepté au sein de leur projet et qui m’ont accompagné dans la réalisation de ma contribution. Egalement Mme. Debled-Rennesson, ma marraine de stage qui a effectué le suivi et l’encadrement de mon stage. De même que toute l’équipe COAST qui m’a accueilli dans leurs locaux avec la joie et la bonne humeur, éléments essentiels d’un travail efficace au quotidien. Notamment Claudia- Lavinla Ignat Et Luc André. Et par extension le LORIA dans son ensemble. Je n’oublierai pas l’IUT et ses enseignants qui m’ont apporté tout au long de ces deux années les capacités pour réaliser ce genre de projet. Table des matières Remerciements ......................................................................................................................................
    [Show full text]
  • Comparison of Flow-Based Versus Block-Based Programming for Naive Programmers
    COMPARISON OF FLOW-BASED VERSUS BLOCK-BASED PROGRAMMING FOR NAIVE PROGRAMMERS by Kruti Dave Bachelor of Engineering in Information Technology, Mumbai University, 2012 A thesis presented to Ryerson University in partial fulfillment of the requirements for the degree of Master of Science in the program of Computer Science Toronto, Ontario, Canada, 2018 c Kruti Dave 2018 Author’s Declaration I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I authorize Ryerson University to lend this thesis to other institutions or individuals for the purpose of scholarly research. I further authorize Ryerson University to reproduce this thesis by photocopying or by other means, in total or in part, at the request of other institutions or individuals for the purpose of scholarly research. I understand that my thesis may be made electronically available to the public for the purpose of scholarly research only. ii Abstract Comparison of Flow-based versus Block-based Programming for Naive Programmers Kruti Dave Master of Science, Computer Science Ryerson University, 2018 There is general agreement that most people should have some programming ability, whether to investigate the vast amount of data around them or for professional purposes. Visual Programming Languages comprise two broad categories: Flow-based, functional programming or Block-based, imperative programming. However, there has been a lack of empirical studies in the visual programming domain to evaluate the relative benefits of the two categories. This research provides an empirical study to analyze the effects of the comparison between Flow- based and Block-based paradigm, to determine which of the two representations is easier for non-programmers or novice programmers.
    [Show full text]
  • A Visual Organization System for MIT App Inventor
    Folders: A Visual Organization System for MIT App Inventor Xixi \Shirley" Lu Submitted in Partial Fulfillment of the Prerequisite for Honors in Computer Science May 2015 c 2015 Xixi Lu Abstract In blocks programming languages, such as MIT App Inventor, programs are built by composing puzzle-shaped fragments on a 2D workspace. Their visual nature makes programming more accessi- ble to novices, but it also has numerous drawbacks. Users must decide where to place blocks on the workspace, and these placements may require the reorganization of other blocks. Block representa- tions are less space efficient than their textual equivalents. Finally, the fundamental 2D nature of the blocks workspace makes it more challenging to search and navigate than the traditional linear workflow. Because of these barriers, users have difficulty creating and navigating complex programs. In order to address these drawbacks, I have developed Folders, a visual organization system, for App Inventor. Folders, which are modeled after the hierarchical desktop metaphor folders, allow users to nest blocks within them, and solve many of the aforementioned problems. First, users can use Folders, rather than spatial closeness, to place and organize blocks, thereby explicitly indicating a relationship between them. Second, Folders allow users to selectively hide and show particular groups of blocks and address the issue of limited visible space. Lastly, users are already familiar with the folder metaphor from other applications, so their introduction does not complicate App Inventor. Unfortunately, Folders also introduce new obstacles. Users might expect that putting blocks into Folders removes them from the main workspace semantically. However, Folders are only for organizing blocks and decluttering the workspace, and their contained blocks are still considered part of the main workspace.
    [Show full text]