COMPUTER SCIENCE For Class 9" -1 0" Part-2 WI Punjab Textbook Board, Lahore.All rights are reserved with the Punjab Textbook Board. Lahore. Prepared by: Punjab Textbook Board, Lahore. Approved by: Federal Ministry of Education. Curriculum Wing, Islamabad. vide its letter No. F.1-10/2005-Maths (Comp. Se.) Dated July 8, 2006. CONTENTS a2 Chapter # Page ft 1 [PROBLEM SOLVING 1 2 |DATA TYPES, ASSIGNMENT AND 13 INPUT / OUTPUT STATEMENTS | 3 |CONTROL STRUCTURE 41 4 |ARRAYS 53 5 _|SUB-PROGRAM AND FILE HANDLING 61 6 —_|GRAPHICS IN BASIC ~ 7 |MIcRosoFT woRD 89 * — |cLossary no | + _|InDEx 123, | Syed Zulquenain Jaffery Assistant Professor COMSATS Institute of Information Technoloyy. Sector H-8, Islamabad Ms. Shahina Naz * Mr, Asif Ali Magsi Head. Department of Computer Science. Lecturer (Computer Science) Islamabad Model College for Girls, College for Boys, Islamabad. F-10,2, Islamabad. Editor Supervision Mirza Mubasher Baig * Mr. Mazhar Hayat Research Associate Subject Specialist Department of Computer Science. Punjab Textbook Board, Lahore. Lahore University of Management Sciences (LUMS), Lahore.Chapter 1 PROBLEM SOLVING 1.1 INTRODUCTION We solve problems and make decisions everyday at home, at work, at play, and even at the general store. Some problems and decisions are very challenging, and require a lot of thought, emotion, and research. However, whatever the nature of the Problem is, we always try to find multiple solutions so that we can have options to choose the best one. 1.2 PROBLEM-SOLVING METHOD Problem-solving is a skill which can be developed by following a well organized approach. Programming is also a problem solving activity. If you are a good problem solver, you have the potential to become a good programmer. Problem. solving methods are covered in many subject areas. Business students learn to solve problems with the related systems approach, while engineering and science students use the engineering and scientific methods. Programmers use the software development method. The following steps can be followed to solve any kind of problem: (i) Problem identification Gi) Specify requirements (Gil) Analyze the problem (iv) Design algorithm and draw flowchart (v) Write the program (Coding) (vi) Test and Debug the Program: (vii) Implement the program (viii) Maintain and update the program (ix) Document the program 1.2.1 Problem Identification « At this stage the problem being solved is observed carefully. Major areas of concern afe identified and irrelevant information is filtered out. Suppose we want to develop a simple calculator. Our major concern is how basic arithmetic operations (addition, subtraction, multiplication and division) are performed? How result should be displayed? How input should be accepted etc.? We are not interested in how the Sine ot Tan are calculated? How is the quadratic equation solved? And how are other mathematical operations performed? These are irrelevant to us, so we shall not bother about these. In this way, by filtering out irrelevant information we can concentrate on the actual problem. 1.2.2. Specify Requirements Most of the users can not explain their exact software requirements. They are uncertain about what they want to do with the software. So they appear with a vague set of requirements in mind which may lead to a wrong solution. This stage demands to make clear the user's requirements so that a proper solution could be suggested. This stage involves the formation of a 1 NOT FOR SALE - PESRPrequirements document which describes the features the system is expected t0 provide, the restrictions under which it must operate, and an abstract description of the software which provide a basis for design and implementation. 1.2.3. Analyze the Problem ‘At this stage the problem is decomposed mnto sub-problems. Rather on concentrating the bigger problem as a whole, we try to solve each sub-problem separately. This leads to a simple solution. This technique is known as top- down design (also called divide and conquer rule). Here we may ask certain questions to approach the right solution ew, (How many solutions are there.to the given problem? (i) Which one is the best solution? (iil) Can the problem be solved on computer? (iv) What are input and output? (v) How can the bigger problem be divided into. sub-problems? 1.2.4. Design Algorithm and Draw Flowchart Designing the algorithm requires to develop a finite list of steps to solve a problem. It is then verified that whether the algorithm solves che problem as intended or not. Writing algorithm is often the most difficule part of the problem-solving process. Most computer algorithms perform at least following three steps: (i) Get data (Input) (i) Perform computation (Processing) (iii) Display results (Output) Once the algorithm has been designed, it should be verified through desk checking, Desk Checking is an important part of algorithm design that is often overlooked. To desk check an algorithm, we must carefully perform teach algorithm step just as a computer would do and verify that the algorithm works as desired, The time and effort can be saved by locating and rectifying algorithm errors at this stage. ‘A program is a set of instructions given to the computer to solve a particular problem. Itis written in a programming language. Desk Checking is the process of carefully observing the working of an algorithm, on the paper, for some test data. Algorithm is provided a variable set of input for which the output is examined. Draw the Flowchart ‘After designing the algorithm, the next step is to draw a flowchart. Flowchart, in fact, maps the algorithm to a pictorial representation which helps in understanding the flow of control and 2 NOT FOR SALE - PESRPdata in the algorithm. We shall discuss in detail the way the flowchart is drawn, later in this chapter. 1.2.5 Write the Program (Coding) This step involves the conversion of an algorithm to a program, written in any programming language. For this purpose, the programmer must know’ the syntax of the programming language chosen. ‘The grammatical rules of a programming language to write programs are referred to as syntax of that programming language. 1.2.6 Test and Debug the Program This stage requires evaluating the program to verify that it works as desired, Don't rely on just one test case. Run the program several times using different sets of data, making sure that it works cortectly for every situation provided in the algorithm. If it is not producing desired results, then errors (bugs) must be pointed out and debugged. Debugging is the:process of finding and removing errors in the program. There can be three types of programming, errors; syntax errors, run time errors (execution errors), and logical errors. Debugging is the process of finding and removing errors in the program. Syntax Errors ‘A syntax error occurs when the program violates one or more grammatical rules of the programming language. These errors are detected at compile time i.c., when the translator (compiler or interpreter) attempts to translate the program. There can be many reasons, fot example trying to execute a wrong program statement of command such as typing PINT instead of PRINT statement; or trying to assign a value to.a constant such as 5 = count ete. Do You Know? Division by zero is undefined. Runtime Errors A runtithe error occurs when the program directs the computer to perform an illegal operation such as dividing a number by 2er0. Runtime errors are detected and displayed by the computer during the execution of a program. When a runtime error occurs, the computer will stop executing the program and may display a diagnostic message that helps in locating the error. Logical Errors Logic errors occur when a program follows a wrong logic. The translator (compiler or interpreter) does not report any error message for a logical error. These are the most difficult errors to locate. Logical errors can he identified by just looking at the wrong output of the program. Logic errors can only be detected by thoroughly testing the % NOT FOR SALE - PESRP13 program, observing all variables closely and testing each path of logic flow in the program. 1.2.7 Implement the Program Once the program has been as tested thoroughly, it must be installed ‘or put into operation at the site where it will be used. This is known as implementation of the program. 1.2.8 Maintain and Update the Program Program maintenance is an ongoing process of upgrading the program to accommodate new hardware of software requirements, and introducing minor improvements, Essentially, it is the expansion, updating and improvement of a program after its installation, Regular maintenance is essential to the continued usefulness of a program. A proper maintenance depends on the existence of complete documentation. 1.2.9 Document the Program Documentation is a detailed description of @ program's algorithm, design, coding method, testing, and proper usage. Documentation is valuable for the users who rely upon the program on a day-to-day basis, and for the programmer who may be called on to modify or update it. There are no universally accepted standards concerning what should be included in a program’s documentation. Although its contents will vary somewhat depending on the complexity of the program, in general, comprehensive documentation consists of the following: * A description of what the program is supposed to do (software requirement document). * A description of the problem solution (the algorithm). © A description of the program design, including any aids used (flowcharts, algorithms etc.). * A description of the prograi used and results obtained. 's testing process, including the test data © A description of all corrections, modifications, and updates made to the program since it was put into operation. © Auser manual (user guide). ALGORITHM An algorithm is a finite set of steps which, if followed, accomplish a particular task. An algorithm must be clear, finite and effective. The simplest form of algorithm is step-form algorithm (like a to-do list) It consists of a sequence of numbered steps 1.3.1. Strategy for Developing Algorithm Algorithm development involves the following steps to carry out. We can proceed to correct solution of a particular problem by adopting the following strategy. 4 NOT FOR SALE - PESRPStep 1: Investigation (i) Identify the processes. (i) Identify the major decisions. (iil) Identify the repetitions. (iv) _ Identify the variables. Step 2: Preliminary algorithm. (Devise a high-level (general) algorithm. (ii) Step through the algorithm. Does this "walk-through" reveal any major problems? If it does then correct the problems. Step 3: Refining the algorithm (i) Incorporate any refinements indicated in step 2. (i) Group together processes where appropriate. (ii) Group together variables where appropriate. (iv) Test the algorithm again by stepping through it. Let us consider the following example to understand the way of approaching a solution to a problem. Problem 1: You have to bake a cake in your house. Step-form Algorithm The following diagram shows the steps to follow to bake the cake. Step 1 Step 2 Step 4 Step 5 v Heat oven to 325°F Milk Flour Gather the ingredients Eogs S9¥=she —_ & Mix ingredients thoroughly ina bowl Pour the mixture into a baking pan Bake in the oven 50 minutes 3 NOT FOR SALE - PESRPStep 6 — Repeat Bake 5 minutes more Until cake tep springs back when touched in the canter Step 7 Coo! on arack before cutting ‘Step-form Algorithm: Baking a cake Problem 2 ‘Making tea: You have to make tea in your house. Step-form Algorithm ‘An initial attempt at an algorithm might be: 1. Put tea leaves in pot 2. Boil water 3. Add water to pot 4. Wait 5 minutes 5. Pour tea into cup First Refinement © These steps are probably not detailed enough to make tea. We therefore refine each step into a sequence of further simpler steps: Step 1: Put tea leaves in pot Te might he refined to 1.1 Open box of tea 1.2 Extract one spoorful of tea leaves 1.3. Put spoonful into por 1.4. Close box of tea Step 2: Boil water Iemighe be refined to 2.1 Fill kettle with water 2.2 Switch on kettle 2.3 Wait umtil water is boiled 24 Switch off kettle Step 5: Pour tea into cup Te might be refined to 5... Pour tea from pot into cup until eup is full ©) Second Refinement Some of the refined steps may be further refined. For example step 2 can be refined as: Step 2.1 Fill kettle with water Te might be refined to 6 NOT FOR SALE -PESRP2.1.1 Put kettle under tap 2.1.2 Turn on tap 2.13 Wait until kettle is full 2.14 Tum off tap Other steps may also require further refinement. After a number of refinements the robot is able to execute every step. Original Algorithm Eirst Refinement Second Refinement 1, Put tea leaves in 1.1 Open box of tea 1.1.1 Take tea box from shelf pot 1.1.2 Remove lid from box 1,2 Extract one spoonful 1.3 Put spoonful into pot 1.4 Close box of tea 1.4.1 Put lid on box 1.4.2 Replace tea box on shelf 1 Put kettle under tap 2.1.2 Turn on tap 2.1.3 Wait until ketcle is full 2.1.4 Turn off tap 2. Boil Water 2.1 Fill kettle with water 2.2 Switch on kettle 2.3 Wait until water boiled — 2.3.1 Wait until kettle whistles 3, Add water to pot. 24 Switch off kettle Warerio Pol’ 3.1 Pour water from kettle 4, Wait 5 Minutes sonal por is full 5. Pour tea into cup 5.1 Pour tea from pot into cup until cup is fall Example 1: Write an algorithm to find | Example 2: Write an algorithm to find the sum of first 50 natural numbers. the factorial ofa given number Algorithm Algorithm. BEGIN BEGIN SUM =0 fact = 1 N= n=l DO WHILE ev <=50) PRINT “Enter a number SUM = SUM +N INO a y FORn = Ltonum Ne fact = fact * n END DO NEXT a END PRINT fact END 3. NOT FOR SALE - PESRP.14 FLOWCHART Flowchart is the pictorial representation of an algorithm. It is a way of visually presenting the flow of data, the operations performed within the system and the sequence in which they are performed. The flowchart is similar to the layout plan of a building. As we know a designer draws a layout plan before starting construction on a building. Similarly, a programmer prefers to draw a flowchart prior to writing a edmputer program. As in the case of drawing of a layout plan, the flowchart.is drawn according to defined rules. 1.4.1 Symbols of Flowchart Flowcharts are usually drawn using some standard symbols; however, other special symbols can also be developed when required. The standard symbols which are frequently used in flowcharting are shown below: 8) Start/End of a flowchart Processing iT Input/ourput |t Flow lines FT Pre-defined Process LD) | tinerionsiubrrvins) eee Remarks 1.4.2. Guidelines for Drawing a Flowchart a. In drawing a flowchart, all necessary requirements should be listed in a logical order. b. The flowchart should be clear, neat and easy to follow. There should not be any ambiguity in understanding the flowchart. cc. The usual direction of the flowchart is from top to bottom or left to right. d. Only one flow line should come out fiom a process symbol. 8 NOT FOR SALE - PESRP14.3 144 d = ee or f Only one flow line must enter a decision symbol, but two flow lines, ‘one for each possible answer, must leave it. eee ‘Only one flow line is used in conjunction with terminal symbol. Ensure that the flowchart has a logical start and end. Write comments within Remarks symbol. We can use the remarks (annotation) symbol to describe steps more clearly. ~"| This is confidential data If the flowchart becomes complex, itis better to use connector symbols to reduce the number of flow lines. The intersection of flow lines should be avoided to make it more effective and clear. Ie is useful to test the validity of the flowchart by passing through it with a simple test data. Advantages Of Flowcharts The benefits of flowcharts are: () With the help of a flowchart, the logic of an algorithm can be described more effectively. (i) As flowcharts are part of the design document, hence maintenance of operational programs becomes easy. (iti) ‘The flowcharts act as a guide for the program development. Thetefore, they help the programmer to put efforts more efficiently on the underlying problem. (iv) The flowchart helps in debugging process. Limitations Of Flowcharts (i) It is difficult to draw flowcharts for complex problems. (ii) Tfalferations are required, the flowchart is to be redrawn. 5 Teo Sake peeExample 3: Draw a flowchart to find the | Example 4: Draw a flowchart to sum of first 50 natural numbers. find the factorial of a number am) SUM=0 1. Fill in the blanks: (i) The set of instructions given to the computer to solve a problem is called (i) The set of rules for writing programs in a programming language is known as, of the language. (iii) Flowchart is a representation of algorithm. (iv) An algorithm solves a problem in. number of steps. (v) During a problem is decomposed into multiple sub- problems. (vi) Debugging is the process of finding and removing ina program, (vii) Program refers to the installation of the program in the user environment. (viii) Occurrence of a error crashes the program. 2. Choose the correct answer: () — BASICisa: (a) High Level Language (b) Low Level Language (©) Assembly Language (d) Machine Language 10 NOT FOR SALE - PESRPGi) (ii) (iv) (w) (vi) (vii) (viii) (x) &) How many possible solutions are there for a problem? () One (b) Two (©) Three (@) Multiple Program upgradation refers to: (a) Program enhancement (b)_ Program identification (©) Program development (d)’ Program implementation ‘Which of the following tasks are performed by most of the algorithms? (a) Input (b) Output (©) Processing (@) All of these ‘Typographical errors in BASIC statements are: (2) Runtime errors (©) Logical errors (©). Syntax errors (@)_ Execution errors ‘The diamond symbol represents the: (a) Input/Output (b). Decision miaking (c)_ Processing (d) | Remfarks Division by zero is: (a) Syntax error (b) Logical error (©) Runtime error (@) Not an error Which of the following documents describe various features of the software and the way it is used? (a) Software requirement (b) Problem description specification (©) User manual (@)_ Algorithm Algorithm is a: (a) Requirement document (b) Design document (©). Test document (d)_ user guide The technique ‘Divide and Conquer’ is used to solve: (a) Simple problems (b) Complex problems (c)_ Large problems (d)_ Complex and large problems Write T for True and F for False statements. @ (i) (iii) (iv) @) (vi) (wii) (viii) (oo) Syntax errors occur due to wrong program logic. “Top-down design is followed to solve complex problems. Desk{checking is the process of verifying the working of an algorithri. Debugging is an important part of analysis Every stage of program development is documented. ‘A rectangle symbol is used for decision making in a flowchart. Requirement document is not helpful at development stage. The usual direction of flowchart is from right to left Annotation symbol is used for writing comments. ul NOT FOR SALE - PESRP- What do you mean by problem solving? Briefly describe the problem solving process. 5. What is debugging? How many types of errors can occur in a program? Describe briefly. 6. Define algorithm. Write a step-form algorithm for making a telephone call to your friend. 7. What are the advantages of flowchart? Discuss limitation of flowchart. 8 Draw flowchart to find the largest of three numbers. 9. Write an algorithm to calculate the area of a circle when the radius is given. (area = 3.14 * radius * radius) 10. Answer the following short questions: (i) List steps that should be followed to solve a problem. (i) Whats analysis? Describe its importance in solving a problem. (iii) What method should be adopted to solve complex problems? Discuss briefly. (iv) What do you mean by syntax of a programming language? Is it necessary to know the syntax for solving a problem on computer? (%) Differentiate runtime errors and logical errors. (vi) Why documentation is considered vital in. problem solving process? Give reasons. (vii) Is it necessary for an algorithm to solve a problem in finite number of steps? Ifyes, why? (vit) Write purpose of the following flowchart symbols: Dc n/m ) »o O (wi) (x) Compare flowchart and algorithm. (0) Write an algorithm to calculate the distance covered by a car moving at an average speed of v ms" in time t. The program should input average speed @ and time t, (Hi vt, where s is the distance traveled] () Program (ii) Syntax (ii) Pictorial (iv) Finite (v) Analysis (vi) Errors (vii) Implementation (viii) Runtime RB @ oa (i) od Gi) a iw) dw) oe wi) ob (vil) € (vii) @&® b @ d BSE fi) F Gi) TW) T & F wi) (vi) F (vit) Fo @) F @ T 2 NOT FOR SALE - PESRP