Structured Programming (COIT 29222) Term 2, 2009, Final Exam Date And Time  As advised by the university Open/Closed Book (3 hours)  Structured Programming,

Slides:



Advertisements
Similar presentations
How to Succeed in Mathematics WOU Mathematics Department
Advertisements

MGF1106 Math for Liberal Arts Sections Course website: Lecturer: Jim Wooland Lectures: TR 8:00 – 9:15, 101 HCB Labs: Mondays,
JAVA Coursework (the same for 2A and 2B). Fundamental Information The coursework is 30 marks in your O’Level = 15% of the exam Must be word processed.
Lecture Roger Sutton 21: Revision 1.
Introduction to Computer Programming I CSE 113
Mock test review Revision of Activity Diagrams for Loops,
1 9/29/06CS150 Introduction to Computer Science 1 Loops Section Page 255.
1 9/29/06CS150 Introduction to Computer Science 1 Loops Section Page 255.
CS 152 & CS 154 Bill Crum, Lecturer Bill White, Instructional Coordinator Earth Chandrraungphen, Lab TA.
Monday, 11/18/02, Slide #1 CS 106 Intro to CS 1 Monday, 11/18/02  QUESTIONS??  Today:  Hand back, discuss HW #4  Discussion of Lab 10  Exam #2 Friday.
COMP1170 Midterm Preparation (March 17 th 2009) Acknowledgment The notes are adapted from those provided by Deitel & Associates, Inc. and Pearson Education.
EnPh 131 Lec B04 Introduction Course syllabus Course components ….
Computer Science: A Structured Programming Approach Using C1 Objectives ❏ To understand the basic concepts and uses of arrays ❏ To be able to define C.
More Functions CS303E: Elements of Computers and Programming.
Homework and Test Taking BIOE 1000 – Orientation and Introduction to Bioengineering.
MyMathLab How to Study Hints from Professor of Mathematics Jon Odell.
Chapter 6: User-Defined Functions I Instructor: Mohammad Mojaddam
Welcome to CS 3260 Dennis A. Fairclough. Overview Course Canvas Web Site Course Materials Lab Assignments Homework Grading Exams Withdrawing from Class.
Staying on task.  This is one section of a set of informational slides designed to give new students an overview of what to expect during the first semester.
2014/2015.  There will be homework, however, not every day.  Whenever homework is assigned, it will be graded.  Always be sure to write your homework.
Class Orientation for Distance Learning Classes Limin Zhang, Ph.D. Associate Professor of Mathematics Summer 2014.
Read 0090 FALL 2012 W70 Adalia Reyna, Instructor.
Ms. Lemons General Chemistry Syllabus and Class Guidelines.
Course Web Page Most information about the course (including the syllabus) will be posted on the course wiki:
Conceptual Foundations © 2008 Pearson Education Australia Lecture slides for this course are based on teaching materials provided/referred by: (1) Statistics.
Project 1 Due Date: September 25 th Quiz 4 is due September 28 th Quiz 5 is due October2th 1.
Welcome to Physics 1D03.
CSCI 51 Introduction to Computer Science Dr. Joshua Stough January 20, 2009.
Bilgisayar Mühendisliği Bölümü CENG 102 – Computer Programming Melek OKTAY Syllabus Administrative Information.
Functions Introduction to Programming By Engr. Bilal Ahmad 1ITP by Engr. Bilal Ahmad.
A2 Mathematics with Mechanics Vivien Moore. The course The A2 course consists of three modules: C3, C4 and M2. We will be finishing C3 by the end of October.
Welcome to Math 10 Academic Term 2: November 12 th – February 1st.
National 4 and National 5 Chemistry. Assessment Arrangements Both courses are broken down into 3 units: Chemical Changes and Structure Nature’s Chemistry.
Session 4: PREPARE FOR TESTS Year 7 Life Skills Student Wall Planner and Study Guide.
CMSC 2021 CMSC 202 Computer Science II for Majors Fall 2002 Mr. Frey (0101 – 0104) Mr. Raouf (0201 – 0204)
Principles of Computer Science I Honors Section Note Set 1 CSE 1341 – H 1.
CS Midterm Study Guide Fall General topics Definitions and rules Technical names of things Syntax of C++ constructs Meaning of C++ constructs.
Epilog Final words about 1304ENG course. Assessment Exam60%(open book) Tutorials5%( 2 x 2.5%) Test5%(Pseudocode) Laboratory30%( 6 x 5%) Must pass exam.
Class Orientation for Distance Learning Classes Limin Zhang, Ph.D. Professor of Mathematics Fall 2014.
1 FUNCTIONS - I Chapter 5 Functions help us write more complex programs.
CS161 Topic #16 1 Today in CS161 Lecture #16 Prepare for the Final Reviewing all Topics this term Variables If Statements Loops (do while, while, for)
Preparing for the OCR Functional Skills Maths Assessment
Welcome back! Mr. Schmidt 7A Math. My background I grew up in Los Angeles, CA. I attended Arizona State University for my Bachelor’s and Master’s degrees.
Review for Final Exam. Contents 5 questions (20 points each) + 1 bonus question (20 points) – Basic concepts in Chapters 1-4 – Chapters 5-9 – Bonus: Chapter.
CMSC 2021 CMSC 202 Computer Science II for Majors Spring 2001 Sections Ms. Susan Mitchell.
1/17/2016B.Ramamurthy1 Final Review CSE321 B.Ramamurthy.
CMSC 2021 CMSC 202 Computer Science II for Majors Spring 2003 Mr. Frey (0101 – 0104) Mr. Raouf (0201 – 0204)
COMP1927 Course Introduction 16x1
REMINDER: If you haven’t yet passed the Gateway Quiz, make sure you take it this week! (You can find more practice quizzes online in the Gateway Info menu.
Syllabus Highlights CSE 1310 – Introduction to Computers and Programming Vassilis Athitsos University of Texas at Arlington 1.
James Tam Introduction To CPSC 233 James Tam Java Object-Orientation Graphical-user interfaces.
Testing.
Introduction to Financial Management. Overview of Financial Management Introduction Keys to Success Recitations Class Structure - Syllabus Text – Financial.
COMP Loop Statements Yi Hong May 21, 2015.
Arrays and Loops. Learning Objectives By the end of this lecture, you should be able to: – Understand what a loop is – Appreciate the need for loops and.
Homework and Quizzes in Course Compass. Entering the classroom First stop – the classroom! Click on your class.
CMSC 104, Section 301, Fall Lecture 18, 11/11/02 Functions, Part 1 of 3 Topics Using Predefined Functions Programmer-Defined Functions Using Input.
REMINDER: If you haven’t yet passed the Gateway Quiz, make sure you take it this week! (You can find more practice quizzes online in the Gateway Info menu.
Strategies & Knowledge for Independent Learning individual Work SKIL SKIL cards are sets of cards that explain how to use different learning strategies.
Grade Scale Quiz 3 Results: Average class score after partial credit: XX.X% Commonly missed questions: # ____________________ We will be going over some.
Syllabus Highlights CSE 1310 – Introduction to Computers and Programming Alexandra Stefan University of Texas at Arlington 1.
Course Information EECS 2031 Fall Instructor Uyen Trang (U.T.) Nguyen Office: LAS Office hours: 
Course Information EECS 2031 – Section A Fall 2017.
Lesson Objectives Aims To be able to write an algorithm in Pseudo Code
Higher Human Biology EXAM TIPS 
National 4 and National 5 Chemistry
Chapter 8 Arrays Objectives
Review for Final Exam.
Review for Final Exam.
Course Information EECS 2031 Fall 2016.
Presentation transcript:

Structured Programming (COIT 29222) Term 2, 2009, Final Exam Date And Time  As advised by the university Open/Closed Book (3 hours)  Structured Programming, TERM 2, 2009 is a Restricted Materials examination.  This is a Restricted Materials examination. You will only be allowed to bring into the exam a copy of any C++ textbook and study guides (3 Study Guides).  Photocopies, handwritten materials, etc. will not be allowed.

You will see the following instructions on your exam paper  Instructions to the student Perusal time: 15 minutes Examination duration: 180 minutes (3 hours) Total mark: 50 There are three (3) sections in the examination. Section 1: Contains 5 questions worth 3 marks each. You may attempt as many questions as you wish. Section 2: Contains 4 questions worth 4 marks each. You may attempt as many questions as you wish. Section 3: Contains 3 questions, the first two worth 5 marks each, and the other worth 9 marks. You may attempt as many questions as you wish.

Things to do before the exam …  A specimen exam paper is available on the course website. You should do it before the exam and if you have a problem, please see your local tutor.  You should review the course material (week 1 to week 12), including your assignments.  Some typical questions & topics are given below to help you in exam preparation & you should study accordingly.  You may be asked to write an output of a given program.  You may be asked to state whether a statement is true or false.  You may be asked to write the pseudo-code for the C++ source code or write the C++ source code from the pseudo-code.  You may be asked to inspect the program code and correct the syntax errors by stating the line number and then rewriting the line with the error corrected.  You should NOT waste your time to rewrite the whole program.  You should know common errors such as missing commos, semicolon, incorrect lib names, operators, etc.

Some typical questions & topics…  You may be asked to identify the syntax error(s), if any, in declarations. For example: array, int, char, bool, etc. int array[-11]; correct or incorrect?  You may be asked to write the output of a given program.  Programs may be based on loops and if statements.  Review complicated loops.  Do you know rules for good programming? You may be asked.  Do you know how to write function prototypes, etc.? Review function prototypes, definitions, etc.  Can you find an error with missing elements (eg. function prototypes)?  Do you know how to sort an array? You should try to sort an array using two for loops, two while loops, etc.

Some typical questions & topics…  You may be asked to write a program using math library. For example:  Write a program that calculates the AB using the following formula: AB = Num+ e -sum + x 20 Where sum = x + y and Num must be a random number between 2 and 5.  You must know how to use the random generator rand() and math functions such as sqrt(), exp() and pow()  You may be asked to write a program that can search an array.  You may be asked about file processing (file opening, reading and writing from/to file)  Review some examples with reading and writing from/to files  Do you know what libraries you need to use?  Write some programs using input/output files

Marking & Results  The exams are marked according to set criteria and marks are checked TWICE before the release of FINAL results.  All marked exams CLOSE TO PASS are checked third time by the course coordinator.  There is no CHANCE OF MISTAKE so please do not send s to course coordinator or lecturer about rechecking your marks until you are very CONFIDENT.  If you qualify for the SE/special considerations, your final results will show appropriate grade.  If you get a “F” grade, please do not send s with “do sir something or check your exam again or you don’t have money to pay or you have got good marks in assignments or any other excuse” to course coordinator/lecturer/tutor as this will be waste of your & coordinator’s time. We cannot change the GRADE or give you another CHANCE.

Marking & Results  Please do not apply for DE until you have very IMPORTANT REASONS.  Please do not apply for special considerations until you have very IMPORTANT REASONS.  Please do not waste your & coordinator’s time with artificial reasons such as “you couldn’t concentrate”, “you were not able to prepare well”, “you had headache a few days before the exam”, “last year someone in your home was sick”, etc.  Please do not apply for REVIEW only because you have done well in the assignments.  As mentioned in course profile, you MUST score 50% in the Final Exam (even if you have scored 50/50 in the assignments). Good Luck. Course Coordinator of coit29222