This lesson talks about the basics of lists in Python. [Computer Programming playlist: 2 of 23]

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]

Computer science is the study of computational systems and their use in representing important problems in science and society. Major topics include computational science, software systems, network systems, theory of computation, machine learning, and human-computer interaction.

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.

***LOGIN REQUIRED*** This two-semester course provides instruction in the basics of computer construction and repair; emphasizes troubleshooting and diagnosis of hardware and software failures; provides the skills necessary to gain entry-level employment in the field of computer servicing. Students have the opportunity to service and repair a wide range of personal computers while learning theory of operation and gaining programming skills. Students will use a variety of service tools. The operation of each component of a computer is studied and tested while assembling test computers. Designed to provide a solid foundation as a basis for a student's continuing education in the computer sciences.

Computers and processors are ubiquitous in everyday life, and they're not only found in your PC. This unit introduces the different parts of computer systems and their use of binary code. Using the examples of kitchen scales, a digital camera and a computer artwork the unit, with the help of flowcharts, discusses how computers process data and instructions.

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.

" This class explores interaction with mobile computing systems and telephones by voice, including speech synthesis, recognition, digital recording, and browsing recorded speech. Emphasis on human interface design issues and interaction techniques appropriate for cognitive requirements of speech. Topics include human speech production and perception, speech recognition and text-to-speech algorithms, telephone networks, and spatial and time-compressed listening. Extensive reading from current research literature."

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.

This course examines computers anthropologically, as artifacts revealing the social orders and cultural practices that create them. Students read classic texts in computer science along with cultural analyses of computing history and contemporary configurations. It explores the history of automata, automation and capitalist manufacturing; cybernetics and WWII operations research; artificial intelligence and gendered subjectivity; robots, cyborgs, and artificial life; creation and commoditization of the personal computer; the growth of the Internet as a military, academic, and commercial project; hackers and gamers; technobodies and virtual sociality. Emphasis is placed on how ideas about gender and other social differences shape labor practices, models of cognition, hacking culture, and social media.

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.)