Final Examination Semester 3 / Year 2010
|
|
- Bertha Daniel
- 5 years ago
- Views:
Transcription
1 Southern College Kolej Selatan 南方学院 Final Examination Semester 3 / Year 2010 COURSE : PROGRAMMING LOGIC AND DESIGN COURSE CODE : CCIS1003 TIME : 2 1/2 HOURS DEPARTMENT : COMPUTER SCIENCE LECTURER : LIM PEI GEOK Student s ID : Batch No. : Notes to candidates: 1) The question paper consists of 5 pages. Section A: 10 questions (25 marks) Section B: 4 questions (75 marks) 2) Answer all questions in Section A and answer any THREE out of FOUR questions in Section B. 3) Return the question paper with your answer booklet.
2 SECTION A: MULTIPLE CHOICE QUESTION ( 10 X 2.5 = 25 MARKS ) Identify the letter of choice that best completes the statement or answer the question. 1. A decision in which one of the two tests must be passed is a(n) decision. a. Complex b. AND c. OR d. NOT 2. The replaced a series of chained if-else statements by providing a choice of multiple values. a. Linear nested if structure b. if-else-then structure c. Non-Linear nested if structure d. Case structure 3. Start Get cpa, studymode if (?) then display You will get the scholarship else display You request for scholarship is failed endif Consider the code above. If cpa is greater than 3.5 and the study mode is F then it will display You will get the scholarship, otherwise, it display You request for scholarship is failed. Which of the following statements can be replaced in (?) correctly? a. cpa > 3.5 AND studymode = F b. cpa > 3.5 OR studymode = F c. cpa >=3.5 AND studymode = F d. cpa >= 3.5 OR studymode = F 4. Which of the following is a possible value for a Boolean expression? a. -1 b. true c. EOF d while rep < 5 print Warning What is wrong with the above? a. Loop control variable is not initialized b. Loop control variable is not altered. c. End-structure statement is missing. d. a, b and c 1/5
3 6. for count = 1 to 5 +2 display Warning Consider the above. How many times the Warning will be display to screen? a. 1 b. 2 c. 3 d Which of the following is not a valid name for a module? a. computearea() b. Compute Area () c. compute_area() d. COMPUTEAREA() 8. The benefit of modularization is to breaking the programs into reasonable units called. Which of the following is not appropriate to fill in the blank? a. modules b. subroutines c. steps d. methods 9. All of the elements in an array have the same. a. name b. default value c. memory location d. index 10. set value = 2 for rep = 1 to 5 num[rep] = value value = value + 3 if (value > 17) then value = value +1 endif Consider the pseudocode above. What is the final value stored in value variable? a. 16 b. 17 c. 18 d. 19 2/5
4 SECTION B: SHORT AND LONG QUESTIONS (75 MARKS) Answer THREE out of FOUR question in the answer booklet provided. Every question carries 25 marks. Question 1 a) Design an algorithm using flowchart to ask user for the department. The program needs to display department s telephone extension based on the department name entered by the user. Use the following table to determine the appropriate telephone extension. The program should display an error message when the department name does not appear in the table. (10 marks) Department Extension Account 234 Personnel 168 IT 348 Mechanical Engineering 932 Marketing 427 b) Design an algorithm that will prompt lecturer for the student id and student final exam score. Your program need to verify that the final exam score is between the ranges 0 to 100. It will display Invalid input if the final exam score is out of the range. Your program is then to display the grade according to the final exam score and display to screen the student id, final exam score and the grade. Determine the grade as follows: Exam score Grade 90 and above A B C D E Below 40 F ii. Write a pseudocode for the program (10 marks) 3/5
5 Question 2 PROGRAMMING LOGIC AND DESIGN a) Write a pseudocode that print numbers from 4 to 48 in increments of 4. The output of your program should be: You are required to display the output using i. do while loop ( 5 marks) ii. do until loop (5 marks) b) Design an algorithm to read a collection of payroll amounts. The last record contains a sentinel amount of 999 and is not to be included in the calculations. The program need to calculate the total payroll amount and the count of the payroll amount entered. Display the total payroll amount and the count of payroll amount entered. ii. Draw a pseudocode for the program (10 marks) Question 3 a) What is the output for the following pseudocode? (5 marks) Start Set x = 2, y = 50 do x = x * 3 y = y - 1 while (x<y) display x, y b) In the following pseudocode, determine the value of sum after the for loop is executed. (5 marks) Start Set sum = 0 for counter = 1 to 10 integer[counter] = counter for counter = 1 to 10 if ( counter%2 = 0 ) then sum = sum + integer[counter] endif display sum 4/5
6 c) Design an algorithm that will get an array of 10 scores, calculate the average score, lowest score and highest score in an array. The algorithm is to display the average score, lowest score and highest score. ii. Write a pseudocode for the program (10 marks) Question 4 a) In the following pseudocode, determine the value of diameter and circumference (5 marks) Start Set radius = 2 Set diameter = 10, circumference = 10 diameter = computediameter(radius) circumference = computecircumference(diameter) display diameter, circumference num computediameter(radius) diameter = radius x 2 return diameter num computecircumference(diameter) circumference = diameter x 3.14 return circumference b) Design an algorithm that input two integer values from users and pass both integer value to methods named sum(), difference() and product(). Create the method sum() to compute the sum of two integer values, difference() to compute the different between two integer values, and product() to compute the multiplication product of two integer values. Each method should perform the appropriate computation and display the result. ii. Draw the hierarchy chart for the program (5 marks) iii. Draw the flowchart for the program (10 marks) 000 5/5
Final Examination Semester 2 / Year 2010
Southern College Kolej Selatan 南方学院 Final Examination Semester 2 / Year 2010 COURSE : PROGRAMMING LOGIC AND DESIGN COURSE CODE : CCIS1003 TIME : 2 1/2 HOURS DEPARTMENT : COMPUTER SCIENCE LECTURER : LIM
More informationFinal Examination Semester 2 / Year 2011
Southern College Kolej Selatan 南方学院 Final Examination Semester 2 / Year 2011 COURSE : FUNDAMENTALS OF SOFTWARE DESIGEN AND DEVELOPMENT COURSE CODE : PROG1003 TIME : 2 1/2 HOURS DEPARTMENT : COMPUTER SCIENCE
More informationFinal Examination Semester 2 / Year 2005
Southern College Kolej Selatan 南方学院 Final Examination Semester 2 / Year 2005 COURSE : INTRODUCTION TO COMPUTING COURSE CODE : CSEG 1003 TIME : 2 1/2 HOURS DEPARTMENT : ELECTRICAL & ELECTRONIC ENGINEERING
More informationFinal Examination Semester 2 / Year 2011
Southern College Kolej Selatan 南方学院 Final Examination Semester 2 / Year 2011 COURSE : COMPUTER SYSTEM COURSE CODE : CSIS 1003 TIME : 2 HOURS 30 MINUTES DEPARTMENT : COMPUTER SCIENCE LECTURER : DR. LEE
More informationFinal Examination Semester 3 / Year 2010
Southern College Kolej Selatan 南方学院 Final Examination Semester 3 / Year 2010 COURSE : INTRODUCTION TO OBJECT-ORIENTED PROGRAMMING COURSE CODE : CCIS1103 TIME : 3 HOURS DEPARTMENT : COMPUTER SCIENCE LECTURER
More informationFinal Examination Semester 2 / Year 2010
Southern College Kolej Selatan 南方学院 Final Examination Semester 2 / Year 2010 COURSE : VISUAL BASIC.NET COURSE CODE : PROG2024 TIME : 2 1/2 HOURS DEPARTMENT : COMPUTER SCIENCE LECTURER : LIM PEI GEOK Student
More informationFinal Examination Semester 3 / Year 2008
Southern College Kolej Selatan 南方学院 Final Examination Semester 3 / Year 2008 COURSE : COMPUTER ORGANIZATION & OPERATING SYSTEM COURSE CODE : CSIS2053 CLASS : CS06-C, CS07-B,CS07-C TIME : 2 ½ HOURS DEPARTMENT
More informationFinal Examination Semester 3 / Year 2010
Southern College Kolej Selatan 南方学院 Final Examination Semester 3 / Year 2010 COURSE : OBJECT-ORIENTED PROGRAMMING COURSE CODE : PROG 2013 TIME : 2 1/2 HOURS DEPARTMENT : COMPUTER SCIENCE LECTURER : LIM
More informationFinal Examination Semester 1 / Year 2011
Southern College Kolej Selatan 南方学院 Final Examination Semester 1 / Year 2011 COURSE : DATA STRUCTURE AND ALGORITHM COURSE CODE : PROG2103 TIME : 2 1/2 HOURS DEPARTMENT : COMPUTER SCIENCE LECTURER : SO
More informationFinal Examination Semester 2 / Year 2010
Southern College Kolej Selatan 南方学院 Final Examination Semester 2 / Year 2010 COURSE : JAVA PROGRAMMING COURSE CODE : PROG1114 TIME : 2 1/2 HOURS DEPARTMENT : COMPUTER SCIENCE LECTURER : LIM PEI GEOK Student
More informationFinal Examination Semester 3 / Year 2007
Southern College Kolej Selatan 南方学院 Final Examination Semester 3 / Year 2007 COURSE : FUNDAMENTALS OF SOFTWARE DESIGN AND DEVELOPMENT COURSE CODE : PROG1003 TIME : 2 1/2 HOURS DEPARTMENT : COMPUTER SCIENCE
More informationFinal Examination Semester 3 / Year 2008
Southern College Kolej Selatan 南方学院 Final Examination Semester 3 / Year 2008 COURSE : JAVA PROGRAMMING COURSE CODE : PROG1114 TIME : 2 1/2 HOURS DEPARTMENT : COMPUTER SCIENCE CLASS : CS08-A + CS08-B LECTURER
More informationFinal Examination Semester 3 / Year 2012
Final Examination Semester 3 / Year 2012 COURSE : INTRODUCTION TO PROGRAMMING COURSE CODE : PROG1013 TIME : 2 1/2 HOURS DEPARTMENT : COMPUTER SCIENCE LECTURER : LIM PEI GEOK Student s ID : Batch No. :
More informationFinal Examination Semester 2 / Year 2011
Southern College Kolej Selatan 南方学院 Final Examination Semester 2 / Year 2011 COURSE COURSE CODE TIME DEPARTMENT LECTURER : JAVA PROGRAMMING : PROG1114 : 2 1/2 HOURS : COMPUTER SCIENCE : LIM PEI GEOK Student
More informationControl Structure: Loop
Control Structure: Loop Knowledge: Understand the various concepts of loop control structure Skill: Be able to develop a program involving loop control structure 1 Loop Structure Condition is tested first
More informationSouthern College Kolej Selatan 南方学院. Final Examination Semester 1 / Year 2011
Southern College Kolej Selatan 南方学院 Final Examination Semester 1 / Year 2011 COURSE : COURSE CODE : CSIS1013 TIME : 3 HOURS DEPARTMENT : COMPUTER SCIENCE LECTURER : NG MEE MEE Student s ID : Batch No.
More informationComputer System and programming in C
Approaches to Problem Solving Concept of algorithm and flow charts ALGORITHMS AND FLOWCHARTS A typical programming task can be divided into two phases: Problem solving phase produce an ordered sequence
More informationProgramming revision. Revision tip: Focus on the things you find difficult first.
Programming revision Revision tip: Focus on the things you find difficult first. Task Time (minutes) a 1. Complete self assessment sheet. 2 2. Read through the chapter on programming. 15 3. Work through
More informationFinal Examination Semester 2 / Year 2010
Southern College Kolej Selatan 南方学院 Final Examination Semester 2 / Year 2010 COURSE : INTRODUCTION TO DATABASE COURSE CODE : CCIS2203 TIME : 2 1/2 HOURS DEPARTMENT : COMPUTER SCIENCE LECTURER : WONG YOW
More informationFinal Examination Semester 1 / Year 2008
Southern College Kolej Selatan 南方学院 Final Examination Semester 1 / Year 2008 COURSE : INTRODUCTION TO DATABASE COURSE CODE : CCIS2203 TIME : 2 1/2 HOURS DEPARTMENT : COMPUTER SCIENCE CLASS : CIC07-AB LECTURER
More informationCSE123 LECTURE 3-1. Program Design and Control Structures Repetitions (Loops) 1-1
CSE123 LECTURE 3-1 Program Design and Control Structures Repetitions (Loops) 1-1 The Essentials of Repetition Loop Group of instructions computer executes repeatedly while some condition remains true Counter-controlled
More informationRepetition Structures
Repetition Structures Chapter 5 Fall 2016, CSUS Introduction to Repetition Structures Chapter 5.1 1 Introduction to Repetition Structures A repetition structure causes a statement or set of statements
More informationCondition-Controlled Loop. Condition-Controlled Loop. If Statement. Various Forms. Conditional-Controlled Loop. Loop Caution.
Repetition Structures Introduction to Repetition Structures Chapter 5 Spring 2016, CSUS Chapter 5.1 Introduction to Repetition Structures The Problems with Duplicate Code A repetition structure causes
More informationLearning Objectives: General Description: DONE DONE Structure Chart
1 CS 215 Fall 2017 Project 2: Grade Calculator Due October 9 @ midnight Version 2.1 Published 9/24 changes in Red [DUE DATE changed 10/3] Learning Objectives: - Developing a C++ program using the Procedure-Oriented
More informationPLD Semester Exam Study Guide Dec. 2018
Covers material from Chapters 1-8. Semester Exam will be built from these questions and answers, though they will be re-ordered and re-numbered and possibly worded slightly differently than on this study
More informationRepetition Algorithms
Repetition Algorithms Repetition Allows a program to execute a set of instructions over and over. The term loop is a synonym for a repetition statement. A Repetition Example Suppose that you have been
More informationThe American University in Cairo Department of Computer Science & Engineering CSCI &09 Dr. KHALIL Exam-I Fall 2011
The American University in Cairo Department of Computer Science & Engineering CSCI 106-07&09 Dr. KHALIL Exam-I Fall 2011 Last Name :... ID:... First Name:... Form I Section No.: EXAMINATION INSTRUCTIONS
More informationSelection Control Structure CSC128: FUNDAMENTALS OF COMPUTER PROBLEM SOLVING
Selection Control Structure CSC128: FUNDAMENTALS OF COMPUTER PROBLEM SOLVING MULTIPLE SELECTION To solve a problem that has several selection, use either of the following method: Multiple selection nested
More informationFinal Examination Semester 2 / Year 2011
Southern College Kolej Selatan 南方学院 Final Examination Semester 2 / Year 2011 COURSE : INTRODUCTION TO MULTIMEDIA COURSE CODE : CCIS1023 TIME : 3 HOURS DEPARTMENT : COMPUTER SCIENCE LECTURER : TAN WEE CHUEN
More informationLecture 7 Tao Wang 1
Lecture 7 Tao Wang 1 Objectives In this chapter, you will learn about: Interactive loop break and continue do-while for loop Common programming errors Scientists, Third Edition 2 while Loops while statement
More informationLooping Subtasks. We will examine some basic algorithms that use the while and if constructs. These subtasks include
1 Programming in C Looping Subtasks We will examine some basic algorithms that use the while and if constructs. These subtasks include Reading unknown quantity of data Counting things Accumulating (summing)
More informationCENTRAL TEXAS COLLEGE COSC 1315 INTRODUCTION TO COMPUTER PROGRAMMING. Semester Hours Credit: 3 INSTRUCTOR: OFFICE HOURS:
CENTRAL TEXAS COLLEGE COSC 1315 INTRODUCTION TO COMPUTER PROGRAMMING Semester Hours Credit: 3 INSTRUCTOR: OFFICE HOURS: I. INTRODUCTION A. This course presents an introduction to computer programming for
More informationChapter 5: Control Structures II (Repetition) Objectives (cont d.) Objectives. while Looping (Repetition) Structure. Why Is Repetition Needed?
Chapter 5: Control Structures II (Repetition) Objectives In this chapter, you will: Learn about repetition (looping) control structures Explore how to construct and use countercontrolled, sentinel-controlled,
More informationCambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level
Cambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level *8955017847* COMPUTER SCIENCE 9608/23 Paper 2 Fundamental Problem-solving and Programming Skills May/June
More informationCOP 1220 Introduction to Programming in C++ Course Justification
Course Justification This course is a required first programming C++ course in the following degrees: Associate of Arts in Computer Science, Associate in Science: Computer Programming and Analysis; Game
More informationClass 8 ALGORITHMS AND FLOWCHARTS. The City School
Class 8 ALGORITHMS AND FLOWCHARTS ALGORITHMS AND FLOWCHARTS A typical programming task can be divided into two phases: Problem solving phase produce an ordered sequence of steps that describe solution
More informationC Programming for Engineers Structured Program
C Programming for Engineers Structured Program ICEN 360 Spring 2017 Prof. Dola Saha 1 Switch Statement Ø Used to select one of several alternatives Ø useful when the selection is based on the value of
More informationCambridge International Examinations Cambridge Ordinary Level
Cambridge International Examinations Cambridge Ordinary Level *4357963448* COMPUTER SCIENCE 2210/21 Paper 2 Problem-solving and Programming May/June 2015 1 hour 45 minutes Candidates answer on the Question
More informationOutline. Program development cycle. Algorithms development and representation. Examples.
Outline Program development cycle. Algorithms development and representation. Examples. 1 Program Development Cycle Program development cycle steps: Problem definition. Problem analysis (understanding).
More informationSTUDENT LESSON A12 Iterations
STUDENT LESSON A12 Iterations Java Curriculum for AP Computer Science, Student Lesson A12 1 STUDENT LESSON A12 Iterations INTRODUCTION: Solving problems on a computer very often requires a repetition of
More informationCHAPTER 2 PROBLEM SOLVING TECHNIQUES. Mr Mohd Hatta Bin Hj Mohamed Ali Computer Programming BFC2042
CHAPTER 2 PROBLEM SOLVING TECHNIQUES Mr Mohd Hatta Bin Hj Mohamed Ali Computer Programming BFC2042 Software Engineering vs Problem Solving Software Engineering - A branch of Computer Science & provides
More informationThe American University in Cairo Computer Science & Engineering Department CSCE Dr. KHALIL Exam II Spring 2010
The American University in Cairo Computer Science & Engineering Department CSCE 106-08 Dr. KHALIL Exam II Spring 2010 Last Name :... ID:... First Name:... Form - I EXAMINATION INSTRUCTIONS * Do not turn
More information*Starting Out with C++: From Control Structures through Objects, 7/E* by *Tony Gaddis* COMPUTER PROGRAMMING LECTURE 05 LOOPS IMRAN IHSAN
PowerPoint Slides adapted from *Starting Out with C++: From Control Structures through Objects, 7/E* by *Tony Gaddis* Copyright 2012 Pearson Education Inc. COMPUTER PROGRAMMING LECTURE 05 LOOPS IMRAN IHSAN
More informationIndividual research task. You should all have completed the research task set last week. Please make sure you hand it in today.
Lecture 6 Individual research task. You should all have completed the research task set last week. Please make sure you hand it in today. Previously Decision structures with flowcharts Boolean logic UML
More informationLogic & Algorithms Foundations of Computer Science Behrouz A. Forouzan, Brooks/Cole Thomson Learning, Pacific Grove, USA, 2003.
OVERVIEW Logic & Algorithms Foundations of Computer Science Behrouz A. Forouzan, Brooks/Cole Thomson Learning, Pacific Grove, USA, 2003. OBJECTIVES After reading this chapter, the reader should be able
More informationCS110D: PROGRAMMING LANGUAGE I
CS110D: PROGRAMMING LANGUAGE I Computer Science department Lecture 5&6: Loops Lecture Contents Why loops?? While loops for loops do while loops Nested control structures Motivation Suppose that you need
More informationAnnouncements. Lab Friday, 1-2:30 and 3-4:30 in Boot your laptop and start Forte, if you brought your laptop
Announcements Lab Friday, 1-2:30 and 3-4:30 in 26-152 Boot your laptop and start Forte, if you brought your laptop Create an empty file called Lecture4 and create an empty main() method in a class: 1.00
More informationStepwise Refinement. Lecture 12 COP 3014 Spring February 2, 2017
Stepwise Refinement Lecture 12 COP 3014 Spring 2017 February 2, 2017 Top-Down Stepwise Refinement Top down stepwise refinement is a useful problem-solving technique that is good for coming up with an algorithm.
More informationProgramming Logic and Design Sixth Edition
Objectives Programming Logic and Design Sixth Edition Chapter 4 Making Decisions In this chapter, you will learn about: Evaluating Boolean expressions to make comparisons The relational comparison operators
More informationAssembly Language for Intel-Based Computers, 4 th Edition
Assembly Language for Intel-Based Computers, 4 th Edition Kip R Irvine Chapter 5: Procedures Lecture 19: Procedures Procedure s parameters Slides prepared by Kip R Irvine Revision date: 08/22/2002 Modified
More information5.1. Chapter 5: The Increment and Decrement Operators. The Increment and Decrement Operators. Looping. ++ is the increment operator.
Chapter 5: Looping 5.1 The Increment and Decrement Operators Copyright 2009 Pearson Education, Inc. Copyright Publishing as Pearson 2009 Addison-Wesley Pearson Education, Inc. Publishing as Pearson Addison-Wesley
More informationCOP 2000 Introduction to Computer Programming Mid-Term Exam Review
he exam format will be different from the online quizzes. It will be written on the test paper with questions similar to those shown on the following pages. he exam will be closed book, but students can
More informationStructured Program Development in C
1 3 Structured Program Development in C 3.2 Algorithms 2 Computing problems All can be solved by executing a series of actions in a specific order Algorithm: procedure in terms of Actions to be executed
More informationWelcome to Starting Out with Programming Logic and Design, Third Edition.
Welcome to Starting Out with Programming Logic and Design, Third Edition. This book uses a language-independent approach to teach programming concepts and problem-solving skills, without assuming any previous
More informationComputers and FORTRAN Language Fortran 95/2003. Dr. Isaac Gang Tuesday March 1, 2011 Lecture 3 notes. Topics:
Computers and FORTRAN Language Fortran 95/2003 Dr. Isaac Gang Tuesday March 1, 2011 Lecture 3 notes Topics: - Program Design - Logical Operators - Logical Variables - Control Statements Any FORTRAN program
More informationChapter 1: Problem Solving Skills Introduction to Programming GENG 200
Chapter 1: Problem Solving Skills Introduction to Programming GENG 200 Spring 2014, Prepared by Ali Abu Odeh 1 Table of Contents Fundamentals of Flowcharts 2 3 Flowchart with Conditions Flowchart with
More informationFinal Examination Semester 2 / Year 2012
Final Examination Semester 2 / Year 2012 COURSE : JAVA PROGRAMMING COURSE CODE : PROG1114 TIME : 2 1/2 HOURS DEPARTMENT : COMPUTER SCIENCE LECTURER : LIM PEI GEOK Student s ID : Batch No. : Notes to candidates:
More informationChapter 3 Structured Program Development
1 Chapter 3 Structured Program Development Copyright 2007 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. Chapter 3 - Structured Program Development Outline 3.1 Introduction
More informationCambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level
Cambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level *6264905153* COMPUTER SCIENCE 9608/21 Paper 2 Fundamental Problem-solving and Programming Skills May/June
More informationChapter 5: Control Structures II (Repetition)
Chapter 5: Control Structures II (Repetition) 1 Objectives Learn about repetition (looping) control structures Explore how to construct and use count-controlled, sentinel-controlled, flag-controlled, and
More informationCS112 Lecture: Repetition Statements
CS112 Lecture: Repetition Statements Objectives: Last revised 2/18/05 1. To explain the general form of the java while loop 2. To introduce and motivate the java do.. while loop 3. To explain the general
More informationRelational operators (1)
Review-2 Control of flow: ifs & loops How to set them up Where to break to When to use which kind 85-132 Introduction to C-Programming 10-1 Relational operators (1) Relational Operators
More informationLECTURE 04 MAKING DECISIONS
PowerPoint Slides adapted from *Starting Out with C++: From Control Structures through Objects, 7/E* by *Tony Gaddis* Copyright 2012 Pearson Education Inc. COMPUTER PROGRAMMING LECTURE 04 MAKING DECISIONS
More informationChapter Two: Program Design Process and Logic
Chapter Two: Program Design Process and Logic 2.1 Chapter objectives Describe the steps involved in the programming process Understand how to use flowchart symbols and pseudocode statements Use a sentinel,
More informationCS 199 Computer Programming. Spring 2018 Lecture 2 Problem Solving
CS 199 Computer Programming Spring 2018 Lecture 2 Problem Solving ALGORITHMS AND FLOWCHARTS A typical programming task can be divided into two phases: Problem solving phase produce an ordered sequence
More informationReview: Repetition Structure
Loops 1 Topics The while Loop Program Versatility Sentinel Values and Priming Reads Checking User Input Using a while Loop Counter-Controlled (Definite) Repetition Event-Controlled (Indefinite) Repetition
More informationIntroduction. C provides two styles of flow control:
Introduction C provides two styles of flow control: Branching Looping Branching is deciding what actions to take and looping is deciding how many times to take a certain action. Branching constructs: if
More informationChapter 3. More Flow of Control. Copyright 2007 Pearson Education, Inc. Publishing as Pearson Addison-Wesley
Chapter 3 More Flow of Control Overview 3.1 Using Boolean Expressions 3.2 Multiway Branches 3.3 More about C++ Loop Statements 3.4 Designing Loops Slide 3-3 Flow Of Control Flow of control refers to the
More informationC++ Programming Language Lecture 2 Problem Analysis and Solution Representation
C++ Programming Language Lecture 2 Problem Analysis and Solution Representation By Ghada Al-Mashaqbeh The Hashemite University Computer Engineering Department Program Development Cycle Program development
More informationPDS Lab Section 16 Autumn Tutorial 3. C Programming Constructs
PDS Lab Section 16 Autumn-2017 Tutorial 3 C Programming Constructs This flowchart shows how to find the roots of a Quadratic equation Ax 2 +Bx+C = 0 Start Input A,B,C x B 2 4AC False x If 0 True B x 2A
More informationFundamentals of Programming Session 7
Fundamentals of Programming Session 7 Instructor: Reza Entezari-Maleki Email: entezari@ce.sharif.edu 1 Fall 2014 These slides have been created using Deitel s slides Sharif University of Technology Outlines
More informationTABLE OF CONTENTS 2 CHAPTER 1 3 CHAPTER 2 4 CHAPTER 3. Algorithm Design & Problem Solving. Programming. Databases
2 CHAPTER 1 Algorithm Design & Problem Solving 3 CHAPTER 2 Programming 4 CHAPTER 3 Databases TABLE OF CONTENTS 1. ALGORITHM DESIGN & PROBLEM-SOLVING 1.1 Problem-solving & Design Every computer system is
More informationwhile Loops Lecture 13 Sections Robb T. Koether Wed, Sep 26, 2018 Hampden-Sydney College
while Loops Lecture 13 Sections 5.8-5.9 Robb T. Koether Hampden-Sydney College Wed, Sep 26, 2018 Robb T. Koether (Hampden-Sydney College) while Loops Wed, Sep 26, 2018 1 / 25 1 while Loops 2 Input Loops
More informationIndicate the answer choice that best completes the statement or answers the question. Enter the appropriate word(s) to complete the statement.
1. C#, C++, C, and Java use the symbol as the logical OR operator. a. $ b. % c. ^ d. 2. errors are relatively easy to locate and correct because the compiler or interpreter you use highlights every error.
More informationWhy Is Repetition Needed?
Why Is Repetition Needed? Repetition allows efficient use of variables. It lets you process many values using a small number of variables. For example, to add five numbers: Inefficient way: Declare a variable
More informationIntroduction to Decision Structures. Boolean & If Statements. Different Types of Decisions. Boolean Logic. Relational Operators
Boolean & If Statements Introduction to Decision Structures Chapter 4 Fall 2015, CSUS Chapter 4.1 Introduction to Decision Structures Different Types of Decisions A decision structure allows a program
More informationProgramming Language. Control Structures: Repetition (while) Eng. Anis Nazer Second Semester
Programming Language Control Structures: Repetition (while) Eng. Anis Nazer Second Semester 2017-2018 Repetition statements Control statements change the order which statements are executed Selection :
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 informationProblem Solving through Programming In C Prof. Anupam Basu Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur
Problem Solving through Programming In C Prof. Anupam Basu Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur Lecture 18 Switch Statement (Contd.) And Introduction to
More informationMultiple Choice (Questions 1 13) 26 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
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 information4*4*4 2. What is the output of the following flowchart for the values given below: (25 p)
Samples 1. Design a pseudocode that computes x n. Prompt the user to enter the value of x and n from keyboard. (25 p) Ex: Sample input for 4 and 3 your design should calculate 4 3 4*4*4 2. What is the
More informationIn this chapter you will learn:
1 In this chapter you will learn: Essentials of counter-controlled repetition. Use for, while and do while to execute statements in program repeatedly. Use nested control statements in your program. 2
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 informationCambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level
www.xtremepapers.com Cambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level *0007615708* COMPUTING 9691/21 Paper 2 May/June 2015 2 hours Candidates answer on
More informationIn Fig. 3.5 and Fig. 3.7, we include some completely blank lines in the pseudocode for readability. programs into their various phases.
Formulating Algorithms with Top-Down, Stepwise Refinement Case Study 2: Sentinel-Controlled Repetition In Fig. 3.5 and Fig. 3.7, we include some completely blank lines in the pseudocode for readability.
More informationwhile for do while ! set a counter variable to 0 ! increment it inside the loop (each iteration)
Week 7: Advanced Loops while Loops in C++ (review) while (expression) may be a compound (a block: {s) Gaddis: 5.7-12 CS 1428 Fall 2015 Jill Seaman 1 for if expression is true, is executed, repeat equivalent
More informationPaper 2 Problem-solving and Programming For Examination from 2015 SPECIMEN PAPER 1 hour 45 minutes
Cambridge International Examinations Cambridge Ordinary Level COMPUTER SCIENCE 2210/02 Paper 2 Problem-solving and Programming For Examination from 2015 SPECIMEN PAPER 1 hour 45 minutes Candidates answer
More informationLoops (while and for)
Loops (while and for) CSE 1310 Introduction to Computers and Programming Alexandra Stefan 1 Motivation Was there any program we did (class or hw) where you wanted to repeat an action? 2 Motivation Name
More informationPaper 2 Problem-solving and Programming For Examination from 2016 SPECIMEN PAPER 1 hour 45 minutes
Cambridge International Examinations Cambridge Ordinary Level *0123456789* COMPUTER SCIENCE 2210/02 Paper 2 Problem-solving and Programming For Examination from 2016 SPECIMEN PAPER 1 hour 45 minutes Candidates
More informationCPE 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
More informationSNS COLLEGE OF ENGINEERING
SNS COLLEGE OF ENGINEERING DEPARTMENT OF CSE Presented By Thillaiarasu.N SCRAMBLE 2 Solution 3 What is Pseudocode? 4 Consists of: Short Readable Formally styled English language Used for: Explaining the
More informationCambridge Assessment International Education Cambridge International General Certificate of Secondary Education. Published
Cambridge Assessment International Education Cambridge International General Certificate of Secondary Education COMPUTER SCIENCE 0478/21 Paper 2 MARK SCHEME Maximum Mark: 50 Published This mark scheme
More informationDecision 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
More informationSoftware Development Techniques. December Sample Exam Marking Scheme
Software Development Techniques December 2015 Sample Exam Marking Scheme This marking scheme has been prepared as a guide only to markers. This is not a set of model answers, or the exclusive answers to
More informationChapter 5. Repetition. Contents. Introduction. Three Types of Program Control. Two Types of Repetition. Three Syntax Structures for Looping in C++
Repetition Contents 1 Repetition 1.1 Introduction 1.2 Three Types of Program Control Chapter 5 Introduction 1.3 Two Types of Repetition 1.4 Three Structures for Looping in C++ 1.5 The while Control Structure
More informationLoop Structures. Loop Structures. Algorithm to record 5 TV programmes. Recall Structured Programming..3 basic control structures.
Loop Structures Recall Structured Programming..3 basic control structures Sequence Input -> Process -> Output Selection IF ENDIF SELECT CASE END SELECT Loop Structures DO WHILE LOOP DO LOOP UNTIL FOR NEXT
More informationMicrosoft Visual Basic 2005: Reloaded
Microsoft Visual Basic 2005: Reloaded Second Edition Chapter 4 Making Decisions in a Program Objectives After studying this chapter, you should be able to: Include the selection structure in pseudocode
More informationALGORITHMS AND FLOWCHARTS
ALGORITHMS AND FLOWCHARTS ALGORITHMS AND FLOWCHARTS A typical programming task can be divided into two phases: Problem solving phase produce an ordered sequence of steps that describe solution of problem
More informationAlgorithms. Abdelghani Bellaachia, CSCI 1121 Page: 1
Algorithms 1. Objectives... 2 2. Design You Solution... 2 3. Structure of an algorithm:... 3 4. Pseudocode:... 4 5. Example... 5 6. Selection or Conditional Execution... 8 7. Looping or Iteration... 9
More information