Pharo is a clean, innovative, open-source, live-programming environment.

Deep into Pharois the second volume of a series of books covering Pharo. Whereas the first volume is intended for newcomers, this second volume covers deeper topics.You will learn about Pharo frameworks and libraries such as Glamour, PetitParser, Roassal, FileSystem, Regex, and Socket.

You will explore the language with chapters on exceptions, blocks, small integers, and floats.

You will discover tools such as profilers, Metacello and Gofer.

This course takes a 'back to the beginning' view that aims to better understand the end result. What might be the developmental processes that lead to the organization of 'booming, buzzing confusions' into coherent visual objects? This course examines key experimental results and computational proposals pertinent to the discovery of objects in complex visual inputs. The structure of the course is designed to get students to learn and to focus on the genre of study as a whole; to get a feel for how science is done in this field.

Digital circuits, often called Integrated Circuits or ICs, are the central building blocks of a Central Processing Unit (CPU). To understand how a computer works, it is essential to understand the digital circuits which make up the CPU. This text introduces the most important of these digital circuits; adders, decoders, multiplexers, D flip-flops, and simple state machines.

The University of Queensland partnered with students to create Digital Essentials, a series of online modules for students to quickly build digital skills for study and work.

The modules cover different digital capabilities for creation, communication, wellbeing, data, information, learning and functional skills. The Learning pathway will help you to choose modules to build your digital capabilities. The modules include H5P content for interactivity and self-assessment. There is also a short quiz at the end of each module to check your knowledge.

The modules include:
Accessibility and study hacks
Communicate and collaborate online
Digital wellbeing and privacy
Employability
eProfessionalism
Finding and using media
Information essentials
Internet essentials
Password management
Social media
Types of assignments
Working with data
Working with files
Write, cite and submit
Writing for the web

This course describes discrete mathematics, which involves processes that consist of sequences of individual steps (as compared to calculus, which describes processes that change in a continuous manner). The principal topics presented in this course are logic and proof, induction and recursion, discrete probability, and finite state machines. Upon successful completion of this course, the student will be able to: Create compound statements, expressed in mathematical symbols or in English, to determine the truth or falseness of compound statements and to use the rules of inference to prove a conclusion statement from hypothesis statements by applying the rules of propositional and predicate calculus logic; Prove mathematical statements involving numbers by applying various proof methods, which are based on the rules of inference from logic; Prove the validity of sequences and series and the correctness or repeated processes by applying mathematical induction; Define and identify the terms, rules, and properties of set theory and use these as tools to support problem solving and reasoning in applications of logic, functions, number theory, sequences, counting, probability, trees and graphs, and automata; Calculate probabilities and apply counting rules; Solve recursive problems by applying knowledge of recursive sequences; Create graphs and trees to represent and help prove or disprove statements, make decisions or select from alternative choices to calculate probabilities, to document derivation steps, or to solve problems; Construct and analyze finite state automata, formal languages, and regular expressions. (Computer Science 202)

The course addresses dynamic systems, i.e., systems that evolve with time. Typically these systems have inputs and outputs; it is of interest to understand how the input affects the output (or, vice-versa, what inputs should be given to generate a desired output). In particular, we will concentrate on systems that can be modeled by Ordinary Differential Equations (ODEs), and that satisfy certain linearity and time-invariance conditions. We will analyze the response of these systems to inputs and initial conditions. It is of particular interest to analyze systems obtained as interconnections (e.g., feedback) of two or more other systems. We will learn how to design (control) systems that ensure desirable properties (e.g., stability, performance) of the interconnection with a given dynamic system.

MAIN AIMS OF THE MODULE: To achieve an understanding and practical experience of key principles, methods and theories in the area of educational software.
LEARNING OUTCOMES FOR THE MODULE: The module provides opportunities for students to develop and demonstrate knowledge and understanding, qualities, skills and other attributes in the following areas:
1) Obtain understand of major learning principles, theories, and approaches
2. Identify key factors of successful educational software design and deployment.
3) Apply theories, principles, and approached into an appropriate design of educational software system.
4) Establish an appreciation of state-of-art developments in the area of educational software design.
MAIN TOPICS OF STUDY: The main topics of study considered in light of the above learning outcomes are: ‰ Educational Principles Design of educational software such as electronic instruction manuals, serious gaming, VR training, drills, and tutor agents and tutorials ‰Educational software for specific learners such as children, elderly, mentally or physically challenged individuals ‰CEvaluation of education software.

Treatment of electromechanical transducers, rotating and linear electric machines. Lumped-parameter electromechanics of interaction. Development of device characteristics: energy conversion density, efficiency; and of system interaction characteristics: regulation, stability, controllability, and response. Use of electric machines in drive systems. Problems taken from current research. This course explores concepts in electromechanics, using electric machinery as examples. It teaches an understanding of principles and analysis of electromechanical systems. By the end of the course, students are capable of doing electromechanical design of the major classes of rotating and linear electric machines and have an understanding of the principles of the energy conversion parts of Mechatronics. In addition to design, students learn how to estimate the dynamic parameters of electric machines and understand what the implications of those parameters are on the performance of systems incorporating those machines.

"Published in 1989 by Prentice-Hall, this book is a useful resource for educators and self-learners alike. The text is aimed at those who have seen Maxwell's equations in integral and differential form and who have been exposed to some integral theorems and differential operators. A hypertext version of this textbook can be found here. An accompanying set of video demonstrations is available below. These video demonstrations convey electromagnetism concepts. The demonstrations are related to topics covered in the textbook. They were prepared by Markus Zahn, James R. Melcher, and Manuel L. Silva and were produced by the Department of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology. The purpose of these demonstrations is to make mathematical analysis of electromagnetism take on physical meaning. Based on relatively simple configurations and arrangements of equipment, they make a direct connection between what has been analytically derived and what is observed. They permit the student to observe physically what has been described symbolically. Often presented with a plot of theoretical predictions that are compared to measured data, these demonstrations give the opportunity to test the range of validity of the theory and present a quantitative approach to dealing with the physical world. The short form of these videos contains the demonstrations only. The long form also presents theory, diagrams, and calculations in support of the demonstrations. These videos are used in the courses 6.013J/ESD.013J and 6.641. Technical Requirements:Special software is required to use some of the files in this course: .mp4, .rm."

Feedback control is an important technique that is used in many modern electronic and electromechanical systems. The successful inclusion of this technique improves performance, reliability, and cost effectiveness of many designs. In this series of lectures we introduce the analytical concepts that underlie classical feedback system design. The application of these concepts is illustrated by a variety of experiments and demonstration systems. The diversity of the demonstration systems reinforces the value of the analytic methods.

In this course, the student will learn the theoretical and practical aspects of algorithms and Data Structures. The student will also learn to implement Data Structures and algorithms in C/C++, analyze those algorithms, and consider both their worst-case complexity and practical efficiency. Upon successful completion of this course, students will be able to: Identify elementary Data Structures using C/C++ programming languages; Analyze the importance and use of Abstract Data Types (ADTs); Design and implement elementary Data Structures such as arrays, trees, Stacks, Queues, and Hash Tables; Explain best, average, and worst-cases of an algorithm using Big-O notation; Describe the differences between the use of sequential and binary search algorithms. (Computer Science 201)

This book contains roughly three parts. The first 11 chapters discussthe JavaScript language itself. The next eight chapters are about webbrowsers and the way JavaScript is used to program them. Finally,two chapters are devoted to Node.js, another environment to programJavaScript in.Throughout the book, there are five project chapters, which describelarger example programs to give you a taste of real programming. Inorder of appearance, we will work through building an artificial life simulation,a programming language, a platform game, a paint program,and a dynamic website.

Pharo is a clean, innovative, open-source, live-programming environment.

Enterprise Pharo is the third volume of a series of book covering Pharo and its community. Whereas the first volume Pharo by Example is intended for newcomers and the second volume Deep into Pharo covers deep topics of Pharo, this third volume covers libraries and frameworks for enterprises, and in particular those doing web development.

The following set of materials is used in the Textbook Transformation Grants implementation of Ethical Hacking for Effective Defense:

https://oer.galileo.usg.edu/compsci-collections/8/

Topics include:

TCP/IP Level Attacks
Port Scanning
DDoS
Footprinting and Social Engineering
Enumeration
Programming for Security Professionals
Operating System Vulnerabilities
Embedded System Security
Hacking Web Servers
Hacking Wireless Networks
Cryptography
Protecting Networks with Security Devices

MIT App Inventor is an intuitive, visual programming environment that allows everyone – even children – to build fully functional apps for smartphones and tablets.

Inspired by the work of the architect Antoni Gaudi, this research workshop will explore three-dimensional problems in the static equilibrium of structural systems. Through an interdisciplinary collaboration between computer science and architecture, we will develop design tools for determining the form of three-dimensional structural systems under a variety of loads. The goal of the workshop is to develop real-time design and analysis tools which will be useful to architects and engineers in the form-finding of efficient three-dimensional structural systems.

Foundations of Computation is a free textbook for a one-semester course in theoretical computer science. It has been used for several years in a course at Hobart and William Smith Colleges. The course has no prerequisites other than introductory computer programming. The first half of the course covers material on logic, sets, and functions that would often be taught in a course in discrete mathematics. The second part covers material on automata, formal languages, and grammar that would ordinarily be encountered in an upper level course in theoretical computer science.

This course provides practical instruction in the design and analysis of non-digital games. Students cover the texts, tools, references and historical context to analyze and compare game designs across a variety of genres, including sports, game shows, games of chance, card games, schoolyard games, board games, and role–playing games. In teams, students design, develop, and thoroughly test their original games to understand the interaction and evolution of game rules. Students taking the graduate version complete additional assignments.

This course will provide a gentle, yet intense, introduction to programming using Python for highly motivated students with little or no prior experience in programming. The course will focus on planning and organizing programs, as well as the grammar of the Python programming language. The course is designed to help prepare students for 6.01 Introduction to EECS. 6.01 assumes some knowledge of Python upon entering; the course material for 6.189 has been specially designed to make sure that concepts important to 6.01 are covered. This course is offered during the Independent Activities Period (IAP), which is a special 4-week term at MIT that runs from the first week of January until the end of the month.

This course provides a challenging introduction to some of the central ideas of theoretical computer science. It attempts to present a vision of "computer science beyond computers": that is, CS as a set of mathematical tools for understanding complex systems such as universes and minds. Beginning in antiquity--with Euclid's algorithm and other ancient examples of computational thinking--the course will progress rapidly through propositional logic, Turing machines and computability, finite automata, GĚŚdel's theorems, efficient algorithms and reducibility, NP-completeness, the P versus NP problem, decision trees and other concrete computational models, the power of randomness, cryptography and one-way functions, computational theories of learning, interactive proofs, and quantum computing and the physical limits of computation. Class participation is essential, as the class will include discussion and debate about the implications of many of these ideas.