This lesson is an introduction to recursion. [Computer Programming playlist: 12 of 23]

This lesson shows how to use recursion to write a Fibonacci function. [Computer Programming playlist: 17 of 23]

This lesson explains simplifying the 'while look' for the Insertion Sort function. [Computer Programming playlist: 23 of 23]

This lesson clarifies what \break\ does and stepping through the insertion sort implementation. [Computer Programming playlist: 22 of 23]

In this lesson you will understand how the iterative Fibonacci function works for a particular example. [Computer Programming playlist: 16 of 23]

This lesson shows why and how the recursive Fibonacci function works. [Computer Programming playlist: 18 of 23]

This lesson shows what happens when a user inputs a particular value into a factorial program in Python. [Computer Programming playlist: 7 of 23]

This computer programming lesson shows how 'while loop' can do the same thing as 'for loop' in Python. [Computer Programming playlist: 4 of 23]

This lesson demonstrates how to write a simple factorial program with a \for\ loop in Python. [Computer Programming playlist: 6 of 23]

This is an activity designed to have students develop soft skills, specifically communication in a computer science setting using python and the repl IDE.  It can be given as a full document, broken up into a jigsaw activity and altered to accomodate different computer languages and IDEs.  The goal is that students develop needed skills for a career that we don't generally practice in class but are still highly valued by future jobs, even outside of IT.  This was created for english readers but can be altered for any language.

Emphasizes the relationship among technology, hardware organization, and programming systems in the evolution of computer architecture. Pipelined, out-of-order, and speculative execution. Superscaler, VLIW, vector, and multithreaded processors. Addressing structures and virtual memory, and exception handling. I/O and memory systems. Parallel computers; message passing and shared memory systems. Memory models, synchronization, and cache coherence protocols. Vector supercomputers. Assumes an undergraduate knowledge of computer systems.

This free ESL lesson plan on computers has been designed for adults and young adults at an intermediate (B1/B2) to advanced (C1/C2) level and should last around 45 to 60 minutes for one student.

Introduces abstraction as an important mechanism for problem decomposition and solution formulation in the biomedical domain, and examines computer representation, storage, retrieval, and manipulation of biomedical data. Examines effect of programming paradigm choice on problem-solving approaches, introduces data structures and algorithms. Presents knowledge representation schemes for capturing biomedical domain complexity. Teaches principles of data modeling for efficient storage and retrieval. The final project involves building a medical information system that encompasses the different concepts taught in the subject.

From the Scratch Wiki:
"Scratch contains the resources available for creating a question/answer system. This system can be used for one to be 'quizzed', or to repetitively answer automated questions. This tutorial shows various methods on how to create a question system. For each method, the ask () and wait block is used to ask questions and input answers."

Use these blocks to teach students to create a quiz for many different concepts and disciplines.

This course introduces cryptography by addressing topics such as ciphers that were used before World War II, block cipher algorithms, the advanced encryption standard for a symmetric-key encryption adopted by the U.S. government, MD5 and SHA-1 hash functions, and the message authentication code. The course will focus on public key cryptography (as exemplified by the RSA algorithm), elliptic curves, the Diffie-Hellman key exchange, and the elliptic curve discrete logarithm problem. The course concludes with key exchange methods, study signature schemes, and discussion of public key infrastructure. Note: It is strongly recommended that you complete an abstract algebra course (such as the Saylor FoundationĺÎĺ_ĺĚĺ_s MA231) before taking this course. Upon successful completion of this course, students will be able to: explain how symmetric and asymmetric key ciphers work; list and define cryptographyĺÎĺ_ĺĚĺ_s goals; list and define the most common classical ciphers; explain the workings of mechanical ciphers Enigma and Lorenz; describe the principles of substitution-permutation networks; describe the algorithms for data encryption and the advanced encryption standard; describe and use the MD5 and SHA-1 hash functions; explain the idea behind public key cryptography; use the RSA cryptography system by applying it to practical problems; test whether the large integer is prime with the mathematical tools presented in this course; define the elliptic curve and use it in cryptography; explain the Diffie-Hellman key exchange; describe the most common signature and autokey identity schemes; describe the conceptual workings of public key infrastructure. This free course may be completed online at any time. (Computer Science 409)

This course features a rigorous introduction to modern cryptography, with an emphasis on the fundamental cryptographic primitives of public-key encryption, digital signatures, pseudo-random number generation, and basic protocols and their computational complexity requirements.

Students gain experience with the software/system design process, closely related to the engineering design process, to solve a problem. First, they learn about the Mars Curiosity rover and its mission, including the difficulties that engineers must consider and overcome to operate a rover remotely. Students observe a simulation of a robot being controlled remotely. These experiences guide discussion on how the design process is applied in these scenarios. The lesson culminates in a hands-on experience with the design process as students simulate the remote control of a rover. In the associated activity, students gain further experience with the design process by creating an Android application using App Inventor to control one aspect of a remotely controlled vehicle. (Note: The lesson requires a LEGO® MINDSTORMS® Education NXT base set.)

This Business English lesson plan on cybersecurity has been designed for business professionals or other adults and young adults at an intermediate (B1/B2) to advanced (C1/C2) level and should last around 45 to 60 minutes for one student.

Modeling of the control processes in conventional and high-speed data communication networks. Develops and utilizes elementary concepts from queueing theory, algorithms, linear and nonlinear programming to study the problems of line and network protocols, distributed algorithms, quasi-static and dynamic routing, congestion control, deadlock prevention. Treats local and wide-area networks, and high-speed electronic and optical networks. Focuses on the fundamentals of data communication networks. One goal is to give some insight into the rationale of why networks are structured the way they are today and to understand the issues facing the designers of next-generation data networks. Much of the course focuses on network algorithms and their performance. Students are expected to have a strong mathematical background and an understanding of probability theory. Topics discussed include: layered network architecture, Link Layer protocols, high-speed packet switching, queueing theory, Local Area Networks, and Wide Area Networking issues, including routing and flow control.

Data Science is a slide deck for the intended use of building educator awareness of and capacity in Data Science. The slide deck contains hyperlinks to videos, webpages, and pdfs; as well as engagement strategies to facilitate group learning.