Students will be able to explain and demonstrate how plastic parts are …
Students will be able to explain and demonstrate how plastic parts are made and the chemistry involved in making different parts to meet different customer requirements. These resources fall into academic and the career domains.
Students will be able to explain and demonstrate how plastic parts are …
Students will be able to explain and demonstrate how plastic parts are made and the chemistry involved in making different parts to meet different customer requirements. These resources fall into academic and the career domains.
"6.002 is designed to serve as a first course in an undergraduate …
"6.002 is designed to serve as a first course in an undergraduate electrical engineering (EE), or electrical engineering and computer science (EECS) curriculum. At MIT, 6.002 is in the core of department subjects required for all undergraduates in EECS. The course introduces the fundamentals of the lumped circuit abstraction. Topics covered include: resistive elements and networks; independent and dependent sources; switches and MOS transistors; digital abstraction; amplifiers; energy storage elements; dynamics of first- and second-order networks; design in the time and frequency domains; and analog and digital circuits and applications. Design and lab exercises are also significant components of the course. 6.002 is worth 4 Engineering Design Points. The 6.002 content was created collaboratively by Profs. Anant Agarwal and Jeffrey H. Lang. The course uses the required textbook Foundations of Analog and Digital Electronic Circuits. Agarwal, Anant, and Jeffrey H. Lang. San Mateo, CA: Morgan Kaufmann Publishers, Elsevier, July 2005. ISBN: 9781558607354."
Code For Fun assembles, creates, reuses curricula, to provide educators with content …
Code For Fun assembles, creates, reuses curricula, to provide educators with content they can use, and adjust based on their audience. Their lessons cover all the standards in the CS K-12 Framework and California K-12 Computer Science Standards.
The student will learn through modules that can be completed on your …
The student will learn through modules that can be completed on your own time, learn about basic programming + good CS pedagogy. Topics include debugging methods, assessing student learning, modifying lessons to students' needs, and much, much more!
CodeMonkey is a great way for students to gain a better understanding …
CodeMonkey is a great way for students to gain a better understanding of how programming works. It is an engaging platform where programming knowledge is acquired alongside 21st century skills through collaboratively playing and solving puzzles, inventing, creating and sharing.
Designed with inclusivity, cultural relevance, social justice and regional curriculum in mind, …
Designed with inclusivity, cultural relevance, social justice and regional curriculum in mind, these coding & robotics programs are offered free to K-12 classrooms across subject areas.
From Code.org: "In this lesson, students will relate the concept of algorithms …
From Code.org:
"In this lesson, students will relate the concept of algorithms back to real-life activities by playing the Dice Race game. The goal here is to start building the skills to translate real-world situations to online scenarios and vice versa."
From Code.org: "The bridge from algorithms to programming can be a short …
From Code.org:
"The bridge from algorithms to programming can be a short one if students understand the difference between planning out a sequence and encoding that sequence into the appropriate language. This activity will help students gain experience reading and writing in shorthand code."
This video from NASA describes the detailed computer modeling used to predict …
This video from NASA describes the detailed computer modeling used to predict that colliding neutron stars can produce gamma-ray bursts similar to those associated with black holes.
Students will use the Scratch Jr. app to create, compare and contrast …
Students will use the Scratch Jr. app to create, compare and contrast characters. This introductory lesson will include the foundational skills students will need to begin using Scratch Jr., so it makes a great "first project" with students.Pre-requisites-Have a device available for each student (Note: instructions are written for iPad, but the app is available on Android and ChromeOS devices as well).-Ensure that the app "Scratch Jr." is installed on all of the devices. This is a free app in the iOS App Store, Google Play Store, or Chrome Web Store.-Read through this lesson plan. The teacher will be directing students through each step along the way, so familiarize yourself with the end product.
This course introduces the compilation process, presenting foundational topics on formal languages …
This course introduces the compilation process, presenting foundational topics on formal languages and outline each of the essential compiler steps: scanning, parsing, translation and semantic analysis, code generation, and optimization. Upon successful completion of this course, the student will be able to: describe the compilation process and explain the function of the components that comprise the structure of a compiler; apply concepts of formal languages and finite-state machines to the translation of computer languages; identify the compiler techniques, methods, and tools that are applicable to other software applications; describe the challenges and state-of-the-practice of compiler theory and practice. This free course may be completed online at any time. (Computer Science 304)
This course is offered to graduates and is a project-oriented course to …
This course is offered to graduates and is a project-oriented course to teach new methodologies for designing multi-million-gate CMOS VLSI chips using high-level synthesis tools in conjunction with standard commercial EDA tools. The emphasis is on modular and robust designs, reusable modules, correctness by construction, architectural exploration, and meeting the area, timing, and power constraints within standard cell and FPGA frameworks.
Physics, modeling, application, and technology of compound semiconductors (primarily III-Vs) in electronic, …
Physics, modeling, application, and technology of compound semiconductors (primarily III-Vs) in electronic, optoelectronic, and photonic devices and integrated circuits. Topics: properties, preparation, and processing of compound semiconductors; theory and practice of heterojunctions, quantum structures, and pseudomorphic strained layers; metal-semiconductor field effect transistors (MESFETs); heterojunction field effect transistors (HFETs) and bipolar transistors (HBTs); and optoelectronic devices.
Theory for programmers. Introduction to programming and computability theory based on a …
Theory for programmers. Introduction to programming and computability theory based on a term-rewriting, "substitution" model of computation by Scheme programs with side-effects. Computation as algebraic manipulation: provable and valid inequalities for multivariate polynomials. Scheme evaluation as algebraic manipulation and term rewriting theory. Paradoxes from self-application and introduction to formal programming semantics. Undecidability of the Halting Problem for Scheme. Properties of recursively enumerable sets, leading to Incompleteness Theorems for Scheme equivalences. Introduction to logic for program specification and verification. Hilbert's Tenth Problem. Alternate years. 6.844 is a graduate introduction to programming theory, logic of programming, and computability, with the programming language Scheme used to crystallize computability constructions and as an object of study itself. Topics covered include: programming and computability theory based on a term-rewriting, "substitution" model of computation by Scheme programs with side-effects; computation as algebraic manipulation: Scheme evaluation as algebraic manipulation and term rewriting theory; paradoxes from self-application and introduction to formal programming semantics; undecidability of the Halting Problem for Scheme; properties of recursively enumerable sets, leading to Incompleteness Theorems for Scheme equivalences; logic for program specification and verification; and Hilbert's Tenth Problem.
" 6.004 offers an introduction to the engineering of digital systems. Starting …
" 6.004 offers an introduction to the engineering of digital systems. Starting with MOS transistors, the course develops a series of building blocks ŰÓ logic gates, combinational and sequential circuits, finite-state machines, computers and finally complete systems. Both hardware and software mechanisms are explored through a series of design examples. 6.004 is required material for any EECS undergraduate who wants to understand (and ultimately design) digital systems. A good grasp of the material is essential for later courses in digital design, computer architecture and systems. The problem sets and lab exercises are intended to give students "hands-on" experience in designing digital systems; each student completes a gate-level design for a reduced instruction set computer (RISC) processor during the semester."
This course is an introduction to computational theories of human cognition. Drawing …
This course is an introduction to computational theories of human cognition. Drawing on formal models from classic and contemporary artificial intelligence, students will explore fundamental issues in human knowledge representation, inductive learning and reasoning. What are the forms that our knowledge of the world takes? What are the inductive principles that allow us to acquire new knowledge from the interaction of prior knowledge with observed data? What kinds of data must be available to human learners, and what kinds of innate knowledge (if any) must they have?
Introduces design as a computational enterprise in which rules are developed to …
Introduces design as a computational enterprise in which rules are developed to compose and describe architectural and other designs. The class covers topics such as shapes, shape arithmetic, symmetry, spatial relations, shape computations, and shape grammars. It focuses on the application of shape grammars in creative design, and teaches shape grammar fundamentals through in-class, hands-on exercises with abstract shape grammars. The class discusses issues related to practical applications of shape grammars.
Why has it been easier to develop a vaccine to eliminate polio …
Why has it been easier to develop a vaccine to eliminate polio than to control influenza or AIDS? Has there been natural selection for a 'language gene'? Why are there no animals with wheels? When does 'maximizing fitness' lead to evolutionary extinction? How are sex and parasites related? Why don't snakes eat grass? Why don't we have eyes in the back of our heads? How does modern genomics illustrate and challenge the field? This course analyzes evolution from a computational, modeling, and engineering perspective. The course has extensive hands-on laboratory exercises in model-building and analyzing evolutionary data.
No restrictions on your remixing, redistributing, or making derivative works. Give credit to the author, as required.
Your remixing, redistributing, or making derivatives works comes with some restrictions, including how it is shared.
Your redistributing comes with some restrictions. Do not remix or make derivative works.
Most restrictive license type. Prohibits most uses, sharing, and any changes.
Copyrighted materials, available under Fair Use and the TEACH Act for US-based educators, or other custom arrangements. Go to the resource provider to see their individual restrictions.
