How we Think

Traditional engineering instruction is deductive, beginning with theories and progressing to the applications of those theories Alternative teaching approaches are more inductive Topics are introduced by presenting specific observations, case studies or problems, and theories are taught or the students are helped to discover them only after the need to know them has been established This study reviews several of the most commonly used inductive teaching methods, including inquiry learning, problem-based learning, project-based learning, case-based teaching, discovery learning, and just-in-time teaching The paper defines each method, highlights commonalities and specific differences, and reviews research on the effectiveness of the methods While the strength of the evidence varies from one method to another, inductive methods are consistently found to be at least equal to, and in general more effective than, traditional deductive methods for achieving a broad range of learning outcomes

Inductive Teaching and Learning Methods: Definitions, Comparisons, and Research Bases

the cambridge handbook of the learning sciences is available in our digital library an online access to it is set as public so you can download it instantly. Our books collection spans in multiple locations, allowing you to get the most less latency time to download any of our books like this one. Merely said, the the cambridge handbook of the learning sciences is universally compatible with any devices to read.

The Cambridge Handbook Of The Learning Sciences

The computing world today is in the middle of a revolution: mobile clients and cloud computing have emerged as the dominant paradigms driving programming and hardware innovation today. The Fifth Edition of Computer Architecture focuses on this dramatic shift, exploring the ways in which software and technology in the "cloud" are accessed by cell phones, tablets, laptops, and other mobile computing devices. Each chapter includes two real-world examples, one mobile and one datacenter, to illustrate this revolutionary change. Updated to cover the mobile computing revolutionEmphasizes the two most important topics in architecture today: memory hierarchy and parallelism in all its forms.Develops common themes throughout each chapter: power, performance, cost, dependability, protection, programming models, and emerging trends ("What's Next")Includes three review appendices in the printed text. Additional reference appendices are available online.Includes updated Case Studies and completely new exercises.

Computer Architecture, Fifth Edition: A Quantitative Approach

International Society for Technology in Education.

The Adaptive Bubble Router

A router design for torus networks that significantly reduces message latency over traditional wormhole routers is presented in this paper. This new router implements virtual cut-through switching and fully-adaptive minimal routing. Packet deadlock is avoided by providing escape ways governed by Bubble flow control, a mechanism that guarantees enough free buffer space in the network to allow continuous packet movement. Both deterministic and adaptive Bubble routers have been designed in VLSI using VHDL synthesis tools. Adopting a fair quantitative comparison, we demonstrate that Bubble routers exhibit a reduction in base latency values over 40% with respect to the corresponding wormhole routers, without any penalty in network throughput. With much lower VLSI costs than adaptive wormhole routers, the adaptive Bubble router is even faster than deterministic wormhole routers based on virtual channels.

/pdf/adaptive-bubble-router-a-design-to-improve-performance-in-sl9t6iihfc.pdf

Adaptive bubble router: a design to improve performance in torus networks

There is a wealth of literature dealing with the difficulties of novice programmers with basic programming constructs such as variables, assignment and conditionals. In this paper we extend the study to two other core CS1 topics: loops and vectors (represented as single dimensional arrays). By the end of their first semester of instruction, students are expected to have acquired both the ability to reproduce given syntactic structure and basic design skills that allow them to write small pieces of code that extend, modify or combine in new ways the basic programming constructs. This work presents an evaluation framework that uses the SOLO taxonomy to assess programming questions' complexity. Our framework extends SOLO by using the term "building block" as an adaptable parameter that explicitly defines the student's ability to increasingly write more complex pieces of code. The granularity of a "building block" is determined by the amount of programming practice students have carried out up to that point. The analysis of final exam answers using this framework allows us to quantify the progress made by one cohort of novice programmers in the mastery of basic design skills and to study correlations between mastery of these skills and overall course performance. Furthermore, we identify common errors that illustrate the challenges students face when trying to combine programming constructs in non-trivial ways.

A Study of Code Design Skills in Novice Programmers using the SOLO taxonomy

This exploratory study focuses on concepts and their assessment in K-9 computer science (CS) education. We analyzed concepts in local curriculum documents and guidelines, as well as interviewed K-9 teachers in two countries about their teaching and assessment practices. Moreover, we investigated the 'task based assessment' approach of the international Bebras contest by classifying the conceptual content and question structure of Bebras tasks spanning five years. Our results show a variety in breadth and focus in curriculum documents, with the notion of algorithm as a significant common concept. Teachers' practice appears to vary, depending on their respective backgrounds. Informal assessment practices are predominant, especially in the case of younger students. In the Bebras tasks, algorithms and data representation were found to be the main concept categories. The question structure follows specific patterns, but the relative frequencies of the patterns employed in the tasks vary over the years. Our analysis methods appear to be interesting in themselves, and the results of our study give rise to suggestions for follow-up research.

/pdf/concepts-in-k-9-computer-science-education-39b9qq81f5.pdf

Concepts in K-9 Computer Science Education

This paper explores the suitability of dense circulant graphs of degree four for the design of on-chip interconnection networks. Networks based on these graphs reduce the Torus diameter in a factor √2, which translates into significant performance gains for unicast traffic. In addition, they are clearly superior to Tori when managing collective communications. This paper introduces a new two-dimensional node's labeling of the networks explored which simplifies their analysis and exploitation. In particular, it provides simple and optimal solutions to two important architectural issues: routing and broadcasting. Other implementation issues such as network folding and scalability by using hierarchical networks are also explored in this work.

/pdf/dense-gaussian-networks-suitable-topologies-for-on-chip-4zjzv66z60.pdf

Cruz Izu

Papers

The Adaptive Bubble Router

Adaptive bubble router: a design to improve performance in torus networks

A Study of Code Design Skills in Novice Programmers using the SOLO taxonomy

Concepts in K-9 Computer Science Education

Dense Gaussian networks: suitable topologies for on-chip multiprocessors