Instructor Paul Pearce

Slides:



Advertisements
Similar presentations
CIS 101: Computer Programming and Problem Solving Lecture 8 Usman Roshan Department of Computer Science NJIT.
Advertisements

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) (
Unix Continuum of Tools Do something once: use the command line Do something many times: –Use an alias –Use a shell script Do something that is complex.
CS 61C L02 Number Representation (1) Garcia, Spring 2004 © UCB Lecturer PSOE 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
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.
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.
Guide To UNIX Using Linux Third Edition
CS61C L2 Number Representation & Introduction to C (1) Beamer, Summer 2007 © UCB Scott Beamer Instructor inst.eecs.berkeley.edu/~cs61c CS61C : Machine.
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
Introduction and Overview Summer 2014 COMP 2130 Introduction to Computer Systems Computing Science Thompson Rivers University.
Basics of Java IMPORTANT: Read Chap 1-6 of How to think like a… Lecture 3.
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.
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.
Elementary C++. Procedural Programming Split your problem into simpler parts then solve each part separately Recognize common parts and solve them only.
12/8/2015\course\cpeg323-07Fs\Topic2b-323.ppt1 Topic 2b High-Level languages and System Software (Languages) Introduction to Computer Systems Engineering.
Computer Organization and Design Pointers, Arrays and Strings in C Montek Singh Sep 18, 2015 Lab 5 supplement.
CS415 C++ Programming Takamitsu Kawai x4212 G11 CERC building WV Virtual Environments Lab West Virginia University.
1 CSC2100B Data Structure Tutorial 1 Online Judge and C.
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.
1 Binghamton University Exam 1 Review CS Binghamton University Birds eye view -- Topics Information Representation Bit-level manipulations Integer.
CSE 374 Programming Concepts & Tools
Functions Students should understand the concept and basic mechanics of the function call/return pattern from CS 1114/2114, but some will not. A function.
Computer Organization and Design Pointers, Arrays and Strings in C
Chapter 10 Programming Fundamentals with JavaScript
The Machine Model Memory
UMBC CMSC 104 – Section 01, Fall 2016
CSE 374 Programming Concepts & Tools
CSE 374 Programming Concepts & Tools
IT 252 Computer Organization and Architecture
CSE 374 Programming Concepts & Tools
A bit of C programming Lecture 3 Uli Raich.
Java Primer 1: Types, Classes and Operators
COSC 220 Computer Science II
CS 61C: Great Ideas in Computer Architecture Introduction to C
March, 2006 Saeid Nooshabadi
C-language Lecture By B.S.S.Tejesh, S.Neeraja Asst.Prof.
CSE 351 Section 1: HW 0 + Intro to C
C Basics.
Week 4 - Monday CS222.
CSCI206 - Computer Organization & Programming
Programmazione I a.a. 2017/2018.
Arrays in C.
Pointers and References
CMSC 341 Prof. Michael Neary
Strings, Line-by-line I/O, Functions, Call-by-Reference, Call-by-Value
Chapter 10 Programming Fundamentals with JavaScript
Memory Allocation CS 217.
CS61C - Machine Structures Lecture 4 C Structures Memory Management
Introduction to C Topics Compilation Using the gcc Compiler
Program Breakdown, Variables, Types, Control Flow, and Input/Output
Introduction to C Topics Compilation Using the gcc Compiler
Java Programming Language
Java Basics Data Types in Java.
The C Language: Intro.
C Programming - Lecture 5
15213 C Primer 17 September 2002.
SPL – PS1 Introduction to C++.
Presentation transcript:

Instructor Paul Pearce inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 2 – Introduction to the C Programming Language (pt 1) 2010-06-22 Instructor Paul Pearce There is a handout at the front of the room! Please pick one up each day! MIPS Supercomputer  China’s next supercomputer (the Dawning 6000) will be built using the Loongson (MIPS) processor and run Linux. Currently, the top 500 supercomputers are mostly x86 chips. You’ll learn MIPS in CS61C! Greet class… SLOOOOOOOOOOWWW DOOOOOWNNNNN Got feedback slow down Remind about website Complaint about temp, possible move www.technologyreview.com/computing/24374/

META: We often make design decisions to make HW simple In review... We represent “things” in computers as particular bit patterns: N bits  2N 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! 00000 00001 01111 ... 10000 11111 00000 00001 01111 ... 11111 11110 10000 META: Ain’t no free lunch

Clarification from last lecture Subtraction on UNSIGNED integers can be done using traditional methods (+13) – (+3) = 10 Subtraction on SIGNED integers is done as follows: A – B becomes A + (-B), which we can do 1 1 0 1 - 0 0 1 1 ------------------------- 1 0 1 0 1 /

Peer Instruction Which of the following are TRUE I: One of the advantages of 2’s compliment is it provides symmetry in the number of positive and negative #’s II: In 2’s compliment, each number has only one unique representation (for a given number of bits). Answer: 2: III only I fails for TWO reasons. You can’t use “-” in names of variables and you didn’t allocate int storage! II fails because a subroutine could be called with a pointer to a (e.g., p) which changes a, or someone else could point at a or p and change it. I II a) F F b) F T c) T F d) T T e) No idea

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 http://en.wikipedia.org/wiki/C99 http://home.tiscalinet.ch/t_wolf/tw/c/c9x_changes.html Highlights Declarations in for loops, like Java (#15) Java-like // comments (to end of line) (#10) Variable-length non-global arrays (#33) <inttypes.h>: explicit integer types (#38) <stdbool.h> for boolean logic def’s (#35)

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” http://oreilly.com/catalog/javanut/excerpt/ Brian Harvey’s course notes On CS61C class website

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)

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 (Makefiles) allow only modified files to be recompiled

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

To get the main function to accept arguments, use this: 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).

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

Actual C Code #include <stdio.h> int main(int argc, char *argv[]) { int i; int n = 5; for (i = 0; i < n; i = i + 1) { printf("hello, world\n"); } return 0; Ask about what i holds

Consider memory to be a single huge array: 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. Mention we assume same size for now 23 42 ... 101 102 103 104 105 ...

Pointer: A variable that contains the address of a variable. 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. 23 42 ... 101 102 103 104 105 ... x y Location (address) name p 104

How to create a pointer: Pointers How to create a pointer: & operator: get address of a variable int x; int *p; p ? x 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. x = 3; p ? x 3 p =&x; p x 3 How get a value pointed to? * “dereference operator”: get value pointed to printf(“p points to %d\n”,*p);

How to change a variable pointed to? Pointers How to change a variable pointed to? Use dereference * operator on left of = p x 3 p x 5 *p = 5; printf(“what is x? %d\n”, x); x is 5

Yes, all legal code. What is the type of q? Common Pitfall In variable declarations, does * associate with the type, or the variable? int *x; // This is legal int* y; // Is this legal? int* z, q; // Uh oh! Yes, all legal code. What is the type of q? q is an int, not a pointer! * associates with variables in declarations, so we suggest you use the first style!

Labs start today. Be there! Administrivia! New class mailing list! We will go over how to sign up in lab! Labs start today. Be there! You should have cardkey access to the room, if not, send Noah an email! HW1 online now! (Dun dun dunnnnn.. =) C Help session! Wednesday June 23rd, 7-9pm, 306 Soda Check back of yesterday’s handout! Illistrated study guide for number rep!

Final will be on Thursday, August 12th More Administrivia! Final will be on Thursday, August 12th Time TBA Let’s see what you guys think about midterm times I’d like the midterm to be during class time, 9:30am-12:30pm. I’d like the midterm to be during class time, 8:00am-11am. C) I’d like the midterm to be in the evening during a day we have lecture (M-Th) D) I’d like the midterm to be on Friday To be on track to 10 early, I should be at 1020

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 printf(“What is y? %d\n”, y);

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 printf(“What is y? %d\n”, y);

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!

C vs. Java™ Overview (1/2) Java C 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

C vs. Java™ Overview (2/2) Java C 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

What evaluates to FALSE in C? 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

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

Peer Instruction Question void main(int argc, char *argv[]); { 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 See following answer slide

Only 0 and NULL evaluate to FALSE. And in conclusion… All declarations go at the beginning of each function except if you use C99. 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