CS61C L03 Introduction to C (pt 1) (1) Garcia, Spring 2005 © UCB Lecturer PSOE Dan Garcia www.cs.berkeley.edu/~ddgarcia inst.eecs.berkeley.edu/~cs61c.

Slides:



Advertisements
Similar presentations
CS61CL L01 Introduction (1) Huddleston, Summer 2009 © UCB Introduction to C Jeremy Huddleston inst.eecs.berkeley.edu/~cs61c.
Advertisements

CS 61C L13Introduction to MIPS: Instruction Representation I (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
CS61C L02 Number Representation (1) Garcia, Spring 2005 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C.
CS61C L03 Introduction to C (pt 1) (1) Garcia, Fall 2006 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C.
CS 61C L02 Number Representation (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C.
CS61C L04 Introduction to C (pt 2) (1) Garcia, Fall 2011 © UCB Reference slides You ARE responsible for the material on these slides (they’re just taken.
Inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 6 – Introduction to MIPS Data Transfer & Decisions I Pieter Abbeel’s recent.
CS61C L03 Introduction to C (pt 1) (1) Garcia, Spring 2007 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C.
CIS 101: Computer Programming and Problem Solving Lecture 8 Usman Roshan Department of Computer Science NJIT.
CS61C L03 Introduction to C (pt 2) (1) Garcia, Fall 2006 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C.
CS 61C L03 Introduction to C (1)Harvey / Wawrzynek Fall 2003 © UCB 8/29/2003  Brian Harvey ( John Wawrzynek  (Warznek) (
CS 61C L02 Number Representation (1)Harvey / Wawrzynek Fall 2003 © UCB 8/27/2003  Brian Harvey ( John Wawrzynek  (Warznek) (
CS61C L05 C Structures, Memory Management (1) Garcia, Spring 2005 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
CS61C L09 Introduction to MIPS: Data Transfer & Decisions I (1) Garcia © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
CS 61C L04 C Pointers (1) Garcia, Fall 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine.
CS 61C L09 Introduction to MIPS: Data Transfer & Decisions I (1) Garcia, Fall 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
CS 61C L03 Introduction to C (pt 1) (1) Garcia, Fall 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C.
CS61C L04 Introduction to C (pt 2) (1) Garcia, Spring 2007 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C.
CS61C L3 C Pointers (1) Garcia, Fall 2005 © UCB Lecturer PSOE, new dad Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine.
The slides are modified from Dan Garcia,
CS 61C L02 Number Representation (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C.
CS61CL L01 Introduction (1) Huddleston, Summer 2009 © UCB Jeremy Huddleston inst.eecs.berkeley.edu/~cs61c CS61CL : Machine Structures Lecture #1 – Introduction,
CS61C L05 Introduction to C (pt 3) (1) Garcia, Fall 2006 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C.
CS61C L13 Introduction to MIPS: Instruction Representation I (1) Garcia © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
CS61C L2 Number Representation & Introduction to C (1) Chae, Summer 2008 © UCB Albert Chae Instructor inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures.
CS 61C L2 Introduction to C (1) A Carle, Summer 2006 © UCB inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 2: Introduction To C
IBM has built a computer with 147,456 processors and 144 terabytes of memory that simulates a cat’s cerebral cortex. It runs 1/100x the speed of an actual.
CS61C L04 Introduction to C (pt 2) (1) Garcia, Spring 2008 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C.
CS 61C L03 C Arrays (1) A Carle, Summer 2005 © UCB inst.eecs.berkeley.edu/~cs61c/su05 CS61C : Machine Structures Lecture #3: C Pointers & Arrays
I just discovered that my iPhone has been quietly watching me; my graph is on the right. There’s an app that can visualize this data quickly, allowing.
CS61C L05 Introduction to C (pt 3) (1) Garcia, Spring 2007 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C.
CS61C L2 Number Representation & Introduction to C (1) Garcia, Fall 2005 © UCB Lecturer PSOE, new dad Dan Garcia inst.eecs.berkeley.edu/~cs61c.
CS61C L03 Introduction to C (pt 1) (1) Garcia, Spring 2008 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C.
CS61C L04 C Pointers (1) Garcia, Spring 2005 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine.
CS 61C L03 C Pointers (1)Garcia / Patterson Fall 2002 © UCB CS61C - Machine Structures Lecture 3 C pointers  Dan Garcia (
CS 61C L08 Introduction to MIPS Assembly Language: Arithmetic (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
CS61C L03 Introduction to C (pt 1) (1) Garcia, Fall 2011 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C.
CS 61C L03 Introduction to C (pt 1) (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
CS 61C L04 C Pointers (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine.
Prof Ali Javey’s group’s may have found the replacement for Silicon to make transistors. (Silicon will be too expensive and “leaky”.) They can make “fast,
CS61C L2 Number Representation & Introduction to C (1) Beamer, Summer 2007 © UCB Scott Beamer Instructor inst.eecs.berkeley.edu/~cs61c CS61C : Machine.
CS61C L02 Number Representation (1) Garcia, Spring 2008 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C.
CS61C L09 Introduction to MIPS : Data Transfer and Decisions (1) Garcia, Spring 2007 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
CS 61C L03 C Arrays (1) A Carle, Summer 2006 © UCB inst.eecs.berkeley.edu/~cs61c/ CS61C : Machine Structures Lecture #3: C Pointers & Arrays
CS 61C L04 C Structures, Memory Management (1) Garcia, Fall 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
CS61C L03 Introduction to C (pt 1) (1) Garcia, Fall 2014 © UCB Senior Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
CENG 311 Machine Representation/Numbers
1 COMP 2130 Introduction to Computer Systems Computing Science Thompson Rivers University.
High-Level Programming Languages: C++
CS 11 java track: lecture 1 Administrivia need a CS cluster account cgi-bin/sysadmin/account_request.cgi need to know UNIX
Basics of Java IMPORTANT: Read Chap 1-6 of How to think like a… Lecture 3.
Netprog: Java Intro1 Crash Course in Java. Netprog: Java Intro2 Why Java? Network Programming in Java is very different than in C/C++ –much more language.
IT 251 Computer Organization and Architecture Introduction to the C Programming Language Part 1 Chia-Chi Teng.
Instructor: Justin Hsia 6/25/2013Summer Lecture #21 CS 61C: Great Ideas in Computer Architecture Introduction to C, Pointers.
IT 252 Computer Organization and Architecture Introduction to the C Programming Language Richard Helps (developed from slides from C. Teng and textbook.
Topic 3: C Basics CSE 30: Computer Organization and Systems Programming Winter 2011 Prof. Ryan Kastner Dept. of Computer Science and Engineering University.
CMSC 2021 CMSC 202 Computer Science II for Majors Spring 2002 Sections Ms. Susan Mitchell.
CMSC 2021 CMSC 202 Computer Science II for Majors Spring 2003 Mr. Frey (0101 – 0104) Mr. Raouf (0201 – 0204)
Announcements You will receive your scores back for Assignment 2 this week. You will have an opportunity to correct your code and resubmit it for partial.
CS 61C: Great Ideas in Computer Architecture C Pointers Instructors: Vladimir Stojanovic & Nicholas Weaver 1.
1 Lecture 2 - Introduction to C Programming Outline 2.1Introduction 2.2A Simple C Program: Printing a Line of Text 2.3Another Simple C Program: Adding.
The Beauty and Joy of Computing Lecture #22: Future of Computing
IT 252 Computer Organization and Architecture
CS 61C: Great Ideas in Computer Architecture Introduction to C
March, 2006 Saeid Nooshabadi
C Basics.
Instructor Paul Pearce
Inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 5 – Introduction to C (pt 3) C Memory Management Lecturer SOE Dan Garcia.
Instructor Paul Pearce
Hello to Scott Sloan from Superior, WI!
Presentation transcript:

CS61C L03 Introduction to C (pt 1) (1) Garcia, Spring 2005 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 3 – Introduction to the C Programming Language Princeton cracks down!  Previously, nearly half the grades given out were {A-,A,A+}…not unusual; other Ivys 44-55%. New cap is 35%. EECS policy is 17% (Lower div) and 23% (upper), though not strict.

CS61C L03 Introduction to C (pt 1) (2) Garcia, Spring 2005 © UCB Review (1): Overview We represent “things” in computers as particular bit patterns: N bits  2 N Decimal for human calculations, binary for computers, hex to write binary more easily 1’s complement - mostly abandoned 2’s complement universal in computing: cannot avoid, so learn Overflow: numbers  ; computers finite, errors!

CS61C L03 Introduction to C (pt 1) (3) Garcia, Spring 2005 © UCB What is 2 27 ? How many bits addresses (I.e., what’s ceil log 2 = lg of) 19 PiB? Answer! 2 XY means… X=0  --- X=1  kibi ~10 3 X=2  mebi ~10 6 X=3  gibi ~10 9 X=4  tebi ~10 12 X=5  pebi ~10 15 X=6  exbi ~10 18 X=7  zebi ~10 21 X=8  yobi ~10 24 Review(2): The way to remember #s Y=0  1 Y=1  2 Y=2  4 Y=3  8 Y=4  16 Y=5  32 Y=6  64 Y=7  128 Y=8  256 Y=9  512 MEMORIZE!

CS61C L03 Introduction to C (pt 1) (4) Garcia, Spring 2005 © UCB Disclaimer Important: You will not learn how to fully code in C in these lectures! You’ll still need your C reference for this course. K&R is a must-have reference. -Check online for more sources. “JAVA in a Nutshell,” O’Reilly. -Chapter 2, “How Java Differs from C”.

CS61C L03 Introduction to C (pt 1) (5) Garcia, Spring 2005 © UCB Compilation : Overview C compilers take C and convert it into an architecture specific machine code (string of 1s and 0s). Unlike Java which converts to architecture independent bytecode. Unlike most Scheme environments which interpret the code. Generally a 2 part process of compiling.c files to.o files, then linking the.o files into executables

CS61C L03 Introduction to C (pt 1) (6) Garcia, Spring 2005 © UCB Compilation : Advantages Great run-time performance: generally much faster than Scheme or Java for comparable code (because it optimizes for a given architecture) OK compilation time: enhancements in compilation procedure ( Makefile s) allow only modified files to be recompiled

CS61C L03 Introduction to C (pt 1) (7) Garcia, Spring 2005 © UCB Compilation : Disadvantages All compiled files (including the executable) are architecture specific, depending on both the CPU type and the operating system. Executable must be rebuilt on each new system. Called “porting your code” to a new architecture. The “change  compile  run [repeat]” iteration cycle is slow

CS61C L03 Introduction to C (pt 1) (8) Garcia, Spring 2005 © UCB C vs. Java™ Overview (1/2) Java Object-oriented (OOP) “Methods” Class libraries of data structures Automatic memory management C No built-in object abstraction. Data separate from methods. “Functions” C libraries are lower-level Manual memory management Pointers

CS61C L03 Introduction to C (pt 1) (9) Garcia, Spring 2005 © UCB C vs. Java™ Overview (2/2) Java High memory overhead from class libraries Relatively Slow Arrays initialize to zero Syntax: /* comment */ // comment System.out.print C Low memory overhead Relatively Fast Arrays initialize to garbage Syntax: /* comment */ printf

CS61C L03 Introduction to C (pt 1) (10) Garcia, Spring 2005 © UCB C Syntax: Variable Declarations Very similar to Java, but with a few minor but important differences All variable declarations must go before they are used (at the beginning of the block). A variable may be initialized in its declaration. Examples of declarations: correct : { int a = 0, b = 10;... incorrect: for (int i = 0; i < 10; i++)

CS61C L03 Introduction to C (pt 1) (11) Garcia, Spring 2005 © UCB C Syntax: True or False? What evaluates to FALSE in C? 0 (integer) NULL (pointer: more on this later) no such thing as a Boolean What evaluates to TRUE in C? everything else… (same idea as in scheme: only #f is false, everything else is true!)

CS61C L03 Introduction to C (pt 1) (12) Garcia, Spring 2005 © UCB C syntax : flow control Within a function, remarkably close to Java constructs in methods (shows its legacy) in terms of flow control if-else switch while and for do-while

CS61C L03 Introduction to C (pt 1) (13) Garcia, Spring 2005 © UCB C Syntax: main To get the main function to accept arguments, use this: int main (int argc, char *argv[]) What does this mean? argc will contain the number of strings on the command line (the executable counts as one, plus one for each argument). -Example: unix% sort myFile argv is a pointer to an array containing the arguments as strings (more on pointers later).

CS61C L03 Introduction to C (pt 1) (14) Garcia, Spring 2005 © UCB Administrivia : You have a question? Do not Dan (& expect response) Hundreds of s in inbox doesn’t scale to classes with 200+ students! Tips on getting an answer to your question: Ask a classmate Ask Dan after or before lecture The newsgroup, ucb.class.cs61c -Read it : Has your Q been answered already? -If not, ask it and check back Ask TA in section, lab or OH Ask Dan in OH Ask Dan in lecture (if relevant to lecture) Send your TA Send one of the two Head TAs Send Dan

CS61C L03 Introduction to C (pt 1) (15) Garcia, Spring 2005 © UCB Administrivia : Near term Upcoming lectures C pointers and arrays in detail HW HW0 due in discussion tomorrow HW1 due this 23:59 PST HW2 due next 23:59 PST Reading K&R Chapters 1-5 (lots, get started now!) First quiz due Friday Get cardkeys from CS main office Soda Hall 3rd floor if you need/want them Soda locks 6:30pm & on weekends

CS61C L03 Introduction to C (pt 1) (16) Garcia, Spring 2005 © UCB Address vs. Value Consider memory to be a single huge array: Each cell of the array has an address associated with it. Each cell also stores some value Don’t confuse the address referring to a memory location with the value stored in that location.

CS61C L03 Introduction to C (pt 1) (17) Garcia, Spring 2005 © UCB Pointers An address refers to a particular memory location. In other words, it points to a memory location. Pointer: A variable that contains the address of a variable x y Location (address) name p 104

CS61C L03 Introduction to C (pt 1) (18) Garcia, Spring 2005 © UCB Pointers How to create a pointer: & operator: get address of a variable int *p, x; p?x? x = 3; p?x3 p = &x; px3 How get a value pointed to? * “ dereference operator”: get value pointed to printf(“p points to %d\n”,*p); Note the “*” gets used 2 different ways in this example. In the declaration to indicate that p is going to be a pointer, and in the printf to get the value pointed to by p.

CS61C L03 Introduction to C (pt 1) (19) Garcia, Spring 2005 © UCB Pointers How to change a variable pointed to? Use dereference * operator on left of = px5 *p = 5 ; px3

CS61C L03 Introduction to C (pt 1) (20) Garcia, Spring 2005 © UCB Pointers and Parameter Passing Java and C pass a parameter “by value” procedure/function gets a copy of the parameter, so changing the copy cannot change the original void addOne (int x) { x = x + 1; } int y = 3; addOne(y); y is still = 3

CS61C L03 Introduction to C (pt 1) (21) Garcia, Spring 2005 © UCB Pointers and Parameter Passing How to get a function to change a value? void addOne (int *p) { *p = *p + 1; } int y = 3; addOne(&y); y is now = 4

CS61C L03 Introduction to C (pt 1) (22) Garcia, Spring 2005 © UCB Pointers Normally a pointer can only point to one type ( int, char, a struct, etc.). void * is a type that can point to anything (generic pointer) Use sparingly to help avoid program bugs!

CS61C L03 Introduction to C (pt 1) (23) Garcia, Spring 2005 © UCB Peer Instruction Question void main(); { int *p, x=5, y; // init y = *(p = &x) + 10; int z; flip-sign(p); printf("x=%d,y=%d,p=%d\n",x,y,p); } flip-sign(int *n){*n = -(*n)} How many errors? #Errors (1)0

CS61C L03 Introduction to C (pt 1) (24) Garcia, Spring 2005 © UCB Peer Instruction Answer void main(); { int *p, x=5, y; // init y = *(p = &x) + 10; int z; flip-sign(p); printf("x=%d,y=%d,p=%d\n",x,y,*p); } flip-sign(int *n){*n = -(*n);} How many errors? I get 7. #Errors (1)0

CS61C L03 Introduction to C (pt 1) (25) Garcia, Spring 2005 © UCB And in conclusion… All declarations go at the beginning of each function. Only 0 and NULL evaluate to FALSE. All data is in memory. Each memory location has an address to use to refer to it and a value stored in it. A pointer is a C version of the address. * “follows” a pointer to its value & gets the address of a value

CS61C L03 Introduction to C (pt 1) (26) Garcia, Spring 2005 © UCB Administrivia : Lab priority Rank order of seating priority 1.61c registered for that section 2.61c registered for another section 3.61c waitlisted for that section 4.61c waitlisted for another section 5.Concurrent enrollment If low on list for busy section, think of moving to the early or late sections (usually more empty seats)

CS61C L03 Introduction to C (pt 1) (27) Garcia, Spring 2005 © UCB Kilo, Mega, Giga, Tera, Peta, Exa, Zetta, Yotta Kilted Meghans giggle terribly petting exalted zellous yodas [CL] Kissing me gives terrible peeps exactly zero, yo! [CL] Killer Megan gives Terrible Peter's excellent zebra yoghurt [YC] “Kiss me”, giant Terrible Peter exclaimed zealously, yo [YC] Kind Merchants Give Texan People Extra Zesty Yogurt [AW] Kittens' Meows Give to Terrific Peals of Extraordinarily Zealous Yowls [AW] Killer Mercenary Giants Temporarily Pester Exercising Zebras in Yorkshire [AW] Kiss me girl, terrible people examine zebras, yo. [JD] Kiss me, given ten pens extracted zen-like yo [AG] KIssing ME GIrl, TElls of my PEnchant for EXtra ZEsty Yoghurt [TM] Kissing me gingerly, Ted Peterson exclaimed, "Zesty, yo!” [DH] Kiss me girl teach petty exasperations zestful yodeling [AR] Kind Megan Gibson teaches people extremely zestful yoga [AC] Kissing mediocre girls/gimmicks teaches/tells people to expect zero/zest from you [MT] Kiss me, giant tease, people excuse zealous young [CR] Kicking mean girls and teasing pedestrians excite zealous youngsters [MH] Killin' me! Giant teacher's pet exaggerates zealously yo [KN] Kind Merlin gives tense people exceptional zebra yogurt [KL] Kinky metaphysics gibberish teaches people exquisite Zen yodeling [JC] Kingly men giving tedious penance exhibit zealous yowls [MH] Kinky mean girls terrorizing petty ex-boyfriends zeroing-on you [HC] Kind Merlin Gives Ten People Extremeley Zealous Yodas [RC] Kiss Me Goat Te Procure Extra Zloties, Yo [RG]

CS61C L03 Introduction to C (pt 1) (28) Garcia, Spring 2005 © UCB Kilo, Mega, Giga, Tera, Peta, Exa, Zetta, Yotta 1. King Mega gives Teddy pets, except zebra, yo [HL] 2. Kim’s melodious giddiness terrifies people, excepting zealous yodelers [DW] 3. Kirby Messed Gigglypuff Terribly, (then) Perfectly Exterminated Zelda and Yoshi [CB] 4. Killed meat gives teeth peace except zebra yogurt [CR] 5. Kind Men Give Tense People Extra Zeal (for) Yoga [VK/DG] 6. Killing melee gives terror; peace exhibits Zen yoga [CR] 7. Killing messengers gives terrible people exactly zero, yo [CL] 8. Kindergarten means giving teachers perfect examples (of) zeal (&) youth 9. Kissing mediocre girls teaches people (to) expect zero (from) you [MT] 10. Kinky Mean Girls Teach Penis-Extending Zen Yoga [AW] 11. Kissing Mel Gibson, Teddy Pendergrass exclaimed, “Zesty, yo!” [DH / AC/DG]