• 検索結果がありません。

Evaluation of a Visual Programming Language in the Class Room

N/A
N/A
Protected

Academic year: 2021

シェア "Evaluation of a Visual Programming Language in the Class Room"

Copied!
1
0
0

読み込み中.... (全文を見る)

全文

(1)Vol. 49. No. SIG 3(PRO 36). IPSJ Transactions on Programming. Mar. 2008. Abstract. Evaluation of a Visual Programming Language in the Class Room Yutaka Watanobe,†1 Nikolay Mirenkov†1 and Rentaro Yoshioka†1 This presentation shows the evaluation of a visual programming language based on ideas of cyberFilms where algorithms are represented by sets of multimedia frames, and contents of frames are represented by an icon language. The introduction of such a new programming paradigm requires a great variety of tests, experiments, and evaluations. To promote this language, we developed basic constructs and created several experimental subsystems. To test expressive power of the language, we have also developed a library of cyberFilm algorithms. The goal of the presentation is to show the usability and understandability evaluation of the language by end users using some library items. Eighty six undergraduate students of Advanced Algorithm classes have been involved in the evaluation. They evaluated visual constructs, icons, and animations representing dynamical features of algorithms, as well as visual programs as a whole. Results show that in spite of very limited time of study, participants could correctly perceive semantics of visual expressions, and easier understand the visual programs in comparison with conventional text-based programs. To simplify the result perception, a brief explanation of the language and library items are also provided.. (Presented October 11, 2007). †1 Department of Information Systems, The University of Aizu 55.

(2)

参照

関連したドキュメント

Laplacian on circle packing fractals invariant with respect to certain Kleinian groups (i.e., discrete groups of M¨ obius transformations on the Riemann sphere C b = C ∪ {∞}),

What relates to Offline Turing Machines in the same way that functional programming languages relate to Turing Machines?.. Int Construction.. Understand the transition from

(Construction of the strand of in- variants through enlargements (modifications ) of an idealistic filtration, and without using restriction to a hypersurface of maximal contact.) At

Theorem 2 If F is a compact oriented surface with boundary then the Yang- Mills measure of a skein corresponding to a blackboard framed colored link can be computed using formula

We show some symmetry relations among the correlation functions of the in- tegrable higher-spin XXX and XXZ spin chains, where we explicitly evaluate the multiple integrals

Having this product and a product integral in a Fr´ echet space (see [6]), we obtain the exact formula (11) for the solution of problem (1), being an extension of a similar formula

Then it follows immediately from a suitable version of “Hensel’s Lemma” [cf., e.g., the argument of [4], Lemma 2.1] that S may be obtained, as the notation suggests, as the m A

These include the relation between the structure of the mapping class group and invariants of 3–manifolds, the unstable cohomology of the moduli space of curves and Faber’s