Make sure the version number is marked on your scantron sheet. This is Version 1
|
|
- Andrew Bradley
- 6 years ago
- Views:
Transcription
1 Last Name First Name McGill ID Make sure the version number is marked on your scantron sheet. This is Version 1 McGill University COMP Computers in Engineering Mid-Term Examination Tuesday, March 11, :00 8:00 P. M. Faculty standard calculators allowed. Grading: Question Points/Question Total marks marks marks Total 105 (The extra 5 marks can be viewed as bonus marks.)
2 This page left blank Computers in Engineering 2 of 16 March 11, 2014
3 Question 1 Which of the following statements (a-d) is false? a) Programs written in a high level language are translated into assembly or machine level programs before being executed. b) Compilers do not translate comments. c) A compiler is a specialized text editor that uses indentation or colours to make the code easier to read d) A program is stored in memory by a loader before being executed e) All of these statements are true. Question 2 An array is: a) A group of variables with a single name and all of the same types b) A collection of values of various types stored in adjacent memory locations c) A variable that contains multiple values of the same type d) A collection of variables, each with its own name but all of the same type Question 3 Which of the following symbols can be used in a variable name in C? a) & (ampersand) b) * (asterisk) c) _ (underscore) d) (pipeline) e) (hyphen) Question 4 The expression means: X == Y a) The value of X is the same as the value of Y b) The address of X is the same as the address of Y c) The value stored in Y should be copied to X d) The value stored in X should be copied to Y Computers in Engineering 3 of 16 March 11, 2014
4 Question 5 The C function free() is used to a) Close a file that has been opened by the program b) Reclaim dynamically allocated storage c) Reset the counter for determining how many operations a program performs d) Restart a random number generator e) None of the above Question 6 Consider the two statements: char *p; p = (char*) malloc(100); Which statement is equivalent? a) char p = * malloc(100); b) char *p = (char) malloc(100); c) char p = (char *)malloc (100); d) char *p = (char *)(malloc *)(100); e) char *p = (char*) malloc(100); Question 7 Suppose A and B are arrays, i and j are integers. What is the following assignment equivalent to? A[i++] = B[j++] a) i = i+1; j = j+1; A[i]=B[j]; b) A[i]=B[j]; i = i+1; j = j+1; c) j = j+1; A[i]=B[j]; i = i+1; d) i = i+1; A[i]=B[j]; j = j+1; Question 8 What is the value of the following expression? 4/3 == 4/4 a) 1 b) 0 c) It is not a valid C expression Computers in Engineering 4 of 16 March 11, 2014
5 Question 9 The following values were in an array after each pass of a sorting algorithm. Which sorting algorithm was used? a) Bubblesort b) Optimized bubblesort c) Selection sort d) Insertion sort e) Mergesort Question 10 What is the decimal representation of the binary number ? a) 106 b) 202 c) 226 d) 234 e) 238 Question 11 Suppose the variable x has the value Which of the following expressions will round it off to 2.0 a) (int)x b) floor (x) c) (int)(x + 0.5) d) floor (x + 0.5) e) (float)x * 2 Computers in Engineering 5 of 16 March 11, 2014
6 Question 12 Zeller s formula used in assignment 2 converts months from the usual representation of 1 for January, 2 for February, etc. to a representation M where 1 represents March, 2 represents April, etc until 10 represents December while January and February are months 11 and 12. An eager COMP 208 student converts the standard representation using the following formula: M = (month + 10) % 12; a) This formula is correct b) This formula works for every month except January c) This formula works for every month except February d) This formula only works for January and February but none of the other months e) This formula works for every month except December Question 13 What does the following function do? int foo (int x[],int size) { int i; for (i=size-1; i>0; i--) if (x[i]<x[i-1]) return 0; return 1; a) It always returns 0 b) It sorts the list x c) It determines the size of list x d) It returns true if the list x is sorted and false otherwise e) It is syntactically incorrect Question 14 How many passes will an optimized bubble sort algorithm make when sorting the following data? {40, 53, 75, 4, 63, 65, 49, 78, 60, 64 a) 1 b) 4 c) 7 d) 9 e) 10 Computers in Engineering 6 of 16 March 11, 2014
7 Question 15 How many times will the following program output Hello? #include<stdio.h> void main() { int i, j; for (i=1;i<=5;i++) for (j=1;j<=i;j++) printf("hello\n"); a) 1 b) 5 c) 10 d) 15 e) 25 Question 16 What is the output of the following program? #include <stdio.h> void main() { int min = 0, max = 0, i = 0; int a[6] = {2,1,3,1,5,4; for(i = 0; i<6; i++) if (a[i] > max) max = a[i]; else if (a[i] < min) min = a[i]; printf("%d,%d\n",min, max); return; a) 5,0 b) 0,5 c) 5,1 d) 1,5 e) 0,0 Computers in Engineering 7 of 16 March 11, 2014
8 Question 17 The following function is intended to implement a bubble sort algorithm that sorts the array x of length size into ascending order by making passes through the array from right to left. The limits for the control variable of the inner loop are missing. void bubble (int x[],int size) { int i, j, k; for (i=0; i<size-1; i++){ for ( *** MISSING CODE *** ){ if (x[j]<x[j-1]) swap(&x[j],&x[j-1]); bubble_cost++; for (k=0;k<size;k++) printf("%d ",x[k]); printf("\n"); What should replace the missing code so that the algorithm is correct? a) j=size; j>i; j-- b) j=size-1; j>0; j c) j=0; j<size-1; j++ d) j=i; j<size-1;j++ e) j=size-1; j>i; j-- Question 18 What is the output of the following program? #include <stdio.h> int f(int *x){ *x = *x * 2; return *x; void main(){ int y = 2; f(&y); printf("%d\n",f(&y)); return; a) 1 b) 2 c) 4 d) 6 e) 8 Computers in Engineering 8 of 16 March 11, 2014
9 Question 19 What is the output of the following program? #include<stdio.h> int main() { char a = '*', b = '+'; int i = 0, j = 1; while(i<=10){ if(i%2 == 0) printf("%c", a); else printf("%c", b); a) +++* b) ***+ c) ++* d) **+ e) *+* j = j + 2; i = i + j; printf("\n"); return 0; Question 20 What is the output of the following program? #include <stdio.h> void newswap (int* a, int b) { int temp = *a; *a = b; b = temp; void main() { int a = 10, b = 30; newswap(&a,b); printf ("%d %d\n", a, b); a) b) c) d) e) a is an address and cannot be output as an integer Computers in Engineering 9 of 16 March 11, 2014
10 Question 21 What is the output of the following program? #include <stdio.h> void main() { int i, a[8]; for (i=0; i<8; i++){ if (i%2) a[i] = i*i + 1; else a[i] = i*i -1; for (i=0; i<8; i++) if (a[i]%5 == 0) printf("%d ", a[i]); printf("\n"); a) b) c) d) e) Question 22 What is the output of the following C program? void main() { int a[5] = {2, 3, 9, 7, 0; a[a[4]] = a[a[1]]; a[1] = 6; a[a[2]-a[1]] = a[2]; printf ("%d %d\n", a[a[0]-a[1]], a[3]); a) 6 9 b) 7 6 c) 9 7 d) 2 7 e) 2 6 Computers in Engineering 10 of 16 March 11, 2014
11 Question 23 What is the output of the following program? #include <stdio.h> void main() { int i, n = 26, d[5]; for (i=4; i>=0; i--) { d[i] = n - 2 * (n/2); n=n/2; for (i=0; i<5; i++) printf ("%d", d[i]); printf("\n"); a) b) c) 1011 d) e) Question 24 What does the following recursive C function compute when given two non-negative integer arguments? int f (int n, int m){ if (m==0) return 0; else return n + f(n, m-1); a) n b) m c) n+m d) n*m e) n m Computers in Engineering 11 of 16 March 11, 2014
12 Question 25 What is the output of the following recursive C program? #include <stdio.h> int abc (int *, int, int); void main() { int a[14] ={2, 68, 70, 9, 24, 24, 83, 76, 17, 65, 6, 4, 28 ; printf ("%d\n",abc(a,0,13)); int abc (int x[], int l, int r) { int mid, a, b; if (l == r) return x[r]; mid = (l+r)/2; a = abc(x, l, mid); b = abc(x,mid+1, r); return a>b?a:b; a) 2 b) 83 c) 6 d) 28 e) The program is infinite and does not terminate Computers in Engineering 12 of 16 March 11, 2014
13 Answer the programming questions on the pages provided below. Question 26 (Programming) Given any positive integer, n, we can generate a sequence of integers as follows: If n is odd and not equal to 1, the next value in the sequence is 3n+1. If n is even, the next value in the sequence is n/2. If n is 1, the sequence terminates. There is a longstanding unproven conjecture that, for any starting value of n, the sequence eventually terminates. Write a program that reads a number and outputs the sequence of numbers generated as described. Also output the length of the sequence. Since the conjecture is unproven, just to be on the safe side your program should terminate if the length of the sequence is over 1000 (whether or not it reaches the value 1). For example, If the input is 3, the output should be the following values (not necessarily on one line): 3, 10, 5, 16, 8, 4, 2, 1 The length of the sequence is 8 Question 27 (Programming) Picture a school hallway with 500 lockers. Initially all of the lockers are closed. Then 500 students enter the hallway, one after the other. The first student opens all the lockers. Student number 2 closes every other locker starting with the second. Student 3 changes the state of every third locker beginning with the third. That is, if the locker is open the student shuts it and if it is closed the student opens it. In general student number i changes the state of every i th locker beginning with the i th. Write a program which outputs the numbers of the lockers that are open at the end of this process. You should use an array of 501 integers (int lockers[501]) to represent the lockers. Do not use the variable lockers[0] but start the process with lockers[1]. (Observation: This is not part of the question but it turns out that the lockers that are open are those whose index is a perfect square 1, 4, 9, 16, 25, 36,.) Answer the programming questions on the following pages. Computers in Engineering 13 of 16 March 11, 2014
14 Answer to question 26 Computers in Engineering 14 of 16 March 11, 2014
15 Answer to question 27 Computers in Engineering 15 of 16 March 11, 2014
16 Additional page for your answers (if needed). Computers in Engineering 16 of 16 March 11, 2014
Computer 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 informationCS Introduction to Programming Midterm Exam #2 - Prof. Reed Fall 2015
CS 141 - Introduction to Programming Midterm Exam #2 - Prof. Reed Fall 2015 You may take this test with you after the test, but you must turn in your answer sheet. This test has the following sections:
More informationName Roll No. Section
Indian Institute of Technology, Kharagpur Computer Science and Engineering Department Class Test I, Autumn 2012-13 Programming & Data Structure (CS 11002) Full marks: 30 Feb 7, 2013 Time: 60 mins. Name
More informationUNIVERSITY OF WINDSOR Fall 2007 QUIZ # 2 Solution. Examiner : Ritu Chaturvedi Dated :November 27th, Student Name: Student Number:
UNIVERSITY OF WINDSOR 60-106-01 Fall 2007 QUIZ # 2 Solution Examiner : Ritu Chaturvedi Dated :November 27th, 2007. Student Name: Student Number: INSTRUCTIONS (Please Read Carefully) No calculators allowed.
More informationSearching Elements in an Array: Linear and Binary Search. Spring Semester 2007 Programming and Data Structure 1
Searching Elements in an Array: Linear and Binary Search Spring Semester 2007 Programming and Data Structure 1 Searching Check if a given element (called key) occurs in the array. Example: array of student
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 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 informationM3-R4: PROGRAMMING AND PROBLEM SOLVING THROUGH C LANGUAGE
M3-R4: PROGRAMMING AND PROBLEM SOLVING THROUGH C LANGUAGE NOTE: 1. There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions. 2. PART ONE is to be
More informationThis is CS50. Harvard University Fall Quiz 0 Answer Key
Quiz 0 Answer Key Answers other than the below may be possible. Binary Bulbs. 0. Bit- Sized Questions. 1. Because 0 is non- negative, we need to set aside one pattern of bits (000) for it, which leaves
More informationC Language Part 2 Digital Computer Concept and Practice Copyright 2012 by Jaejin Lee
C Language Part 2 (Minor modifications by the instructor) 1 Scope Rules A variable declared inside a function is a local variable Each local variable in a function comes into existence when the function
More informationCS11001/CS11002 Programming and Data Structures (PDS) (Theory: 3-0-0)
CS11001/CS11002 Programming and Data Structures (PDS) (Theory: 3-0-0) Class Teacher: Pralay Mitra Department of Computer Science and Engineering Indian Institute of Technology Kharagpur An Example: Random
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 informationCOMP-202B - Introduction to Computing I (Winter 2011) - All Sections Example Questions for In-Class Quiz
COMP-202B - Introduction to Computing I (Winter 2011) - All Sections Example Questions for In-Class Quiz The in-class quiz is intended to give you a taste of the midterm, give you some early feedback about
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 informationINDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR Stamp / Signature of the Invigilator
INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR Stamp / Signature of the Invigilator EXAMINATION ( End Semester ) SEMESTER ( Spring ) Roll Number Section Name Subject Number C S 1 0 0 0 1 Subject Name Programming
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 informationCOS 126 General Computer Science Fall Midterm 1
COS 126 General Computer Science Fall 2001 Midterm 1 This test has 11 questions worth a total of 50 points. You have 120 minutes. The exam is closed book, except that you are allowed to use a one page
More informationSchool of Computer Science Introduction to Algorithms and Programming Winter Midterm Examination # 1 Wednesday, February 11, 2015
Page 1 of 8 School of Computer Science 60-141-01 Introduction to Algorithms and Programming Winter 2015 Midterm Examination # 1 Wednesday, February 11, 2015 Marking Exemplar Duration of examination: 75
More informationQ1: Functions / 33 Q2: Arrays / 47 Q3: Multiple choice / 20 TOTAL SCORE / 100 Q4: EXTRA CREDIT / 10
EECE.2160: ECE Application Programming Spring 2018 Exam 2 March 30, 2018 Name: Lecture time (circle 1): 8-8:50 (Sec. 201) 12-12:50 (Sec. 202) For this exam, you may use only one 8.5 x 11 double-sided page
More informationCSCI 2132 Software Development. Lecture 19: Generating Permutations
CSCI 2132 Software Development Lecture 19: Generating Permutations Instructor: Vlado Keselj Faculty of Computer Science Dalhousie University 19-Oct-2018 (19) CSCI 2132 1 Previous Lecture Mergesort implementation
More informationDEPARTMENT OF ELECTRICAL AND ELECTRONIC ENGINEERING PROGRAMMING TECHNIQUES I EE271
UNIVERSITY OF SWAZILAND FACULTY OF SCIENCE AND ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONIC ENGINEERING MAIN EXAMINATION: 2015 TITLE OF PAPER: COURSE NUMBER: TIME ALLOWED: PROGRAMMING TECHNIQUES
More informationUNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING
UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING APS 105 Computer Fundamentals Midterm Examination October 20, 2011 6:15 p.m. 8:00 p.m. (105 minutes) Examiners: J. Anderson, T. Fairgrieve,
More informationNote: unless otherwise stated, the questions are with reference to the C Programming Language. You may use extra sheets if need be.
CS 156 : COMPUTER SYSTEM CONCEPTS TEST 1 (C PROGRAMMING PART) FEBRUARY 6, 2001 Student s Name: MAXIMUM MARK: 100 Time allowed: 45 minutes Note: unless otherwise stated, the questions are with reference
More informationOne Dimension Arrays 1
One Dimension Arrays 1 Array n Many applications require multiple data items that have common characteristics In mathematics, we often express such groups of data items in indexed form: n x 1, x 2, x 3,,
More informationIndian Institute of Technology, Kharagpur
Indian Institute of Technology, Kharagpur Department of Computer Science and Engineering Students: 700 Full marks: 60 Mid-Semester Examination, Autumn 2013-14 Programming and Data Structures (CS 11001)
More informationAMCAT Procedure functions and scope Sample Questions
AMCAT Procedure functions and scope Sample Questions Question 1 A function cannot be defined inside another function A. True B. False Explanation: A function cannot be defined inside the another function,
More informationArrays and Pointers (part 2) Be extra careful with pointers!
Arrays and Pointers (part 2) EECS 2031 22 October 2017 1 Be extra careful with pointers! Common errors: l Overruns and underruns Occurs when you reference a memory beyond what you allocated. l Uninitialized
More informationArrays and Pointers (part 2) Be extra careful with pointers!
Arrays and Pointers (part 2) CSE 2031 Fall 2011 23 October 2011 1 Be extra careful with pointers! Common errors: Overruns and underruns Occurs when you reference a memory beyond what you allocated. Uninitialized
More informationDecision Making and Loops
Decision Making and Loops Goals of this section Continue looking at decision structures - switch control structures -if-else-if control structures Introduce looping -while loop -do-while loop -simple for
More informationArrays in C. Prof. Indranil Sen Gupta Dept. of Computer Science & Engg. Indian Institute of Technology Kharagpur. Basic Concept
Arrays in C Prof. Indranil Sen Gupta Dept. of Computer Science & Engg. Indian Institute of Technology Kharagpur 1 Basic Concept Many applications require multiple data items that have common characteristics.
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 informationArrays and Applications
Arrays and Applications 60-141: Introduction to Algorithms and Programming II School of Computer Science Term: Summer 2014 Instructor: Dr. Asish Mukhopadhyay What s an array Let a 0, a 1,, a n-1 be a sequence
More informationIntroduction to C Final Review Chapters 1-6 & 13
Introduction to C Final Review Chapters 1-6 & 13 Variables (Lecture Notes 2) Identifiers You must always define an identifier for a variable Declare and define variables before they are called in an expression
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 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 informationQuiz1 Fall 2007 October 2 nd, UNIVERSITY OF WINDSOR Fall 2007 QUIZ # 1 Solution. Examiner:Ritu Chaturvedi Dated :October 2nd, 2007.
UNIVERSITY OF WINDSOR 60-106-01 Fall 2007 QUIZ # 1 Solution Examiner:Ritu Chaturvedi Dated :October 2nd, 2007. Student Name: Student Number: INSTRUCTIONS (Please Read Carefully) No calculators allowed.
More informationDepartment of Computer Science & Engineering Indian Institute of Technology Kharagpur. Practice Sheet #04
Department of Computer Science & Engineering Indian Institute of Technology Kharagpur Topic: Arrays and Strings Practice Sheet #04 Date: 24-01-2017 Instructions: For the questions consisting code segments,
More informationProgramming and Data Structures Mid-Semester - Solutions to Sample Questions Dept. of Computer Science and Engg. IIT Kharagpur Spring
Programming and Data Structures Mid-Semester - s to Sample Questions Dept. of Computer Science and Engg. IIT Kharagpur Spring 2015-16 February 15, 2016 1. Tick the correct options. (a) Consider the following
More informationUniversity of California San Diego Department of Electrical and Computer Engineering. ECE 15 Final Exam
University of California San Diego Department of Electrical and Computer Engineering ECE 15 Final Exam Tuesday, March 21, 2017 3:00 p.m. 6:00 p.m. Room 109, Pepper Canyon Hall Name Class Account: ee15w
More informationMcGill University Faculty of Science School of Computer Science. MIDTERM EXAMINATION - Sample solutions. COMP-250: Introduction to Computer Science
STUDENT NAME: STUDENT ID: McGill University Faculty of Science School of Computer Science MIDTERM EXAMINATION - Sample solutions COMP-250: Introduction to Computer Science March 12, 2014 Examiner: Prof.
More informationIndian Institute of Technology Kharagpur Programming and Data Structures (CS10001) Autumn : Mid-Semester Examination
Indian Institute of Technology Kharagpur Programming and Data Structures (CS10001) Autumn 2017-18: Mid-Semester Examination Time: 2 Hours Full Marks: 60 INSTRUCTIONS 1. Answer ALL questions 2. Please write
More informationCS 137 Part 8. Merge Sort, Quick Sort, Binary Search. November 20th, 2017
CS 137 Part 8 Merge Sort, Quick Sort, Binary Search November 20th, 2017 This Week We re going to see two more complicated sorting algorithms that will be our first introduction to O(n log n) sorting algorithms.
More informationCOP 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.................................
More informationDept. of CSE, IIT KGP
Control Flow: Looping CS10001: Programming & Data Structures Pallab Dasgupta Professor, Dept. of Computer Sc. & Engg., Indian Institute of Technology Kharagpur Types of Repeated Execution Loop: Group of
More informationSearching an Array: Linear and Binary Search. 21 July 2009 Programming and Data Structure 1
Searching an Array: Linear and Binary Search 21 July 2009 Programming and Data Structure 1 Searching Check if a given element (key) occurs in the array. Two methods to be discussed: If the array elements
More informationSorting and Searching. Sudeshna Sarkar 7 th Feb 2017
Sorting and Searching Sudeshna Sarkar 7 th Feb 2017 Searching an Array: Linear and Binary Search Spring 2012 Programming and Data Structure 2 Searching Check if a given element (key) occurs in the array.
More informationBubble sort starts with very first two elements, comparing them to check which one is greater.
Bubble Sorting: Bubble sort is a simple sorting algorithm. This sorting algorithm is comparison-based algorithm in which each pair of adjacent elements is compared and the elements are swapped if they
More informationSample Problems for Quiz # 2
EE 1301 UMN Introduction to Computing Systems Fall 2013 Sample Problems for Quiz # 2 (with solutions) Here are sample problems to help you prepare for Quiz 2 on Oct. 31. 1. Bit-Level Arithmetic (a) Consider
More informationLecture 6 Sorting and Searching
Lecture 6 Sorting and Searching Sorting takes an unordered collection and makes it an ordered one. 1 2 3 4 5 6 77 42 35 12 101 5 1 2 3 4 5 6 5 12 35 42 77 101 There are many algorithms for sorting a list
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 Exam Answers Instructor: Randy Shepherd CSCI-UA.0201 Spring 2017
Section 1: Multiple choice (select any that apply) - 20 points 01. Representing 10 using the 4 byte unsigned integer encoding and using 4 byte two s complements encoding yields the same bit pattern. (a)
More informationUNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING
UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING APS 105 Computer Fundamentals Midterm Examination October 20, 2011 6:15 p.m. 8:00 p.m. (105 minutes) Examiners: J. Anderson, T. Fairgrieve,
More informationUNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING
UNIVERSITY OF TORONTO FACULTY OF APPLIED SCIENCE AND ENGINEERING APS 105 Computer Fundamentals Midterm Examination October 28, 2008 12:20 p.m. 1:50 p.m. Examiners: Jason Anderson, Tom Fairgrieve, Baochun
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 informationDepartment of Computer Science & Engineering Indian Institute of Technology Kharagpur. Practice Sheet #05
Department of Computer Science & Engineering Indian Institute of Technology Kharagpur Topic: Functions in C Practice Sheet #05 Date: 30-01-2017 Instructions: For the questions consisting code segments,
More informationComputer Programming 5th Week loops (do-while, for), Arrays, array operations, C libraries
Computer Programming 5th Week loops (do-while, for), Arrays, array operations, C libraries Hazırlayan Asst. Prof. Dr. Tansu Filik Computer Programming Previously on Bil 200 Low-Level I/O getchar, putchar,
More informationonly in the space provided. Do the rough work in the space provided for it. The question paper has total 12 pages.
Instructions: Answer all five questions. Total marks = 10 x 2 + 4 x 10 = 60. Time = 2hrs. Write your answer only in the space provided. Do the rough work in the space provided for it. The question paper
More informationTHE UNIVERSITY OF WESTERN ONTARIO. COMPUTER SCIENCE 211a FINAL EXAMINATION 17 DECEMBER HOURS
Computer Science 211a Final Examination 17 December 2002 Page 1 of 17 THE UNIVERSITY OF WESTERN ONTARIO LONDON CANADA COMPUTER SCIENCE 211a FINAL EXAMINATION 17 DECEMBER 2002 3 HOURS NAME: STUDENT NUMBER:
More informationA3-R3: PROGRAMMING AND PROBLEM SOLVING THROUGH 'C' LANGUAGE
A3-R3: PROGRAMMING AND PROBLEM SOLVING THROUGH 'C' LANGUAGE NOTE: 1. There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions. 2. PART ONE is to be
More informationGovernment Polytechnic Muzaffarpur.
Government Polytechnic Muzaffarpur. Name of the Lab: COMPUTER PROGRAMMING LAB (MECH. ENGG. GROUP) Subject Code: 1625408 Experiment: 1 Aim: Programming exercise on executing a C program. If you are looking
More informationMTH 307/417/515 Final Exam Solutions
MTH 307/417/515 Final Exam Solutions 1. Write the output for the following programs. Explain the reasoning behind your answer. (a) #include int main() int n; for(n = 7; n!= 0; n--) printf("n =
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 informationFORM 2 (Please put your name and form # on the scantron!!!!) CS 161 Exam II:
FORM 2 (Please put your name and form # on the scantron!!!!) CS 161 Exam II: True (A)/False(B) (2 pts each): 1. The declaration below declares three pointer variables of type pointer to double that is
More informationCS 0449 Sample Midterm
Name: CS 0449 Sample Midterm Multiple Choice 1.) Given char *a = Hello ; char *b = World;, which of the following would result in an error? A) strlen(a) B) strcpy(a, b) C) strcmp(a, b) D) strstr(a, b)
More informationDepartment of Computer Science & Engineering Indian Institute of Technology Kharagpur. Practice Sheet #06
Department of Computer Science & Engineering Indian Institute of Technology Kharagpur Practice Sheet #06 Topic: Recursion in C 1. What string does the following program print? #include #include
More informationGoogle placement paper
Visit prepnode.com for more placement papers and interview tips. Google placement paper No. of questions : 25 Maximum Time allowed : 60 minutes 1. Teacher asked the students to find the cube root of a
More informationDynamic Memory Allocation and Command-line Arguments
Dynamic Memory Allocation and Command-line Arguments CSC209: Software Tools and Systems Programming Furkan Alaca & Paul Vrbik University of Toronto Mississauga https://mcs.utm.utoronto.ca/~209/ Week 3
More informationSCJ2013 Data Structure & Algorithms. Bubble Sort. Nor Bahiah Hj Ahmad & Dayang Norhayati A. Jawawi
SCJ2013 Data Structure & Algorithms Bubble Sort Nor Bahiah Hj Ahmad & Dayang Norhayati A. Jawawi 1 Bubble Sort Sorting activities for Bubble: Go through multiple passes over the array. In every pass: Compare
More informationDECISION CONTROL AND LOOPING STATEMENTS
DECISION CONTROL AND LOOPING STATEMENTS DECISION CONTROL STATEMENTS Decision control statements are used to alter the flow of a sequence of instructions. These statements help to jump from one part of
More informationProgramming Language B
Programming Language B Takako Nemoto (JAIST) 7 January Takako Nemoto (JAIST) 7 January 1 / 13 Usage of pointers #include int sato = 178; int sanaka = 175; int masaki = 179; int *isako, *hiroko;
More informationWarmup January 9th, What is the value of the following C expression? 8*9 % 10/ 2
Warmup January 9th, 2018 What is the value of the following C expression? 8*9 % 10/ 2 Warmup January 11th, 2018 What is the value of the following C expression? ( -42 3!= 3) && ( -3 < -2 < -1) Warmup January
More informationSorting. Task Description. Selection Sort. Should we worry about speed?
Sorting Should we worry about speed? Task Description We have an array of n values in any order We need to have the array sorted in ascending or descending order of values 2 Selection Sort Select the smallest
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 informationFunctions. Arash Rafiey. September 26, 2017
September 26, 2017 are the basic building blocks of a C program. are the basic building blocks of a C program. A function can be defined as a set of instructions to perform a specific task. are the basic
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 21, 2015 9:30 a.m. 12:00 p.m. (150 minutes) Examiners: J. Anderson, B. Li, J. Rose
More informationFaculty of Science FINAL EXAMINATION COMP-250 A Introduction to Computer Science School of Computer Science, McGill University
NAME: STUDENT NUMBER:. Faculty of Science FINAL EXAMINATION COMP-250 A Introduction to Computer Science School of Computer Science, McGill University Examimer: Prof. Mathieu Blanchette December 8 th 2005,
More informationMidterm Exam 2 Solutions C Programming Dr. Beeson, Spring 2009
Midterm Exam 2 Solutions C Programming Dr. Beeson, Spring 2009 April 16, 2009 Instructions: Please write your answers on the printed exam. Do not turn in any extra pages. No interactive electronic devices
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 informationOF VICTORIA EXAMINATIONS- DECEMBER 2010 CSC
Name: ID Number: UNIVERSITY OF VICTORIA EXAMINATIONS- DECEMBER 2010 CSC 225 - Algorithms and Data Structures: I Section A01 (CRN 1089) Instructor: Wendy Myrvold Duration: 3 hours TO BE ANSWERED ON THE
More information8. Functions (II) Control Structures: Arguments passed by value and by reference int x=5, y=3, z; z = addition ( x, y );
- 50 - Control Structures: 8. Functions (II) Arguments passed by value and by reference. Until now, in all the functions we have seen, the arguments passed to the functions have been passed by value. This
More informationOutput of sample program: Size of a short is 2 Size of a int is 4 Size of a double is 8
Pointers Variables vs. Pointers: A variable in a program is something with a name and a value that can vary. The way the compiler and linker handles this is that it assigns a specific block of memory within
More informationCOS 126 General Computer Science Spring Written Exam 1
COS 126 General Computer Science Spring 2017 Written Exam 1 This exam has 9 questions (including question 0) worth a total of 70 points. You have 50 minutes. Write all answers inside the designated spaces.
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 informationQ1: Multiple choice / 20 Q2: C input/output; operators / 40 Q3: Conditional statements / 40 TOTAL SCORE / 100 EXTRA CREDIT / 10
EECE.2160: ECE Application Programming Spring 2016 Exam 1 February 19, 2016 Name: Section (circle 1): 201 (8-8:50, P. Li) 202 (12-12:50, M. Geiger) For this exam, you may use only one 8.5 x 11 double-sided
More informationCOMP 2001/2401 Test #1 [out of 80 marks]
COMP 2001/2401 Test #1 [out of 80 marks] Duration: 90 minutes Authorized Memoranda: NONE Note: for all questions, you must show your work! Name: Student#: 1. What exact shell command would you use to:
More informationQ1: Multiple choice / 20 Q2: Arrays / 40 Q3: Functions / 40 TOTAL SCORE / 100 EXTRA CREDIT / 10
EECE.2160: ECE Application Programming Spring 2017 Exam 2 March 29, 2017 Name: Section (circle 1): 201 (Dr. Li, MWF 8-8:50) 202 (Dr. Geiger, MWF 12-12:50) For this exam, you may use only one 8.5 x 11 double-sided
More informationESC 101N: Fundmentals of Computing ( IInd Semester) Mid Sem II Examination PM, Monday 7th March, 2011
ESC 101N: Fundmentals of Computing (2010-11-IInd Semester) Mid Sem II Examination 3.30-4.30PM, Monday 7th March, 2011 Instructions 1. Write your name, roll number and section below and also in the space
More informationCS16 Exam #1 7/17/ Minutes 100 Points total
CS16 Exam #1 7/17/2012 75 Minutes 100 Points total Name: 1. (10 pts) Write the definition of a C function that takes two integers `a` and `b` as input parameters. The function returns an integer holding
More informationprovided. Use any other space for rough work. The question paper has total 8 pages. Rough Work
Instructions: Answer all six questions. Total marks = 60. Time = 2hrs. Write your answer only in the space provided. Use any other space for rough work. The question paper has total 8 pages. Rough Work
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 informationUIC. C Programming Primer. Bharathidasan University
C Programming Primer UIC C Programming Primer Bharathidasan University Contents Getting Started 02 Basic Concepts. 02 Variables, Data types and Constants...03 Control Statements and Loops 05 Expressions
More information'C' Programming Language
F.Y. Diploma : Sem. II [DE/EJ/ET/EN/EX] 'C' Programming Language Time: 3 Hrs.] Prelim Question Paper Solution [Marks : 70 Q.1 Attempt any FIVE of the following : [10] Q.1(a) Define pointer. Write syntax
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 informationProgramming and Data Structure Tutorial sheet: 1 Topics: Data Handling, Operators and Expressions, Input and Output Operations.
Programming and Data Structure Tutorial sheet: 1 Topics: Data Handling, Operators and Expressions, Input and Output Operations. Q1. (a) Which one of the following is a valid name of a C variable: 2ab_c,
More informationQuestions Bank. 14) State any four advantages of using flow-chart
Questions Bank Sub:PIC(22228) Course Code:-EJ-2I ----------------------------------------------------------------------------------------------- Chapter:-1 (Overview of C Programming)(10 Marks) 1) State
More informationIntroduction 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
More informationPROGRAMMING IN C LAB MANUAL FOR DIPLOMA IN ECE/EEE
PROGRAMMING IN C LAB MANUAL FOR DIPLOMA IN ECE/EEE 1. Write a C program to perform addition, subtraction, multiplication and division of two numbers. # include # include int a, b,sum,
More informationTutorial 5. PDS Lab Section 16 Autumn Functions The C language is termed as function-oriented programming
PDS Lab Section 16 Autumn-2018 Tutorial 5 Functions The C language is termed as function-oriented programming Every C program consists of one or more functions. The concept is based on the divide-and conquer
More informationCOMP102: Test 2: Part B Model Solutions
Name:.................................. ID Number:............................ COMP102: Test 2: Part B Model Solutions 13 Sept, 2006 Instructions Time allowed: 30 minutes. There are 30 marks in total.
More informationUNIVERSITY OF SWAZILAND
UNIVERSITY OF SWAZILAND FACULTY OF SCIENCE DEPARTMENT OF ELECTRICAL &ELECTRONIC ENGINEERING PROGRAMMING TECHNIQUES I COURSE CODE - EE271 MAIN EXAMINATION DECEMBER 2011 DURATION OF THE EXAMINATION - 3 HOURS
More information