Register now to access 7 million high quality study materials (What's Course Hero?) Course Hero is the premier provider of high quality online educational resources. With millions of study documents, online tutors, digital flashcards and free courseware, Course Hero is helping students learn more efficiently and effectively. Whether you're interested in exploring new subjects or mastering key topics for your next exam, Course Hero has the tools you need to achieve your goals.
3 Pages
320groupproject
Course: AIST 320, Spring 2008School: Idaho
Rating:
Word Count: 316
Document Preview
Indian Celluloid Group Project Film List Go to www.imdb.com for summaries and cast lists GROUPS ONE Early "Indian" Films The Massacre (1913) The Last of the Mohicans (1920) The Paleface (1922) Redskin (1929) TWO Early Animation/Cartoons "Pioneer Days" (1930; Mickey Mouse) "Big Chief Ugh-Amugh-Ugh" (1938; Popeye) "Scalp Trouble" (1939; Daffy...
Unformatted Document Excerpt
Coursehero >> Idaho >> Idaho >> AIST 320Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Indian Celluloid Group Project Film List
Go to www.imdb.com for summaries and cast lists
GROUPS ONE Early "Indian" Films The Massacre (1913) The Last of the Mohicans (1920) The Paleface (1922) Redskin (1929)
TWO Early Animation/Cartoons "Pioneer Days" (1930; Mickey Mouse) "Big Chief Ugh-Amugh-Ugh" (1938; Popeye) "Scalp Trouble" (1939; Daffy Duck & Porky Pig) "Rhythm on the Reservation" (1939; Betty Boop) "Hiawatha's Rabbit Hunt" (1941; Bugs Bunny) "The Daffy Duckaroo" (1941; Daffy Duck) "Big Heel-Watha" (1944; Screwball cartoon) "Wagon Heels" (1945; Porky Pig cartoon) "Wigwam Whoopee" (1948; Popeye) "Two Little Indians" (1953; Hanna-Barbara cartoon) "A Cowboy Needs a Horse" (1956; Mickey Mouse) "Horse Hair" (1962; Bugs Bunny Cartoon) Peter Pan (1953)
THREE Recent Animation Pocahontas (1995) Indian in the Cupboard (1995) Pocahontas II: Journey to a New World (1998)
FOUR Massacre/Violence to Right the World Soldier Blue (1970) Ulzana's Raid (1972) Johnny Firecloud (1975) Crazy Horse (1996) Clearcut (1991) Geronimo (1993) Windtalkers (2002)
FIVE Classic Westerns Drums Along the Mohawk (1939) Stagecoach (1939) Northwest Passage (1940) White Eagle (1941) Cherokee Uprising (1950) Distant Drums (1951) Arrowhead (1953) Pillars the of Sky (1956) Comanche (1956) Pawnee (1957)
SIX Playing Indian/Possibility of Integration The Squaw Man (1931) Broken Arrow (1950) Little Big Man (1970) A Man Called Horse (1970) Cheyenne Warrior (1994)
SEVEN Red Power Era The Trial of Billy Jack (1974) Running Brave (1983) (Story of Sioux Olympics-winning runner, Billy Mills) Thunderheart (1992) Incident at Oglala (1992) Lakota Woman: Siege at Wounded Knee (1994)
EIGHT Imagining Contact The Far Horizons (Lewis & Clark story) Blackrobe (1991) 1492: Conquest of Paradise (1992) Last of the Mohicans (1992) Squanto: A Warrior's Tale (1994) The New World (2005)
NINE Indigenous Aesthetics (Love/Family) Medicine River (1993) Naturally Native (1998) Christmas in the Clouds (2001)
TEN Indigenous Aesthetics (Overcoming Adversity) Grand Avenue (1996) Edge...
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more.
Course Hero has millions of course specific materials providing students with the best way to expand
their education.
Below is a small sample set of documents:
Below is a small sample set of documents:
St. Cloud - CSCI - 301
Dept. of Computer Science CSCI 301: Introduction to Algorithms and Data Structures Instructor: Pranava K. Jha Graph Traversals Graph traversal consists of a systematic exploration of all nodes of a given graph. There are two popular strategies: depth
St. Cloud - CSCI - 301
CSCI 301: Introduction to Algorithms and Data Structures Instructor: Pranava K. Jha Abstract Data Types and Related Termsabstract, verb. to draw out the essence of a matter or to separate the fundamentals from irrelevant materials which surround th
St. Cloud - CSCI - 301
CSCI 301: Introduction to Algorithms and Data Structures Instructor: Pranava K. Jha Compilation and Execution Here is a discussion on how a client's program obtains access to the implementation details of an object. 1. The user must have access to th
St. Cloud - CSCI - 301
Dept. of Computer Science Fall 2008CSCI 301: Introduction to Algorithms and Data Structures Instructor: Pranava K. JhaSolution to Exam II1 of 6CSCI 301 (Fall 2008): Exam II (Instructor: Pranava K. Jha)Q. 1. [20 points] Solve the following re
St. Cloud - CSCI - 301
CSCI 301: Introduction to Algorithms and Data Structures (Fall 2008) Instructor: Pranava K. Jha HW 1 (Due Monday, Oct. 27) Prob. 1. [20 points] Let a be a constant, where a > 0. (a) Prove that 2n + a is O(2n ) . (b) Prove that 22 n + a is not O(2n )
St. Cloud - CSCI - 301
CSCI 301: Introduction to Algorithms and Data Structures (Fall 2008) Instructor: Pranava K. Jha Quiz 2 Wednesday, Sep. 10 Present the output corresponding to execution of the following program.#include <iostream> using namespace std; class A { priva
St. Cloud - CSCI - 301
CSCI 301: Introduction to Algorithms and Data Structures (Fall 2008) Instructor: Pranava K. Jha Quiz 9 (Wednesday, Nov. 12) Write a client function height that takes a binary tree T as the argument and returns the height of T. A skeleton of the class
St. Cloud - CSCI - 301
CSCI 301: Introduction to Algorithms and Data Structures (Fall 2008) Instructor: Pranava K. Jha Quiz 1 Wednesday, Sep. 3 Consider the following function:void display(int n) { if(n > 0) { if(n/8 > 0) display(n/8); cout < n % 8; } / end if } / end of
St. Cloud - CSCI - 301
CSCI 301: Introduction to Algorithms and Data Structures (Fall 2008) Instructor: Pranava K. Jha Quiz 7 Wednesday, Oct. 22 Determine how many times the output statement is executed in each of the following program segments. Present each expression in
St. Cloud - CSCI - 301
CSCI 301: Introduction to Algorithms and Data Structures (Fall 2008) Instructor: Pranava K. Jha Quiz 11 (Friday, Nov. 28) Perform heapsort on the following tree that is already heapified. Show the necessary steps.-o-
St. Cloud - CSCI - 301
CSCI 301: Introduction to Algorithms and Data Structures (Fall 2008) Instructor: Pranava K. Jha Solution to Quiz 6 Assuming that the input is 15 28 14 22 19 21 -999 show what is output when the following program is executed.#include <iostream> #incl
St. Cloud - CSCI - 301
CSCI 301: Introduction to Algorithms and Data Structures (Fall 2008) Instructor: Pranava K. Jha Project 8 (Due Monday, Dec. 1) Binary Tree and Binary Search Tree 1. [20 points] A binary tree is said to be balanced if every node in the tree is such th
St. Cloud - CSCI - 301
CSCI 301: Introduction to Algorithms and Data Structures (Fall 2008) Instructor: Pranava K. Jha HW 3 (Due Friday, Nov. 21) Prob. 1. [10 points] Arrange the nodes that contain the letters A, C, E, F, L, V and Z into two binary search trees: one that h
St. Cloud - CSCI - 301
CSCI 301: Introduction to Algorithms and Data Structures (Fall 2008) Instructor: Pranava K. Jha Project 6 (Due Monday, Oct. 20) Applications of a queue 1. Evaluating a prefix expression: One way to evaluate a prefix expression is to use a queue. To e
St. Cloud - CSCI - 301
CSCI 301: Introduction to Algorithms and Data Structures (Fall 2008) Instructor: Pranava K. Jha Solution to Quiz 9 Write a client function height that takes a binary tree T as the argument and returns the height of T. A skeleton of the class definiti
St. Cloud - CSCI - 301
CSCI 301: Introduction to Algorithms and Data Structures (Fall 2008) Instructor: Pranava K. Jha Quiz 6 Oct. 15 (Wednesday) Assuming that the input is: 15 28 14 22 19 21 -999 present the output corresponding to execution of the following program.#inc
St. Cloud - CSCI - 301
CSCI 301: Introduction to Algorithms and Data Structures (Fall 2008) Instructor: Pranava K. Jha Quiz 12 (Friday, Dec. 12) Perform depth-first traversal on the following digraph starting at vertex a. (Whenever a choice is to be made between two vertic
St. Cloud - CSCI - 301
CSCI 301: Introduction to Algorithms and Data Structures (Fall 2008) Instructor: Pranava K. Jha Quiz 5 Oct. 8 (Wednesday) Recall the function endPre in the context of prefix expressions. It acts on a string strExp of characters, and determines for ea
St. Cloud - CSCI - 301
CSCI 301: Introduction to Algorithms and Data Structures (Fall 2008) Instructor: Pranava K. Jha Quiz 3 Sep. 17 (Wednesday) Q. 1. Consider the following class definition: class YourClass { private: int info; char moreInfo; public: YourClass(); YourCla