C Sample Code. Nyoman Bogi Aditya Karna Sisfo IMTelkom
|
|
- Grant Ball
- 5 years ago
- Views:
Transcription
1 Dynamic Array C Sample Code Nyoman Bogi Aditya Karna Sisfo IMTelkom bogi@imtelkom.ac.id Institut Manajemen Telkom
2 /* This program will read the data file (text file) */ /* dissect into a dynamic array */ /* and produce the result both in data measurement */ /* and error.log file */ /* input file name is given as a command line argument */ /* */ #include <stdio.h> #include <string.h> #include <stdlib.h> #include <math.h> #define MAX_STUDENT 30 #define MAX_QUESTION 200 struct student char studentid[10]; /* student ID number as a string */ int *answers; /* ptr to dynamic array of grades */ int rawscore; /* calculated raw score */ ; typedef struct student student; /* assign student structure as a new var type*/ int main(int argc, char *argv[]) /* FUNCTION PROTOTYPE */ FILE *open_file (char *, char *); void get_header (FILE *, char []); int *get_solution (FILE *, int *); int get_student (FILE *, student [], int, int *); student assign_student (char [], char [], int, int *); void statistic (student [], double [], int, int, int *); void print_out (student [], double [], char [], int, int, int *); /* VARIABLE DECLARATION */ char *filename, /* name of the text file (data file) */ header[85]; /* header of the data file */ FILE *fp, /* pointer to the data file */ *error; /* pointer to error.log file */ int *solution; /* array of correct solution */ int no_of_question, /* number of correct solution */ no_of_student; /* number of valid student taking the exam */ student examtakers[max_student]; /* array of the student's information*/ double statistics[6];/* contain all statistic measurements */
3 /* mean, std_dev, median for all students */ /* mean, std_dev, median for every question */ /* START MAIN PROGRAM */ if (argc==2) filename=argv[1]; else fprintf(stderr,"usage : project filename\n"); fp=open_file(filename, "r"); error=open_file("error.log","w"); fclose(error); /* flush error log file */ get_header(fp, header);/* obtain the header of the text file */ solution=get_solution(fp, &no_of_question); /* obtain the correct solution in array and return a pointer to solutions array */ no_of_student=get_student(fp, examtakers, no_of_question, solution); /* obtain all student information and return the number of valid students found*/ statistic(examtakers, statistics, no_of_student, no_of_question, solution); /* calculate all statistic measures */ /* and put them in statistics array */ print_out(examtakers, statistics, header, no_of_student, no_of_question, solution); /* print the student report & summary report */ fclose(fp); return 0; /* function : open a file, given the name of the file and the mode to open */ /* return a pointer to the file if success (exist and readable) */ FILE *open_file(char *file_name, char *mode) FILE *fp; if ((fp=fopen(file_name,mode)) == NULL) /* error checking for file exist. */ fprintf(stderr,"file not found\n"); return fp; /* return a file pointer if success (file exist) */ /* function : get the file header (the first line of a text file) */ /* return the file header in string (array of char)*/
4 void get_header(file *file_pointer, char file_header[]) if (fgets(file_header,85,file_pointer) == NULL) /* error checking */ fprintf(stderr,"file empty\n"); /* if file is empty */ if (file_header[79]!='1') fprintf(stderr,"no header found\n"); /* given file has no header */ file_header[78]='\0'; /* eliminate new line char at [80] and '1' at [79]*/ /* function : get the solution part of the text file */ /* return a pointer to an array (int) contain the correct solution */ /* it also return the number of correct solution (call by reference)*/ int *get_solution(file *file_pointer, int *no_of_question) char line[85], /* each line of type-2 data */ solution[max_question]=' '; /* contain all correct solution in string */ /* (for temporary storage only) */ int i, /* used for iteration */ *solution_data; /* ptr to solution array */ fgets(line,85,file_pointer); /* get the first line of type-2 data */ /* to obtain the number of solution */ if (line[79]!='2') /* check if it's type-2 data */ fprintf(stderr,"error on solution part\n"); sscanf(line,"%d",no_of_question); /* get the number of correct solution */ if (*no_of_question<=0 *no_of_question>max_question) /* check no_of_question validity */ fprintf(stderr, "invalid number of questions\n"); fprintf(stderr, "it should be positive and less than MAX_QUESTION\n"); if ((solution_data=(int *) calloc(*no_of_question, sizeof(int)))==null) fprintf(stderr, "error allocating memory\n"); /* allocate memory for all solution */
5 strncpy(solution, line+10, 50); /* get the solution part (50 char) */ for (i=0;i<*no_of_question/50;++i) /* if there are more solution */ fgets(line,85,file_pointer); /* read them */ if (line[79]!='2') /* but check if it's type-2 data */ fprintf(stderr,"error on solution part\n"); strncat(solution, line+10, 50); /* concatenate all solution */ /* (still in string format) */ if (solution[*no_of_question]!=' ') fprintf(stderr,"too many solution records\n"); for (i=0; i<*no_of_question; ++i) solution_data[i]=solution[i]-48; /* convert solution string into numeric*/ return solution_data; /* function : assign a new student in a student structure */ /* including raw score calculation */ /* return the student structure */ student assign_student(char student_id[], char student_solution[], int no_of_question, int *solution) int i; /* used for iteration (counter) */ student new_student; /* variable type student structure */ strcpy(new_student.studentid,student_id); /*assign student ID to the struct*/ new_student.rawscore=0; /* initialize student's raw score*/ if ((new_student.answers=(int *) calloc(no_of_question, sizeof(int)))==null) fprintf(stderr, "error allocating memory\n"); for (i=0; i<no_of_question; ++i)/* convert student solution into numeric */ new_student.answers[i]=student_solution[i]-48; if (new_student.answers[i]==solution[i]) /* calculate raw score */ new_student.rawscore++; return new_student;
6 /* function : get the student information (student ID and solution card) */ /* and construct a data structure (array of struct) */ /* return a pointer to the struct and the number of valid exam takers*/ int get_student(file *file_pointer, student examtakers[], int no_of_question, int *solution) FILE *error; int i, /* used for iteration (counter) */ student_no=0; /* student counter */ char mainline[85], /* 1st line of type-3 for each student */ line[85], /* each line of type-3 data */ ID[10], ID_comparator[10],/* each of the student ID */ answer[max_question]; /* each of the student answer */ /* all three variable above are temporary */ answer[0]='\0'; /* initialize end of string at the beginning of answer */ ID[0]='\0'; /* initialize end of string for both */ ID_comparator[0]='\0'; /* string ID for equal comparison (using strcmp) */ while (!feof(file_pointer) line[0]=='\n') if (!strcmp(id, ID_comparator)) fgets(mainline,85,file_pointer); /* take 1st line of each student */ else strcpy(mainline,line); if (mainline[79]!='3') /* check if it's type-3 data */ fprintf(stderr,"error on student record\n"); sscanf(mainline,"%s",id);/*get the student ID number (the first-10 char)*/ strcpy(id_comparator, ID); /* set the 2 ID the same in case of */ /* no_of_question < 50 (only 1 line type-3) */ strncat(answer, mainline+10, 50);/*get the student answer (11-50th char)*/ for (i=0;i<no_of_question/50;++i) /* if there are more solution */ fgets(line,85,file_pointer); /* take the next line of type-3 data*/ if (line[79]!='3') /* check if it's type-3 data */ fprintf(stderr,"error on student record\n"); sscanf(line,"%s",id_comparator);/* get the ID for comparison */ if (strcmp(id, ID_comparator)) break; strncat(answer, line+10, 50);/* get the student answer (11th-50th char)*/ if (strcmp(id, ID_comparator) line[0]=='\n') error=open_file("error.log", "a");
7 fprintf(error, "Student with ID : %s does not have enough answers\n", ID); fclose(error); /* put invalid student answer in error.log file */ else /* if student answer valid : assign as a new student in struct */ examtakers[student_no]=assign_student(id, answer, no_of_question, solution); student_no++; answer[0]='\0'; /* flush answer */ return (student_no-1); /* function : calculate all necessary statistical measures */ /* (e.g. mean, median, and standard deviation) */ /* put them in 1 array (double statistics[6]) */ void statistic(student examtakers[], double statistics[], int no_of_student, int no_of_question, int *solution) int i, j; /* used for iteration (counter) */ double temp, /* temporary storage for sorting purposes */ question[max_question]=0.0, /* contain the percent. of correct answer */ sum=0.0, /* sum of all score */ sqr_xi=0.0; /* x[i] * x[i] for standard deviation calc. */ student temp_student; /* temporary variable with student structure */ /* for sorting purposes */ for (i=0; i<no_of_student; i++) sum+=examtakers[i].rawscore; sqr_xi+=examtakers[i].rawscore*examtakers[i].rawscore; for (i=0; i<no_of_student-1; i++) /* buble sorting the score to find */ for (j=no_of_student-1; j>i; --j)/* the median of the raw scores */ if (examtakers[j-1].rawscore>examtakers[j].rawscore) temp_student=examtakers[j-1];/* swap between student [j-1] and [j]*/ examtakers[j-1]=examtakers[j]; examtakers[j]=temp_student;
8 statistics[0] =(float) sum/no_of_student; /* calc. the mean */ statistics[1] =(float) sqrt((sqr_xi-no_of_student* statistics[0]*statistics[0])/(no_of_student-1)); /*calc. the std_dev */ /* start to calculate median */ if (no_of_student % 2 == 0) /* no_of_student is an even number */ statistics[2] =(float) (examtakers[no_of_student/2-1].rawscore+ examtakers[no_of_student/2].rawscore)/2.0; else /* no_of_student is an odd number */ statistics[2] =(float) examtakers[no_of_student/2].rawscore; sum =0; /* initialize to reuse sum and sqr_xi */ sqr_xi=0; for (i=0; i<no_of_question; i++) for (j=0; j<no_of_student; j++) if (solution[i]==examtakers[j].answers[i]) question[i]++; question[i]=100*(float)question[i]/no_of_student; for (i=0; i<no_of_question; i++) sum+=question[i]; sqr_xi+=question[i]*question[i]; for (i=0; i<no_of_question-1; i++) /* buble sorting the array to find */ for (j=no_of_question-1; j>i; --j)/* the median of the percentage */ if (question[j-1]>question[j]) temp=question[j-1]; /* swap between score [j-1] and [j] */ question[j-1]=question[j]; question[j]=temp; statistics[3] =(float) sum/(float)no_of_question; /* calc. the mean */ statistics[4] =(float) sqrt((sqr_xi-no_of_question*statistics[3]* statistics[3])/(no_of_question-1)); /*calc. the std_dev */ /* start to calculate median */ if (no_of_question % 2 == 0) /* no_of_question is an even number */ statistics[5] =(float) (question[no_of_question/2-1]+ question[no_of_question/2])/2.0;
9 else /* no_of_question is an odd number */ statistics[5] =(float) question[no_of_question/2]; /* function : print out student report and summary report */ void print_out(student examtakers[], double statistics[], char header[], int no_of_student, int no_of_question, int *solution) int i,j, /* used for iteration (counter) */ correct=0; /* as a counter of correct answer */ student temp; /* temporary variable with student structure */ /* for sorting purposes */ /* sorting the student based on ID number */ for (i=0; i<no_of_student-1; i++) for (j=no_of_student-1; j>i; --j) if (strcmp(examtakers[j-1].studentid,examtakers[j].studentid)>0) temp=examtakers[j-1]; examtakers[j-1]=examtakers[j]; examtakers[j]=temp; printf("%s\n\n", header); printf("student REPORT :\n"); printf(" Student ID raw score percent correct \n"); for (i=0; i<no_of_student; ++i) printf("%10s%22d%25.2f\n",examtakers[i].studentid,examtakers[i].rawscore, 100*((float)examTakers[i].rawScore/no_of_question)); printf("\n"); printf("\nsummary REPORT:\n"); printf(" Question no. percent correct number correct \n"); for (i=0; i<no_of_question; i++) for (j=0; j<no_of_student; j++) if (solution[i]==examtakers[j].answers[i]) correct++; printf("%10s%3d%22.2f%25d\n","quest. ", i+1, 100*((float)correct/no_of_student), correct); correct=0; printf("for all %d students :\n", no_of_student);
10 printf(" the average score = %7.2f\n", statistics[0]); printf(" the standard deviation = %7.2f\n", statistics[1]); printf(" the median = %7.2f\n", statistics[2]); printf("for each of the %d questions :\n", no_of_question); printf(" the average = %7.2f\n", statistics[3]); printf(" the standard deviation = %7.2f\n", statistics[4]); printf(" the median = %7.2f\n", statistics[5]);
Flowchart, Types, and Values
Flowchart, Types, and Values Course Number CLO : 1 Week : 1-3 : FEH1H3 CLO#1 Student have the knowledge to create algorithm and iteration Know the fundamental of computer system Understand the components
More informationECE264 Spring 2013 Exam 1, February 14, 2013
ECE264 Spring 2013 Exam 1, February 14, 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.
More informationECE264 Summer 2013 Exam 1, June 20, 2013
ECE26 Summer 2013 Exam 1, June 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. I
More informationECE264 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
More informationECE 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.
More informationMemory. 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)
More informationECE264 Fall 2013 Exam 1, September 24, 2013
ECE264 Fall 2013 Exam 1, September 24, 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.
More informationECE264 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.
More informationFORM 2 (Please put your name and form # on the scantron!!!!)
CS 161 Exam 2: FORM 2 (Please put your name and form # on the scantron!!!!) True (A)/False(B) (2 pts each): 1. Recursive algorithms tend to be less efficient than iterative algorithms. 2. A recursive function
More informationLab 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:
More informationSubject: Fundamental of Computer Programming 2068
Subject: Fundamental of Computer Programming 2068 1 Write an algorithm and flowchart to determine whether a given integer is odd or even and explain it. Algorithm Step 1: Start Step 2: Read a Step 3: Find
More informationScheme G. Sample Test Paper-I. Course Name : Computer Engineering Group Course Code : CO/CD/CM/CW/IF Semester : Second Subject Tile : Programming in C
Sample Test Paper-I Marks : 25 Time:1 Hrs. Q1. Attempt any THREE 09 Marks a) State four relational operators with meaning. b) State the use of break statement. c) What is constant? Give any two examples.
More informationRicardo 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()
More informationProcedural 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
More informationMidterm Examination # 2 Wednesday, March 19, Duration of examination: 75 minutes STUDENT NAME: STUDENT ID NUMBER:
Page 1 of 7 School of Computer Science 60-141-01 Introduction to Algorithms and Programming Winter 2014 Midterm Examination # 2 Wednesday, March 19, 2014 ANSWERS Duration of examination: 75 minutes STUDENT
More informationAryan College. Fundamental of C Programming. Unit I: Q1. What will be the value of the following expression? (2017) A + 9
Fundamental of C Programming Unit I: Q1. What will be the value of the following expression? (2017) A + 9 Q2. Write down the C statement to calculate percentage where three subjects English, hindi, maths
More informationECE264 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.
More informationCS 1713 Introduction to Programming II
CS 1713 Introduction to Programming II Spring 2014 Midterm 2 -- April 24, 2014 You have 75 min. Good luck. You can use the 2-page C reference card posted in the class web page. Name: Score:./100 Background
More informationPRINCIPLES 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)
More informationArrays. An array is a collection of several elements of the same type. An array variable is declared as array name[size]
(November 10, 2009 2.1 ) Arrays An array is a collection of several elements of the same type. An array variable is declared as type array name[size] I The elements are numbered as 0, 1, 2... size-1 I
More informationMidterm Examination # 2 Wednesday, March 18, Duration of examination: 75 minutes STUDENT NAME: STUDENT ID NUMBER:
Page 1 of 8 School of Computer Science 60-141-01 Introduction to Algorithms and Programming Winter 2015 Midterm Examination # 2 Wednesday, March 18, 2015 ANSWERS Duration of examination: 75 minutes STUDENT
More informationC 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
More informationLecture 16. Daily Puzzle. Functions II they re back and they re not happy. If it is raining at midnight - will we have sunny weather in 72 hours?
Lecture 16 Functions II they re back and they re not happy Daily Puzzle If it is raining at midnight - will we have sunny weather in 72 hours? function prototypes For the sake of logical clarity, the main()
More informationC BOOTCAMP DAY 2. CS3600, Northeastern University. Alan Mislove. Slides adapted from Anandha Gopalan s CS132 course at Univ.
C BOOTCAMP DAY 2 CS3600, Northeastern University Slides adapted from Anandha Gopalan s CS132 course at Univ. of Pittsburgh Pointers 2 Pointers Pointers are an address in memory Includes variable addresses,
More informationSOFTWARE Ph.D. Qualifying Exam Spring Consider the following C program, which includes three function definitions, including the main function.
(i) (6 pts.) SOFTWARE Ph.D. Qualifying Exam Spring 2017 Consider the following C program, which includes three function definitions, including the main function. #include #include
More informationCSC 2400: Computer Systems. Arrays and Strings in C
CSC 2400: Computer Systems Arrays and Strings in C Lecture Overview Arrays! List of elements of the same type Strings! Array of characters ending in \0! Functions for manipulating strings 1 Arrays: C vs.
More informationESC101N: Fundamentals of Computing End-sem st semester
ESC101N: Fundamentals of Computing End-sem 2010-11 1st semester Instructor: Arnab Bhattacharya 8:00-11:00am, 15th November, 2010 Instructions 1. Please write your name, roll number and section below. 2.
More informationCSC 2400: Computer Systems. Arrays and Strings in C
CSC 2400: Computer Systems Arrays and Strings in C Lecture Overview Arrays! List of elements of the same type Strings! Array of characters ending in \0! Functions for manipulating strings 1 Arrays in C
More informationMidterm 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
More informationCS61, 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
More informationUNIVERSITY 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.
More informationCS 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
More informationArray 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]
More informationComputer Science Foundation Exam
Computer Science Foundation Exam May 19, 2018 Section I A DATA STRUCTURES SOLUTION NO books, notes, or calculators may be used, and you must work entirely on your own. Name: UCFID: NID: Question # Max
More informationM.CS201 Programming language
Power Engineering School M.CS201 Programming language Lecture 16 Lecturer: Prof. Dr. T.Uranchimeg Agenda Opening a File Errors with open files Writing and Reading File Data Formatted File Input Direct
More informationLab Exam 1 D [1 mark] Give an example of a sample input which would make the function
Grade: / 20 Lab Exam 1 D500 1. [1 mark] Give an example of a sample input which would make the function scanf( "%f", &f ) return 0? Answer: Anything that is not a floating point number such as 4.567 or
More informationAnswer all questions. Write your answers only in the space provided. Full marks = 50
Answer all questions. Write your answers only in the space provided. Full marks = 50 1. Answer the following: [2+3+2+1=8 marks] a) What are the minimum and maximum numbers that can be represented in 10-bit
More informationCOMP2521. Generic ADTs in C
COMP2521 Generic ADTs in C 1 Function Pointers C can pass functions by passing a pointer to them. Function pointers... are references to memory addresses of functions are pointer values and can be assigned/passed
More informationProblem 2 Add the two 2 s complement signed 8-bit values given below, and express your answer in decimal.
Problem 1 Recall the definition of root in project 1. (The declaration of struct entrynode appears below.) struct entrynode * root; Give the type of each of the following expressions. The answer may be
More informationIntroduction to C Language (M3-R )
Introduction to C Language (M3-R4-01-18) 1. Each question below gives a multiple choice of answers. Choose the most appropriate one and enter in OMR answer sheet supplied with the question paper, following
More informationArrays and Pointers. CSE 2031 Fall November 11, 2013
Arrays and Pointers CSE 2031 Fall 2013 November 11, 2013 1 Arrays l Grouping of data of the same type. l Loops commonly used for manipulation. l Programmers set array sizes explicitly. 2 Arrays: Example
More informationProcedures, 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.
More informationComputer Science & Engineering 150A Problem Solving Using Computers
Computer Science & Engineering 150A Problem Solving Using Computers Lecture 06 - Stephen Scott Adapted from Christopher M. Bourke 1 / 30 Fall 2009 Chapter 8 8.1 Declaring and 8.2 Array Subscripts 8.3 Using
More informationJTSK Programming in C II C-Lab II. Lecture 3 & 4
JTSK-320112 Programming in C II C-Lab II Lecture 3 & 4 Xu (Owen) He Spring 2018 Slides modified from Dr. Kinga Lipskoch Planned Syllabus The C Preprocessor Bit Operations Pointers and Arrays (Dynamically
More informationUnited States Naval Academy Electrical and Computer Engineering Department EC310-6 Week Midterm Spring AY2017
United States Naval Academy Electrical and Computer Engineering Department EC310-6 Week Midterm Spring AY2017 1. Do a page check: you should have 8 pages including this cover sheet. 2. You have 50 minutes
More informationC:\Temp\Templates. Download This PDF From The Web Site
11 2 2 2 3 3 3 C:\Temp\Templates Download This PDF From The Web Site 4 5 Use This Main Program Copy-Paste Code From The Next Slide? Compile Program 6 Copy/Paste Main # include "Utilities.hpp" # include
More informationa) (5 points) What is the output of the following code sequence? int *ptr = 0x1050; printf ("%x\n", ptr--); printf ("%x\n", ptr);
Problem 1: Short Answers (25 points) a) (5 points) What is the output of the following code sequence? int *ptr = 0x1050; printf ("%x\n", ptr--); printf ("%x\n", ptr); b) (5 points) What are the three basic
More informationComputer Science Foundation Exam
Computer Science Foundation Exam December 18, 015 Section I B COMPUTER SCIENCE NO books, notes, or calculators may be used, and you must work entirely on your own. SOLUTION Question # Max Pts Category
More informationDeep 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
More informationFile I/O. Arash Rafiey. November 7, 2017
November 7, 2017 Files File is a place on disk where a group of related data is stored. Files File is a place on disk where a group of related data is stored. C provides various functions to handle files
More informationUnderstanding 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
More informationCompiling 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
More informationArrays and Pointers. Arrays. Arrays: Example. Arrays: Definition and Access. Arrays Stored in Memory. Initialization. EECS 2031 Fall 2014.
Arrays Arrays and Pointers l Grouping of data of the same type. l Loops commonly used for manipulation. l Programmers set array sizes explicitly. EECS 2031 Fall 2014 November 11, 2013 1 2 Arrays: Example
More informationCOP Programming Concepts Spring 1999 CLOSED BOOK Exam #1 100 Points NAME
CLOSED BOOK Exam #1 100 Points NAME 1. The following program has (at least) 10 syntax errors. Circle each error. Write the corrected program in the blank space below. 2 points for each error you find.
More informationKurt 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
More informationCourse organization. Course introduction ( Week 1)
Course organization Course introduction ( Week 1) Code editor: Emacs Part I: Introduction to C programming language (Week 2-9) Chapter 1: Overall Introduction (Week 1-3) Chapter 2: Types, operators and
More information- It computes the Standard Deviation by calculating the difference of each channel (R,G,B and A) of a pixel.
Standard Deviation: It is common to find comparison of two bitmaps in Image Processing Development. Comparison of two bitmaps means how each pixel of image1 is different from corresponding pixel of image2
More informationTest Paper 1 Programming Language 1(a) What is a variable and value of a variable? A variable is an identifier and declared in a program which hold a value defined by its type e.g. integer, character etc.
More informationCSC209H Lecture 3. Dan Zingaro. January 21, 2015
CSC209H Lecture 3 Dan Zingaro January 21, 2015 Streams (King 22.1) Stream: source of input or destination for output We access a stream through a file pointer (FILE *) Three streams are available without
More informationCSE 303 Midterm Exam
CSE 303 Midterm Exam October 29, 2008 Name Sample Solution The exam is closed book, except that you may have a single page of hand written notes for reference. If you don t remember the details of how
More informationC programming for beginners
C programming for beginners Lesson 2 December 10, 2008 (Medical Physics Group, UNED) C basics Lesson 2 1 / 11 Main task What are the values of c that hold bounded? x n+1 = x n2 + c (x ; c C) (Medical Physics
More informationSubject: PROBLEM SOLVING THROUGH C Time: 3 Hours Max. Marks: 100
Code: DC-05 Subject: PROBLEM SOLVING THROUGH C Time: 3 Hours Max. Marks: 100 NOTE: There are 11 Questions in all. Question 1 is compulsory and carries 16 marks. Answer to Q. 1. must be written in the space
More informationHigh 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
More informationSection 1: C Programming Lab
Course Code : MCSL-017 Course Title : C and Assembly Language Programming (Lab Course) Assignment Number : MCA(1)/015/Assignment/17-18 Maximum Marks : 100 Weightage : 25% Last Dates for Submission : 15th
More informationCS 1713 Introduction to Programming II
CS 1713 Introduction to Programming II Spring 2014 Midterm 2 -- April 24, 2014 You have 75 min. Good luck. You can use the 2-page C reference card posted in the class web page. Name: Score:./100 Background
More informationECE551 Midterm Version 1
Name: ECE551 Midterm Version 1 NetID: There are 7 questions, with the point values as shown below. You have 75 minutes with a total of 75 points. Pace yourself accordingly. This exam must be individual
More informationLesson 5: Functions and Libraries. EE3490E: Programming S1 2018/2019 Dr. Đào Trung Kiên Hanoi Univ. of Science and Technology
Lesson 5: Functions and Libraries 1 Functions 2 Overview Function is a block of statements which performs a specific task, and can be called by others Each function has a name (not identical to any other),
More informationToday 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,
More informationSolution for Data Structure
Solution for Data Structure May 2016 INDEX Q1 a 2-3 b 4 c. 4-6 d 7 Q2- a 8-12 b 12-14 Q3 a 15-18 b 18-22 Q4- a 22-35 B..N.A Q5 a 36-38 b N.A Q6- a 39-42 b 43 1 www.brainheaters.in Q1) Ans: (a) Define ADT
More informationIntroduction to Data Structures. Systems Programming
Introduction to Data Structures Systems Programming Intro to Data Structures Self-referential Structures Dynamic Memory Allocation A Simple malloc Example Linear Lists Linked Lists Insertion Example Linked
More informationFile Handling. 21 July 2009 Programming and Data Structure 1
File Handling 21 July 2009 Programming and Data Structure 1 File handling in C In C we use FILE * to represent a pointer to a file. fopen is used to open a file. It returns the special value NULL to indicate
More informationMultiple Choice Questions ( 1 mark)
Multiple Choice Questions ( 1 mark) Unit-1 1. is a step by step approach to solve any problem.. a) Process b) Programming Language c) Algorithm d) Compiler 2. The process of walking through a program s
More informationLaboratory 2: Programming Basics and Variables. Lecture notes: 1. A quick review of hello_comment.c 2. Some useful information
Laboratory 2: Programming Basics and Variables Lecture notes: 1. A quick review of hello_comment.c 2. Some useful information 3. Comment: a. name your program with extension.c b. use o option to specify
More informationCMSC 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,
More informationFinal Exam. Fall Semester 2016 KAIST EE209 Programming Structures for Electrical Engineering. Name: Student ID:
Fall Semester 2016 KAIST EE209 Programming Structures for Electrical Engineering Final Exam Name: This exam is open book and notes. Read the questions carefully and focus your answers on what has been
More informationCOP 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.................................
More informationIntroduction to Computer Science Midterm 3 Fall, Points
Introduction to Computer Science Fall, 2001 100 Points Notes 1. Tear off this sheet and use it to keep your answers covered at all times. 2. Turn the exam over and write your name next to the staple. Do
More informationECE264 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.
More informationComputer Science Foundation Exam
Computer Science Foundation Exam December 16, 2016 Section I A DATA STRUCTURES NO books, notes, or calculators may be used, and you must work entirely on your own. Name: UCFID: NID: Question # Max Pts
More information3/22/2016. Pointer Basics. What is a pointer? C Language III. CMSC 313 Sections 01, 02. pointer = memory address + type
Pointer Basics What is a pointer? pointer = memory address + type C Language III CMSC 313 Sections 01, 02 A pointer can contain the memory address of any variable type A primitive (int, char, float) An
More informationPESIT Bangalore South Campus Hosur road, 1km before ElectronicCity, Bengaluru -100 Department of Basic Science and Humanities
INTERNAL ASSESSMENT TEST-3 Date : 12-05-2016 Marks: 40 Subject & Code : Programming in C and data structures (15PCD23) Sec : F,G,H,I,J,K Name of faculty :Dr J Surya Prasad/Mr.Sreenath M V/Ms.Monika/ Time
More informationFinal Exam. Fall Semester 2016 KAIST EE209 Programming Structures for Electrical Engineering. Name: Student ID:
Fall Semester 2016 KAIST EE209 Programming Structures for Electrical Engineering Final Exam Name: This exam is open book and notes. Read the questions carefully and focus your answers on what has been
More information10/20/2015. Midterm Topic Review. Pointer Basics. C Language III. CMSC 313 Sections 01, 02. Adapted from Richard Chang, CMSC 313 Spring 2013
Midterm Topic Review Pointer Basics C Language III CMSC 313 Sections 01, 02 1 What is a pointer? Why Pointers? Pointer Caution pointer = memory address + type A pointer can contain the memory address of
More informationFunctions. Systems Programming Concepts
Functions Systems Programming Concepts Functions Simple Function Example Function Prototype and Declaration Math Library Functions Function Definition Header Files Random Number Generator Call by Value
More informationSample 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
More informationContents. A Review of C language. Visual C Visual C++ 6.0
A Review of C language C++ Object Oriented Programming Pei-yih Ting NTOU CS Modified from www.cse.cuhk.edu.hk/~csc2520/tuto/csc2520_tuto01.ppt 1 2 3 4 5 6 7 8 9 10 Double click 11 12 Compile a single source
More informationC 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
More informationSOFTWARE Ph.D. Qualifying Exam Fall 2017
(i) (4 pts.) SOFTWARE Ph.D. Qualifying Exam Fall 2017 Consider the following C program. #include #define START 2 #define LIMIT 60 #define STEP 7 #define SIZE 3 int main(void) { int i = START,
More informationSignature: ECE 551 Midterm Exam
Name: ECE 551 Midterm Exam NetID: There are 7 questions, with the point values as shown below. You have 75 minutes with a total of 75 points. Pace yourself accordingly. This exam must be individual work.
More informationChapter 6. Arrays. Copyright 2007 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved.
1 Chapter 6 Arrays Copyright 2007 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. 2 Chapter 6 - Arrays 6.1 Introduction 6.2 Arrays 6.3 Declaring Arrays 6.4 Examples Using Arrays
More informationCSCI-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
More informationUNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING
UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING APS 105 Computer Fundamentals Final Examination December 14, 2012 2:00 p.m. 4:30 p.m. (150 minutes) Examiners: J. Anderson, B. Li, M. Sadoghi,
More informationlist-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
More informationWriting an ANSI C Program Getting Ready to Program A First Program Variables, Expressions, and Assignments Initialization The Use of #define and
Writing an ANSI C Program Getting Ready to Program A First Program Variables, Expressions, and Assignments Initialization The Use of #define and #include The Use of printf() and scanf() The Use of printf()
More informationCSE 303 Winter 2008 Midterm Key
CSE 303 Winter 2008 Midterm Key 1. [2 points] Give a Unix command line that will list all (and only) files that end with.h in the current working directory. Full credit: ls *.h Extra credit: ls a *.h (although
More informationQuestion 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.
More informationApproximately a Test II CPSC 206
Approximately a Test II CPSC 206 Sometime in history based on Kelly and Pohl Last name, First Name Last 5 digits of ID Write your section number(s): All parts of this exam are required unless plainly and
More informationWrite a program that creates in the main function two linked lists of characters and fills them with the following values:
Write a program that creates in the main function two linked lists of characters and fills them with the following values: The first list will have 3 nodes with the following characters: A,B, and C. The
More informationMARKS: Q1 /20 /15 /15 /15 / 5 /30 TOTAL: /100
FINAL EXAMINATION INTRODUCTION TO ALGORITHMS AND PROGRAMMING II 03-60-141-01 U N I V E R S I T Y O F W I N D S O R S C H O O L O F C O M P U T E R S C I E N C E Winter 2014 Last Name: First Name: Student
More informationCMSC 313 COMPUTER ORGANIZATION & ASSEMBLY LANGUAGE PROGRAMMING LECTURE 13, SPRING 2013
CMSC 313 COMPUTER ORGANIZATION & ASSEMBLY LANGUAGE PROGRAMMING LECTURE 13, SPRING 2013 TOPICS TODAY Reminder: MIDTERM EXAM on THURSDAY Pointer Basics Pointers & Arrays Pointers & Strings Pointers & Structs
More information