Review: Recursions. CSCE155N Matlab Fall 2016
|
|
|
- Pearl Arnold
- 5 years ago
- Views:
Transcription
1 Review: Recursions CSCE155N Matlab Fall 2016
2 1. For the recursive function shown, if n = 4, how many times is the mystery function called, including the first invocation? A. 7 B. 9 C. 4 function mystery(n) if (n <= 1) print( done ) else mystery(n-1) mystery(n-2) endif D. 8
3 2. Which line(s) is/are the stopping condition(s)? A. 1 B. 2 C. 3 D. 1 & 3 function mystery( n) 1 if (n <= 1) 2 print( done ) 3 else if (n == 2) 4 print( done 2 ) 5 else 6 mystery(n-1) 7 mystery(n-2) 8 print( not done ) 9 endif
4 3. Which line(s) is/are the end case(s)? A. 1 B. 2 C. 3 D. 2 & 4 function mystery( n) 1 if (n <= 1) 2 print( done ) 3 else if (n == 2) 4 print( done 2 ) 5 else 6 mystery(n-1) 7 mystery(n-2) 8 print( not done ) 9 endif E. 6 & 8
5 4. Which line(s) is/are the recursive step? A. 6 B. 7 C. 6 & 7 D. 6, 7, & 8 function mystery( n) 1 if (n <= 1) 2 print( done ) 3 else if (n == 2) 4 print( done 2 ) 5 else 6 mystery(n-1) 7 mystery(n-2) 8 print( not done ) 9 endif
6 5. Which line(s) is/are the integration step? A. 6 B. 7 C. 6 & 7 D. 6, 7, & 8 function mystery( n) 1 if (n <= 1) 2 print( done ) 3 else if (n == 2) 4 print( done 2 ) 5 else 6 mystery(n-1) 7 mystery(n-2) 8 print( not done ) 9 endif
7 6. For the recursive function shown, if n = 4, how many times is the mystery function called, including the first invocation? A. 4 B. 7 C. 9 D. Infinitely uncl the program crashes function mystery(n) 1 if (n == 1) 2 print( done ) 3 else 4 mystery(n-1) 5 mystery(n-2) 6 end end
8 7. For the recursive function shown, if n = 4, how many times is the mystery function called, including the first invocation? A. 4 B. 7 C. 9 D. Infinitely uncl the program crashes function mystery(n) 1 if (n == 1) 2 print( done ) 3 else if (n > 0) 4 mystery(n-1) 5 mystery(n-2) 6 end end
9 8. If s is lincoln, what is the output of the mystery function? A. linccoln B. lnilnocc C. lliinnccoollnn function mystery(s) if (s is an empty string) print( ) else 1 print(first char of s) 2 print(last char of s) 3 mystery(s without 1 st and last chars) 4 endif end D. lincolnnlocnil
10 9. If s is lincoln, what is the output of the mystery function? A. linccoln B. lnilnocc C. lliinnccoollnn function mystery(s) if (s is an empty string) print( ) else 1 print(first char of s) 2 mystery(s without 1 st and last chars) 3 print(last char of s) 4 endif end D. lincolnnlocnil
11 10. What does mystery(3,0) return? A. 0 B. 1 C. 3 D. 5 E. Infinitely uncl the program crashes function output = mystery(num1, num2) 1 if (num2 is 0) 2 output = 1 3 Elseif (num2 is 1) 4 output = num1 5 Else 6 output = num1 * mystery(num1, num2 1) 7 Endif
12 11. What does mystery(5,1) return? A. 0 B. 1 C. 3 D. 5 E. Infinitely uncl the program crashes function output = mystery(num1, num2) 1 if (num2 is 0) 2 output = 1 3 Elseif (num2 is 1) 4 output = num1 5 Else 6 output = num1 * mystery(num1, num2 1) 7 Endif
13 12. What does mystery(2,4) return? A. 1 B. 2 C. 8 D. 16 E. Infinitely uncl the program crashes function output = mystery(num1, num2) 1 if (num2 is 0) 2 output = 1 3 Elseif (num2 is 1) 4 output = num1 5 Else 6 output = num1 * mystery(num1, num2 1) 7 Endif
14 13. If we invoke mystery(2,5), how many times is the mystery function invoked/called (including the initial invocation)? A. 1 B. 2 C. 5 D. 32 E. Infinitely uncl the program crashes function output = mystery(num1, num2) 1 if (num2 is 0) 2 output = 1 3 Elseif (num2 is 1) 4 output = num1 5 Else 6 output = num1 * mystery(num1, num2 1) 7 Endif
15 14. If line 6 is replaced with the following: output = num1 * mystery(num1, num2) What does mystery(2,3) return? A. 2 B. 3 C. 6 D. Does not return; calls infinitely uncl the program crashes function output = mystery(num1, num2) 1 if (num2 is 0) 2 output = 1 3 Elseif (num2 is 1) 4 output = num1 5 Else 6 output = num1 * mystery(num1, num2) 7 Endif
16 14. If line 6 is replaced with the following: output = num1 + mystery(num1, num2) What does mystery(2,4) return? A. 2 B. 4 C. 8 D. 16 function output = mystery(num1, num2) 1 if (num2 is 0) 2 output = 1 3 Elseif (num2 is 1) 4 output = num1 5 Else 6 output = num1 + mystery(num1, num2 1) 7 Endif
![15. What is the output of mystery([1, 2, 3],[4, 5, 6, 7])?](/docs-images/88/116213885/images/17-1.jpg "function mystery(list1, list2) A. 20 B. 21 C. 24 D.")
17 15. What is the output of mystery([1, 2, 3],[4, 5, 6, 7])? function mystery(list1, list2) A. 20 B. 21 C. 24 D. 25 if (list1 is empty) return the value of 1 else sum = first element of list1 + last element of list2 return the value of sum + mystery(list1 without first element, list2 without last element) endif
CSCE155N Matlab Examination 3 Solution. March 29, 2013
CSCE155N Matlab Examination 3 Solution March 29, 2013 Name: NUID: This examination consists of 4 questions and you have 50 minutes to complete the test. Show all steps (including any computations/explanations)
Practice Exam 2. CS112 Computation for the Sciences
1 CS112 Computation for the Sciences Practice Exam 2 This exam is open book and open notes. There are 5 problems on the exam worth a total of 100 points. The number of points for each problem is shown
CS 170 Exam 2. Version: A Spring Name (as in OPUS) (print): Instructions:
CS 170 Exam 2 Version: A Spring 2016 Name (as in OPUS) (print): Section: Seat Assignment: Instructions: Keep your eyes on your own paper and do your best to prevent anyone else from seeing your work. Do
COGS 119/219 MATLAB for Experimental Research. Fall 2016 Week 1 Built-in array functions, Data types.m files, begin Flow Control
COGS 119/219 MATLAB for Experimental Research Fall 2016 Week 1 Built-in array functions, Data types.m files, begin Flow Control .m files We can write the MATLAB commands that we type at the command window
CS 135 Winter 2018 Tutorial 7: Accumulative Recursion and Binary Trees. CS 135 Winter 2018 Tutorial 7: Accumulative Recursion and Binary Trees 1
CS 135 Winter 2018 Tutorial 7: Accumulative Recursion and Binary Trees CS 135 Winter 2018 Tutorial 7: Accumulative Recursion and Binary Trees 1 Goals of this tutorial You should be able to... understand
Programming for Experimental Research. Flow Control
Programming for Experimental Research Flow Control FLOW CONTROL In a simple program, the commands are executed one after the other in the order they are typed. Many situations require more sophisticated
CSE 143 SAMPLE MIDTERM
CSE 143 SAMPLE MIDTERM 1. (5 points) In some methods, you wrote code to check if a certain precondition was held. If the precondition did not hold, then you threw an exception. This leads to robust code
COS 126 General Computer Science Fall Written Exam 1
COS 26 General Computer Science Fall 27 Written Exam This exam has 7 questions (including question ) worth a total of 7 points. You have 5 minutes. Write all answers inside the designated spaces. Policies.
CS 170 Exam 2. Version: A Spring Name (as in OPUS) (print): Instructions:
CS 170 Exam 2 Version: A Spring 2016 Name (as in OPUS) (print): Section: Seat Assignment: Instructions: Keep your eyes on your own paper and do your best to prevent anyone else from seeing your work. Do
FORM 1 (Please put your name and form # on the scantron!!!!) CS 161 Exam II: True (A)/False(B) (2 pts each):
FORM 1 (Please put your name and form # on the scantron!!!!) CS 161 Exam II: True (A)/False(B) (2 pts each): 1. When you attach & after the datatype in the parameter list of a function, the variable following
Question Points Score Total 100
Name Signature General instructions: You may not ask questions during the test. If you believe that there is something wrong with a question, write down what you think the question is trying to ask and
Announcements. Recursion and why study it. Recursive programming. Recursion basic idea
Announcements Recursion and why study it Tutoring schedule updated Do you find the sessions helpful? Midterm exam 1: Tuesday, April 11, in class Scope: will cover up to recursion Closed book but one sheet,
ECE 2574: Data Structures and Algorithms - Recursion Part I. C. L. Wyatt
ECE 2574: Data Structures and Algorithms - Recursion Part I C. L. Wyatt Today we will introduce the notion of recursion, look at some examples, and see how to implement them in code. Introduction to recursion
C Sc 227 Practice Test 2 Section Leader Name 134pts
C Sc 227 Practice Test 2 Section Leader Name 134pts 1. Determine the tightest upper bound runtimes of the following loops. Express your answer in the Big-O notation we have been using in class (assume
CPSC 311: Analysis of Algorithms (Honors) Exam 1 October 11, 2002
CPSC 311: Analysis of Algorithms (Honors) Exam 1 October 11, 2002 Name: Instructions: 1. This is a closed book exam. Do not use any notes or books, other than your 8.5-by-11 inch review sheet. Do not confer
CS 340 Spring 2019 Midterm Exam
CS 340 Spring 2019 Midterm Exam Instructions: This exam is closed-book, closed-notes. Electronic devices of any kind are not permitted. Write your final answers, tidily, in the boxes provided. Scratch
CSE 143. Lecture 9: introduction to recursion reading: 12.1
CSE 143 Lecture 9: introduction to recursion reading: 12.1 Recursion recursion: The definition of an operation in terms of itself. Solving a problem using recursion depends on solving smaller occurrences
CSE 143 SAMPLE MIDTERM SOLUTION
CSE 143 SAMPLE MIDTERM SOLUTION 1. (5 points) In some methods, you wrote code to check if a certain precondition was held. If the precondition did not hold, then you threw an exception. This leads to robust
RACKET BASICS, ORDER OF EVALUATION, RECURSION 1
RACKET BASICS, ORDER OF EVALUATION, RECURSION 1 COMPUTER SCIENCE 61AS 1. What is functional programming? Give an example of a function below: Functional Programming In functional programming, you do not
Java+- Language Reference Manual
Fall 2016 COMS4115 Programming Languages & Translators Java+- Language Reference Manual Authors Ashley Daguanno (ad3079) - Manager Anna Wen (aw2802) - Tester Tin Nilar Hlaing (th2520) - Systems Architect
COMP 202 Recursion. CONTENTS: Recursion. COMP Recursion 1
COMP 202 Recursion CONTENTS: Recursion COMP 202 - Recursion 1 Recursive Thinking A recursive definition is one which uses the word or concept being defined in the definition itself COMP 202 - Recursion
Notes - Recursion. A geeky definition of recursion is as follows: Recursion see Recursion.
Notes - Recursion So far we have only learned how to solve problems iteratively using loops. We will now learn how to solve problems recursively by having a method call itself. A geeky definition of recursion
Introduction to Recursion
Recursive Patterns Introduction to Recursion CS Computer Programming Department of Computer Science Wellesley College Reminder: DCG What is Recursion? 8- Recursion is an instance of divide-conquer-glue
CS 170 Exam 2. Version: A Fall Name (as in OPUS) (print): Instructions:
CS 170 Exam 2 Version: A Fall 2015 Name (as in OPUS) (print): Section: Seat Assignment: Instructions: Keep your eyes on your own paper and do your best to prevent anyone else from seeing your work. Do
A function that invokes itself is said to
when a function invokes itself A function that invokes itself is said to be nothing new A common problem solving technique: - break problem down into smaller/simpler sub-problems - solve sub-problems -
C Sc 227 Practice Test 2 Section Leader Name 134pts ANSWERS
C Sc 227 Practice Test 2 Section Leader Name 134pts ANSWERS 1. Determine the tightest upper bound runtimes of the following loops. Express your answer in the Big-O notation we have been using in class
CSCI 135 Exam #1 Fundamentals of Computer Science I Fall 2012
CSCI 135 Exam #1 Fundamentals of Computer Science I Fall 2012 Name: This exam consists of 6 problems on the following 7 pages. You may use your two-sided hand-written 8 ½ x 11 note sheet during the exam.
An Introduction to MATLAB
An Introduction to MATLAB Day 1 Simon Mitchell Simon.Mitchell@ucla.edu High level language Programing language and development environment Built-in development tools Numerical manipulation Plotting of
Department of Computer Science Purdue University, West Lafayette
Department of Computer Science Purdue University, West Lafayette Fall 2011: CS 180 Problem Solving and OO Programming Exam 1 Solutions Q 1 Answer the questions below assuming that binary integers are represented
COS 126 General Computer Science Spring Midterm 1
COS 126 General Computer Science Spring 2003 Midterm 1 This test has 9 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
Introduction to Mathematical and Scientific Programming TUTORIAL WEEK 2 (MATH 1MP3) Winter 2019
TUTORIAL WEEK 2 Introduction to Mathematical and Scientific Programming (MATH 1MP3) Winter 2019 We will review: String Slicing Lists Conditionals Loops Some Examples for String Slicing A="This is an apple"
Recursion Chapter 17. Instructor: Scott Kristjanson CMPT 125/125 SFU Burnaby, Fall 2013
Recursion Chapter 17 Instructor: Scott Kristjanson CMPT 125/125 SFU Burnaby, Fall 2013 2 Scope Introduction to Recursion: The concept of recursion Recursive methods Infinite recursion When to use (and
CS3 Midterm 2 Summer 2008
CS3 Midterm 2 Summer 2008 Read this page and fill in the left table now. Name: Instructional login (eg, cs3- ab): UCWISE login: Name of the person sitting to your left: Name of the person sitting to your
CSE 143 Lecture 10. Recursion
CSE 143 Lecture 10 Recursion slides created by Marty Stepp and Alyssa Harding http://www.cs.washington.edu/143/ Recursion Iteration: a programming technique in which you describe actions to be repeated
CPE 112 Spring 2015 Exam II (100 pts) March 4, Definition Matching (8 Points)
Name Definition Matching (8 Points) 1. (8 pts) Match the words with their definitions. Choose the best definition for each word. Relational Expression Iteration Counter Count-controlled loop Loop Flow
COMP-202. Recursion. COMP Recursion, 2011 Jörg Kienzle and others
COMP-202 Recursion Recursion Recursive Definitions Run-time Stacks Recursive Programming Recursion vs. Iteration Indirect Recursion Lecture Outline 2 Recursive Definitions (1) A recursive definition is
1- Write a single C++ statement that: A. Calculates the sum of the two integrates 11 and 12 and outputs the sum to the consol.
1- Write a single C++ statement that: A. Calculates the sum of the two integrates 11 and 12 and outputs the sum to the consol. B. Outputs to the console a floating point number f1 in scientific format
ECE 122. Engineering Problem Solving with Java
ECE 122 Engineering Problem Solving with Java Lecture 5 Anatomy of a Class Outline Problem: How do I build and use a class? Need to understand constructors A few more tools to add to our toolbox Formatting
CMSC 132: Object-Oriented Programming II. Recursive Algorithms. Department of Computer Science University of Maryland, College Park
CMSC 132: Object-Oriented Programming II Recursive Algorithms Department of Computer Science University of Maryland, College Park Recursion Recursion is a strategy for solving problems A procedure that
204111: Computer and Programming
204111: Computer and Programming Week 4: Control Structures t Monchai Sopitkamon, Ph.D. Overview Types of control structures Using selection structure Using repetition structure Types of control ol structures
Practical Questions CSCA48 Week 6
Practical Questions CSCA48 Week 6 Trace the following functions with a variety of input, and describe their functionality in a single sentence. 1. def mystery(n): if n == 4: result = n result = 2 * mystery(n+1)
CSE 143 Sample Midterm Exam #1
CSE 143 Sample Midterm Exam #1 1. ArrayList Mystery. Consider the following method: public static void mystery1(arraylist list) { for (int i = 0; i < list.size(); i += 2) { int element = list.get(i);
Recursion. Chapter 11
Walter Savitch Frank M. Carrano Recursion Chapter 11 ISBN 0136091113 2009 Pearson Education, Inc., Upper Saddle River, NJ. All Rights Reserved Objectives Describe the concept of recursion Use recursion
Structure of Programming Languages Lecture 5
Structure of Programming Languages Lecture 5 CSCI 6636 4536 June, 2017 CSCI 6636 4536 Lecture 10... 1/16 June, 2017 1 / 16 Outline 1 Expressions and Evaluation 2 Control Structures Conditionals Repetition
CS-211 Fall 2017 Test 1 Version Practice For Test on Oct. 2, Name:
CS-211 Fall 2017 Test 1 Version Practice For Test on Oct. 2, 2017 True/False Questions... Name: 1. (10 points) For the following, Check T if the statement is true, the F if the statement is false. (a)
Multiple Choice (Questions 1 14) 28 Points Select all correct answers (multiple correct answers are possible)
Name Closed notes, book and neighbor. If you have any questions ask them. Notes: Segment of code necessary C++ statements to perform the action described not a complete program Program a complete C++ program
Recursive Thinking. Chapter 8: Recursion. Recursive Definitions. Recursion. Java Software Solutions for AP* Computer Science A 2nd Edition
Chapter 8: Recursion Presentation slides for Recursive Thinking Recursion is a programming technique in which a method can call itself to solve a problem Java Software Solutions for AP* Computer Science
// a stack is printed from bottom (leftmost) to top (rightmost) System.out.println(stk);
CompSci 100 Test 2 Spring 2011 Prof. Rodger April 14, 2011 Some common recurrence relations T(n) = T(n/2) +O(1) O(log n) T(n) = T(n/2) +O(n) O(n) T(n) = 2T(n/2) +O(1) O(n) T(n) = 2T(n/2) +O(n) O(n log
Test #2 October 8, 2015
CPSC 1040 Name: Test #2 October 8, 2015 Closed notes, closed laptop, calculators OK. Please use a pencil. 100 points, 5 point bonus. Maximum score 105. Weight of each section in parentheses. If you need
C Sc 227 Practice Test 2 Section Leader Your Name 100pts. a. 1D array b. PriorityList<E> c. ArrayPriorityList<E>
C Sc 227 Practice Test 2 Section Leader Your Name 100pts 1. Approximately how many lectures remain in C Sc 227 (give or take 2)? (2pts) 2. Determine the tightest upper bound runtimes of the following loops.
Computer Science E-119 Fall Problem Set 1. Due before lecture on Wednesday, September 26
Due before lecture on Wednesday, September 26 Getting Started Before starting this assignment, make sure that you have completed Problem Set 0, which can be found on the assignments page of the course
Control Statements. Objectives. ELEC 206 Prof. Siripong Potisuk
Control Statements ELEC 206 Prof. Siripong Potisuk 1 Objectives Learn how to change the flow of execution of a MATLAB program through some kind of a decision-making process within that program The program
CS115 INTRODUCTION TO COMPUTER SCIENCE 1. Additional Notes Module 5
CS115 INTRODUCTION TO COMPUTER SCIENCE 1 Additional Notes Module 5 Example my-length (Slide 17) 2 (define (my-length alos) [(empty? alos) 0] [else (+ 1 (my-length (rest alos)))])) (my-length empty) alos
Lecture 19: Recursion
Lecture 19: Recursion Building Java Programs: A Back to Basics Approach by Stuart Reges and Marty Stepp Copyright (c) Pearson 2013. All rights reserved. Recursion recursion: The definition of an operation
1KOd17RMoURxjn2 CSE 20 DISCRETE MATH Fall
CSE 20 https://goo.gl/forms/1o 1KOd17RMoURxjn2 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Explain the steps in a proof by mathematical and/or structural
Conditionals and Recursion. Python Part 4
Conditionals and Recursion Python Part 4 Modulus Operator Yields the remainder when first operand is divided by the second. >>>remainder=7%3 >>>print (remainder) 1 Boolean expressions An expression that
Programming via Java Recursion
Programming via Java Recursion We saw how to create methods in Chapter 12. Inside their bodies, we can include invocations of other methods. It may not have occurred to you, but you might reasonably wonder:
CS-140 Fall 2017 Test 1 Version Practice Practie for Sept. 27, Name:
CS-140 Fall 2017 Test 1 Version Practice Practie for Sept. 27, 2017 Name: 1. (10 points) For the following, Check T if the statement is true, the F if the statement is false. (a) T F : In mathematics,
1 Introduction. 2 Recursive descent parsing. Predicative parsing. Computer Language Implementation Lecture Note 3 February 4, 2004
CMSC 51086 Winter 2004 Computer Language Implementation Lecture Note 3 February 4, 2004 Predicative parsing 1 Introduction This note continues the discussion of parsing based on context free languages.
Decision Making -Branching. Class Incharge: S. Sasirekha
Decision Making -Branching Class Incharge: S. Sasirekha Branching The C language programs presented until now follows a sequential form of execution of statements. Many times it is required to alter the
CSE 143 Lecture 11. Decimal Numbers
CSE 143 Lecture 11 Recursive Programming slides created by Marty Stepp http://www.cs.washington.edu/143/ Decimal Numbers A visual review of decimal numbers: We get 348 by adding powers of 10 348 = 300
V Advanced Data Structures
V Advanced Data Structures B-Trees Fibonacci Heaps 18 B-Trees B-trees are similar to RBTs, but they are better at minimizing disk I/O operations Many database systems use B-trees, or variants of them,
CPE Summer 2015 Exam I (150 pts) June 18, 2015
Name Closed notes and book. If you have any questions ask them. Write clearly and make sure the case of a letter is clear (where applicable) since C++ is case sensitive. You can assume that there is one
Functions. Lab 4. Introduction: A function : is a collection of statements that are grouped together to perform an operation.
Lab 4 Functions Introduction: A function : is a collection of statements that are grouped together to perform an operation. The following is its format: type name ( parameter1, parameter2,...) { statements
CSE 143: Computer Programming II Spring 2015 Midterm Exam Solutions
CSE 143: Computer Programming II Spring 2015 Midterm Exam Solutions Name: Sample Solutions ID #: 1234567 TA: The Best Section: A9 INSTRUCTIONS: You have 50 minutes to complete the exam. You will receive
Chapter 4: Writing Classes
Chapter 4: Writing Classes Java Software Solutions Foundations of Program Design Sixth Edition by Lewis & Loftus Writing Classes We've been using predefined classes. Now we will learn to write our own
C++ Final Exam 2017/2018
1) All of the following are examples of integral data types EXCEPT. o A Double o B Char o C Short o D Int 2) After the execution of the following code, what will be the value of numb if the input value
Selection Statements. Chapter 4. Copyright 2013 Elsevier Inc. All rights reserved 1
Selection Statements Chapter 4 Copyright 2013 Elsevier Inc. All rights reserved 1 Recall Relational Expressions The relational operators in MATLAB are: > greater than < less than >= greater than or equals
V Advanced Data Structures
V Advanced Data Structures B-Trees Fibonacci Heaps 18 B-Trees B-trees are similar to RBTs, but they are better at minimizing disk I/O operations Many database systems use B-trees, or variants of them,
n A m I B I A U n I V ER SI TY OF SCIEnCE AnDTECHnOLOGY
n A m I B I A U n I V ER SI TY OF SCIEnCE AnDTECHnOLOGY FACULTY OF COMPUTING AND INFORMATICS DEPARTMENT OF COMPUTER SCIENCE QUALIFICATION: BACHELOR OF COMPUTER SCIENCE QUALIFICATION CODE: 07BACS LEVEL:
FORM 1 (Please put your name and form # on the scantron!!!!) CS 161 Exam I: True (A)/False(B) (2 pts each):
FORM 1 (Please put your name and form # on the scantron!!!!) CS 161 Exam I: True (A)/False(B) (2 pts each): 1. The basic commands that a computer performs are input (get data), output (display result),
5. Assuming gooddata is a Boolean variable, the following two tests are logically equivalent. if (gooddata == false) if (!
FORM 2 (Please put your name and form # on the scantron!!!!) CS 161 Exam I: True (A)/False(B) (2 pts each): 1. Assume that all variables are properly declared. The following for loop executes 20 times.
CSE 143 Sample Midterm Exam #4
CSE 143 Sample Midterm Exam #4 (based on Summer 2009's midterm; thanks to Alyssa Harding) 1. ArrayList Mystery. Consider the following method: public static void mystery4(arraylist list) { for
Assist. Prof. Dr. Caner ÖZCAN
Assist. Prof. Dr. Caner ÖZCAN Memory Structure When a variable defined it is stored somewhere in memory. Memory can be thought as block consist of cells. When a variable defined, required number of cell
CS111: PROGRAMMING LANGUAGE II
CS111: PROGRAMMING LANGUAGE II Computer Science Department Lecture 1(c): Java Basics (II) Lecture Contents Java basics (part II) Conditions Loops Methods Conditions & Branching Conditional Statements A
AP Computer Science Principles Programming Question Tips. 1: Which algorithm/code segment achieves some result?
AP Computer Science Principles Programming Question Tips Name: Recall that roughly 40 percent of the questions on the AP exam will be programming or algorithm questions. These will often fall into one
A PROBLEM can be solved easily if it is decomposed into parts. Similarly a C program decomposes a program into its component functions.
FUNCTIONS IN C A PROBLEM can be solved easily if it is decomposed into parts. Similarly a C program decomposes a program into its component functions. Big problems require big programs too big to be written
Multiple Choice (Questions 1 14) 28 Points Select all correct answers (multiple correct answers are possible)
Name Closed notes, book and neighbor. If you have any questions ask them. Notes: Segment of code necessary C++ statements to perform the action described not a complete program Program a complete C++ program
CS-211 Fall 2017 Test 1 Version A Oct. 2, Name:
CS-211 Fall 2017 Test 1 Version A Oct. 2, 2017 True/False Questions... Name: 1. (10 points) For the following, Check T if the statement is true, the F if the statement is false. (a) T F : If I code a C
The Pip Language Reference Manual. PLT (W4115) Fall Frank Wallingford
The Pip Language Reference Manual PLT (W4115) Fall 2008 Frank Wallingford (frw2106@columbia.edu) Contents 1 Introduction 3 2 Execution 4 3 Lexical Elements 4 3.1 ASCII.................................
Programming Paradigms Written Exam (6 CPs)
Programming Paradigms Written Exam (6 CPs) 31.01.2018 First name Student number Last name Signature Instructions for Students Write your name and student number on the exam sheet and on every solution
CS 307 Midterm 2 Fall 2009
Points off 1 2 3 4 5 Total off Net Score Exam Number: CS 307 Midterm 2 Fall 2009 Name UTEID login name TA's Name: Oswaldo Rashid Swati (Circle One) Instructions: 1. Please turn off your cell phones and
CS171 Final Practice Exam
CS171 Final Practice Exam Name: You are to honor the Emory Honor Code. This is a closed-book and closed-notes exam. You have 150 minutes to complete this exam. Read each problem carefully, and review your
Compiler Theory. (GCC the GNU Compiler Collection) Sandro Spina 2009
Compiler Theory (GCC the GNU Compiler Collection) Sandro Spina 2009 GCC Probably the most used compiler. Not only a native compiler but it can also cross-compile any program, producing executables for
Lecture 05: Methods. AITI Nigeria Summer 2012 University of Lagos.
Lecture 05: Methods AITI Nigeria Summer 2012 University of Lagos. Agenda What a method is Why we use methods How to declare a method The four parts of a method How to use (invoke) a method The purpose
Unit 7. Functions. Need of User Defined Functions
Unit 7 Functions Functions are the building blocks where every program activity occurs. They are self contained program segments that carry out some specific, well defined task. Every C program must have
An Introduction to Functions
Chapter 4 An Introduction to Functions Through the agency of with, we have added identifiers and the ability to name expressions to the language. Much of the time, though, simply being able to name an
CS-140 Fall 2017 Test 1 Version Practice Practie for Sept. 27, Name:
CS-140 Fall 2017 Test 1 Version Practice Practie for Sept. 27, 2017 Name: 1. (10 points) For the following, Check T if the statement is true, the F if the statement is false. (a) T F : In mathematics,
Arithmetic Compound Assignment Operators
Arithmetic Compound Assignment Operators Note that these shorthand operators are not available in languages such as Matlab and R. Zheng-Liang Lu Java Programming 76 / 141 Example 1... 2 int x = 1; 3 System.out.println(x);
Review for the. Final Exam. Final Exam. December 8, Final Format. Final Format. Ways to get an A on the Final. A Crash Course in Java
Final Exam Review for the Final Exam Time: Tuesday Dec 12 @ :00-9:00 p.m. December 8, 2006 Location: same as midterms, i.e., Hoover 2055. ComS 20: Programming I (in Java) Iowa State University, FALL 2006
Haskell Review COMP360
Haskell Review COMP360 Some people talk in their sleep. Lecturers talk while other people sleep Albert Camus Remaining Schedule Friday, April 7 Haskell Monday, April 10 Logic Programming read chapter 12
Matlab Examples. (v.01, Fall 2011, prepared by HP Huang)
1 Matlab Examples (v.01, Fall 2011, prepared by HP Huang) These examples illustrate the uses of the basic commands that will be discussed in the Matlab tutorials. This collection does not reflect the full
Writing Functions. Reading: Dawson, Chapter 6. What is a function? Function declaration and parameter passing Return values Objects as parameters
What is a function? Function declaration and parameter passing Return values Objects as parameters Reading: Writing Functions Dawson, Chapter 6 Abstraction Data scoping Encapsulation Modules Recursion
18.3 Deleting a key from a B-tree
18.3 Deleting a key from a B-tree B-TREE-DELETE deletes the key from the subtree rooted at We design it to guarantee that whenever it calls itself recursively on a node, the number of keys in is at least
Recursion. Readings: RS Chapter 12. Recursion. Recursion: The definition of an operation in terms of itself.
Recursion Readings: RS Chapter 12 CSC216: Programming Concepts Java NC State CSC216 Faculty Slides are modified from those provided by Marty Stepp www.buildingjavaprograms.com Some materials from Joseph
1. Answer as shown or -2 unless question allows partial credit. No points off for differences in spacing, capitalization, commas, and braces
CS314 Fall 2012 Final Exam Solution and Grading Criteria. Grading acronyms: AIOBE - Array Index out of Bounds Exception may occur BOD - Benefit of the Doubt. Not certain code works, but, can't prove otherwise
Scheme: Strings Scheme: I/O
Scheme: Strings Scheme: I/O CS F331 Programming Languages CSCE A331 Programming Language Concepts Lecture Slides Wednesday, April 5, 2017 Glenn G. Chappell Department of Computer Science University of
CSE 143 Sample Midterm Exam #7 (11wi)
CSE 143 Sample Midterm Exam #7 (11wi) 1. ArrayList Mystery Write the output produced by the following method when passed each of the following ArrayLists: public static void mystery(arraylist
Sometimes an ambiguous grammar can be rewritten to eliminate the ambiguity.
Eliminating Ambiguity Sometimes an ambiguous grammar can be rewritten to eliminate the ambiguity. Example: consider the following grammar stat if expr then stat if expr then stat else stat other One can
function [s p] = sumprod (f, g)
![function [s p] = sumprod (f, g)](/thumbs/73/68615713.jpg "function [s p] = sumprod (f, g)")
Outline of the Lecture Introduction to M-function programming Matlab Programming Example Relational operators Logical Operators Matlab Flow control structures Introduction to M-function programming M-files: