6.01 Lecture Notes - Lecture 15: List Comprehension, Combinatory Logic, Modus Operandi

7 views11 pages

rosi10agarwal

4 Apr 2023

School

MIT

Department

Electrical Engineering and Computer Science

Course

6.01

Professor

For unlimited access to Class Notes, a Class+ subscription is required.

Document Summary

155 takes a string as input, and returns a sequential tsm that will output that string. It uses a list comprehension to turn each character into a chartsm that generates that character, and then uses that sequence to make a sequence. def maketextsequencetsm(str): return sm. sequence([chartsm(c) for c in str]) In: none out: h next state: (1, false) In: none out: e next state: (2, false) In: none out: l next state: (3, false) In: none out: l next state: (4, false) In: none out: o next state: (5, false) In: none out: w next state: (7, false) In: none out: o next state: (8, false) In: none out: r next state: (9, false) In: none out: l next state: (10, false) In: none out: d next state: (10, true) ["h", "e", "l", "l", "o", " ", "w", "o", "r", "l", "d"] We can also see that sequencing interacts well with the repeat combinator.

Related Questions

Longer multiple choice questions (3 points each) Coding Question - Fibonacci sequence You are to write a method named "Fibo" that takes as input an integer n, and returns the nth number in the Fibonacci sequence. If Fibo (n) denotes the nth number in the Fibonacci sequence, then recall for n > 2, Fibo (n) = Fibo (n-1) + Fibo (n-2), and Fibo (1) = 1 and Fibo (2) = 1. You are to assume that the user is always going to enter an input greater than 2. For example Fibo (4) = 3. Use the 7 following questions to "write" your code. Pay close attention to how your answers group together with each other. 26. Line 1 (A) public static int Fibo (int n) { (B) public static void main(String[] args) { (C) public static int Fibo () { (D) public static void Fibo (Double input) { (E) public static void Fibo (int n) {

You are given an integer N, followed by N lines of input (1 <= N <= 100). Each line of input contains one or several words separated with single spaces. Each word is a sequence of letters of English alphabet containing between 1 and 10 characters, inclusive. The total number of words in the input is between 1 and 100, inclusive.

Your task is to reverse the order of words in each line of input, while preserving the words themselves. The lines of your output should not have any trailing or leading spaces.

Example

input
3
Hello World
Bye World
Useless World

output
World Hello
World Bye
World Useless

papayaprofessor

Among the following statements, which statement finds the logical consequence of the second law of thermodynamics?

This law states that the entropy of an isolated system always increases or equal to zero but can never decrease
This law is a relationship between the energy and the internal energy of a system
This law states that entropy attains a constant value at absolute zero temperature
This law states enthalpy of a closed system is a point function

6.01 Lecture Notes - Lecture 15: List Comprehension, Combinatory Logic, Modus Operandi

Document Summary

Get access

Related Documents

6.01 Lecture Notes - Lecture 29: City Map, Successor Function, Branching Factor

6.01 Lecture Notes - Lecture 13: Indium Phosphide, Simple Machine, Init

6.01 Lecture Notes - Lecture 14: Indium Phosphide, Combinatory Logic, Init

Related Questions