73 Pages

C_lecture_2

Course: CS 11, Spring 2012
School: Caltech
Rating:
 
 
 
 
 

Word Count: 1458

Document Preview

11 CS C track: lecture 2 Last week: basics of C programming compilation data types (int, float, double, char, etc.) operators (+ - * / = == += etc.) functions conditionals loops preprocessor (#include) This week Preprocessor (#define) Operators and precedence Types and type conversions Function prototypes Loops (while, do/while) More on input/output and scanf() Commenting Using the make...

Register Now

Unformatted Document Excerpt

Coursehero >> California >> Caltech >> CS 11

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.

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.
11 CS C track: lecture 2 Last week: basics of C programming compilation data types (int, float, double, char, etc.) operators (+ - * / = == += etc.) functions conditionals loops preprocessor (#include) This week Preprocessor (#define) Operators and precedence Types and type conversions Function prototypes Loops (while, do/while) More on input/output and scanf() Commenting Using the make program #define (1) So far, only preprocessor command we know is #include Lots of other ones as well will see more later in course One major one: #define Used in almost all C header files #define (2) #define usually used to define symbolic constants: #define MAX_LENGTH 100 Then preprocessor substitutes the number 100 for MAX_LENGTH everywhere in program NOTE: Just a textual substitution! no type checking #define (3) #define MAX_LENGTH 100 /* later... */ int i; /* later... */ if (i > MAX_LENGTH) { printf("Whoa there!\n"); } #define (4) /* That code expands into: */ if (i > 100) { printf("Whoa there!\n"); } Note that all occurrences of MAX_LENGTH replaced with 100 Why not just write 100 in the first place? #define (5) Why not just write 100 in the first place? If you decide you want to change MAX_LENGTH to another number instead only have to change one #define statement and all occurrences of MAX_LENGTH will be changed to the new number Hard-coded numbers like 100 are called magic numbers usually repeated many times in a program would have to change many lines to change the number throughout the program Digression: ? : operator C has one ternary operator (three arguments), the ? : ("question mark") operator Like an if statement that returns a value: int i = 10; int j; j = (i == 10) ? 20 : 5; /* note 3 args */ /* "(i == 10) ? 20 : 5" means: * "If i equals 10 then 20 else 5." */ Not used very often #define macros #define can also be used to define short function-like macros e.g. #define MAX(a, b) \ (((a) > (b)) ? (a) : (b)) Like a short function that gets expanded everywhere it's used (a.k.a. an inline function) But pitfalls exist (won't discuss further) #define style #define defines new meaning for names Names that have been defined using #define are conventionally written with ALL_CAPITAL_LETTERS That way, they're easy to identify in code Conversely, don't use this style for regular variable names Operators and precedence Low to high precedence: = (assignment) == != < <= > >= + and * and / ++ -- += -= *= /= 15 precedence levels in all! Use ( ) for all non-obvious cases ++ and - (1) ++ and -- can be prefix or postfix int a = 0; a++; ++a; /* OK */ /* OK */ Here they mean the same thing ++ and - (2) Prefix is not the same as postfix! int a, b, c; a = 10; b = ++a; /* What is b? */ /* 11 */ c = a++; /* What is c? */ /* 11 */ Types (1) int usually 32 bits wide could be 64 (depends on computer) "longer" integer length >= length of int usually same as int long short (will see later in course) Types (2) float single-precision approximate real number 32 bits wide double double-precision 64 bits wide Type conversions (1) Converting numbers between types int i = 10; float f = (float) i; double d = (double) i; (float) etc. are type conversion operators Compiler will convert automatically But don't do it that way! Type conversions (2) Dangers of implicit conversions: int i, j; double d; i = 3; j = 4; d = i / j; /* d = ? */ /* 0.0 */ d = ((double) i) / ((double) j); /* d = ? */ /* 0.75 */ Function prototypes (1) Normally, functions must be defined before use: int foo(int x) { ... } int bar(int y) { return 2 * foo(y); } Couldn't define bar before foo Compiler isn't that smart Function prototypes (2) Can get around this with function prototypes Consist of signature of function w/out body int foo(int x); /* no body yet. */ int bar(int y); /* no body yet. */ int bar(int y) { return 2 * foo(y); /* OK */ } /* Define 'foo' later. */ Function prototypes (3) Note that foo not defined when bar defined Rule of thumb: always write function prototypes at top of file That way, can use functions anywhere in file while loops int a = 10; while (a > 0) { printf("a = %d\n", a); a--; } Useful when # of iterations not known in advance Infinite loops and break int a; while (1) { scanf("%d ", &a); printf("a = %d\n", a); if (a <= 0) break; } /* get out of loop */ /* or: for (;;) */ More on break break exits the nearest enclosing loop To exit more deeply-nested loops, need goto Avoid using goto in general goto for (i = 0; i < m; i++) { for (j = 0; j < n; j++) { /* code ... */ goto out; /* something went wrong */ } } out: /* a label */ /* continue here */ do/while Sometimes to want test at end of loop: int i = 10; do { /* try something at least once */ /* i gets changed */ } while (i > 0); continue To exit a single iteration of a loop early, but keep on executing the loop itself, use a continue statement int i; for (i = 0; i < 100; i++) { if (i % 2 == 0) continue; else printf("i = %d\n", i) } Here, only prints out odd numbers Note on syntax Body of for, while, do/while, if, if/ else statements can be either a block of code (surrounded by curly braces) a single line of code expresses intent more clearly to reader can add extra statements later more easily Better to always use a block of code Input/output and scanf() (1) C provides three input/output "files" for you to use: stdin for input from the terminal stdout for output to the terminal stderr for error output normally also outputs to terminal All defined in stdio.h header file Input/output and scanf() (2) printf() function outputs to stdout scanf() function reads from stdin More general versions to read from other files: fprintf() outputs to any file fscanf() reads from any file Input/output and scanf() (3) fprintf() and stderr used to print error messages: fprintf(stderr, "something went wrong!\n"); Still prints to terminal Always use this for printing error messages or program usage messages! Input/output and scanf() (4) Recall scanf() function from lab 1 Reads in from terminal input (known as stdin) Uses funny syntax e.g. char s[100]; scanf("%99s", s); This says: "read in a string s that is no more than 99 characters long". Input/output and scanf() (5) scanf() changes the variable(s) in its argument list scanf() also returns an int value if scanf() was successful, return the number of items read if input unavailable, the special EOF ("end of file") value is returned EOF is also defined in stdio.h header file Input/output and scanf() (6) Testing scanf()'s return value: int val; int result; result = scanf("%d", &val); if (result == EOF) { /* print an error message */ } Input/output and scanf() (7) Notice the &val in the scanf() call: int val, result; result = scanf("%d", &val); What's that all about? Can't explain in detail now Will explain when we talk about pointers Rule: need & for reading int or double, but not strings Commenting your code (1) The most important thing is to realize that COMMENTS ARE VERY VERY IMPORTANT! Commenting your code (2) Purposes of comments: explain how to use your functions explain how your functions work explain anything that's tricky or nonobvious anyone modifying your code you, in a few weeks/months/years Who reads the comments? Commenting your code (3) Put comments right before functions purpose of function what arguments mean what's returned Comment code that's not obvious Assume others will read your code Style (spelling, grammar) counts! Poor commenting marks off! Good commenting /* * area: finds area of circle * arguments: r: radius of circle * return value: the computed area */ double area(double r) { double pi = 3.1415926; return (pi * r * r); } Variable names Usually use meaningful variable names /* what does x mean? */ /* better */ /* bad */ /* good */ double x; double distance; Not always necessary int loop_index; int i; The make program (1) make is a program which automates compilation of programs only recompiles files that have changed depend on files that have changed Only really useful for programs with multiple source code files The make program (2) Write compilation info in a Makefile Usually compile by typing make Clean up by typing make clean We usually supply the Makefile Details: http://www.cs.caltech.edu/courses/cs11/material/c/ mike/misc/make.html The make program (3) Trivial Makefile: program: program.o gcc program.o -o program program.o: program.c program.h gcc -c program.c clean: rm program.o program The make program (4) Targets in red gcc program.o -o program program: program.o program.o: program.c program.h gcc -c program.c clean: rm program.o program The make program (5) Dependencies in green gcc program.o -o program program: program.o program.o: program.c program.h gcc -c program.c clean: rm program.o program The make program (6) Commands in blue gcc program.o -o program program: program.o program.o: program.c program.h gcc -c program.c clean: rm program.o program The make program (7) If program.c or program.h changes program.o is now out-of-date program.o gets recompiled (changes) program is now out-of-date program gets recompiled If multiple .c files exist and only one changes, only necessary files recompiled Next week Arrays Strings Command-line arguments assert
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:

Caltech - CS - 11
CS 11 C track: lecture 3nThis week:nArraysn none-dimensional multidimensionaln nCommand-line arguments AssertionsArraysn nWhat is an &quot;array&quot;? A way to collect together data of a single type in a single object A linear sequence of data objects e
Caltech - CS - 11
CS 11 C track: lecture 4 Last week: arrays This week: Recursion Introduction to pointersLab 4 Harder than previous labs One non-obvious trick hints on web page email me if get stuck Support code supplied for you Read carefully!Recursion (1)Sh
Caltech - CS - 11
CS 11 C track: lecture 6n nLast week: pointer arithmetic This week:nThe gdb program struct typedef linked listsn n ngdb for debugging (1)n ngdb: the Gnu DeBugger http:/www.cs.caltech.edu/courses/cs11/ material/c/mike/misc/gdb.html Use when program
Caltech - CS - 11
CS 11 C track: lecture 7 Last week: structs, typedef, linked lists This week: hash tables more on the C preprocessor extern constHash tables (1)Data structures we've seen so far:arrays structs linked listsHash tables (2)Hash tables are a new data
Caltech - CHE - 101
ChE 101 2012 Problem Set 11. Computational problem of the week: Every week, we will assign one problem designed to increase your exposure to numerical methods, improve your algorithmic thinking, and get you familiar with Matlab (you'll thank us once you
Caltech - CHE - 101
ChE 101 2012 Problem Set 2Read Schmidt, Sections 3.1-3.3 1. Consider the following reversible elementary reaction: A 2B The rate coefficient of the forward reaction is kf = 25 hr-1 , and the rate coefficient of the reverse reaction is kb = 4 M-1 hr-1 . T
Caltech - CHE - 101
ChE 101 2012 Problem Set 3Read Schmidt Chapter 3 1. Find the minimum number of CSTRs connected in series to give an outlet conversion within 5 percent of that achieved in a PFR of equal total volume for: (a) first-order irreversible reaction of A to form
Caltech - CHE - 101
ChE 101 2012 Problem Set 4Read Schmidt, Chapter 4 1. Consider the reactions A D, A B, B C, r1 = k1 c2 A r2 = k2 cA r3 = k3with B the desired product. In the subsequent problems, you may use Mathematica to evaluate integrals and simplify algebraic expres
Caltech - CHE - 101
ChE 101 2012 Problem Set 51. Computational problem of the week: It is oft quoted that &quot;when you ASSUME, you make an ASS of U and ME&quot;. In kinetics, we often make simplifying assumptions to make our modeling more tractable, but a good kineticist must alway
Caltech - CHE - 101
ChE 101 2012 Problem Set 6Read Schmidt, Chapter 71. Derivation of the Langmuir isotherm: In this problem, we will use the tools of statistical mechanics to derive the Langmuir adsorption isotherm and understand how it changes with temperature. All of th
Caltech - CHE - 101
ChE 101 2012 Problem Set 7Read Schmidt Chapters 5 and 10 1. The steady-state approximation is not valid until the reactive intermediates approach their steady-state concentration. The time required for this to occur is called the relaxation time tr . Pas
Caltech - CHE - 101
ChE 101 2012 Problem Set 8Read Schmidt Chapter 6 1. The inclusion of temperature effects in chemical reactor models makes the mass and energy balances intractable to solve analytically, since reaction rates depend on temperature in a highly nonlinear fas
Caltech - CHE - 101
ChE 101 2012 Problem Set 1 Solutions1. (a)i.f u n c t i o n varargout = eulers_method ( ode_func , t0 , tf , n , y0 ) t = l i n s p a c e ( t0 , tf , n+1) ; y = z e r o s ( l e n g t h ( y0 ) , n+1) ; y ( : , 1 ) = y0 ; h = ( tf - t0 ) / n ; for i = 1:
Caltech - CHE - 101
ChE 101 2012 Problem Set 2 Solutions1. Consider the following reversible elementary reaction: A 2B The rate coefficient of the forward reaction is kf = 25 hr-1 , and the rate coefficient of the reverse reaction is kb = 4 M-1 hr-1 . The aqueous phase reac
Caltech - CHE - 101
ChE 101 2012 Problem Set 3 Solutions1. (a) We will assume that all of the CSTRs have the same residence time. Thus, for n CSTRs in series, we have PFR CSTR = n Writing a mass balance on the nth CSTR, we see that cA,n-1 - cA,n = k CSTR cA,n Solving this b
Caltech - CHE - 101
ChE 101 2012 Problem Set 4 Solutions1. (a) We start with the balance on A in a CSTR, which tells us that = cA,0 - cA k1 c2 + k2 cA ARearranging terms, we obtain the equation k1 c2 + (1 + k2 ) cA - cA,0 = 0 A Applying the quadratic formula and taking the
Caltech - CHE - 101
ChE 101 2012 Problem Set 5 Solutions1. (a) The full ODE system to be solved is d[P ] dt d[ES] dt d[E] dt d[S] dt = kcat [ES] = kf [E][S] - (kcat + kb ) [ES] = (kcat + kb ) [ES] - kf [E][S] = kb [ES] - kf [E][S]Under the equilibrium assumption, the simpl
Caltech - CHE - 101
ChE 101 2012 Problem Set 6 Solutions1. (a) In order for the system to be in mechanical equilibrium, the pressure must be constant across the two phases. Next, in order to achieve thermal equilibrium, the temperatures of the two phases must be equal. Fina
Caltech - CHE - 101
ChE 101 2012 Set 7 Solutions1. The steady-state approximation is not valid until the reactive intermediates approach their steady-state concentration. The time required for this to occur is called the relaxation time tr . Past the relaxation time, the st
Caltech - CHE - 101
ChE 101 2012 Set 8 Solutions1. (a) The PFR mass balance is given by Equation 5.22 as u dcA E , = -k0 cA exp - dz RTwhere we have explicitly used the Arrhenius temperature dependence of k. The energy balance is given in Equation 5.31, u dT HR U pw E =- -
Caltech - CHE - 101
ChE 101 Chemical Reaction Engineering Final Exam ReviewWinter 2012Equation and Concept ReviewRemember to review the equations and concepts from the midterm exam review!Chapter 5: Nonisothermal ReactorsHeat removal and generation The rate of enthalpy
Caltech - ACM - 95b
Giordon StarkACM95b NotesMarch 13, 2010TABLE OF CONTENTS1st Order ODEs .4 Linear 1st Order ODEs .4 General Strategy (Leibniz) .4 Existence and Uniqueness .5 Complex Case .5 2 Order Linear IVPs .
Caltech - ACM - 95b
ACM95b/100b Lecture NotesNiles A. Pierce Caltech 2010Introduction to Dierential EquationsDierential equations relate derivatives of functions: a) Newtons second law dv d2 x F = ma = m =m 2 dt dt b) Radio carbon dating dy = ky, k = constant &lt; 0 dt c) Ch
Caltech - ACM - 95b
ACM95b/100b Lecture NotesNiles A. Pierce Caltech 2010Reduction of OrderConsider the homogeneous 2nd order linear ODE Ly y + p(t)y + q (t)y = 0 (1)with p and q continuous on an open interval I . Suppose that one solution y1 (t) is already known. To nd
Caltech - PHYSICS - 129
Physics 129a Calculus of Variations 071113 Frank Porter Revision 0811201IntroductionMany problems in physics have to do with extrema. When the problem involves finding a function that satisfies some extremum criterion, we may attack it with various met
Caltech - PH - 129
Frank PorterJanuary 13, 2011Chapter 2SimulationThe technology of &quot;Monte Carlo simulation&quot; is an important tool for understanding and working with complicated probability distributions. This technique is widely used in both experiment design and analys
Caltech - PH - 129
Frank PorterFebruary 1, 2011Chapter 1Probability1.1Definition of ProbabilityThe notion of probability concerns the measure (&quot;size&quot;) of sets in a space. The space may be called a Sample Space, or Event Space. We define a probability as a set function
Caltech - PH - 129
Physics 129a Measure Theory 071126 Frank Porter1IntroductionThe rigorous mathematical underpinning of much of what we have discussed, such as the construction of a proper Hilbert space of functions, is to be found in &quot;measure theory&quot;. We thus refine th
Caltech - PH - 129
Physics 125c Course Notes Approximate Methods 040415 F. PorterContents1 Introduction 2 Variational Method 2.1 Bound on Ground State Energy . . . . . . 2.2 Example: Helium Atom . . . . . . . . . . 2.3 Other Applications of Variational Method 2.4 Variatio
Caltech - PH - 129
36Frank PorterApril 18, 2010Chapter 3Reverend Bayes and Professor NeymanScientists use statistics in the process of gathering and interpreting information relevant to interesting questions. They sometimes like to pretend that there is no philosophica
Caltech - PH - 129
Complex Variables 020701 F. Porter Revision 0910061IntroductionThis note is intended as a review and reference for the basic theory of complex variables. For further material, and more rigor, Whittaker and Watson is recommended, though there are very m
Caltech - PH - 129
Physics 129a Hilbert Spaces 051014 Frank Porter Revision 0810091IntroductionIt is a fundamental postulate of quantum mechanics that any physically allowed state of a system may be described as a vector in a separable Hilbert space of possible states. H
Caltech - PH - 129
Physics 195a Course Notes Ideas of Quantum Mechanics 021024 F. Porter1IntroductionThis note summarizes and examines the foundations of quantum mechanics, including the mathematical background.22.1General Review of the Ideas of Quantum MechanicsStat
McGill - PHYSICS - 357
Caltech - PH - 357
McGill - PH - 357
McGill - PH - 357
Homework #1 - Probability distribution Due Sept. 16, 2011 at 11:35, in classTami Pereg-Barnea1. Griffiths 1.4+: At time t = 0 a particle is represented by the wavefunction: A x if 0 x a a (x, 0) = A b-x if a x b b-a 0 otherwise(1)where a and b are con
McGill - PH - 357
Problem set 2 - Fourier transforms -functions and quantum dynamicsdue on Friday, September 23rd, in class.(Dated: September 16, 2011)1. Width of a Gaussian wave packet. In class we talked about the time evolution of a gaussian wave packet. We saw that
McGill - PH - 357
1Problem set 4 - The harmonic oscillatorDue: Oct. 10, 2011, in class Posted on Oct. 3, 2011 1. Typical scales in harmonic oscillators. Modern cold-atoms research concentrates on trapped atoms, which are futher constrained to move in an optical lattice.
McGill - PH - 357
1Problem set 5 - Free space and sharp potentialsDue: Oct. 19, 2011, in class Posted on Oct. 12, 2011 1. A particle in a parabolic potential is set free. This is similar to the 3rd problem in problem set 2. Imaginek a parabolic potential described by th
McGill - PH - 357
1Problem set 6 - Sharp potentialsDue on Wednesday, October 25, 2011. Posted on Oct. 19 1. To the edge of the cliff and back. In classical mechanics a particle hitting the a wall (i.e. a potential jump) gets reflected. In quantum mechanics, a particle wi
Caltech - PH - 357
1Problem set 3 - Square well potentialDue: Sept. 30, 2011, in class Posted on Sept. 23, 2011 1. Bohr Sommerfeld quantization of a particle in a box Assume we did not know about Schrdinger o formalism and wanted to solve the particle in a box problem. Ac
Caltech - MATH - 2b
MATH 2B WINTER 2012 HOMEWORK 1DUE MONDAY 1/9 AT 10AMAll numbered problems are from Pitman. 1.3.8: Let A and B be events such that P (A) = 0.6, P (B) = 0.4, P (AB) = 0.2. Find the probabilities of: (a) A B, b) Ac , c) B c , d) Ac B, e)A B c f) Ac B c 1.3
Caltech - MA - 2b
MATH 2B WINTER 2012 HOMEWORK 2DUE TUESDAY 1/17 AT NOONNote the deadline is shifted due to the holiday! All numbered problems are from Pitman. (1) 2.1.6 (2) 2.1.12. For this problem, assume that the casino is using the more common double zero wheel. This
Caltech - MA - 2b
MATH 2B WINTER 2012 HOMEWORK 3DUE MONDAY 1/23 AT NOONAll numbered problems are from Pitman. (1) 3.1.10 (2) 3.1.16 (3) 3.2.5 (4) 3.2.14 (5) 3.review.22 (6) (counts as 3 problems) [Gambler's Ruin] A gambler repeatedly bets a dollar on a sequence of i.i.d.
Wisconsin Milwaukee - HIST - 210
History 248 Fall 2008 Essay Assignment 1 HISTORY 248 (Fall 2008) Essay Assignment 11DUE: In your section meeting in Week 6 (10/9/08 or 10/10/08) Value: 20% of course grade Essay Requirements: 4-6 pages. You must have at least four full pages and not mor
Wisconsin Milwaukee - ENGLISH - 170
Movie Review V for Vendetta Some say the book is always better than the movie; I have heard this comment twice this week once on Twilight and another one on Sisterhood of the Travelling Pants. But I would like to hold an opposite comment towards V for Ven
Wisconsin Milwaukee - LING - 100
Sep 2, 2008-Dec 11, 20081Linguistics 210POWER OF WORDSFall 2008Prerequisites: None. Instructor: Assistants: Hamid Ouali ouali@uwm.edu tel. 229-1113Hie-Jung You (Hina) hyou@uwm.edu tel. 229-3672 Brenden Mason bjmason@uwm.eduOffice Hours:Ouali: You
Wisconsin Milwaukee - LING - 300
History 248 Fall 2008 Essay Assignment 2 Question 1: Explain how total war redefined internal and external threats for multiethnic empires. In particular, examine how the war affected the interests and goals of national minority leaders. Nationalism is on
Wisconsin Milwaukee - LING - 300
Natalie Yu (Yu Tsz Sum) February 28, 2009 JMC 101 Intro to Mass Media Section 608 Jennifer Draeger The Torch in Her Hand Shines &quot;Like No OtherTM &quot;Growing up in Hong Kong, I remembered Japan-founded companies had always dominated the electronics market in
Wisconsin Milwaukee - LING - 300
Natalie Yu 1. What is the difference between linguistics and linguistic anthropology? According to Salzmann (and me having taken both linguistics and linguistic anthropology courses), there are certain resemblance and divergence between linguistics and li
Wisconsin Milwaukee - LING - 300
Natalie Yu 3. How do the Hopi examples help illustrate the relationship between language and thought in the Sapir-Whorf hypothesis? The Sapir-Whorf hypothesis suggests that a people's worldview is reflected from the lexicon and grammar of their language.
Wisconsin Milwaukee - LING - 300
Natalie Yu (,Tsz Sum) 4. Define and illustrate the following terms: phonology, morphology, syntax, semantics, and discourse. To start briefly, phonology, morphology, syntax, semantics are the different aspects that linguists study in the structure of lang
Wisconsin Milwaukee - LING - 300
Natalie Yu 5. How does the phrase &quot;Colorless green ideas sleep furiously&quot; help us understand the difference between language acquisition and language learning? From the very first video we saw in the course, the famous sentence by Noam Chomsky, &quot;Colorless
Wisconsin Milwaukee - LING - 300
Natalie Yu 6. Will computers conversing with humans represent the next stage of language evolution? Many says that computers have been &quot;taught&quot; to talk, but according to Napoli (and in my own opinion), computers do not have language; the sounds they are p
Wisconsin Milwaukee - LING - 300
Quiz (Discussion Focus) One 1.What distinction does Napoli make between communication and language?According to Napoli, to communicate is one of the main purposes of language. And there are many ways to communicate, using language is one of them, yet ma
Wisconsin Milwaukee - LING - 300
Natalie Yu Anthro 105401 March 4, 2009 Week #6 Pop Language Project Q: Does computer language constitute the next human language?zLanguage changes swiftly especially in recent decades with the emergence of pop culture. With the booming popularity of the
Wisconsin Milwaukee - LING - 300
1Natalie Yu (Yu Tsz Sum) HIST 249-609 March 1, 2009 HISTORY 249 (Spring 2009) Essay Assignment 1 Question 1 Examine the Challenges that European governments faced at the end of the First World War. Why did extreme ideologies gain in this period? Be sure
Wisconsin Milwaukee - LING - 300
Natalie Yu February 1, 2011 German Beginners 2 Dialog 1 (P.52) (Black font= Kunde Brown font= Verkauferin) Tag! Tag! Sie wnschen? Ich htte gern Orangen. Wie viel Orangen mchten Sie? 1 kg, bitte. Haben Sie auch Apfel? Ja, natrlich. Auch 1 kg mchten Sie? Hm
Wisconsin Milwaukee - LING - 300
Natalie Yu (1155000186) March 23, 2011. An E-mail to a new German friend Liebe Olivia,Hallo Olivia, wie gehts es Ihnen? Sie sind meine Partnerin fr den Online-Sprache Austauschprogramms, und ich mochte zu Ihnen um mich vorstellen.Mein name ist Natalie u
Wisconsin Milwaukee - LING - 300
Natalie Yu (1155000186) April 5, 2011 LING 2006 Semantics Assignment 3 1. (a) &quot;Necessarily, Japan's nuclear crisis is worse than the Three Mile Island nuclear accident in 1979&quot; is true iff we. (`Japan's nuclear crisis is worse than the Three Mile Island n