Computer Science 10" ADAMJEECOACHING.BLOGSPOT.COM COMPUTER SCIENCE 10TH - MULTIPLE CHOICE QUESTIONS => PROBLEM SOLVING AND ALGORITHM DESIGNING Chapter # 01 ‘ADAMJEECOACHING. BLOGSPOT.COM The step by step solution of any program is called: (a) A flowchart (b) Apseudo code (Vv Analgorithm (d) None of these Which of the following is not one of the steps in a programming project: (a) Planning the solution (b) Coding the program () Testing the program (d)V_ Selecting the hardware In preparing a program, one should first: (a)V_ Plan the solution (b) Documentation () Coding (d) Define the problem Problem solving steps of a program is called: (a) Top-down design (b) Flowchart (c) V_ Algorithm (d) Runtime error Apictorial representation of program is called: (a) VA flowchart (b) analgorithm (c) Apseudecode (d) None of these Step by step instructions to solve the C++ program is called: (a)V_ Algorithm (b) Flowchart (c) procedure (d) Allof these What does the <> symbol in a flowchart represent: (a)V_ decision (b) process (0) start/stop (d) predefined process PROBLEM SOLVING AND ALGORITHM DESIGNING - MULTIPLE CHOICE QUESTIONS Page |1Computer Science 10" ADANMJEECOACHING.BLOGSPOT.COM 8. 10. 11. 12. 13. “4. 15. What does an arrow represent in a flowchart? (a) Decision making (b) Vata flow (c) Start (d) Stop In a flowchart a calculation (process) is represented by: (a)V Arectangle (b) Arhombus () Aparallelogram (a) Acircle symbol is used to represent input and output operation in a flowchart. (a) Circle (b) Rectangle () Diamond (d)vParallelogram When an algorithm is written in the form of a programming language, it becomes a: (a) Flowchart (b) Vv. Program (c) Pseudo code (d) Syntax Asystem wherein items are added from one and removed from the other end. (a) Stack {b) Linked list (c)¥V Queue (d) Array Another name for 1-D arrays. (a)V¥_ Linear arrays (b) Lists () Horizontal array (d) Vertical array A data structure that follows the FIFO principle. (a)V. Queue (bo) ut (c) — Stack (d) Union The process of drawing a flowchart for an algorithm is called (a) Performance (b) Evaluation (c)_ Algorithmic representation (d)v_ Flowcharting PROBLEM SOLVING AND ALGORITHM DESIGNING — MULTIPLE CHOICE QUESTIONS Page |2Computer Science 10" ADANMJEECOACHING.BLOGSPOT.COM 16. 17. 18. 19. 20, 21. 22. 23. Which of the following is not an advantage of a flowchart? (a) Better communication (b) — Efficient coding (c) Systematic testing (d)V¥_ Improper documentation Which one of the following is the process of inserting an element in the stack? (a) Insert (b) Add ()v_ Push (d) None of the above Linear data structure arrange data in method. (a) Non-linear (b)V Linear (c) Structure (d) None of the above A data structure that follows the LIFO principle. (a) Queue (b) UL (c)v_ Stack (d) Union ‘Which one of the following is the process of deleting an element in the stack? (a) Delete {b)¥ Pop (Push (d) None of the above Which one of the following is the process of inserting an element in the queue? (a) Insert (b) Vv Enqueue () Add (d) None of the above Which one of the following is the process of deleting an element in the queue? (a)v Dequeue (b) Add (c) Enqueue (d) None of the above Rearrange a given array or list of elements is known as. (a) Inserting (b) Arranging ()_ Update (d)v Sorting PROBLEM SOLVING AND ALGORITHM DESIGNING — MULTIPLE CHOICE QUESTIONS Page |3Computer Science 10" ADAMJEECOACHING.BLOGSPOT.COM 24. 25. ‘Which data structure has a hierarchical structure? (a}V Tree (b) Stack (c) Queue (d) None of the above A data structure in which data items are not arranged in linear method: (a)V_ Non-linear (b) Linear () Structure (d) None of the above FOR MORE NOTES, MCQS & ONLINE TEST ADAMJEECOACHING.BLOGSPOT.COM PROBLEM SOLVING AND ALGORITHM DESIGNING — MULTIPLE CHOICE QUESTIONS Page |4COMPUTER SCIENCE 10TH - DETAILED QUESTION ANSWERS, => PROBLEM SOLVING AND ALGORITHM DESIGNING Chapter # 01 ‘ADAMJEECOACHING. BLOGSPOT.COM Q.1: What is problem solving? Ans, PROBLEMSOLVING: Problem solving is a procedure to figure out the solution of complex problems. Problem solving is the main process in computer programming, where programmers first understand the problem, plan the solution and then understand how to translate algorithm into something a computer can do, and finally how to write the specific syntax or code required by a computer to get the job done. Q.2: Define Problem? Ans. PROBLEM Problem sometimes referred as an issue, is any situation that occurs and is unexpected or prevents something from occurring. In programming a problem is considered as a matter which is difficult to solve, it is a complex task or routine. Q.3: What are the strategies of problem solving? Ans. PROBLEMSOLVING PROCESS: Finding a suitable solution for issues can be accomplished by the following the basic four step problem-solving process given below. 1 Define the problem. 2. Generate alternative solutions. 3. Evaluate and select an alternative. 4, Implement and follow up on the solution. * Define the Problem * Generate alternative solutions * Select an alternative © Implement the solution PROBLEM SOLVING AND ALGORITHM DESIGNING — DETAILED QUESTION ANSWERS. Page |1Computer Science 10" ADANJEECOACHING.BLOGSPOT.COM 1. DEFINE THE PROBLEM Specifically, the task of defining the problem consists of identifying what you know (input-given data), and what you want to obtain (output-the result). During this step, it is more important to understand described problem. GENERATE ALTERNATIVE SOLUTIONS Many alternative solutions to the problem should be generated to achieve the desired results. Generating multiple alternatives can enhance the value of best solution. So, it is good to generate a list of all possible solutions and evaluate to decide which one is the best for that particular problem. EVALUATE AND SELECT AN ALTERNATIVE Good problem-solving approach uses a series of considerations when selecting the best alternative. In this step, evaluate all possible solutions related to a target standard and select the best alternative. A particular alternative will solve the problem without causing other unanticipated problems. IMPLEMENT AND FOLLOW UP ONTHE SOLUTION The implementation of best solution also includes planning on what happens when something goes wrong with the selected solution. It is also important to follow up and track the results of solution at every stage of implementation. Q.4: Whats algorithm? ALGORITHM Ans. An algorithm is a procedure or formula for solving a problem. It can be defined as the set of well-defined step by step instructions to solve a program. In computer science an algorithm usually means a small procedure that solves a specific problem designs; algorithms are widely used throughout all areas of IT. There are two common methods to represent algorithm designs; pseudocode and flowcharts. PROBLEM SOLVING AND ALGORITHM DESIGNING — DETAILED QUESTION ANSWERS, Page [2Computer Science 10 Qs: Ans. Q6é: Ans. Q7: Ans. ADANMJEECOACHING.BLOGSPOT.COM Explain the role of algorithm in problem solving. OR Describe the advantages of algorithm. ROLE OF ALGORITHMIN PROBLEM SOLVING Algorithms give us the most ideal option of accomplishing a task in problem solving. Algorithms are used to find the best possible way of solving a problem. In doing so they improve the efficiency of a program. With the best algorithm, a computer program will be able to produce very accurate results. An algorithm can be used to improve the speed at which a program executes. ‘What are the qualities of a good algorithm? QUALITIES OF AGOOD ALGORITHM 1. Inputs and outputs should be defined exactly. 2. Every step in an algorithm must be clear, precise and unambiguous. 3. It should be effective among many different ways to solve a problem. 4. It shouldn't have computer code. Instead, the algorithm must be written in such a way that, it can be used in similar programming languages. ‘Write some examples of algorithm. ALGORITHM EXAMPLES “ALGORITHM 1: MAKING A CUP OF TEA Step 1: Start. Step 2: Put the teabag ina cup. Step 3: Fill the kettle with water. Step 4: Boil the water in the kettle. ‘Step 5: Pour some of the boiled water into the cup. Step 6; Add milk to the cup. Step 7: Add sugar to the cup. Step &: Stir the tea. Step 9: Drink the tea. Step 10: Stop PROBLEM SOLVING AND ALGORITHM DESIGNING — DETAILED QUESTION ANSWERS. Page |3Computer Science 10" ADANMJEECOACHING.BLOGSPOT.COM ALGORITHM 2: SUBTRACTION OF TWO NUMBERS. Step 1: Start ‘Step 2: Declare variables n1, n2 & sub Step 3: Read values n1 & n2 Step 4: Subtract n1 & n2 and assign the result to sub sub =nl-n2 Step 5: Display sub Step 6: Stop “ALGORITHM 3: ADDITION OF TWO NUMBERS Step 1: Start Step 2: Declare variables n1, n2 & sum Step 3: Read values nl & n2 Step 4: Add n1 & n2 and assign the result to sum sum =n1+n2 ‘Step 5: Display sum Step 6: Stop “ALGORITHM 4: MULTIPLICATION OF TWO NUMBERS Step 1: Start Step 2: Declare variables n1, n2 & mul Step 3: Read values n1 & n2 Step 4: Multiply n1 & n2 and assign the result to mul mul =n * n2 Step 5: Display mul Step 6: Stop PROBLEM SOLVING AND ALGORITHM DESIGNING — DETAILED QUESTION ANSWERS. Page |4Computer Science 10" ADANMJEECOACHING.BLOGSPOT.COM Qs: Q9: ALGORITHM 5: AREA OF CIRCLE Step 1: Start ‘Step 2: Declare variable r and area Step 3: Read value of r Step 4: Apply formula {Area = (3.142) * r * r} area = (3.142) *r*r Step 5: Display area Step 6: Stop ‘What is flowchart? FLOWCHART A flowchart is a pictorial representation of an algorithm, workflow or process, showing the steps as boxes of various kinds, and their order by connecting them with arrows. It is used ‘to show the sequence of steps and logic of solution toa given problem. Floweharts are used in analyzing, designing, documenting or managing a process or program in various fields. Define different symbols used in flowchart. FLOWCHART SYMBOLS 1. TERMINAL ORSTART/STOP The terminal symbol is used to indicate the beginning (START) and ending (STOP) in the program logic flow. 2. Process Process symbol is used to illustrate a process, action or an operation. These are represented by rectangles. PROBLEM SOLVING AND ALGORITHM DESIGNING — DETAILED QUESTION ANSWERS. Page |5Computer Science 10 ADANMJEECOACHING.BLOGSPOT.COM 3. Input / Output The input / output symbol is used to denote any type of input data or output information. 4. Decision The decision symbol is used in a flowchart to indicate a point at which a decision has to be made and a branch to one of two or more alternative points are possible: 5. Arrowsor Flowlines Flowlines with arrowheads are used to indicate the flow of operation. It shows the exact sequence in which the instructions are to be executed. ney Q.10: Write down the importance of flowchart in problem solving. Ans. IMPORTANCE OF FLOWCHART IN SOLVING A PROBLEM 1, Communication Flowcharts are better way of communicating the logic of a system. 2. Effective Analysis With the help of flowchart, problem can be analyzed in more effective way therefore reducing cost and wastage of time. 3. Efficient Coding The flowcharts act as a guide or blueprint during the systems analysis and program development phase. PROBLEM SOLVING AND ALGORITHM DESIGNING — DETAILED QUESTION ANSWERS. Page |6Computer Science 10 ADANJEECOACHING.BLOGSPOT.COM 4. Proper Debugging The flowchart helps in debugging a process. 5. Efficient Program Maintenance The maintenance of operating program becomes easy with the help of flowchart. It helps the programmer to put efforts more efficiently on that part. Q.11: Write down the example of flowchart. Ans. FLOWCHARTEXAMPLE Input Number 1 Number 2 ‘Sum = Number 1 + number 2 PROBLEM SOLVING AND ALGORITHM DESIGNING — DETAILED QUESTION ANSWERS. Page |7Computer Science 10" ADANJEECOACHING.BLOGSPOT.COM. Q.12: What are the differences between algorithm and flowchart? Ans. DIFFERENCES BETWEEN ALGORITHM & FLOWCHART ALGORITHM FLOWCHART It is step by step solution of program _| It is the diagrammatical representation which shows the flow of data. Text in common language is used in|Symbols and shapes are used in algorithm. flowchart. It is difficult to write and understand. _| It is easy to construct and understand Algorithm doesn't have any specific | Flowchart have specific rules for its rules. construction. Q.13; Define data structures. Ans. Data Structures: Data structure is a particular means of organizing and storing data in computers in such a ‘way that we can perform operations on the stored data more efficiently. Data structures have a wide and diverse scope of usage across the fields of Computer Science and Software engineering. Data structure may be linear of non-linear. Q.14: Describe linear data structure. Ans: LINEAR DATA STRUCTURE Linear data structure arranges the data ina linear fashion. The data elements are arranged sequentially such that the element is directly linked to its previous and the next elements. This data structure supports single-level storage of data. And hence, transfer of the data is achieved through a single run only. Examples of linear data structures are Stack, Queue, Array, etc. Q.15: Define stack and its operations. Ans, STACK Stackis a linear data structure that stores information in such a way that the last item stored is the first item retrieved. It is based on the principle of LIFO (Last-in-first-out). The stack in digital computers is a group of memory locations with a register that holds the address of ‘top of element. Stacks usually performs two operations. Push: It is used to insert an element on top of stack. Pop: It is used to delete an element from top of stack. PROBLEM SOLVING AND ALGORITHM DESIGNING — DETAILED QUESTION ANSWERS, Page |8Computer Science 10" ADANMJEECOACHING.BLOGSPOT.COM. Q.16: Define queue data structure and its operations. Ans. QUEUE- Queue is the type of linear data structure where the elements to be stored follow the rule of First in First Out (FIFO). In queue, the element that was added first is removed first) In ‘this data structure, both ends are used for the insertion and the removal of data. The two main operations of queue are enqueue and dequeue. Enqueue: It refers to the process where inserting an element is allowed to the collection of data. Dequeue: It refers to the process where removal of elements is allowed, which is the first element of queue. Q.17: Define array data structure and its operations. Ans. ARRAY: The array is the type of linear data structure that stores homogeneous (same type) elements at memory locations which are consecutive. The same types of objects are stored sequentially in an array. The main idea of anarray is that multiple data of the same type can be stored together. Before storing the data in an array, the size of the array has to be defined. The location of elements stored in an array has a numerical value called index to identify the element. Some operations of array are: Traverse: Go through the elements and print them. Search: Search for an element in the array by its value or its index. Update: Update the value of an existing element at a given index. Insert: Insert an element in array. Deletion: Delete an element from array. Sorting: Rearrange a given array or list of elements. Memory Locations 200 201 202 203 204 205 206 207 208 209 210 211 eG Gals TTT [ols Ts [3 [313159] 0123 4 5 6 7 8 9 10 11 Index PROBLEM SOLVING AND ALGORITHM DESIGNING — DETAILED QUESTION ANSWERS. Page |9Computer Science 10" ADAMJEECOACHING.BLOGSPOT.COM Q.18: Describe nonlinear data structure. Ans. NON-LINEAR DATA STRUCTURES: Non-linear data structures are those data structures in which data items are not arranged in a sequence. In this structure, each element can have multiple paths to connect to other elements. Non-linear data structures allow multi-level storage. Non-linear data structures are not easy to implement but are more efficient in utilizing computer memory. Examples of non-linear data structures are Tree, Graphs, etc. Q.19: Define tree data structure. Ans. TREE: Atree can be defined as a finite set of data items (nodes) in which data items are arranged in branches and sub-branches. It consists of various linked nodes and has a hierarchical tree structure that forms a parent-child relationship. In tree structure, the first node is called root node. The node connected to root node are called parent node and another node connected to parent node is called child node. Various types of trees have been developed ‘throughout the past decades, one of them are binary tree or binary search tree. Root Height of the tree Children Leaf nodes Q.20: Define graph data structure. Ans. GRAPH Graphs are used to solve many real-life problems. A graph is a non-linear data structure that has a finite number of vertices and edges, and these edges are used to connect the vertices. The vertices are used to store the data elements, while the edges represent the relationship between the vertices. The order of a graph is the number of vertices in the graph. The size PROBLEM SOLVING AND ALGORITHM DESIGNING — DETAILED QUESTION ANSWERS, Page | 10Computer Science 10" ADAMJEECOACHING.BLOGSPOT.COM of a graph is the number of edges in the graph. Two nodes are said to be adjacent if they are connected to each other by the same edge. There are two types of graphs: (a) Undirected graph (b) Directed graph Edge 7 () (8) Vertices (E) S©—O Q.21; Define undirected graph. Ans. UNDIRECTEDGRAPH An undirected graph is a graph in which all its edges have no direction. It can go in both ways between the two vertices. Q.22: Define directed graph. Ans. DIRECTEDGRAPH Adirected graph is a graph in which all its edges have a direction indicating what is the start vertex and what is the end vertex. FOR MORE NOTES, MCQS & ONLINE TEST ADAMJEECOACHING.BLOGSPOT.COM PROBLEM SOLVING AND ALGORITHM DESIGNING — DETAILED QUESTION ANSWERS. Page | 11Computer Science 10" ADANJEECOACHING.BLOGSPOT.COM COMPUTER SCIENCE 10TH - LABACTIVITIES => PROBLEM SOLVING AND ALGORITHM DESIGNING Chapter # 01 ‘ADAMJEECOACHING.BLOGSPOT.COM Q.1: Design an algorithm to find the greater number by taking two numbers as input. Step 1: Start Step 2: Read a, b Step 3: Ifa>bthen Display “A is the largest number". Otherwise Display “B is the largest number". Step 4: Stop. Q.2: Design an algorithm to find area of a triangle. Step 1: Start Step 2: Input base, height Step 3: Calculate area = 1/2 * base * height Step 4: Display "Area of Triangle =" area Step 5: Stop Q.3: Sort the following steps of the algorithm in correct order for baking a cake: SNo Before Sort After Sort 1. __ | Gather the ingredients. Start 2. End Gather the ingredients 3, Gteaea pan Mix together the ingredients to make the batter 4, __ | Preheat the oven Grease a pan a Put the pan in the oven Pour the batter into the pan [6 [start Preheat the pan 7. Pour the butter into the pan Put the pan in the oven ,__| When the timer goes off, take the pan | oo timer out of the oven 9. Set a timer When the timer goes off, take the pan out of the oven 10. | Mix together the ingredients to make |, the butter PROBLEM SOLVING AND ALGORITHM DESIGNING — LAB ACTIVITIES Page |1Computer Science 10" ADANJEECOACHING.BLOGSPOT.COM Q.4: Drawa flowchart to calculate gross salary by adding 20% house rent and 30% medical allowances in basic salary. Start ma Input basic salary - v Calculate house rent 20/100*basic salary x Calculate medical allowances = 30/100* basic salary ¥ Calculate gross salary = basic salary + house rent + medical allowances A Print gross salary L PROBLEM SOLVING AND ALGORITHM DESIGNING — LAB ACTIVITIES Page |2Computer Science 10" ADANMJEECOACHING.BLOGSPOT.COM Q.5. Drawa flowchart for all the algorithms given in this unit. Ans. Algorithm1: Makinga cup of tea Flowchart of the process. Start / Place the fresh water in a pot or kettle 7 ¥ Boil the water é. Put the black tea leaves in the that pot 7 4 Add milk inthat pot / Z Add Sugar in the pot / Boil for some time PROBLEM SOLVING AND ALGORITHM DESIGNING — LAB ACTIVITIES Page |3Computer Science 10% ADANMJEECOACHING.BLOGSPOT.COM. Algorithm 2: Sum of two numbers Flowchart of the process. Start Input num and num2 Calculate sum = num1 + num2 H Print sum Algorithm 3: Average of three numbers Flowchart of the process. Start Input num1, num2, num. ¥ Calculate avg = (num1 + num2 + num3)/3 Print avg PROBLEM SOLVING AND ALGORITHM DESIGNING — LAB ACTIVITIES Page |4Computer Science 10" ADANMJEECOACHING.BLOGSPOT.COM Algorithm 4: Volume of a box Flowchart of the process. Start /_ Input length, width, height / t Calculate volume = (length * width * height) J Print volume / Algorithm: Percent Calculate Flowchart of the process. Start Input part and total ¥ calculate percentage = (part/total) * 100 J Print percentage / PROBLEM SOLVING AND ALGORITHM DESIGNING — LAB ACTIVITIES Page |SComputer Science 10" ADAMJEECOACHING.BLOGSPOT.COM Q.6: Draw the following structures 4. Treewith sixnodes. (1) Q @ OY ® © 2. Graph with five nodes. @)—a) Vy b2 @ @® FOR MORE NOTES, MCQS & ONLINE TEST ADAMJEECOACHING.BLOGSPOT.COM PROBLEM SOLVING AND ALGORITHM DESIGNING — LAB ACTIVITIES Page |6