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

Slides:



Advertisements
Similar presentations
compilers and interpreters
Advertisements

CS61CL L01 Introduction (1) Huddleston, Summer 2009 © UCB Introduction to C Jeremy Huddleston inst.eecs.berkeley.edu/~cs61c.
MPI and C-Language Seminars Seminar Plan (1/3)  Aim: Introduce the ‘C’ Programming Language.  Plan to cover: Basic C, and programming techniques.
This Time Pointers (declaration and operations) Passing Pointers to Functions Const Pointers Bubble Sort Using Pass-by-Reference Pointer Arithmetic Arrays.
C Programming - Lecture 5
CS61C L03 Introduction to C (pt 1) (1) Garcia, Fall 2006 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C.
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.
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.
Pointer. Warning! Dangerous Curves C (and C++) have just about the most powerful, flexible and dangerous pointers in the world. –Most other languages.
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.
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 Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c 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
CS61C L03 Introduction to C (pt 1) (1) Garcia, Spring 2005 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
CS-341 Dick Steflik Introduction. C++ General purpose programming language A superset of C (except for minor details) provides new flexible ways for defining.
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
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.
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.
CS 61C L03 Introduction to C (pt 1) (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c.
CS61CL L01 Introduction (1) Huddleston, Summer 2009 © UCB Jeremy Huddleston inst.eecs.berkeley.edu/~cs61c CS61CL : Machine Structures Lecture #2 - C Pointers.
Guide To UNIX Using Linux Third Edition
CS 61C L04 C Pointers (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine.
CS61C L2 Number Representation & Introduction to C (1) Beamer, Summer 2007 © UCB Scott Beamer Instructor inst.eecs.berkeley.edu/~cs61c CS61C : Machine.
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.
1 Procedural Concept The main program coordinates calls to procedures and hands over appropriate data as parameters.
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++
EE4E. C++ Programming Lecture 1 From C to C++. Contents Introduction Introduction Variables Variables Pointers and references Pointers and references.
1 Computing Software. Programming Style Programs that are not documented internally, while they may do what is requested, can be difficult to understand.
CSC3315 (Spring 2009)1 CSC 3315 Programming Languages Hamid Harroud School of Science and Engineering, Akhawayn University
C for Java Programmers Tomasz Müldner Copyright:  Addison-Wesley Publishing Company, 2000 Introduction to C Muldner, Chapters 1, 2.
Introduction to Java CSIS 3701: Advanced Object Oriented Programming.
Basics of Java IMPORTANT: Read Chap 1-6 of How to think like a… Lecture 3.
Hello.java Program Output 1 public class Hello { 2 public static void main( String [] args ) 3 { 4 System.out.println( “Hello!" ); 5 } // end method main.
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.
C Programming in Linux Jacob Chan. C/C++ and Java  Portable  Code written in one system and works in another  But in C, there are some libraries that.
These notes were originally developed for CpSc 210 (C version) by Dr. Mike Westall in the Department of Computer Science at Clemson.
1 Homework HW5 due today Review a lot of things about allocation of storage that may not have been clear when we covered them in our initial pass Introduction.
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.
Computer Organization and Design Pointers, Arrays and Strings in C Montek Singh Sep 18, 2015 Lab 5 supplement.
CSC 143A 1 CSC 143 Introduction to C++ [Appendix A]
C++ for Java Programmers Chapter 2. Fundamental Daty Types Timothy Budd.
ICOM 4035 – Data Structures Dr. Manuel Rodríguez Martínez Electrical and Computer Engineering Department Lecture 2 – August 23, 2001.
Pointers1 WHAT IS A POINTER? Simply stated, a pointer is an address. A running program consists of three parts: execution stack, code, and data. They are.
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.
Announcements Assignment 2 Out Today Quiz today - so I need to shut up at 4:25 1.
CS 61C: Great Ideas in Computer Architecture C Pointers Instructors: Vladimir Stojanovic & Nicholas Weaver 1.
The Machine Model Memory
IT 252 Computer Organization and Architecture
A bit of C programming Lecture 3 Uli Raich.
CS 61C: Great Ideas in Computer Architecture Introduction to C
March, 2006 Saeid Nooshabadi
C Basics.
CMSC 341 Prof. Michael Neary
Instructor Paul Pearce
Presentation transcript:

CS61C L03 Introduction to C (pt 1) (1) Garcia, Fall 2011 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 3 – Introduction to the C Programming Language (pt 1) First Strechable OLED!  Still in the early research stage, but engineers at sister campus UCLA have developed an organic light-emitting diode that streches, which could lead to electronics that can be rolled up like cloth. Get your clickers ready...

CS61C L03 Introduction to C (pt 1) (2) Garcia, Fall 2011 © UCB And in review... We represent “things” in computers as particular bit patterns: N bits  2 N things These 5 integer encodings have different benefits; 1s complement and sign/mag have most problems. unsigned (C99’s uintN_t ) : 2’s complement (C99’s intN_t ) universal, learn! Overflow: numbers  ; computers finite,errors! META: We often make design decisions to make HW simple META: Ain’t no free lunch

CS61C L03 Introduction to C (pt 1) (3) Garcia, Fall 2011 © UCB “Before this class, I (student) would say I am a solid C programmer” a)Strongly disagree (never coded, and I don’t know Java or C++) b)Mildly disagree (never coded, but I do know Java and/or C++) c)Neutral (I’ve coded a little in C) d)Mildly agree (I’ve coded a fair bit in C) e)Strongly agree (I’ve coded a lot in C)

CS61C L03 Introduction to C (pt 1) (4) Garcia, Fall 2011 © UCB “Before this class, I (student) would say I am a solid Java programmer” a)Strongly disagree (never coded, and I don’t know C or C++) b)Mildly disagree (never coded, but I do know C and/or C++) c)Neutral (I’ve coded a little in Java) d)Mildly agree (I’ve coded a fair bit in Java) e)Strongly agree (I’ve coded a lot in Java)

CS61C L03 Introduction to C (pt 1) (5) Garcia, Fall 2011 © UCB Has there been an update to ANSI C? Yes! It’s called the “C99” or “C9x” std You need “ gcc -std=c99 ” to compile References Highlights Declarations in for loops, like Java (#15) Java-like // comments (to end of line) (#10) Variable-length non-global arrays (#33) : explicit integer types (#38) for boolean logic def’s (#35)

CS61C L03 Introduction to C (pt 1) (6) Garcia, Fall 2011 © 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”  Brian Harvey’s course notes  On CS61C class website

CS61C L03 Introduction to C (pt 1) (7) Garcia, Fall 2011 © 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. These differ mainly in when your program is converted to machine instructions. For C, generally a 2 part process of compiling.c files to.o files, then linking the.o files into executables. Assembling is also done (but is hidden, i.e., done automatically, by default)

CS61C L03 Introduction to C (pt 1) (8) Garcia, Fall 2011 © 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) (9) Garcia, Fall 2011 © 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) (10) Garcia, Fall 2011 © 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). Here argc is 2: 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) (11) Garcia, Fall 2011 © 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; if not, it holds garbage! Examples of declarations: correct : { int a = 0, b = 10;... Incorrect:* for (int i = 0; i < 10; i++) *C99 overcomes these limitations

CS61C L03 Introduction to C (pt 1) (12) Garcia, Fall 2011 © 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. Do you think they use signed or unsigned numbers? Negative address?! Don’t confuse the address referring to a memory location with the value stored in that location

CS61C L03 Introduction to C (pt 1) (13) Garcia, Fall 2011 © 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) (14) Garcia, Fall 2011 © 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) (15) Garcia, Fall 2011 © 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) (16) Garcia, Fall 2011 © UCB Pointers and Parameter Passing Java and C pass parameters “by value” procedure/function/method 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) (17) Garcia, Fall 2011 © 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) (18) Garcia, Fall 2011 © UCB Pointers Pointers are used to point to any data type ( int, char, a struct, etc.). 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… and security issues… and a lot of other bad things!

CS61C L03 Introduction to C (pt 1) (19) Garcia, Fall 2011 © UCB Peer Instruction Question void main(); { int *p, x=5, y; // init y = *(p = &x) + 1; int z; flip-sign(p); printf("x=%d,y=%d,p=%d\n",x,y,p); } flip-sign(int *n){*n = -(*n)} How many syntax+logic errors in this C99 code? #Errors a)1 b)2 c)3 d)4 e)5

CS61C L03 Introduction to C (pt 1) (20) Garcia, Fall 2011 © UCB Peer Instruction Answer void main(); { int *p, x=5, y; // init y = *(p = &x) + 1; int z; flip-sign(p); printf("x=%d,y=%d,p=%d\n",x,y,*p); } flip-sign(int *n){*n = -(*n);} How many syntax+logic errors in this C99 code? I get 5… (signed ptr print is logical err) #Errors a)1 b)2 c)3 d)4 e)5

CS61C L03 Introduction to C (pt 1) (21) Garcia, Fall 2011 © UCB And in conclusion… All declarations go at the beginning of each function except if you use C99. 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) (22) Garcia, Fall 2011 © 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) (23) Garcia, Fall 2011 © 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 */ // comment printf * You need newer C compilers to allow Java style comments, or just use C99

CS61C L03 Introduction to C (pt 1) (24) Garcia, Fall 2011 © 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!) *Boolean types provided by C99’s stdbool.h

CS61C L03 Introduction to C (pt 1) (25) Garcia, Fall 2011 © 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