src7-malan/c/array/array/main.c // main.c // Array // David J. Malan // Harvard University // // Demonstrates arrays. 11.
|
|
|
- Andrew Barton
- 6 years ago
- Views:
Transcription
1 src7-malan/c/array/array/main.c main.c Array David J. Malan Harvard University malan@harvard.edu Demonstrates arrays. #include <stdio.h> int main(int argc, const char * argv[]) prompt user for number of exams int n; printf("enter number of exams: "); scanf("%d", &n); allocate memory for grades (on stack) int grades[n]; prompt user for exams' grades for (int i = 0; i < n; i++) printf("enter grade %d of %d: ", i+1, n); scanf("%d", &grades[i]); do something with grades...
2 src7-malan/c/conditions/conditions/main.c main.c Conditions David J. Malan Harvard University malan@harvard.edu Reports whether user's input is positive, negative, or zero. #include <stdio.h> int main(int argc, const char * argv[]) int n; printf("enter an integer: "); scanf("%d", &n); if (n > 0) printf("thanks for the positive integer!\n"); else if (n < 0) printf("thanks for the negative integer!\n"); else printf("thanks for the zero!\n");
3 src7-malan/c/dowhile/dowhile/main.c main.c DoWhile David J. Malan Harvard University malan@harvard.edu Demonstrates a do-while loop. #include <stdio.h> int main(int argc, const char * argv[]) int n; do printf("enter a positive integer: "); scanf("%d", &n); while (n < 1); printf("thanks for the positive integer!\n");
4 src7-malan/c/enum/enum/main.c main.c Enum David J. Malan Harvard University malan@harvard.edu Demonstrates an enum (and a struct). #include <stdio.h> gender typedef enum FEMALE, MALE genders; student typedef struct char *name; genders gender; student; prototype void greet(student s); int main (int argc, const char * argv[]) alice student alice; alice.name = "Alice"; alice.gender = FEMALE; greet(alice); bob student bob; bob.name = "Bob"; bob.gender = MALE; greet(bob); greets student void greet(student s)
5 src7-malan/c/enum/enum/main.c char *title = (s.gender == FEMALE)? "Ms." : "Mr."; printf("hello, %s %s.\n", title, s.name);
6 src7-malan/c/for/for/main.c main.c For David J. Malan Harvard University malan@harvard.edu Demonstrates a for loop. #include <stdio.h> int main(int argc, const char * argv[]) int n; printf("enter a positive integer: "); scanf("%d", &n); for (int i = n; i > 0; i--) printf("%d...\n", i); printf("blast off!\n");
7 src7-malan/c/getint/getint/main.c main.c GetInt David J. Malan Harvard University malan@harvard.edu Gets an int from the user. #include <stdio.h> int main(int argc, const char * argv[]) int n; printf("enter an integer: "); scanf("%d", &n); printf("thanks for the %d!\n", n);
8 src7-malan/c/helloc/helloc/main.c main.c HelloC David J. Malan Harvard University malan@harvard.edu Says hello to the world in C. #include <stdio.h> int main (int argc, const char * argv[]) printf("hello, World!\n");
9 src7-malan/c/malloc/malloc/main.c main.c Malloc David J. Malan Harvard University malan@harvard.edu Demonstrates malloc. #include <stdio.h> #include <stdlib.h> prototype int *get_grades(int exams); int main (int argc, const char * argv[]) prompt user for number of exams int n; printf("enter number of exams: "); scanf("%d", &n); get grades int *grades = get_grades(n); do something with grades... free memory free(grades); gets grades int *get_grades(int exams) allocate memory for grades (on heap) int *grades = malloc(sizeof(int) * exams); prompt user for exams' grades for (int i = 0; i < exams; i++) printf("enter grade %d of %d: ", i+1, exams); scanf("%d", &grades[i]); return grades;
10 src7-malan/c/struct/struct/main.c main.c Struct David J. Malan Harvard University malan@harvard.edu Demonstrates a struct. #include <stdio.h> student typedef struct int age; char *name; student; prototype void greet(student s); int main (int argc, const char * argv[]) alice student alice; alice.age = 20; alice.name = "Alice"; greet(alice); bob student bob; bob.age = 21; bob.name = "Bob"; greet(bob); greets student void greet(student s) printf("hello, %s. I see that you are %d years old.\n", s.name, s.age);
11 src7-malan/c/swapfailure/swapfailure/main.c main.c SwapFailure David J. Malan Harvard University malan@harvard.edu Fails to swap two variables' values. #include <stdio.h> function prototype void swap(int a, int b); int main(int argc, const char * argv[]) int x = 0; int y = 1; printf("x is %d\n", x); printf("y is %d\n", y); printf("swapping x and y...\n"); swap(x, y); printf("success!\n"); printf("x is %d\n", x); printf("y is %d\n", y); Swaps arguments' values. void swap(int a, int b) int tmp = a; a = b; b = tmp;
12 src7-malan/c/swapsuccess/swapsuccess/main.c main.c SwapSuccess David J. Malan Harvard University malan@harvard.edu Swaps two variables' values. #include <stdio.h> function prototype void swap(int *a, int *b); int main(int argc, const char * argv[]) int x = 0; int y = 1; printf("x is %d\n", x); printf("y is %d\n", y); printf("swapping x and y...\n"); swap(&x, &y); printf("success!\n"); printf("x is %d\n", x); printf("y is %d\n", y); Swaps arguments' values. void swap(int *a, int *b) int tmp = *a; *a = *b; *b = tmp;
13 src7-malan/c/while/while/main.c main.c While David J. Malan Harvard University malan@harvard.edu Demonstrates a while loop. #include <stdio.h> int main(int argc, const char * argv[]) int n; printf("enter a positive integer: "); scanf("%d", &n); while (n > 0) printf("%d...\n", n); n--; printf("blast off!\n");
14 src7-malan/objc/helloobjc/helloobjc/main.m main.c HelloObjC David J. Malan Harvard University malan@harvard.edu Says hello to the world in Objective-C. #import <Foundation/Foundation.h> int main(int argc, const char * NSLog(@"Hello, World!");
15 src7-malan/objc/students1/students1/main.m main.m Students1 David J. Malan Harvard University malan@harvard.edu Demonstrates use of a class. #import <Foundation/Foundation.h> #import "Student.h" prototype void greet(student *s); int main(int argc, const char * Alice Student *alice = [Student alloc]; alice->age = 20; alice->name greet(alice); Bob Student *bob = [Student alloc]; bob->age = 21; bob->name greet(bob); greets student (via stderr) void greet(student *s) NSLog(@"Hello, %@. I see that you are %d years old.\n", s->name, s->age);
16 src7-malan/objc/students1/students1/student.h Student.h Students1 David J. Malan Harvard University malan@harvard.edu Declares a student. #import Student : int age; NSString
17 src7-malan/objc/students1/students1/student.m Student.m Students1 David J. Malan Harvard University Defines a student. #import
18 src7-malan/objc/students2/students2/main.m main.m Students2 David J. Malan Harvard University malan@harvard.edu Demonstrates use of a class, getters, and setters. #import <Foundation/Foundation.h> #import "Student.h" prototype void greet(student *s); int main(int argc, const char * Alice Student *alice = [Student alloc]; [alice setage:20]; [alice setname:@"alice"]; greet(alice); Bob Student *bob = [Student alloc]; [bob setage:21]; [bob setname:@"bob"]; greet(bob); greets student (via stderr) void greet(student *s) NSLog(@"Hello, %@. I see that you are %d years old.\n", [s name], [s age]);
19 src7-malan/objc/students2/students2/student.h Student.h Students2 David J. Malan Harvard University malan@harvard.edu Declares a student with getters and setters. #import Student : NSObject int _age; NSString *_name; - (int)age; - (void)setage:(int)age; - (NSString *)name; - (void)setname:(nsstring
20 src7-malan/objc/students2/students2/student.m Student.m Students2 David J. Malan Harvard University malan@harvard.edu Defines a student with getters and setters. #import Student - (int)age return _age; - (void)setage:(int)age _age = age; - (NSString *)name return _name; - (void)setname:(nsstring *)name _name = [name
21 src7-malan/objc/students3/students3/main.m main.m Students3 David J. Malan Harvard University malan@harvard.edu Demonstrates use of properties. #import <Foundation/Foundation.h> #import "Student.h" prototype void greet(student *s); int main(int argc, const char * Alice Student *alice = [Student alloc]; alice.age = 20; alice.name greet(alice); Bob Student *bob = [Student alloc]; bob.age = 21; bob.name greet(bob); greets student (via stderr) void greet(student *s) NSLog(@"Hello, %@. I see that you are %d years old.\n", s.name, s.age);
22 src7-malan/objc/students3/students3/student.h Student.h Students3 David J. Malan Harvard University malan@harvard.edu Declares a student with properties. #import Student : NSObject int _age; NSString (assign, nonatomic, readwrite) int (copy, nonatomic, readwrite) NSString *name; - (int)age; - (void)setage:(int)age; - (NSString *)name; - (void)setname:(nsstring
23 src7-malan/objc/students3/students3/student.m Student.m Students3 David J. Malan Harvard University malan@harvard.edu Defines a student with properties. #import Student - (int)age return _age; - (void)setage:(int)age _age = age; - (NSString *)name return _name; - (void)setname:(nsstring *)name _name = [name
24 src7-malan/objc/students4/students4/main.m main.m Students4 David J. Malan Harvard University malan@harvard.edu Demonstrates use of synthesized properties. #import <Foundation/Foundation.h> #import "Student.h" prototype void greet(student *s); int main(int argc, const char * Alice Student *alice = [Student alloc]; alice.age = 20; alice.name greet(alice); Bob Student *bob = [Student alloc]; bob.age = 21; bob.name greet(bob); greets student (via stderr) void greet(student *s) NSLog(@"Hello, %@. I see that you are %d years old.\n", s.name, s.age);
25 src7-malan/objc/students4/students4/student.h Student.h Students4 David J. Malan Harvard University malan@harvard.edu Declares a student with synthesized properties. #import Student : (assign, nonatomic, readwrite) int (copy, nonatomic, readwrite) NSString
26 src7-malan/objc/students4/students4/student.m Student.m Students4 David J. Malan Harvard University malan@harvard.edu Defines a student with synthesized properties. #import
27 src7-malan/objc/students5/students5/main.m main.m Students5 David J. Malan Harvard University malan@harvard.edu Demonstrates use of (mostly) synthesized properties. #import <Foundation/Foundation.h> #import "Student.h" prototype void greet(student *s); int main(int argc, const char * Alice Student *alice = [Student alloc]; alice.age = 20; alice.name greet(alice); Bob Student *bob = [Student alloc]; bob.age = 21; bob.name greet(bob); David Student *david = [Student alloc]; david.age = 34; david.name greet(david); greets student (via stderr) void greet(student *s) NSLog(@"Hello, %@. I see that you are %d years old.\n", s.name, s.age);
28 src7-malan/objc/students5/students5/student.h Student.h Students5 David J. Malan Harvard University malan@harvard.edu Declares a student with (mostly) synthesized properties. #import Student : (assign, nonatomic, readwrite) int (copy, nonatomic, readwrite) NSString
29 src7-malan/objc/students5/students5/student.m Student.m Students5 David J. Malan Harvard University malan@harvard.edu Defines a student with (mostly) synthesized properties. #import name=_name; - (void)setname:(nsstring *)name if ([name isequaltostring:@"david"]) _name = [[NSString alloc] initwithstring:@"dummy"]; else _name = [name
30 src7-malan/objc/students6/students6/main.m main.m Students6 David J. Malan Harvard University malan@harvard.edu Demonstrates init methods. #import <Foundation/Foundation.h> #import "Student.h" prototype void greet(student *s); int main(int argc, const char * Alice Student *alice = [[Student alloc] initwithname:@"alice" andage:20]; greet(alice); Bob Student *bob = [[Student alloc] initwithname:@"bob" andage:21]; greet(bob); John Student *john = [[Student alloc] init]; greet(john); greets student (via stderr) void greet(student *s) NSLog(@"Hello, %@. I see that you are %d years old.\n", s.name, s.age);
31 src7-malan/objc/students6/students6/student.h Student.h Students6 David J. Malan Harvard University malan@harvard.edu Declares a student with init methods. #import Student : (assign, nonatomic, readwrite) int (copy, nonatomic, readwrite) NSString *name; - (id)initwithname:(nsstring *)name
32 src7-malan/objc/students6/students6/student.m Student.m Students6 David J. Malan Harvard University malan@harvard.edu Defines a student with init methods. #import name=_name; - (id)init self = [self initwithname:@"john" andage:404]; return self; - (id)initwithname:(nsstring *)name andage:(int)age if (self = [super init]) self.age = age; self.name = name; return
33 src7-malan/objc/students7/students7/main.m main.m Students7 David J. Malan Harvard University malan@harvard.edu Demonstrates mutable arrays. #import <Foundation/Foundation.h> #import "Student.h" prototype void greet(student *s); int main(int argc, const char * allocate array for students NSMutableArray *students = [[NSMutableArray alloc] init]; Alice [students addobject:[[student alloc] initwithname:@"alice" andage:20]]; Bob [students addobject:[[student alloc] initwithname:@"bob" andage:21]]; greet then release each student for (Student *s in students) greet(s); greets student (via stderr) void greet(student *s) NSLog(@"Hello, %@. I see that you are %d years old.\n", s.name, s.age);
34 src7-malan/objc/students7/students7/student.h Student.h Students7 David J. Malan Harvard University malan@harvard.edu Declares a student with init methods. #import Student : (assign, nonatomic, readwrite) int (copy, nonatomic, readwrite) NSString *name; - (id)initwithname:(nsstring *)name
35 src7-malan/objc/students7/students7/student.m Student.m Students7 David J. Malan Harvard University malan@harvard.edu Defines a student with init methods. #import name=_name; - (id)init self = [self initwithname:@"john" andage:404]; return self; - (id)initwithname:(nsstring *)name andage:(int)age if (self = [super init]) self.age = age; self.name = name; return
src2/section2.0/section2/main.m // main.m // Students7 // David J. Malan // Harvard University // // Demonstrates mutable arrays.
src2/section0/section2/main.m 1 1 1 1 2 2 2 2 2 2 2 2 2 30. 3 3 3 3 3 3 3 3 3 40. 4 4 4 4 main.m Students7 David J. Malan Harvard University malan@harvard.edu Demonstrates mutable arrays. #import
Design Phase. Create a class Person. Determine the superclass. NSObject (in this case)
Design Phase Create a class Person Determine the superclass NSObject (in this case) 8 Design Phase Create a class Person Determine the superclass NSObject (in this case) What properties should it have?
CS193P - Lecture 3. iphone Application Development. Custom Classes Object Lifecycle Autorelease Properties
CS193P - Lecture 3 iphone Application Development Custom Classes Object Lifecycle Autorelease Properties 1 Announcements Assignments 1A and 1B due Wednesday 1/13 at 11:59 PM Enrolled Stanford students
Announcement. Final Project Proposal Presentations and Updates
Announcement Start Final Project Pitches on Wednesday Presentation slides dues by Tuesday at 11:59 PM Email slides to cse438ta@gmail.com Extensible Networking Platform 1 1 - CSE 438 Mobile Application
Parameter passing. Programming in C. Important. Parameter passing... C implements call-by-value parameter passing. UVic SEng 265
Parameter passing Programming in C UVic SEng 265 Daniel M. German Department of Computer Science University of Victoria 1 SEng 265 dmgerman@uvic.ca C implements call-by-value parameter passing int a =
Objective-C Part 2 (ECS189H) Ken Joy Serban Porumbescu
Objective-C Part 2 (ECS189H) Ken Joy joy@cs.ucdavis.edu Serban Porumbescu porumbes@cs.ucdavis.edu Today Objective-C Memory Management Properties Categories and Protocols Delegates Objective-C Memory Management
CMSC 313 COMPUTER ORGANIZATION & ASSEMBLY LANGUAGE PROGRAMMING PREVIEW SLIDES 14, SPRING 2013
CMSC 313 COMPUTER ORGANIZATION & ASSEMBLY LANGUAGE PROGRAMMING PREVIEW SLIDES 14, SPRING 2013 RECAP ARRAYS VS. POINTERS C Parameter Passing Notes We'll say formal parameter vs actual parameter. Formal
From Java to C. Thanks to Randal E. Bryant and David R. O'Hallaron (Carnegie-Mellon University) for providing the basis for these slides
From Java to C Thanks to Randal E. Bryant and David R. O'Hallaron (Carnegie-Mellon University) for providing the basis for these slides 1 Outline Overview comparison of C and Java Good evening Preprocessor
Ricardo Rocha. Department of Computer Science Faculty of Sciences University of Porto
Ricardo Rocha Department of Computer Science Faculty of Sciences University of Porto Adapted from the slides Revisões sobre Programação em C, Sérgio Crisóstomo Compilation #include int main()
cs50.c /**************************************************************************** * CS50 Library 6 *
cs50.c 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. 28. 29. 30. 31. 32. 33. 34. 35. 36. 37. 38. 39. 40. 41. 42. 43. 44. 45. 46. 47. 48. / CS50 Library
Computer Science 50 Introduction to Computer Science I. Week 0
Computer Science 50 Introduction to Computer Science I Harvard College Week 0 David J. Malan malan@post.harvard.edu 0 Counting in Binary 128s 64s 32s 16s 8s 4s 2s 1s 1 Counting in Binary 128s 64s 32s 16s
Outline. Lecture 1 C primer What we will cover. If-statements and blocks in Python and C. Operators in Python and C
Lecture 1 C primer What we will cover A crash course in the basics of C You should read the K&R C book for lots more details Various details will be exemplified later in the course Outline Overview comparison
CS193E Lecture #3 Categories and Protocols Cocoa Memory Management
CS193E Lecture #3 Categories and Protocols Cocoa Memory Management Winter 2008, Dempsey/Marcos 1 Today s Topics Questions from Assignment 1A or 1B? Categories Protocols Cocoa Memory Management Object life
Objective-C ICT/7421ICTNathan. René Hexel. School of Information and Communication Technology Griffith University.
Objective-C 2.0 2501ICT/7421ICTNathan René Hexel School of Information and Communication Technology Griffith University Semester 1, 2012 Outline Fast Enumeration and Properties 1 Fast Enumeration and Properties
ECE 264 Exam 2. 6:30-7:30PM, March 9, You must sign here. Otherwise you will receive a 1-point penalty.
ECE 264 Exam 2 6:30-7:30PM, March 9, 2011 I certify that I will not receive nor provide aid to any other student for this exam. Signature: You must sign here. Otherwise you will receive a 1-point penalty.
COMP 2355 Introduction to Systems Programming
COMP 2355 Introduction to Systems Programming Christian Grothoff christian@grothoff.org http://grothoff.org/christian/ 1 Pointers Pointers denote addresses in memory In C types, the * represents the use
Kurt Schmidt. October 30, 2018
to Structs Dept. of Computer Science, Drexel University October 30, 2018 Array Objectives to Structs Intended audience: Student who has working knowledge of Python To gain some experience with a statically-typed
Memory. What is memory? How is memory organized? Storage for variables, data, code etc. Text (Code) Data (Constants) BSS (Global and static variables)
Memory Allocation Memory What is memory? Storage for variables, data, code etc. How is memory organized? Text (Code) Data (Constants) BSS (Global and static variables) Text Data BSS Heap Stack (Local variables)
Programming in C. Pointers and Arrays
Programming in C Pointers and Arrays NEXT SET OF SLIDES FROM DENNIS FREY S FALL 2011 CMSC313 http://www.csee.umbc.edu/courses/undergraduate/313/fall11/" Pointers and Arrays In C, there is a strong relationship
COP 3223 Introduction to Programming with C - Study Union - Fall 2017
COP 3223 Introduction to Programming with C - Study Union - Fall 2017 Chris Marsh and Matthew Villegas Contents 1 Code Tracing 2 2 Pass by Value Functions 4 3 Statically Allocated Arrays 5 3.1 One Dimensional.................................
ntroduction to C CS 2022: ntroduction to C nstructor: Hussam Abu-Libdeh (based on slides by Saikat Guha) Fall 2011, Lecture 1 ntroduction to C CS 2022, Fall 2011, Lecture 1 History of C Writing code in
DS Assignment I. 1. Set a pointer by name first and last to point to the first element and last element of the list respectively.
DS Assignment I 1 Suppose an integer array by name list is declared of size N (ex: #define N 10 int list[n]; ) Write C statements to achieve the following: 1 Set a pointer by name first and last to point
return return else return
compare0.c 1 // Compares two strings' addresses 4 #include 5 6 int main(void) 7 { 8 // get two strings 9 string s = get_string("s: "); 10 string t = get_string("t: "); 11 1 // compare strings'
else return for return
addresses.c 1 // Prints two strings' addresses 4 #include 5 6 int main(void) 7 { 8 // Get two strings 9 string s = get_string("s: "); 10 string t = get_string("t: "); 11 1 // Print strings' addresses
list-0.c * list-0.c * David J. Malan * * Demonstrates a linked list for numbers.
list-0.c 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. 28. 29. 30. 31. 32. 33. 34. 35. 36. 37. 38. 39. 40. 41. 42. 43. 44. 45. 46. 47. 48. list-0.c
IPHONE DEVELOPMENT. Getting Started with the iphone SDK
IPHONE DEVELOPMENT Getting Started with the iphone SDK OBJECTIVE-C The Big Picture STRICT SUPERSET OF C The Objective C Language Any C stuff applies Standard libs are here (time, sqrt etc) The C Language
High-performance computing and programming Intro to C on Unix/Linux. Uppsala universitet
High-performance computing and programming Intro to C on Unix/Linux IT Uppsala universitet What is C? An old imperative language that remains rooted close to the hardware C is relatively small and easy
C/Java Syntax. January 13, Slides by Mark Hancock (adapted from notes by Craig Schock)
C/Java Syntax 1 Lecture 02 Summary Keywords Variable Declarations Data Types Operators Statements if, switch, while, do-while, for Functions 2 By the end of this lecture, you will be able to identify the
C/Java Syntax. Lecture 02 Summary. Keywords Variable Declarations Data Types Operators Statements. Functions. if, switch, while, do-while, for
C/Java Syntax 1 Lecture 02 Summary Keywords Variable Declarations Data Types Operators Statements if, switch, while, do-while, for Functions 2 1 By the end of this lecture, you will be able to identify
COMP 2355 Introduction to Systems Programming
COMP 2355 Introduction to Systems Programming Christian Grothoff christian@grothoff.org http://grothoff.org/christian/ 1 Functions Similar to (static) methods in Java without the class: int f(int a, int
These problems are provided to you as a guide for practice. The questions cover important concepts covered in class.
Midterm Written Exam Practice Midterm will cover all concepts covered up to the midterm exam. Concepts of arrays, LL s, pointers (*,**,***), malloc, calloc, realloc, function pointers, Hash tables will
C LANGUAGE A Short Course
C LANGUAGE A Short Course Alvaro F. M. Azevedo http://www.fe.up.pt/~alvaro January 2002 C Language - Alvaro Azevedo 1 ANSI C Standard (ANSI, ISO) Compiled - efficient Low level / high level Other languages
Array Initialization
Array Initialization Array declarations can specify initializations for the elements of the array: int primes[10] = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29 ; initializes primes[0] to 2, primes[1] to 3, primes[2]
CS61, Fall 2012 Section 2 Notes
CS61, Fall 2012 Section 2 Notes (Week of 9/24-9/28) 0. Get source code for section [optional] 1: Variable Duration 2: Memory Errors Common Errors with memory and pointers Valgrind + GDB Common Memory Errors
16.216: ECE Application Programming Fall 2011
16.216: ECE Application Programming Fall 2011 Exam 2 Solution 1. (24 points, 6 points per part) Multiple choice For each of the multiple choice questions below, clearly indicate your response by circling
C Concepts - I/O. Lecture 19 COP 3014 Fall November 29, 2017
C Concepts - I/O Lecture 19 COP 3014 Fall 2017 November 29, 2017 C vs. C++: Some important differences C has been around since around 1970 (or before) C++ was based on the C language While C is not actually
CMSC 313 COMPUTER ORGANIZATION & ASSEMBLY LANGUAGE PROGRAMMING LECTURE 14, FALL 2012
CMSC 313 COMPUTER ORGANIZATION & ASSEMBLY LANGUAGE PROGRAMMING LECTURE 14, FALL 2012 TOPICS TODAY Midterm exam topics Recap arrays vs pointers Characters & strings & pointers (Oh My!) Structs & pointers
COP 3223 Introduction to Programming with C - Study Union - Spring 2018
COP 3223 Introduction to Programming with C - Study Union - Spring 2018 Chris Marsh and Matthew Villegas Contents 1 Code Tracing 2 2 Pass by Value Functions 4 3 Statically Allocated Arrays 5 3.1 One Dimensional.................................
Agenda. The main body and cout. Fundamental data types. Declarations and definitions. Control structures
The main body and cout Agenda 1 Fundamental data types Declarations and definitions Control structures References, pass-by-value vs pass-by-references The main body and cout 2 C++ IS AN OO EXTENSION OF
Common Misunderstandings from Exam 1 Material
Common Misunderstandings from Exam 1 Material Kyle Dewey Stack and Heap Allocation with Pointers char c = c ; char* p1 = malloc(sizeof(char)); char** p2 = &p1; Where is c allocated? Where is p1 itself
CMPSC 311- Introduction to Systems Programming Module: Arrays and Pointers
CMPSC 311- Introduction to Systems Programming Module: Arrays and Pointers Professor Patrick McDaniel Fall 2014 Course notes Exam moved to Oct 1, 2014 Assignment #3 introduction section This Thur (9/25)
Dynamic memory allocation
Dynamic memory allocation outline Memory allocation functions Array allocation Matrix allocation Examples Memory allocation functions (#include ) malloc() Allocates a specified number of bytes
Running a C program Compilation Python and C Variables and types Data and addresses Functions Performance. John Edgar 2
CMPT 125 Running a C program Compilation Python and C Variables and types Data and addresses Functions Performance John Edgar 2 Edit or write your program Using a text editor like gedit Save program with
Lecture 02 Summary. C/Java Syntax 1/14/2009. Keywords Variable Declarations Data Types Operators Statements. Functions
Lecture 02 Summary C/Java Syntax Keywords Variable Declarations Data Types Operators Statements if, switch, while, do-while, for Functions 1 2 By the end of this lecture, you will be able to identify the
Introductory ios Development
Instructor s Introductory ios Development Unit 3 - Objective-C Classes Introductory ios Development 152-164 Unit 3 - Swift Classes Quick Links & Text References Structs vs. Classes Structs intended for
Systems Programming and Computer Architecture ( )
Systems Group Department of Computer Science ETH Zürich Systems Programming and Computer Architecture (252-0061-00) Timothy Roscoe Herbstsemester 2016 1 4: Pointers Computer Architecture and Systems Programming
Pointers. Part VI. 1) Introduction. 2) Declaring Pointer Variables. 3) Using Pointers. 4) Pointer Arithmetic. 5) Pointers and Arrays
EE105: Software Engineering II Part 6 Pointers page 1 of 19 Part VI Pointers 1) Introduction 2) Declaring Pointer Variables 3) Using Pointers 4) Pointer Arithmetic 5) Pointers and Arrays 6) Pointers and
Sample Examination. Family Name:... Other Names:... Signature:... Student Number:...
Family Name:... Other Names:... Signature:... Student Number:... THE UNIVERSITY OF NEW SOUTH WALES SCHOOL OF COMPUTER SCIENCE AND ENGINEERING Sample Examination COMP1917 Computing 1 EXAM DURATION: 2 HOURS
EM108 Software Development for Engineers
EE108 Section 6 Pointers page 1 of 20 EM108 Software Development for Engineers Section 6 - Pointers 1) Introduction 2) Declaring Pointer Variables 3) Using Pointers 4) Pointer Arithmetic 5) Pointers and
Fundamental of Programming (C)
Borrowed from lecturer notes by Omid Jafarinezhad Fundamental of Programming (C) Lecturer: Vahid Khodabakhshi Lecture 9 Pointer Department of Computer Engineering 1/46 Outline Defining and using Pointers
PRINCIPLES OF OPERATING SYSTEMS
PRINCIPLES OF OPERATING SYSTEMS Tutorial-1&2: C Review CPSC 457, Spring 2015 May 20-21, 2015 Department of Computer Science, University of Calgary Connecting to your VM Open a terminal (in your linux machine)
CSE 333 Lecture 2 Memory
CSE 333 Lecture 2 Memory John Zahorjan Department of Computer Science & Engineering University of Washington Today s goals - some terminology - review of memory resources - reserving memory - type checking
Deep C. Multifile projects Getting it running Data types Typecasting Memory management Pointers. CS-343 Operating Systems
Deep C Multifile projects Getting it running Data types Typecasting Memory management Pointers Fabián E. Bustamante, Fall 2004 Multifile Projects Give your project a structure Modularized design Reuse
CSCI-243 Exam 1 Review February 22, 2015 Presented by the RIT Computer Science Community
CSCI-243 Exam 1 Review February 22, 2015 Presented by the RIT Computer Science Community http://csc.cs.rit.edu History and Evolution of Programming Languages 1. Explain the relationship between machine
Introduction to C. Sean Ogden. Cornell CS 4411, August 30, Geared toward programmers
Introduction to C Geared toward programmers Sean Ogden Slide heritage: Alin Dobra Niranjan Nagarajan Owen Arden Robert Escriva Zhiyuan Teo Ayush Dubey Cornell CS 4411, August 30, 2013 Administrative Information
Review. iphone Application Programming Lecture 2: Objective-C, Cocoa. History. Objective-C. Device restrictions. Interaction paradigm changes
Review iphone Application Programming Lecture 2: Objective-C, Cocoa Device restrictions Gero Herkenrath Media Computing Group RWTH Aachen University Winter Semester 2013/2014 http://hci.rwth-aachen.de/iphone
Introduction to C. Ayush Dubey. Cornell CS 4411, August 31, Geared toward programmers
Introduction to C Geared toward programmers Ayush Dubey Slide heritage: Alin Dobra Niranjan Nagarajan Owen Arden Robert Escriva Zhiyuan Teo Cornell CS 4411, August 31, 2012 Administrative Information Outline
CSE 333 Midterm Exam 2/12/16. Name UW ID#
Name UW ID# There are 6 questions worth a total of 100 points. Please budget your time so you get to all of the questions. Keep your answers brief and to the point. The exam is closed book, closed notes,
CS270 Homework 5 (HW5)
Name: Date: CS270 Homework 5 (HW5) Due Thursday, Nov 21 (start of class) Homework and programming assignments are to be done individually. Goals To understand C pointers and structs, and functions and
211: Computer Architecture Summer 2016
211: Computer Architecture Summer 2016 Liu Liu Topic: C Programming Structure: - header files - global / local variables - main() - macro Basic Units: - basic data types - arithmetic / logical / bit operators
Pointers and Structure. Bin Li Assistant Professor Dept. of Electrical, Computer and Biomedical Engineering University of Rhode Island
Pointers and Structure Bin Li Assistant Professor Dept. of Electrical, Computer and Biomedical Engineering University of Rhode Island 1 Pointer Variables Each variable in a C program occupies space in
C programming basics T3-1 -
C programming basics T3-1 - Outline 1. Introduction 2. Basic concepts 3. Functions 4. Data types 5. Control structures 6. Arrays and pointers 7. File management T3-2 - 3.1: Introduction T3-3 - Review of
Memory Allocation in C
Memory Allocation in C When a C program is loaded into memory, it is organized into three areas of memory, called segments: the text segment, stack segment and heap segment. The text segment (also called
Introduction to C. Zhiyuan Teo. Cornell CS 4411, August 26, Geared toward programmers
Introduction to C Geared toward programmers Zhiyuan Teo Slide heritage: Alin Dobra Niranjan Nagarajan Owen Arden Robert Escriva Cornell CS 4411, August 26, 2011 1 Administrative Information 2 Why C? 3
Lab Exam 1 D [1 mark] Give an example of a sample input which would make the function
![Lab Exam 1 D [1 mark] Give an example of a sample input which would make the function](/thumbs/95/125616856.jpg "Lab Exam 1 D [1 mark] Give an example of a sample input which would make the function")
CMPT 127 Spring 2019 Grade: / 20 First name: Last name: Student Number: Lab Exam 1 D400 1. [1 mark] Give an example of a sample input which would make the function scanf( "%f", &f ) return -1? Answer:
Introduction to C. Robert Escriva. Cornell CS 4411, August 30, Geared toward programmers
Introduction to C Geared toward programmers Robert Escriva Slide heritage: Alin Dobra Niranjan Nagarajan Owen Arden Cornell CS 4411, August 30, 2010 1 Why C? 2 A Quick Example 3 Programmer s Responsibilities
CMPSC 311- Introduction to Systems Programming Module: Introduction to C
CMPSC 311- Introduction to Systems Programming Module: Introduction to C Professor Patrick McDaniel Fall 2015 Building HW1 You are provided with a Makefile that will assist in making your program. You
Announcements. CSCI 334: Principles of Programming Languages. Lecture 18: C/C++ Announcements. Announcements. Instructor: Dan Barowy
CSCI 334: Principles of Programming Languages Lecture 18: C/C++ Homework help session will be tomorrow from 7-9pm in Schow 030A instead of on Thursday. Instructor: Dan Barowy HW6 and HW7 solutions We only
2. C99 standard guarantees uniqueness of characters for internal names. A. 12 B. 26 C. 31 D. 48
1. How can you make an infinite loop in C? A. while(1) { } B. loop:... goto loop; C. for(;;) { } D. All answers are right 2. C99 standard guarantees uniqueness of characters for internal names. A. 12 B.
Programming in C. UVic SEng 265. Daniel M. German Department of Computer Science University of Victoria. October 23, 2002 Version: 1.
Programming in C UVic SEng 265 Daniel M. German Department of Computer Science University of Victoria October 23, 2002 Version: 1.00 11 1 Programming in C (1.00) dmgerman@uvic.ca Parameter passing C implements
CSE 333 Midterm Exam July 24, Name UW ID#
Name UW ID# There are 6 questions worth a total of 100 points. Please budget your time so you get to all of the questions. Keep your answers brief and to the point. The exam is closed book, closed notes,
ECE264 Spring 2014 Exam 2, March 11, 2014
ECE264 Spring 2014 Exam 2, March 11, 2014 In signing this statement, I hereby certify that the work on this exam is my own and that I have not copied the work of any other student while completing it.
UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING
UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING APS 105 Computer Fundamentals Final Examination December 16, 2013 2:00 p.m. 4:30 p.m. (150 minutes) Examiners: J. Anderson, B. Korst, J.
CMSC 313 COMPUTER ORGANIZATION & ASSEMBLY LANGUAGE PROGRAMMING LECTURE 13, FALL 2012
CMSC 313 COMPUTER ORGANIZATION & ASSEMBLY LANGUAGE PROGRAMMING LECTURE 13, FALL 2012 TOPICS TODAY Project 5 Pointer Basics Pointers and Arrays Pointers and Strings POINTER BASICS Java Reference In Java,
Question 1. Part (a) [2 marks] error: assignment of read-only variable x ( x = 20 tries to modify a constant) Part (b) [1 mark]
![Question 1. Part (a) [2 marks] error: assignment of read-only variable x ( x = 20 tries to modify a constant) Part (b) [1 mark]](/thumbs/75/72333068.jpg "Question 1. Part (a) [2 marks] error: assignment of read-only variable x ( x = 20 tries to modify a constant) Part (b) [1 mark]")
Note to Students: This file contains sample solutions to the term test together with the marking scheme and comments for each question. Please read the solutions and the marking schemes and comments carefully.
Today s Learning Objectives
Today s Learning Objectives 15-123 Systems Skills in C and Unix We will Review ints and modular arithmetic Learn basic Data types and Formats How Conditionals and loops work How Arrays are defined, accessed,
Procedural programming with C
Procedural programming with C Dr. C. Constantinides Department of Computer Science and Software Engineering Concordia University Montreal, Canada August 11, 2016 1 / 77 Functions Similarly to its mathematical
S-1. Concepts this lecture. CSE 142 Computer Programming I. Chapter 11. Review: Data Structures. Problem: Account Records.
CSE 142 Computer Programming I Structures Concepts this lecture Review: Data structures Heterogenous structures (structs, records) struct type definitions (typedef) Field selection (. operator) Structs
Understanding Pointers
Division of Mathematics and Computer Science Maryville College Pointers and Addresses Memory is organized into a big array. Every data item occupies one or more cells. A pointer stores an address. A pointer
Midterm Exam Nov 8th, COMS W3157 Advanced Programming Columbia University Fall Instructor: Jae Woo Lee.
Midterm Exam Nov 8th, 2012 COMS W3157 Advanced Programming Columbia University Fall 2012 Instructor: Jae Woo Lee About this exam: - There are 4 problems totaling 100 points: problem 1: 30 points problem
ECE264 Fall 2013 Exam 3, November 20, 2013
ECE264 Fall 2013 Exam 3, November 20, 2013 In signing this statement, I hereby certify that the work on this exam is my own and that I have not copied the work of any other student while completing it.
The C language. Introductory course #1
The C language Introductory course #1 History of C Born at AT&T Bell Laboratory of USA in 1972. Written by Dennis Ritchie C language was created for designing the UNIX operating system Quickly adopted
Arrays and Strings. Antonio Carzaniga. February 23, Faculty of Informatics Università della Svizzera italiana Antonio Carzaniga
Arrays and Strings Antonio Carzaniga Faculty of Informatics Università della Svizzera italiana February 23, 2015 Outline General memory model Definition and use of pointers Invalid pointers and common
Question 1. [15 marks]
![Question 1. [15 marks]](/thumbs/76/73799697.jpg "Question 1. [15 marks]")
Note to Students: This file contains sample solutions to the term test together with the marking scheme and comments for each question. Please read the solutions and the marking schemes and comments carefully.
#include <stdio.h> int main() { char s[] = Hsjodi, *p; for (p = s + 5; p >= s; p--) --*p; puts(s); return 0;
![#include <stdio.h> int main() { char s[] = Hsjodi, *p; for (p = s + 5; p >= s; p--) --*p; puts(s); return 0;](/thumbs/80/81398999.jpg "#include <stdio.h> int main() { char s[] = Hsjodi, *p; for (p = s + 5; p >= s; p--) --*p; puts(s); return 0;")
1. Short answer questions: (a) Compare the typical contents of a module s header file to the contents of a module s implementation file. Which of these files defines the interface between a module and
ECE264 Fall 2013 Exam 2, October 24, 2013
ECE Fall 0 Exam, October, 0 If this is an on-line exam, you have 0 minutes to finish the exam. When the time limit is reached, the system will automatically close. If this is a paper exam, you have 0 minutes.
CMPT 115. C tutorial for students who took 111 in Java. University of Saskatchewan. Mark G. Eramian, Ian McQuillan CMPT 115 1/32
CMPT 115 C tutorial for students who took 111 in Java Mark G. Eramian Ian McQuillan University of Saskatchewan Mark G. Eramian, Ian McQuillan CMPT 115 1/32 Part I Starting out Mark G. Eramian, Ian McQuillan
Compiling and Running a C Program in Unix
CPSC 211 Data Structures & Implementations (c) Texas A&M University [ 95 ] Compiling and Running a C Program in Unix Simple scenario in which your program is in a single file: Suppose you want to name
Structures and Unions in C
Structures and Unions in C Leo Ferres Department of Computer Science Universidad de Concepción leo@inf.udec.cl July 5, 2010 1 Introduction 2 Structures [W1] Structures in C are defined as data containers
Programming in C. What is C?... What is C?
C Programming in C UVic SEng 265 Developed by Brian Kernighan and Dennis Ritchie of Bell Labs Earlier, in 1969, Ritchie and Thompson developed the Unix operating system We will be focusing on a version
Procedures, Parameters, Values and Variables. Steven R. Bagley
Procedures, Parameters, Values and Variables Steven R. Bagley Recap A Program is a sequence of statements (instructions) Statements executed one-by-one in order Unless it is changed by the programmer e.g.
CS 223: Data Structures and Programming Techniques. Exam 2
CS 223: Data Structures and Programming Techniques. Exam 2 Instructor: Jim Aspnes Work alone. Do not use any notes or books. You have approximately 75 minutes to complete this exam. Please write your answers
Programming in C UVic SEng 265
Programming in C UVic SEng 265 Daniel M. German Department of Computer Science University of Victoria 1 SEng 265 dmgerman@uvic.ca C Developed by Brian Kernighan and Dennis Ritchie of Bell Labs Earlier,
ECE264 Spring 2013 Final Exam, April 30, 2013
ECE264 Spring 2013 Final Exam, April 30, 2013 In signing this statement, I hereby certify that the work on this exam is my own and that I have not copied the work of any other student while completing
Memory Management. a C view. Dr Alun Moon KF5010. Computer Science. Dr Alun Moon (Computer Science) Memory Management KF / 24
Memory Management a C view Dr Alun Moon Computer Science KF5010 Dr Alun Moon (Computer Science) Memory Management KF5010 1 / 24 The Von Neumann model Memory Architecture One continuous address space Program
High Performance Programming Programming in C part 1
High Performance Programming Programming in C part 1 Anastasia Kruchinina Uppsala University, Sweden April 18, 2017 HPP 1 / 53 C is designed on a way to provide a full control of the computer. C is the
Programming in C. What is C?... What is C?
Programming in C UVic SEng 265 C Developed by Brian Kernighan and Dennis Ritchie of Bell Labs Earlier, in 1969, Ritchie and Thompson developed the Unix operating system We will be focusing on a version
CS 326 Operating Systems C Programming. Greg Benson Department of Computer Science University of San Francisco
CS 326 Operating Systems C Programming Greg Benson Department of Computer Science University of San Francisco Why C? Fast (good optimizing compilers) Not too high-level (Java, Python, Lisp) Not too low-level
Review. iphone Application Programming Lecture 2: Objective-C, Cocoa. History. Objective-C. Device restrictions. Interaction paradigm changes
Review iphone Application Programming Lecture 2: Objective-C, Cocoa Device restrictions Gero Herkenrath Media Computing Group RWTH Aachen University Winter Semester 2013/2014 http://hci.rwth-aachen.de/iphone
Online Judge and C. Roy Chan. January 12, Outline Information Online Judge Introduction to C. CSC2100B Data Structures Tutorial 1
Roy Chan CSC2100B Data Structures Tutorial 1 January 12, 2009 1 / 38 1 Information Your TA team Course Information Assignment 2 Online Judge Writing Your Assignment Program Submitting Your Program Online