jjlumagbas

Film crit HULK smash: luke cage, netflix and the death of episodic tv

Whatever happened to telling stories within stories?

Film crit HULK Oct. 12, 2016

1. Stories within stories

HULK worries we're witnessing the death of episodic tv.

jjlumagbas

import qualified Data.List as L hiding (nub)

numUniques :: (Eq a) => [a] -> Int  
numUniques = length . nub 

jjlumagbas

module Shapes
( Point(..)  
, Shape(..)  
, surface  
, nudge  
, baseCircle  
, baseRect  
) where  

data Point = Point Float Float deriving (Show)  

jjlumagbas

# sum
def sum(lst):
    """[Number] -> Number
    Returns the sum of all elements of the list
    """
    result = 0
    for el in lst:
        result = result + el
    return result

jjlumagbas

#
#
# fold


# map
# create a duplicate of the given list
def dup(lst):
    result = [] 
    for el in lst:

jjlumagbas

CMSC11 Lab Exercise 11 – Lists

Create the following functions. Don’t forget the design recipe! I’ll be looking for the following:

• Signature, purpose, stub
• Examples
• Template

---

jjlumagbas

Machine Problem 3 - Parsing Poetry Packets

Data on the internet are broken up and passed around in what are called "packets":

On the Internet, the network breaks an e-mail message into parts of a certain size in bytes. These are the packets. Each packet carries the information that will help it get to its destination -- the sender's IP address, the intended receiver's IP address, something that tells the network how many packets this e-mail message has been broken into and the number of this particular packet. - Read the whole article at HowStuffWorks

In this MP, you're going to parse a "network packet capture" (a listing of packets), reassemble corresponding sets of packets into the original "messages" sent, and display the messages in a human-readable format.

jjlumagbas

#
# fold

def sum_nums(lst):
    sum = 0
    for el in lst:
        sum = sum + el
    return sum

jjlumagbas

# given a list, remove successive duplicate elements

def remove_succ_lst(lst):
    result = [lst[0]]
    prev = lst[0]
    for curr in lst:
        if ( prev != curr ):
           result = result + [curr]

jjlumagbas

public class ExpressionTree {
  public static int eval(MyTreeNode root) {
    return 0;
  }
}