CE151-4-AU UNIVERSITY OF ESSEX. Sample Examination Questions 2011 INTRODUCTION TO PROGRAMMING
|
|
- Violet Clarke
- 5 years ago
- Views:
Transcription
1 CE151-4-AU UNIVERSITY OF ESSEX Sample Examination Questions 2011 INTRODUCTION TO PROGRAMMING This paper contains questions from the first half of the CE112 papers from 2009 and 2010, adapted to Python. Questions from the past papers that cannot be translated into Python have been omitted. The 2009 and 2010 papers were three-hour examinations comprising 10 questions each worth 10% of the paper. Such questions would be worth 15% of a two-hour paper; hence the percentages shown in the original papers have been multiplied by 1.5 [ The marks for question 5 from 2009 do not correspond to the marks in the original paper since the modification from C to Python required more substantial changes than the other questions; furthermore the marks for this question do not add up to 15%. ] The 2011 paper will contain five questions each worth 15% and a longer question worth 25%. A sample longer question is provided at the end of this paper Please do not leave your seat unless you are given permission by an invigilator. Do not communicate in any way with any other candidate in the examination room. Do not open the question paper until told to do so. All answers must be written in the answer book(s) provided. All rough work must be written in the answer book(s) provided. A line should be drawn through any rough work to indicate to the examiner that it is not part of the work to be marked. At the end of the examination, remain seated until your answer book(s) have been collected and you have been told you may leave.
2 CE151-4-AU 2 QUESTIONS BASED ON CE Question 1 Briefly describe what is meant by a syntax error and a runtime error. The following program should read a sequence of integers from the keyboard and terminate when the total of the numbers that have been read is greater than 500, outputting the average value so far after the each input. However, there are two errors that will be detected by the IDLE syntax-checker and one that will cause failure at runtime and another that will cause the program to behave incorrectly. For each of the four errors, give - the number of the line of code where it occurs - the kind of error in that line of code - the way in which the error should be corrected [12%] 01 count = 0 02 finished = False 03 total = 0 04 while finished: 05 number = int(input("enter a number: )) 06 total = total + number 07 print("current average is ", total / count); 08 if total> finished = True 10 count = count + 1;
3 3 CE151-4-AU Question 2 What is the value of each of the following Python expressions? (i) 7 // 3 (ii) 7 / 2 (iii) 2 * a (iv) 5.3 > 5 (v) 1==1 or 2>1 and 1>2 (c) What is the value of sum after the following code has been executed? i = 0 sum = 0 while i < 9: if i%4 == 0: sum = sum + i i = i + 2 Rewrite the code fragment from part using a for loop without using any break statements and without introducing any more variables; [4.5%]
4 CE151-4-AU 4 Question 4 Write a full definition for a Python function called compare, which takes as arguments two strings s1 and s2 and an integer n, and returns the value True if the first n characters in the string s1 are the same as the first n characters in the string s2 and returns the value False otherwise. You may assume that both strings have at least n characters. [6%] Write a full definition for a function called minsum, which takes as an argument a list of lists of numbers, calculates the sum of the values in each of the lists and returns the smallest such sum. [ For example, if the argument was [[1, 4, 0, 2], [2, 5, 1, 3], [3, 6, 2, 4]] the sums would be 7, 11, and 15, so the value returned should be 7. ] [9%]
5 5 CE151-4-AU Question 1 QUESTIONS BASED ON CE Briefly describe what is meant by a syntax error and a type error. The following Python program contains one error that will be detected by the IDLE syntax-checker and three that may cause failure at runtime. For each of the four errors, give - the number of the line of code where it occurs - the kind of error in that line of code - the way in which the error should be corrected [12%] 01 count = 0 02 sum = 0 03 finished = False 04 while not finished: 05 number = input("enter a number: ") 06 if number<0: 07 finished = true 08 else: 09 sum = sum + number 10 print("average ="; sum / count)
6 CE151-4-AU 6 Question 3 (part) (c) (d) Not relevant to Python. What is the value of sum after the following code has been executed? sum = 0 for i in range(0, 18, 3): if i%6 == 0 : sum = sum + i Rewrite the code fragment from part using a while loop without using break statements and without introducing any more variables; Not relevant to Python. [4.5%] [6%]
7 7 CE151-4-AU Question 4 Provide a full Python function definition for a function isuppercasevowel, which takes as an argument a single-character string and which returns the value True if the character supplied as an argument is an upper case vowel (i.e. A, E, I, O or U) and returns the value False otherwise. Not relevant to Python (c) Write a statement that initialises the value of a variable b to be a list of 5 integers in which all the elements have an initial value of 2, without mentioning the number 5. [1%] (d) Write a statement that initialises the value of a variable c to be an list of 100 integers in which the first five elements have an initial value of 1, and the remainder have an initial value of 0. [You must not explicitly use 95 zeroes!] [2%] (e) Write a full definition for a function called maxsum which takes as an argument a list of lists of numbers, calculates the sum of the values of each list and returns the largest such sum. [7.5%]
8 CE151-4-AU 8 Question 5 Consider the following Python function. def swap(a, b): temp = a a = b b = temp (i) Explain why after a call of the form swap(x,y) the values of the variables x and y will be unaltered. (ii) Write a single statement that will swap the values of the variables x and y without using a temporary variable. An outline for a Student class is defined as follows. class Student(object) : def init (self, name, regnum, postgrad) : self.name = name self.regnum = regnum self.postgrad = postgrad def showstudent(self) : You should assume that the name is a string, the registration number is an integer and the postgrad attribute is a boolean value indicating whether the student is a postgraduate. (i) Provide a complete body for the method showsudent which should display on one line the name, registration number and postgraduate status of the student supplied as an argument in the following format. Name: Fred Smith; Reg Number: 12345; Postgrad: no (ii) Write a full function definition for a function showundergrads which takes as an argument a list of objects of type Student and makes use of the showstudent method to display details of all of the undergraduates in the list [4%]
9 9 CE151-4-AU Question 6 SAMPLE LONGER QUESTION A file containing data about a collection of students has the following format. Fred Smith CSEE Jim Brown CSEE Ann Simpson Biology Each line contains a first name, a second name, a registration number, a year and a department. Write a complete Python program that will input the contents of the file into a list of tuples, and output each of the following full details of the student sorted by registration number (in a neatly formatted table) the names of all students with a year of less than 3 the number of people in each department The output for the data shown above should be Ann Simpson Biology Fred Smith CSEE Jim Brown CSEE Fred Smith Ann Simpson CSEE 2 Biology 1 You may assume that no name occupies a total of more than 20 characters and all registration numbers have five digits. The filename should be obtained from the user; if the file does not exist the program should display an appropriate message and ask the user to supply another filename. END OF PAPER CE AU
CE161-4-AU UNIVERSITY OF ESSEX. Undergraduate Examinations 2014 DIGITAL SYSTEMS ARCHITECTURE. Time allowed: TWO hours
CE161-4-AU UNIVERSITY OF ESSEX Undergraduate Examinations 2014 DIGITAL SYSTEMS ARCHITECTURE Time allowed: TWO hours The following items are provided: Graph paper (available on invigilator s desk) Candidates
More informationDo not turn over until you are told to do so by the Invigilator.
UNIVERSITY OF EAST ANGLIA School of Mathematics UG End of Year Examination 2002-2003 PROGRAMMING FOR MATHEMATICIANS Time allowed: TWO hours Answer ALL FOUR questions in Section A Answer ONE Question from
More informationPython 2 Conditionals and loops
Today s lecture Python 2 Conditionals and loops Lecture 23 COMPSCI111/111G SS 2016! Recap of yesterday s lecture! if statements! while loops Recap! Introduced the IDLE IDE, variables! Basic arithmetic
More informationName: Partner: Python Activity 9: Looping Structures: FOR Loops
Name: Partner: Python Activity 9: Looping Structures: FOR Loops Learning Objectives Students will be able to: Content: Explain the difference between while loop and a FOR loop Explain the syntax of a FOR
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 informationCE221 Programming in C++ Part 2 References and Pointers, Arrays and Strings
CE221 Programming in C++ Part 2 References and Pointers, Arrays and Strings 19/10/2017 CE221 Part 2 1 Variables and References 1 In Java a variable of primitive type is associated with a memory location
More informationBEng (Hons) Electronic Engineering. BEng (Hons) Telecommunications. Examinations for / Semester 2
BEng (Hons) Electronic Engineering BEng (Hons) Telecommunications Cohort: BEE/16B/FT & BTEL/16B/FT Examinations for 2016-2017 / Semester 2 Resit Examinations for BTEL/15B/FT, BEE/13B/FT, BTEL/14B/FT &
More informationFundamentals of Programming (Python) Control Structures. Sina Sajadmanesh Sharif University of Technology Fall 2017
Fundamentals of Programming (Python) Control Structures Sina Sajadmanesh Sharif University of Technology Some slides have been adapted from Python: How to Program 1 st Edition Outline 1. Control Structures
More informationIntroduction to Programming
Introduction to Programming Python Lab 8: Loops PythonLab8 lecture slides.ppt 20 November 2018 Ping Brennan (p.brennan@bbk.ac.uk) 1 Getting Started Create a new folder in your disk space with the name
More informationCPSC 121 Sample Final Examination December 2013
CPSC 121 Sample Final Examination December 2013 Name: Student ID: Signature: You have 150 minutes to write the 11 questions on this examination. A total of 98 marks are available. Justify all of your answers.
More informationComputer Science 217
Computer Science 17 Midterm Exam March 5, 014 Exam Number 1 First Name: Last Name: ID: Class Time (Circle One): 1:00pm :00pm Instructions: Neatly print your names and ID number in the spaces provided above.
More informationData Structures CSci 1200 Test 1 Questions
Overview Data Structures CSci 1200 Test 1 Questions Test 1 will be held Monday, February 14, 2011, 12:00-1:30pm, Darrin 308. No make-ups will be given except for emergency situations, and even then a written
More informationCPSC 411, 2015W Term 2 Midterm Exam Date: February 25, 2016; Instructor: Ron Garcia
CPSC 411, 2015W Term 2 Midterm Exam Date: February 25, 2016; Instructor: Ron Garcia This is a closed book exam; no notes; no calculators. Answer in the space provided. There are 8 questions on 14 pages,
More informationSection 004 Spring CS 170 Exam 1. Name (print): Instructions:
CS 170 Exam 1 Section 004 Spring 2014 Name (print): Instructions: Keep your eyes on your own paper and do your best to prevent anyone else from seeing your work. Do NOT communicate with anyone other than
More informationCE151 ASSIGNMENT
Set by: Mike Sanderson Credit: 20% of total module mark Deadline: 11.59.59, Monday 8 December Submission of this assignment will be via the online submission system; your programs may be tested during
More informationFundamentals of Python: First Programs. Chapter 4: Strings (Indexing, Slicing, and Methods)
Fundamentals of Python: First Programs Chapter 4: Strings (Indexing, Slicing, and Methods) Objectives After completing this lesson, you will be able to: 1) Know the definition of a string and that strings
More informationSoftware Development Techniques. December Sample Examination Paper. Time: 3 hours
Software Development Techniques December 2015 Sample Examination Paper Answer ALL questions. Clearly cross out surplus answers. Time: 3 hours The maximum mark for this paper is 100. Any reference material
More information8/2/10. Looking for something COMP 10 EXPLORING COMPUTER SCIENCE. Where is the book Modern Interiors? Lecture 7 Searching and Sorting TODAY'S OUTLINE
Looking for something COMP 10 EXPLORING COMPUTER SCIENCE Where is the book Modern Interiors? Lecture 7 Searching and Sorting TODAY'S OUTLINE Searching algorithms Linear search Complexity Sorting algorithms
More informationIntroduction to Programming
Introduction to Programming Department of Computer Science and Information Systems Steve Maybank sjmaybank@dcs.bbk.ac.uk Spring 2018 Week 9: Functions 9 March 2018 Birkbeck College, U. London 1 Exercise
More informationComputer Science 217
Computer Science 217 Midterm Exam Fall 2012 November 1, 2012 Name: ID: Class Time (Circle One): 1:00pm 3:00pm Instructions: Neatly print your name and ID number in the spaces provided above. Pick the best
More informationFinal Examination, Semester 1, 2015 COMP10001 Foundations of Computing
Student Number The University of Melbourne Department of Computing and Information Systems Final Examination, Semester 1, 2015 COMP10001 Foundations of Computing Reading Time: 15 minutes. Writing Time:
More informationCOMPUTING SCIENCE 3Z: PROGRAMMING LANGUAGES 3
Tuesday, 28 May 2009 2.00 pm 3.30 pm (Duration: 1 hour 30 minutes) DEGREES OF MSci, MEng, BEng, BSc, MA and MA (Social Sciences) COMPUTING SCIENCE 3Z: PROGRAMMING LANGUAGES 3 Answer all 4 questions. This
More informationModule Contact: Dr Geoff McKeown, CMP Copyright of the University of East Anglia Version 1
UNIVERSITY OF EAST ANGLIA School of Computing Sciences Main Series UG Examination 2013-14 PROGRAMMING FOR NON-SPECIALISTS CMPC2X02 Time allowed: 2 hours Section A (Attempt all questions: 80 marks) Section
More informationCPSC 121 Midterm 1 Friday October 14th, Signature: Section (circle one): 11:00 15:30 17:00
CPSC 121 Midterm 1 Friday October 14th, 2016 Name: Student ID: Signature: Section (circle one): 11:00 15:30 17:00 You have 70 minutes to write the 9 questions on this examination. A total of 60 marks are
More informationTo become familiar with array manipulation, searching, and sorting.
ELECTRICAL AND COMPUTER ENGINEERING 06-88-211: COMPUTER AIDED ANALYSIS LABORATORY EXPERIMENT #2: INTRODUCTION TO ARRAYS SID: OBJECTIVE: SECTIONS: Total Mark (out of 20): To become familiar with array manipulation,
More informationComputer Science II CSci 1200 Test 1 Overview and Practice
Computer Science II CSci 1200 Test 1 Overview and Practice Overview Test 1 will be held Tuesday, February 13, 2007, 2:00-3:30pm, West Hall Auditorium. No make-ups will be given except for emergency situations,
More informationQUEEN MARY, UNIVERSITY OF LONDON
QUEEN MARY, UNIVERSITY OF LONDON BSC IN THE FACULTY OF ENGINEERING AND MATHEMATICAL SCIENCES Examination No.: UserId. MODULE: DCS100: PROCEDURAL PROGRAMMING 2004 MOCK TEST 2 Time allowed: 2 hours (120
More informationSEMESTER 1, 2011 EXAMINATIONS. CITS1200 Java Programming FAMILY NAME: GIVEN NAMES:
Computer Science & Software Engineering SEMESTER 1, 2011 EXAMINATIONS CITS1200 Java Programming FAMILY NAME: GIVEN NAMES: STUDENT ID: SIGNATURE: This Paper Contains: 26 pages (including title page) Time
More informationUNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS INFR08013 INFORMATICS 1 - FUNCTIONAL PROGRAMMING
UNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS INFR08013 INFORMATICS 1 - FUNCTIONAL PROGRAMMING Monday 15 th December 2014 14:30 to 16:30 INSTRUCTIONS TO CANDIDATES 1.
More informationUNIT I : OVERVIEW OF COMPUTERS AND C-PROGRAMMING
SIDDARTHA INSTITUTE OF SCIENCE AND TECHNOLOGY:: PUTTUR Siddharth Nagar, Narayanavanam Road 517583 QUESTION BANK (DESCRIPTIVE) Subject with Code : PROGRAMMING FOR PROBLEM SOLVING (18CS0501) Course & Branch
More informationAlgorithms. Chapter 8. Objectives After studying this chapter, students should be able to:
Objectives After studying this chapter, students should be able to: Chapter 8 Algorithms Define an algorithm and relate it to problem solving. Define three construct and describe their use in algorithms.
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 informationCOMP101: Final Review. With your boy(s), Mason and San
COMP101: Final Review With your boy(s), Mason and San COMP101 Happenings The COMP 101 final exam is still scheduled for tomorrow (December 12) at 12 pm in Genome Sciences Bldg. Seating assignments will
More informationCambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level
Cambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level *4137415794* COMPUTER SCIENCE 9608/31 Paper 3 Advanced Theory October/November 2018 1 hour 30 minutes
More informationCS61B Lecture #2. Public Service Announcements:
CS61B Lecture #2 Please make sure you have obtained an account, run register, and finished the survey today. In the future (next week), the password required for surveys and such will be your account password
More informationCambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level
Cambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level *7848878250* COMPUTER SCIENCE 9608/21 Paper 2 Fundamental Problem-solving and Programming Skills October/November
More informationQUEEN MARY, UNIVERSITY OF LONDON DCS128 ALGORITHMS AND DATA STRUCTURES Class Test Monday 27 th March
QUEEN MARY, UNIVERSITY OF LONDON DCS128 ALGORITHMS AND DATA STRUCTURES Class Test Monday 27 th March 2006 11.05-12.35 Please fill in your Examination Number here: Student Number here: MODEL ANSWERS All
More informationLecture 11: while loops CS1068+ Introductory Programming in Python. for loop revisited. while loop. Summary. Dr Kieran T. Herley
Lecture 11: while loops CS1068+ Introductory Programming in Python Dr Kieran T. Herley Python s while loop. Summary Department of Computer Science University College Cork 2017-2018 KH (24/10/17) Lecture
More informationLab1. Introduction to Python. Lab 4: Selection Statement. Eng. Mai Z. Alyazji
Islamic University of Gaza Faculty of Engineering Computer Engineering Dept. Introduction to Computers Lab (ENGG 1003) Lab1 Introduction to Python Lab 4: Selection Statement Eng. Mai Z. Alyazji In this
More informationDefinition: A data structure is a way of organizing data in a computer so that it can be used efficiently.
The Science of Computing I Lesson 4: Introduction to Data Structures Living with Cyber Pillar: Data Structures The need for data structures The algorithms we design to solve problems rarely do so without
More informationOutline. Parts 1 to 3 introduce and sketch out the ideas of OOP. Part 5 deals with these ideas in closer detail.
OOP in Java 1 Outline 1. Getting started, primitive data types and control structures 2. Classes and objects 3. Extending classes 4. Using some standard packages 5. OOP revisited Parts 1 to 3 introduce
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 informationSelection Statement ( if )
Islamic University Of Gaza Faculty of Engineering Computer Engineering Department Lab 4 Selection Statement ( if ) Eng. Ibraheem Lubbad October 10, 2016 In this lab we will constructs program that allow
More informationStructure and Interpretation of Computer Programs
CS 61A Spring 2017 Structure and Interpretation of Computer Programs Test 1 Solutions INSTRUCTIONS You have 2 hours to complete the exam. The exam is open book, open notes, closed computer, closed calculator.
More informationFirst name (printed): a. DO NOT OPEN YOUR EXAM BOOKLET UNTIL YOU HAVE BEEN TOLD TO BEGIN.
CSE 231 F 13 Exam #1 Last name (printed): First name (printed): Form 1 X Directions: a. DO NOT OPEN YOUR EXAM BOOKLET UNTIL YOU HAVE BEEN TOLD TO BEGIN. b. This exam booklet contains 25 questions, each
More informationProgramming. We will be introducing various new elements of Python and using them to solve increasingly interesting and complex problems.
Plan for the rest of the semester: Programming We will be introducing various new elements of Python and using them to solve increasingly interesting and complex problems. We saw earlier that computers
More informationModule Contact: Dr Gavin Cawley, CMP Copyright of the University of East Anglia Version 1
UNIVERSITY OF EAST ANGLIA School of Computing Sciences Main Series UG Examination 2017-18 PROGRAMMING 1 CMP-4008Y Time allowed: 2 hours Answer FOUR questions. All questions carry equal weight. Notes are
More informationQuestion 1. tmp = Stack() # Transfer every item from stk onto tmp. while not stk.is_empty(): tmp.push(stk.pop())
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 informationSubject: Computer Science
Subject: Computer Science Topic: Data Types, Variables & Operators 1 Write a program to print HELLO WORLD on screen. 2 Write a program to display output using a single cout statement. 3 Write a program
More informationSorting and Searching
Sorting and Searching Sorting o Simple: Selection Sort and Insertion Sort o Efficient: Quick Sort and Merge Sort Searching o Linear o Binary Reading for this lecture: http://introcs.cs.princeton.edu/python/42sort/
More informationCS 323 Lecture 1. Design and Analysis of Algorithms. Hoeteck Wee
{ CS 323 Lecture 1 } Design and Analysis of Algorithms Hoeteck Wee hoeteck@cs.qc.cuny.edu http://cs323.qwriting.org/ Algorithmic ideas are pervasive APPLICATIONS. Economics, auctions and game theory Biology,
More informationPLEASE HAND IN UNIVERSITY OF TORONTO Faculty of Arts and Science
PLEASE HAND IN UNIVERSITY OF TORONTO Faculty of Arts and Science AUGUST EXAMINATIONS CSC 108H1Y Instructor: Daniel Zingaro Duration three hours PLEASE HAND IN Examination Aids: None. Student Number: Last
More informationTeaching London Computing
Teaching London Computing A Level Computer Science Topic 1: GCSE Python Recap William Marsh School of Electronic Engineering and Computer Science Queen Mary University of London Aims What is programming?
More informationCommon Loop Algorithms 9/21/16 42
Common Loop Algorithms 9/21/16 42 Common Loop Algorithms 1. Sum and Average Value 2. Coun4ng Matches 3. Promp4ng un4l a Match Is Found 4. Maximum and Minimum 5. Comparing Adjacent Values 9/21/16 43 Sum
More informationWYSE Academic Challenge 2002 Computer Science Test (Sectional) SOLUTION
Computer Science - 1 WYSE Academic Challenge 2002 Computer Science Test (Sectional) SOLUTION 1. Access to moving head disks requires three periods of delay before information is brought into memory. The
More informationStructure and Interpretation of Computer Programs
CS 61A Fall 2016 Structure and Interpretation of Computer Programs Final INSTRUCTIONS You have 3 hours to complete the exam. The exam is closed book, closed notes, closed computer, closed calculator, except
More informationProblem Solving for Intro to Computer Science
Problem Solving for Intro to Computer Science The purpose of this document is to review some principles for problem solving that are relevant to Intro to Computer Science course. Introduction: A Sample
More information1. What is the minimum number of bits needed to store a single piece of data representing: a. An integer between 0 and 100?
1 CS 105 Review Questions Most of these questions appeared on past exams. 1. What is the minimum number of bits needed to store a single piece of data representing: a. An integer between 0 and 100? b.
More informationChapter 6: List. 6.1 Definition. What we will learn: What you need to know before: Data types Assignments
Chapter 6: List What we will learn: List definition Syntax for creating lists Selecting elements of a list Selecting subsequence of a list What you need to know before: Data types Assignments List Sub-list
More informationGIS 4653/5653: Spatial Programming and GIS. More Python: Statements, Types, Functions, Modules, Classes
GIS 4653/5653: Spatial Programming and GIS More Python: Statements, Types, Functions, Modules, Classes Statement Syntax The if-elif-else statement Indentation and and colons are important Parentheses and
More information8 Algorithms 8.1. Foundations of Computer Science Cengage Learning
8 Algorithms 8.1 Foundations of Computer Science Cengage Learning 8.2 Objectives After studying this chapter, the student should be able to: Define an algorithm and relate it to problem solving. Define
More informationPLEASE HAND IN UNIVERSITY OF TORONTO Faculty of Arts and Science
PLEASE HAND IN UNIVERSITY OF TORONTO Faculty of Arts and Science APRIL 2010 EXAMINATIONS CSC 108 H1S Instructors: Horton Duration 3 hours PLEASE HAND IN Examination Aids: None Student Number: Family Name(s):
More informationSAMS Programming A/B. Lecture #1 Introductions July 3, Mark Stehlik
SAMS Programming A/B Lecture #1 Introductions July 3, 2017 Mark Stehlik Outline for Today Overview of Course A Python intro to be continued in lab on Wednesday (group A) and Thursday (group B) 7/3/2017
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 informationSorting/Searching and File I/O. Sorting Searching Reading for this lecture: L&L
Sorting/Searching and File I/O Sorting Searching Reading for this lecture: L&L 10.4-10.5 1 Sorting Sorting is the process of arranging a list of items in a particular order The sorting process is based
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 informationModule 3: Strings and Input/Output
Module 3: Strings and Input/Output Topics: Strings and their methods Printing to standard output Reading from standard input Readings: ThinkP 8, 10 1 Strings in Python: combining strings in interesting
More informationPython 2 Conditionals and loops Matthew Egbert CS111
Python 2 Conditionals and loops Matthew Egbert CS111 Yesterday's Lecture Input and Output user_input_as_str = input('prompt: ') print('hello. You entered: '+ user_input_as_str) Comments # everything to
More informationInstructions PLEASE READ (notice bold and underlined phrases)
Assignment 4 Recursive and Sorting Methods Solutions Required Reading Java Foundations Chapter 13 Linked Structures Chapter 17 Recursion Chapter 18 Searching and Sorting Chapter 19 Trees Instructions PLEASE
More informationLecture Writing Programs. Richard E Sarkis CSC 161: The Art of Programming
Lecture Writing Programs Richard E Sarkis CSC 161: The Art of Programming Class Administrivia Agenda To be able to understand and write Python statements to output information to the screen To assign values
More informationWhile Loops A while loop executes a statement as long as a condition is true while condition: statement(s) Statement may be simple or compound Typical
Recommended Readings Chapter 5 Topic 5: Repetition Are you saying that I am redundant? That I repeat myself? That I say the same thing over and over again? 1 2 Repetition So far, we have learned How to
More informationKadi Sarva Vishwavidyalaya, Gandhinagar
Kadi Sarva Vishwavidyalaya, Gandhinagar MASTERS OF COMPUTER APPLICATION (MCA) Semester I (First Year) Subject: MCA-101 Programming for Logic Building (LDPL) SUB Teaching scheme Examination scheme Total
More informationUNIVERSITY REGULATIONS
CPSC 221: Algorithms and Data Structures Midterm Exam, 2015 October 21 Name: Student ID: Signature: Section (circle one): MWF(101) TTh(102) You have 90 minutes to solve the 8 problems on this exam. A total
More informationThe while Loop 4/6/16 4
Chapter 4: Loops Chapter Goals To implement while and for loops To hand-trace the execution of a program To become familiar with common loop algorithms To understand nested loops To implement programs
More informationL14 Quicksort and Performance Optimization
L14 Quicksort and Performance Optimization Alice E. Fischer Fall 2018 Alice E. Fischer L4 Quicksort... 1/12 Fall 2018 1 / 12 Outline 1 The Quicksort Strategy 2 Diagrams 3 Code Alice E. Fischer L4 Quicksort...
More informationChapter 8 Algorithms 1
Chapter 8 Algorithms 1 Objectives After studying this chapter, the student should be able to: Define an algorithm and relate it to problem solving. Define three construct and describe their use in algorithms.
More informationCIS 110 Introduction To Computer Programming. February 29, 2012 Midterm
CIS 110 Introduction To Computer Programming February 29, 2012 Midterm Name: Recitation # (e.g. 201): Pennkey (e.g. bjbrown): My signature below certifies that I have complied with the University of Pennsylvania
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 informationIntroduction To Files In Python
Introduction To Files In Python In this section of notes you will learn how to read from and write to files in your programs. Why Bother With Files? Many reasons: - Too much information to input all at
More informationReg. No. : Question Paper Code : B.E./B.Tech. DEGREE EXAMINATION, JANUARY First Semester GE 6151 COMPUTER PROGRAMMING
wss Reg. No. : Question Paper Code : 37007 B.E./B.Tech. DEGREE EXAMINATION, JANUARY 2014. First Semester Civil Engineering GE 6151 COMPUTER PROGRAMMING (Common to all branches) (Regulation 2013) Time :
More informationCSc 110, Spring 2017 Lecture 39: searching
CSc 110, Spring 2017 Lecture 39: searching 1 Sequential search sequential search: Locates a target value in a list (may not be sorted) by examining each element from start to finish. Also known as linear
More informationCS 2505 Computer Organization I
Instructions: Print your name in the space provided below. This examination is closed book and closed notes, aside from the permitted one-page formula sheet. No calculators or other computing devices may
More informationAPT Session 2: Python
APT Session 2: Python Laurence Tratt Software Development Team 2017-10-20 1 / 17 http://soft-dev.org/ What to expect from this session: Python 1 What is Python? 2 Basic Python functionality. 2 / 17 http://soft-dev.org/
More informationCIS 110 Introduction to Computer Programming. February 29, 2012 Midterm
CIS 110 Introduction to Computer Programming February 29, 2012 Midterm Name: Recitation # (e.g. 201): Pennkey (e.g. bjbrown): My signature below certifies that I have complied with the University of Pennsylvania
More informationPython Activity 7: Looping Structures WHILE Loops
Python Activity 7: Looping Structures WHILE Loops How can I get my code to repeat output or processes? Learning Objectives Students will be able to: Content: Explain the three parts of a loop Explain the
More informationPython review. 1 Python basics. References. CS 234 Naomi Nishimura
Python review CS 234 Naomi Nishimura The sections below indicate Python material, the degree to which it will be used in the course, and various resources you can use to review the material. You are not
More informationUniversity of Washington CSE 140 Introduction to Data Programming Winter Midterm exam. February 6, 2013
University of Washington CSE 140 Introduction to Data Programming Winter 2013 Midterm exam February 6, 2013 Name: Solutions UW Net ID (username): This exam is closed book, closed notes. You have 50 minutes
More informationCPSC 311, 2010W1 Midterm Exam #2
CPSC 311, 2010W1 Midterm Exam #2 2010/11/02 Page 1 of 18 CPSC 311, 2010W1 Midterm Exam #2 Name: Q1: 20 Student ID: Q2: 20 Signature (required; indicates agreement with rules below): Q3: 20 Q4: 20 Q5: 20
More informationMidterm #1 Fall minutes
15-112 Midterm #1 Fall 2014 80 minutes Name: Andrew ID: @andrew.cmu.edu Section: INSTRUCTIONS You may not use any books, notes, or electronic devices during this exam. You may not ask questions about the
More informationNotices. Test rules. Page 1 of 8. CS 1112 Spring 2018 Test 2
Page 1 of 8 Name: Email id: Notices Based on your past educational achievements, I expect you to do well on this test. Answer the questions in any order that you want. Hand in both parts of the test. Test
More informationQuestion: Total Points: Score:
CS 170 Exam 2 Section 005 Spring 2015 Name (print): ˆ Instructions: Keep your eyes on your own paper and do your best to prevent anyone else from seeing your work. Do NOT communicate with anyone other
More informationIn addition to the correct answer, you MUST show all your work in order to receive full credit.
In addition to the correct answer, you MUST show all your work in order to receive full credit. Questions Mark: Question1) Multiple Choice Questions /10 Question 2) Binary Trees /15 Question 3) Linked
More informationFundamentals of Programming (Python) Getting Started with Programming
Fundamentals of Programming (Python) Getting Started with Programming Ali Taheri Sharif University of Technology Some slides have been adapted from Python Programming: An Introduction to Computer Science
More informationYou have 90 minutes to complete the exam of InformatikIIb. The following rules apply:
Department of Informatics Prof. Dr. Michael Böhlen Binzmühlestrasse 14 8050 Zurich Phone: +41 44 635 4333 Email: boehlen@ifi.uzh.ch AlgoDat Nachholtest Spring 2016 20.05.2016 Name: Advice You have 90 minutes
More informationAppendix 1: Pseudo-code command set
Appendix 1: Pseudo-code command set Questions in the written examination that involve code will use this pseudo-code for clarity and consistency. However, students may answer questions using any valid
More informationSorting algorithms: Bubble, Selection, and Tree Sort
Courses 5LN446 & 5LN715 Sorting algorithms: Bubble, Selection, and Tree Sort Mats Dahllöf Dept of Linguistics and Philology October 2016 1 / 29 Today Sorting sequences of values (important in many contexts)
More informationAbout the Final. Saturday, 7-10pm in Science Center 101. Closed book, closed notes. Not on the final: graphics, file I/O, vim, unix
CS 21 Final Review About the Final Saturday, 7-10pm in Science Center 101 Closed book, closed notes Not on the final: graphics, file I/O, vim, unix Expect Questions That Ask You To: Evaluate Python expressions
More informationFinal Exam. COMP Summer I June 26, points
Final Exam COMP 14-090 Summer I 2000 June 26, 2000 200 points 1. Closed book and closed notes. No outside material allowed. 2. Write all answers on the test itself. Do not write any answers in a blue book
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 ( Autumn ) Roll Number Section Name Subject Number C S 1 1 0 0 1 Subject Name Programming
More informationQUEEN MARY, UNIVERSITY OF LONDON DCS128 ALGORITHMS AND DATA STRUCTURES Class Test Monday 13 th February
QUEEN MARY, UNIVERSITY OF LONDON DCS128 ALGORITHMS AND DATA STRUCTURES Class Test Monday 13 th February 2006 11.05-12.35 Please fill in your Examination Number here: Student Number here: All answers to
More information