problem solving methodology class 11 questions and answers

• Book Solutions
• State Boards

NCERT Solutions Class 11 Computer Science Chapter 4 Introduction to Problem Solving

NCERT Solutions Class 11 Computer Science Chapter 4 Introduction to Problem Solving: National Council of Educational Research and Training Class 11 Computer Science Chapter 4 Solutions – Introduction to Problem Solving. NCERT Solutions Class 11 Computer Science Chapter 4 PDF Download.

NCERT Solutions Class 11 Computer Science Chapter 4: Overview

Question 3. Write the pseudocode to print all multiples of 5 between 10 and 25 (including both 10 and 25).

FOR EACH I := 10 TO 15

IF I % 5 :=0   THEN

Question 4. Give an example of a loop that is to be executed a certain number of times.

Answer: Suppose we certain number starting from 11 to 16. The loop will be executed as follow:

SET i: = 11

FOR i: = 11 to 16 do

Question 5. Suppose you are collecting money for something. You need ` 200 in all. You ask your parents, uncles and aunts as well as grandparents. Different people may give either ` 10, ` 20 or even ` 50. You will collect till the total becomes 200. Write the algorithm.

Step 1: Set need Money := 0

Step 2: While Loop (need Money <200)

Input money

Step 3: need Money : = need Money + money

Step 4: End Loop

Question 6. Write the pseudocode to print the bill depending upon the price and quantity of an item. Also print Bill GST, which is the bill after adding 5% of tax in the total bill.

INPUT all_Item

INPUT price_for_each_Item

COMPUTE bill :=totalItem * price_for_each_Item

COMPUTE tax := bill * (5 / 100)

COMPUTE bill_with_gst := bill + tax

PRINT bill_with_gst

Question 7. Write pseudocode that will perform the following: a) Read the marks of three subjects: Computer Science, Mathematics and Physics, out of 100 b) Calculate the aggregate marks c) Calculate the percentage of marks.

INPUT Computer_Science, maths, physics

COMPUTE aggregate := (Computer_Science + maths + physics) / 3

COMPUTE percentage := ((Computer_Science + math + physics) / 300) * 100

PRINT aggregate

PRINT percentage

Question8. Write an algorithm to find the greatest among two different numbers entered by the user.

Step1: READ num1

Step2: READ num2

Step3:IF (num1 > num2)

Question9 . Write an algorithm that performs the following: Ask a user to enter a number. If the number is between 5 and 15, write the word GREEN. If the number is between 15 and 25, write the word BLUE. if the number is between 25 and 35, write the word ORANGE. If it is any other number, write that ALL COLOURS ARE BEAUTIFUL.

Step 1: INPUT n

Step 2: IF n>5 And n<15 THEN

Step 3: PRINT “GREEN”

Step 4: ELSE IF n>15 And n<225 THEN

Step 5: PRINT “BLUE”

Step 6 : ELSE IF n>25 And n<35 THEN

Step 7: PRINT “ORANGE”

Step 8: ELSE

PRINT “ALL COLOURS ARE BEAUTIFUL”

Step 9: End IF

Question 10. Write an algorithm that accepts four numbers as input and find the largest and smallest of them.

Question11. Write an algorithm to display the total water bill charges of the month depending upon the number of units consumed by the customer as per the following criteria:

• for the first 100 units @ 5 per unit
• for next 150 units @ 10 per unit
• more than 250 units @ 20 per unit Also add meter charges of 75 per month to calculate the total water bill .

Step 1: INPUT units

Setp 2: SET bill := 0

Step 3: IF units > 250 THEN

COMPUTE bill := units * 20

IF units <= 100 THEN

COMPUTE bill := units * 5

COMPUTE bill := 100 * 5 + (units – 100) * 10

Step 4: END IF

Step 5: COMPUTE total_Bill := bill + 75

Step 6: PRINT total_Bil

Question 12. What are conditionals? When they are required in a program?

In programming conditionals are used for providing the condition to values, input and output. There are various conditional statements are there to evaluate the expression. Generally conditional statement give us a output in the form of true or false which is known as Boolean value.

Conditionals are required in program to check whether the value is satisfied with required output or not.

In case you are missed :- Previous Chapter Solution

Question 13. Match the pairs

Question14. Following is an algorithm for going to school or college. Can you suggest improvements in this to include other options?

Reach_School_Algorithm

b) Get ready

c) Take lunch box

d) Take bus

e) Get off the bus

f) Reach school or college

• Brush our teeth
• Do some exercise
• Take a bath
• Take a breakfast
• Take a lunch box
• Go to bus stand
• Get off the bus
• Reach school or college

Question 15. Write a pseudocode to calculate the factorial of a number (Hint: Factorial of 5, written as 5!=5 4 3 21 ×××× )

INPUT number

SET factorial := 1, i := 1

WHILE i<= number DO

COMPUTE factorial := factorial * i

INCREASE i by 1

PRINT factorial

Question 16. Draw a flowchart to check whether a given number is an Armstrong number. An Armstrong number of three digits is an integer such that the sum of the cubes of its digits is equal to the number itself. For example, 371 is an Armstrong number since 3**3 + 7**3 + 1**3 = 371.

Question 17. Following is an algorithm to classify numbers as “Single Digit”, “Double Digit” or “Big”. Classify_Numbers_Algo

INPUT Number

IF Number < 9

“Single Digit”

 Else If Number < 99

“Double Digit”

Verify for (5, 9, 47, 99, 100 200) and correct the algorithm if required.

For given data,

5 and 9 are single digit number, so it will print “single digit”

47 and 99 are double digit number, so it will print “double digit”

100 and 200 is a three digit number, so it will print “big”

Correct algorithm:

Step 1: INPUT Number

Step 2: IF Number <= 9

Step 3: Else If Number <= 99

Step 4: Else

Step 5: End IF

Question 18. For some calculations, we want an algorithm that accepts only positive integers upto 100.Accept_1to100_Algo

IF (0<= Number) AND (Number <= 100)

a) On what values will this algorithm fail?

b) Can you improve the algorithm?

This algorithm fails at value 0. Because in condition we specify “greater than equal to operator”. So it will accept zero also.

IF (0<Number) AND (Number <= 100)

In case you are missed :- Next Chapter Solution

Leave a Reply Cancel reply

Your email address will not be published. Required fields are marked *

Save my name, email, and website in this browser for the next time I comment.

We have a strong team of experienced Teachers who are here to solve all your exam preparation doubts

Icse class 10 physics sample paper 2025 solutions, 2025 solved icse specimen paper class 10 english paper 1, tripura board class 6 bengali solutions chapter 11 ছেলেবেলা, assam scert class 8 geography and economics chapter 2 solutions.

Sign in to your account

Username or Email Address

Remember Me

Introduction to Problem Solving Class 11 Notes | CBSE Computer Science

Latest Problem Solving Class 11 Notes includes Problem Solving, steps, algorithm and its need, flow chart, pseudo code with lots of examples.

• 1 What is Problem Solving?
• 2 Steps for problem solving
• 3 What is Algorithm?
• 4 Why do we need Algorithm?
• 5.1 Flow chart
• 5.2 Flow Chart Examples
• 5.3 Pseudo code
• 5.4 Pseudo Code Example
• 6.1 Selection
• 6.2 Algorithm, Pseudocode, Flowchart with Selection ( Using if ) Examples
• 6.3 Repetition
• 6.4 Algorithm, Pseudocode, Flowchart with Repetition ( Loop ) Examples
• 7 Decomposition

What is Problem Solving?

Problem solving is the process of identifying a problem, analyze the problem, developing an algorithm for the identified problem and finally implementing the algorithm to develop program.

Steps for problem solving

There are 4 basic steps involved in problem solving

Analyze the problem

• Developing an algorithm
• Testing and debugging

Analyzing the problem is basically understanding a problem very clearly before finding its solution. Analyzing a problem involves

• List the principal components of the problem
• List the core functionality of the problem
• Figure out inputs to be accepted and output to be produced

Developing an Algorithm

• A set of precise and sequential steps written to solve a problem
• The algorithm can be written in natural language
• There can be more than one algorithm for a problem among which we can select the most suitable solution.

Algorithm written in natural language is not understood by computer and hence it has to be converted in machine language. And to do so program based on that algorithm is written using high level programming language for the computer to get the desired solution.

Testing and Debugging

After writing program it has to be tested on various parameters to ensure that program is producing correct output within expected time and meeting the user requirement.

There are many standard software testing methods used in IT industry such as

• Component testing
• Integration testing
• System testing
• Acceptance testing

What is Algorithm?

• A set of precise, finite and sequential set of steps written to solve a problem and get the desired output.
• Algorithm has definite beginning and definite end.
• It lead to desired result in finite amount of time of followed correctly.

Why do we need Algorithm?

• Algorithm helps programmer to visualize the instructions to be written clearly.
• Algorithm enhances the reliability, accuracy and efficiency of obtaining solution.
• Algorithm is the easiest way to describe problem without going into too much details.
• Algorithm lets programmer understand flow of problem concisely.

Characteristics of a good algorithm

• Precision — the steps are precisely stated or defined.
• Uniqueness — results of each step are uniquely defined and only depend on the input and the result of the preceding steps.
• Finiteness — the algorithm always stops after a finite number of steps.
• Input — the algorithm receives some input.
• Output — the algorithm produces some output.

What are the points that should be clearly identified while writing Algorithm?

• The input to be taken from the user
• Processing or computation to be performed to get the desired result
• The output desired by the user

Representation of Algorithm

An algorithm can be represented in two ways:

Pseudo code

• Flow chart is visual representation of an algorithm.
• It’s a diagram made up of boxes, diamonds and other shapes, connected by arrows.
• Each step represents a step of solution process.
• Arrows in the follow chart represents the flow and link among the steps.

Flow Chart Examples

Example 1: Write an algorithm to divide a number by another and display the quotient.

Input: Two Numbers to be divided Process: Divide number1 by number2 to get the quotient Output: Quotient of division

Step 1: Input a two numbers and store them in num1 and num2 Step 2: Compute num1/num2 and store its quotient in num3 Step 3: Print num3

• Pseudo code means ‘not real code’.
• A pseudo code is another way to represent an algorithm.  It is an informal language used by programmer to write algorithms.
• It does not require strict syntax and technological support.
• It is a detailed description of what algorithm would do.
• It is intended for human reading and cannot be executed directly by computer.
• There is no specific standard for writing a pseudo code exists.

Keywords used in writing pseudo code

Pseudo Code Example

Example:  write an algorithm to display the square of a given number.

Input, Process and Output Identification

Input: Number whose square is required Process: Multiply the number by itself to get its square Output: Square of the number

Step 1: Input a number and store it to num. Step 2: Compute num * num and store it in square. Step 3: Print square.

INPUT num COMPUTE  square = num*num PRINT square

Example: Write an algorithm to calculate area and perimeter of a rectangle, using both pseudo code and flowchart.

INPUT L INPUT B COMPUTER Area = L * B PRINT Area COMPUTE Perimeter = 2 * ( L + B ) PRINT Perimeter

Flow of Control

An algorithm is considered as finite set of steps that are executed in a sequence. But sometimes the algorithm may require executing some steps conditionally or repeatedly. In such situations algorithm can be written using

Selection in algorithm refers to Conditionals which means performing operations (sequence of steps) depending on True or False value of given conditions. Conditionals are written in the algorithm as follows:

If <condition> then                 Steps to be taken when condition is true Otherwise                 Steps to be taken when condition is false

Algorithm, Pseudocode, Flowchart with Selection ( Using if ) Examples

Example: write an algorithm, pseudocode and flowchart to display larger between two numbers

INPUT: Two numbers to be compared PROCESS: compare two numbers and depending upon True and False value of comparison display result OUTPUT: display larger no

STEP1: read two numbers in num1, num2 STEP 2: if num1 > num2 then STEP 3: display num1 STEP 4: else STEP 5: display num2

INPUT num1 , num2 IF num1 > num2 THEN                 PRINT “num1 is largest” ELSE                 PRINT “num2 is largest” ENDIF

Example: write pseudocode and flowchart to display largest among three numbers

INPUT: Three numbers to be compared PROCESS: compare three numbers and depending upon True and False value of comparison display result OUTPUT: display largest number

INPUT num1, num2, num3 PRINT “Enter three numbers” IF num1 > num2 THEN                 IF num1 > num3 THEN                                 PRINT “num1 is largest”                 ELSE                                 PRINT “num3 is largest”                 END IF ELSE                 IF num2 > num3 THEN                                 PRINT “num2 is largest”                 ELSE                                 PRINT “num3 is largest”                 END IF END IF

• Repetition in algorithm refers to performing operations (Set of steps) repeatedly for a given number of times (till the given condition is true).
• Repetition is also known as Iteration or Loop

Repetitions are written in algorithm is as follows:

While <condition>, repeat step numbers                 Steps to be taken when condition is true End while

Algorithm, Pseudocode, Flowchart with Repetition ( Loop ) Examples

Example: write an algorithm, pseudocode and flow chart to display “Techtipnow” 10 times

Step1: Set count = 0 Step2: while count is less than 10, repeat step 3,4 Step 3:                  print “techtipnow” Step 4:                  count = count + 1 Step 5: End while

SET count = 0 WHILE count<10                 PRINT “Techtipnow”                 Count = count + 1 END WHILE

Example: Write pseudocode and flow chart to calculate total of 10 numbers

Step 1: SET count = 0, total = 0 Step 2: WHILE count < 10, REPEAT steps 3 to 5 Step 3:                  INPUT a number in var Step 4:                  COMPUTE total = total + var Step 5:                  count = count + 1 Step 6: END WHILE Step 7: PRINT total

Example: Write pseudo code and flow chart to find factorial of a given number

Step 1: SET fact = 1 Step 2: INPUT a number in num Step 3: WHILE num >=1 REPEAT step 4, 5 Step 4:                  fact = fact * num Step 5:                  num = num – 1 Step 6: END WHILE Step 7: PRINT fact

Decomposition

• Decomposition means breaking down a complex problem into smaller sub problems to solve them conveniently and easily.
• Breaking down complex problem into sub problem also means analyzing each sub problem in detail.
• Decomposition also helps in reducing time and effort as different subprograms can be assigned to different experts in solving such problems.
• To get the complete solution, it is necessary to integrate the solution of all the sub problems once done.

Following image depicts the decomposition of a problem

2 thoughts on “Introduction to Problem Solving Class 11 Notes | CBSE Computer Science”

SO HELPFUL AND BEST NOTES ARE AVAILABLE TO GAIN KNOWLEDGE EASILY THANK YOU VERY VERY HEPFUL CONTENTS

THANK YOU SO MUCH FOR THE WONDERFUL NOTES

Leave a Comment Cancel Reply

Your email address will not be published. Required fields are marked *

Save my name, email, and website in this browser for the next time I comment.

• Class 6 Maths
• Class 6 Science
• Class 6 Social Science
• Class 6 English
• Class 7 Maths
• Class 7 Science
• Class 7 Social Science
• Class 7 English
• Class 8 Maths
• Class 8 Science
• Class 8 Social Science
• Class 8 English
• Class 9 Maths
• Class 9 Science
• Class 9 Social Science
• Class 9 English
• Class 10 Maths
• Class 10 Science
• Class 10 Social Science
• Class 10 English
• Class 11 Maths
• Class 11 Computer Science (Python)
• Class 11 English
• Class 12 Maths
• Class 12 English
• Class 12 Economics
• Class 12 Accountancy
• Class 12 Physics
• Class 12 Chemistry
• Class 12 Biology
• Class 12 Computer Science (Python)
• Class 12 Physical Education
• GST and Accounting Course
• Excel Course
• Tally Course
• Finance and CMA Data Course
• Payroll Course

Interesting

• Learn English
• Learn Excel
• Learn Tally
• Learn GST (Goods and Services Tax)
• Learn Accounting and Finance
• GST Tax Invoice Format
• Accounts Tax Practical
• Tally Ledger List
• GSTR 2A - JSON to Excel

Are you in school ? Do you love Teachoo?

We would love to talk to you! Please fill this form so that we can contact you

• MCQ questions (1 mark each)
• True or False Questions (1 mark each)
• Fill in the Blanks Questions (1 Mark each)
• Very Short Answer Type Questions (1 Mark each)
• Short Answer Type Questions (2 Marks each)
• Long Answer Type Questions (3 Marks each)

Steps for Problem Solving

Last updated at April 16, 2024 by Teachoo

• Analyzing the Problem: Involves identifying the problem , inputs the program should accept and the desired output of the program.
• Developing an Algorithm: The solution to the problem represented in natural language is called Algorithm. For a given problem, more than one algorithm is possible and we have to select the most suitable solution.
• Coding: Different high level languages can be used for writing the code based on the algorithm developed.
• Testing and Debugging: To ensure that the software meets all the business and technical requirements and works as expected . The errors or defects found in the testing phases are debugged or rectified and the program is again tested . This continues till all the errors are removed from the program.  

Davneet Singh

Davneet Singh has done his B.Tech from Indian Institute of Technology, Kanpur. He has been teaching from the past 14 years. He provides courses for Maths, Science, Social Science, Physics, Chemistry, Computer Science at Teachoo.

Hi, it looks like you're using AdBlock :(

Please login to view more pages. it's free :), solve all your doubts with teachoo black.

• Trending Now
• Foundational Courses
• Data Science
• Practice Problem
• Machine Learning
• System Design
• DevOps Tutorial

CBSE Class 11 | Concepts of Programming Methodology

• CBSE Class 11 | Problem Solving Methodologies
• Best Courses on Competitive Programming
• CBSE Class 11 | Computer Science - Python Syllabus
• CBSE Class 12 | Computer Science - Python Syllabus
• Object Oriented Programming | Set 1
• CBSE Class 11 Revision Notes
• CBSE Class 12th Economics Previous Year Papers
• CBSE Class 12 Computer Science (Self-Paced Course)
• CBSE Revision Notes for Class 12
• CBSE Class 10 Revision Notes
• CBSE Class 11 Maths Formulas
• CBSE Class 8 History Revision Notes
• CBSE Class 7 History Revision Notes
• Programming Tutorial | Introduction, Basic Concepts, Getting started, Problems
• CBSE Class 11 Maths Notes
• CBSE Class 12 Economics Previous Year Question Paper
• CBSE Class 9 Maths Revision Notes
• CBSE Class 10 Economics Notes
• NCERT Solutions for CBSE Class 12 Biology

Inrtoduction :

Programming methodology is the process of designing, writing, testing, and maintaining computer programs. It encompasses various concepts and techniques that programmers use to develop software applications efficiently and effectively.

Programming is all about solving a particular problem through computerized codes. Whether it be a problem of inventory management at any shopping complex, marks evaluation of OMR sheets, running of a remote car, or even running of a missile. Thus the scope of programming ranges from very simpleton tasks to extremely complicated ones. But behind all the codes, one parameter is common, that is, to handle and solve the problem efficiently. As one can’t learn to fly an aeroplane simply by watching it flying, one has to actually learn it. Similarly to become a proficient coder, one has to actually do the codes. And, the task of coding is extremely easy once one learns how to apply the logic for problem solving. Computer Programming comprises of the fundamental entities which are writing, testing, troubleshooting, debugging, and maintaining of a computer program.

• Writing involves writing down on a paper what is the desired output of the code. This can easily be done by drawing a flowchart which depicts all the steps involved from starting to end. Then writing also involves writing the first copy of the course actually onto the corresponding software. Then the written code has to be tested.
• Once tested, if there are some errors, then those errors has to be removed. This process is called troubleshooting.
• To determine the exact location of the error in the code is executed through a process called debugging.
• After successful completion of all these steps, the program is being executed to obtain the desired result. This is called running the program.

A program is called an efficient program only if it gives correct output corresponding to every input, including the wrong input. The systematic approach to write such an efficient article involves two steps: a) Program Structure and b) Program Representation. While the former is implemented by using bottom-up or top-down approach and is termed as “popular approach” ; the latter is used to make the code more readable and comprehensible.

Some of the key concepts of programming methodology include:

• Algorithms: An algorithm is a step-by-step procedure for solving a problem or performing a task. Programmers use algorithms to develop the logic for their programs and ensure that they run efficiently and correctly.
• Data structures: Data structures are ways of organizing and storing data in a computer. Programmers use data structures to optimize the storage and retrieval of data within their programs.
• Object-oriented programming (OOP): OOP is a programming paradigm that focuses on objects, which are instances of classes that encapsulate data and behavior. OOP allows programmers to create modular, reusable, and maintainable code.
• Functional programming: Functional programming is a programming paradigm that emphasizes the use of functions to perform computations. Functional programming can improve code clarity, maintainability, and reliability.
• Software design patterns: Software design patterns are reusable solutions to common programming problems. They can help programmers write more efficient and maintainable code.
• Code testing and debugging: Programmers use testing and debugging techniques to ensure that their code runs correctly and efficiently. This includes techniques such as unit testing, integration testing, and system testing.

Why need Programming Methodology ?

Programming methodology is essential for several reasons:

• Efficiency: Programming methodology provides a systematic approach to designing and developing software applications, which can lead to more efficient and effective code. By following best practices and established techniques, programmers can optimize their code for performance, scalability, and maintainability.
• Reusability: Programming methodology emphasizes the use of modular and reusable code, which can save time and resources in the long run. By developing code that can be easily adapted and reused, programmers can avoid duplicating efforts and create applications more quickly.
• Quality assurance: Programming methodology includes techniques for testing and debugging code to ensure that it runs correctly and efficiently. By using these techniques, programmers can catch errors and bugs early in the development process, leading to higher-quality software applications.
• Collaboration: Programming methodology provides a common language and set of tools that programmers can use to collaborate on software projects. By using established practices and techniques, programmers can communicate more effectively and work together more efficiently.
• Innovation: Programming methodology provides a framework for innovation and experimentation. By using established techniques and best practices as a starting point, programmers can build on existing knowledge and create new solutions to complex problems.

What is an efficient or good program ?

A good program is one which produces faster and accurate results and should occupy less space in the computer memory. This constraint on the memory space is often termed as memory constraints. The eminent programmers of the world have agreed upon a list of habits which are considered good for programming. This list contains:

• Use library functions to make programs more powerful For Example:
• Follow simplicity to maintain the clarity of expression For Example:
• We can simplify it and write as:
• Avoid program tricks usage, the meaning of whose is difficult to comprehend by the user.
• A meaningful name for a data object (variable) and function should be used.
• Meaningful names of constants should be chosen.
• Similar names like book, bookkeeper or library, librarian should be avoided.
• One letter identifiers like a, b, c should be avoided. Instead use more relevant names like age, name, first_name etc
• Comments: To enhance the readability of a program, comments are used. These are used to embed programmer-readable annotations in the original or source code of a program. These comments are profoundly important for the programmer but are simply overlooked by the compilers and interpreters. Comments should be added in the program in simple English language where they denote why a particular function has been used in the program or to specify the reason to use any particular data object or function in the code. Comments are generally categorized into two categories, viz, “Block Comments” and “Line Comments”. Line comments are single line comments while block comments are usually multi line comments. The symbols to denote block comments and line comments are different in different languages. However, the symbol for block comments can also be used for line comments. In python for example, Block comments are implemented by “”” and “”” while line comments are implemented by #. Lets take an example:

“Write a program using while loop in python to print a sequence of numbers from 1 to 50. while (n < 50); # While loop print n n = n + 1

• Indentation: Indentation is defined as the process of leading white space (tabs and spaces) at the beginning of each statement. It is used to determine the group of a statement. Lets take an example:

# Let Anshul and Vivek denote age of two brothers If Anshul > Vivek print ‘ Anshul is elder ‘ # Block 1 else: print ‘Vivek is elder’ # Block 2

• In this example, the ‘if’ block being used is a type of code block. If the ‘if’ condition evaluates to true, the Block 1 is executed, else (otherwise) Block 2 is executed. Though, the individual blocks can have multiple lines, but it’s conspicuous that a proper indentation makes the visibility of a particular block easier and simpler.

Characteristics of Good Programming

What happens, if we bury a seed of mango under the earth. After many years a mango tree will be grown at that place. Well, it’s a very fundamental thing. The concept of the idea is that ‘input determines the output’. And this concept applies even in programming. To yield/provide correct and desired output, we need to feed/provide the computer with proper and correct instruction set. The characteristics of a good program are as follows :

• Flexibility: It should be possible to accommodate modifications in the program without having the requirement to write the entire code again. The program should be able to serve multiple purposes. For instance, CAD (Computer Aided Design) software can efficiently be used to serve diverse fields like engineering drafting, industrial art, fabric designing, printing circuit layout and designing, architectural drawing etc. Most softwares are developed for a particular period and updations are required to make the software adaptable for serving new purposes as well.
• User Friendly: User friendly programs are those programs which can easily be understood by a beginner. The interaction between user and program should be easy to understand. The commands in the program like to input data, to print result, etc. must easily be comprehensible by the naive user.
• Portability: The ability of a program to run on different operating systems without having any or minimum changes is termed as the portability of the program or application. With the rise of numerous platforms having different operating systems embedded within them, and with the availability of various hardware and softwares, portability is something which is being taken care of by every application developer these days.Without portability, a program highly usable for one platform becomes obsolete for another. Program developed in high level languages are generally more portable than programs developed in assembly level languages.
• Reliability: Reliability of a program refers to its ability to perform its intended function accurately along with certain modifications. The ability of a program to handle exceptions of wrong input or no input is one of the fundamental behaviors which define reliability. Although, the program is not expected to produce correct result in these exceptions but it should be able enough to provide an error message. A program equipped with such a characteristic is called a reliable program.
• Self-Documenting Code: A self-documenting code is the source code, in which suitable names for the identifiers are being used. Proper names for the identifiers makes it easier for the user to understand the functionality of a particular variable or consonant (identifier). Hence, it is advisable that every good program must have a self-documenting code.

Modular Approach to Programming

Often there are very long codes in the practical world. These codes are written to perform various functions or tasks. Now, an efficient program or code is one where the lengthy code is being divided into different sections/modules. This process of dividing a long code into different sub codes is called modular approach to programming. These different modules are often termed as functions in a program. Take for an Example: Let the code below represents a program to evaluate percentage of a student in 10th class exam.

Now, the above program is a brief illustration of how a lengthy program can be even more difficult to operate with. Now, as per the modular approach, the above program looks like:

This is called a modular approach to programming and should be followed with long programs.

Documentation and Program Maintenance

In the modular approach of programming we saw that different modules help to deal with the program in an efficient way. In the pragmatic world, where the codes are longer than usual, different modules of a same program are developed by different departments of the organization. These modules are thus required to be properly documented and maintained so that each department can use them efficiently. This procedure is called documentation and maintenance of a program. Guidelines for a good document are as follows:

• It should not be ambiguous.
• Repetition of documents should be avoided.
• While preparing the document, industrial standards should be followed.
• Regular updation of documents should be done.
• Outdated documents should either be removed or updated.
• Helps to track the complete program in a modular way.
• Easier maintenance
• Enhances quality of the software
• Code becomes comprehensible to developer and others as well.
• Makes user – training easier
• If the first developer leaves the job in between then the new developer can easily get acquainted with the ongoing work.
• User manual: It is like a ‘How to use’ guide for the end users.
• Operational Manual: It contains all the operations and their inter dependencies which are being used in the program.
• Design Document: It enlists all the design aspects of the program and contains diagrams like data flow, entity relationships etc.
• Requirement Document: It enlists the requirements to run the software efficiently.
• Technical Document: Components like program codes, algorithms, functional modules etc. are listed in this document.
• List of Known Bugs Document: In this document those bugs or errors are listed which were discovered later and thus couldn’t be removed from the software.

Errors and their types

Errors are unwanted aberration that occur in a program because of illegal operation performed by the developer or user of the program. Errors are also termed as ‘bug’ in programming language. They are not detected until the program is compiled or executed. The common types or errors are as follows:

• Syntax Errors: Syntax errors or compile time errors are errors which occur when the proper writing rules of a particular language are not followed. Each language has a set of instructions which has to be followed while writing a code in that particular language. These errors are called syntax errors. Since these errors are detected by compiler at the time of compilation, thus these are also called compile time errors. Example:
• Notice that the “while” keyword in above code is not spelled correctly. These type of errors are called Syntax errors.
• Run Time Errors: These are errors which occur while the program is being executed, hence also called execution time errors. These errors result in abrupt completion of the program or the program may also enter an endless loop. Example:
• Notice that the second number is by default set to zero. Now a number divided by zero results in infinity which is not known. Such errors are called runtime errors.
• Logical Errors: These errors as self explanatory by its name, occur due to the implementation of incorrect logic by the developer of the program. These errors are not detected while compiling or executing the program. Example:
• Now, as per the desired goal, the above program is expected to give the average of two numbers x and y. But it doesn’t produces the desired result. Because firstly, y is being divided by 2 and the result is then added to x. Thus incorrect logic is there. As per the correct logic, the developer should have written :
• These types of errors are called logical errors or semantic errors .

Please Login to comment...

Similar reads.

• School Programming

Improve your Coding Skills with Practice

What kind of Experience do you want to share?

Introduction to Problem Solving Class 11 MCQ

Teachers and Examiners ( CBSESkillEduction ) collaborated to create the Introduction to Problem Solving Class 11 MCQ . All the important Information are taken from the NCERT Textbook Computer Science (083) class 11 .

1. Computers cannot solve problems on their own. We must provide clear, step-by-step directions on how to solve the issue, this solving technique is known as ____________. a. Problem Solving  b. Problem Addressing c. Problem Analysis d. None of the above

2. ___________ is the process of identifying a problem, developing an algorithm for the identified problem and finally implementing the algorithm to develop a computer program. a. Problem Solving  b. Problem Addressing c. Problem Analysis d. None of the above

3. It is essential to device a solution before writing a program code for a given problem. The solution is represented in natural language and is called an ___________. a. Problem b. Algorithm  c. Problem Analysis d. None of the above

4. After finalizing the algorithm, we need to convert the algorithm into the_________. a. Format which can be understood by the computer b. High level programming language c. Both a) and b)  d. None of the above

5. What are the different type of testing. a. Component testing b. Integration testing c. System testing & Acceptance testing d. All of the above 

6. The developed programme needs to pass different parameter __________. The programme needs to fulfil the user’s requirements. It must respond in the anticipated amount of time. a. Method b. Testing  c. Error d. None of the above

7. To complete each activity in a computer, we follow a sequence of steps. This sequence of steps is known as ________. a. Problem b. Algorithm  c. Problem Analysis d. None of the above

8. ____________ is the act of locating and fixing problems in software code that could lead to unexpected behavior or crashes. These errors are sometimes referred to as “bugs.” a. Algorithm b. Problem Solving c. Debugging  d. All of the above

9. Why do we need an Algorithm? a. Accuracy b. Minimized mistakes c. Best possible solution d. All of the above 

10. Writing an algorithm is mostly considered as a ________. a. First step of programming  b. Second step of programming c. Third step of programming d. None of the above

11. Purpose of using algorithm? a. Increase the reliability b. Accuracy of the program c. Efficiency of obtaining solutions d. All of the above 

12. Characteristics of a good algorithm. a. Precision & Uniqueness b. Finiteness c. Input & Output d. All of the above 

13. Before implementing algorithm, the programmer should __________ first. a. Analyze the problem b. Identify the problem c. Both a) and b)  d. None of the above

14. A __________ is a visual representation of an algorithm. a. Flowchart  b. Pseudocode c. Algorithm d. None of the above

15. A flowchart is a diagram made up of __________. a. Boxes b. Diamonds c. Shapes d. All of the above 

16. Start/End also called _________ symbol, it indicates where the flow starts and ends. a. Terminator  b. Decision c. Input / Output d. Arrow

17. Process is also called ________, it represents a process, action, or a single step. a. Terminator b. Action Symbol  c. Decision d. Input/ Output

18. A __________ or branching point, usually a yes/no or true/ false question is asked, and based on the answer, the path gets split into two branches. a. Terminator b. Action Symbol c. Decision  d. Input/ Output

19. _________ is also called data symbol, this parallelogram shape is used to input or output data. a. Terminator b. Action Symbol c. Decision d. Input/ Output 

20. ___________ connector to show order of flow between shapes. a. Terminator b. Action Symbol c. Decision d. Arrow 

21. A ___________ is another way of representing an algorithm. It is considered as a non-formal language that helps programmers to write algorithm. a. Flowchart b. Pseudocode  c. Algorithm d. None of the above

22. The word “pseudocode” means ___________. a. Not real code  b. Real code c. Temporary code d. None of the above

23. It is necessary to run different input values through the algorithm’s phases in order to verify. This process of taking an input and running it through all of the algorithm’s steps is commonly referred to as a _______. a. Code b. Dry run  c. Method d. None of the above

24. Dry run will help us to __________. a. Identify any incorrect steps in the algorithm b. Figure out missing details or specifics in the algorithm c. Both a) and b)  d. None of the above

25. algorithms can be ___________ on the basis of the amount of processing time they need to run and the amount of memory that is needed to execute the algorithm. a. Compared b. Analyzed c. Both a) and b)  d. None of the above

26. ___________ is the set of rules or grammar that governs the formulation of the statements in the language, such as spellings, order of words, punctuation, etc. a. Analyzed b. Syntax  c. Code d. None of the above

27. Programs written using ________ are directly understood by the computer hardware, but they are difficult to deal with and comprehend by humans. a. High Level Language b. Binary Digit  c. 4GL Language d. None of the above

28. A program written in a high-level language is called ___________. a. Source code  b. Object c. Machine language d. None of the above

29. What type of problems are solved by computer. a. Easy problem b. Complex problem c. Both a) and b)  d. None of the above

30. The basic idea of solving a complex problem by decomposition is to __________. a. Decompose b. Break down c. Complex problem into smaller sub problems d. All of the above 

31. An algorithm is defined as a _________ procedure designed to perform an operation which will lead to the desired result, if followed correctly. a. Reverse procedure b. Step-by-step procedure  c. Random procedure d. None of the above

32. Algorithms have a definite ________ and a definite ________, and a finite number of steps. a. Middle & End b. Beginning & End  c. Beginning & Middle d. None of the above

33. A good algorithm, which is __________, receives input and produces an output. a. Precise b. Unique c. Finite d. All of the above 

34. In order to write effective algorithms we need to identify the__________ to be followed and the desired output. a. Input b. Process c. Both a) and b)  d. None of the above

35. A flowchart is a type of diagram that represents the algorithm graphically using boxes of various kinds, in an order connected by arrows. a. Flowchart  b. Algorithm c. Pseudocode d. None of the above

36. An _________ where all the steps are executed one after the other is said to execute in sequence. a. Flowchart b. Algorithm  c. Pseudocode d. None of the above

37. _________ making involves selection of one of the alternatives based on outcome of a condition. a. Terminator b. Action Symbol c. Decision  d. Arrow

38. An _________ may have a certain set of steps, which are repeating for a finite number of times, such an algorithm is said to be iterative. a. Flowchart b. Algorithm  c. Pseudocode d. None of the above

39. There can be __________ approach to solve a problem and hence we can have more than one algorithm for a particular problem. a. Only one b. More than one  c. No approach d. None of the above

40. The choice of __________ should be made on the basis of time and space complexity. a. Flowchart b. Algorithm  c. Pseudocode d. None of the above

Computer Science Class 11 Notes

• Unit 1 : Basic Computer Organisation
• Unit 1 : Encoding Schemes and Number System
• Unit 2 : Introduction to problem solving
• Unit 2 : Getting Started with Python
• Unit 2 : Conditional statement and Iterative statements in Python
• Unit 2 : Function in Python
• Unit 2 : String in Python
• Unit 2 : Lists in Python
• Unit 2 : Tuples in Python
• Unit 2 : Dictionary in Python
• Unit 3 : Society, Law and Ethics

Computer Science Class 11 MCQ

Computer science class 11 ncert solutions.

• Unit 2 : Tuples and Dictionary in Python

• Andhra Pradesh
• Chhattisgarh
• West Bengal
• Madhya Pradesh
• Maharashtra
• Jammu & Kashmir
• NCERT Books 2022-23
• NCERT Solutions
• NCERT Notes
• NCERT Exemplar Books
• NCERT Exemplar Solution
• States UT Book
• School Kits & Lab Manual
• NCERT Books 2021-22
• NCERT Books 2020-21
• NCERT Book 2019-2020
• NCERT Book 2015-2016
• RD Sharma Solution
• TS Grewal Solution
• TR Jain Solution
• Selina Solution
• Frank Solution
• ML Aggarwal Solution
• Lakhmir Singh and Manjit Kaur Solution
• I.E.Irodov solutions
• ICSE - Goyal Brothers Park
• ICSE - Dorothy M. Noronhe
• Sandeep Garg Textbook Solution
• Micheal Vaz Solution
• S.S. Krotov Solution
• Evergreen Science
• KC Sinha Solution
• ICSE - ISC Jayanti Sengupta, Oxford
• ICSE Focus on History
• ICSE GeoGraphy Voyage
• ICSE Hindi Solution
• ICSE Treasure Trove Solution
• Thomas & Finney Solution
• SL Loney Solution
• SB Mathur Solution
• P Bahadur Solution
• Narendra Awasthi Solution
• MS Chauhan Solution
• LA Sena Solution
• Integral Calculus Amit Agarwal Solution
• IA Maron Solution
• Hall & Knight Solution
• Errorless Solution
• Pradeep's KL Gogia Solution
• OP Tandon Solutions
• Sample Papers
• Previous Year Question Paper
• Value Based Questions
• CBSE Syllabus
• CBSE MCQs PDF
• Assertion & Reason
• New Revision Notes
• Revision Notes
• HOTS Question
• Marks Wise Question
• Toppers Answer Sheets
• Exam Paper Aalysis
• Concept Map
• CBSE Text Book
• Additional Practice Questions
• Vocational Book
• CBSE - Concept
• KVS NCERT CBSE Worksheets
• Formula Class Wise
• Formula Chapter Wise
• JEE Crash Course
• JEE Previous Year Paper
• Important Info
• JEE Mock Test
• JEE Sample Papers
• SRM-JEEE Mock Test
• VITEEE Mock Test
• BITSAT Mock Test
• Manipal Engineering Mock Test
• AP EAMCET Previous Year Paper
• COMEDK Previous Year Paper
• GUJCET Previous Year Paper
• KCET Previous Year Paper
• KEAM Previous Year Paper
• Manipal Previous Year Paper
• MHT CET Previous Year Paper
• WBJEE Previous Year Paper
• AMU Previous Year Paper
• TS EAMCET Previous Year Paper
• SRM-JEEE Previous Year Paper
• VITEEE Previous Year Paper
• BITSAT Previous Year Paper
• UPSEE Previous Year Paper
• CGPET Previous Year Paper
• CUSAT Previous Year Paper
• AEEE Previous Year Paper
• Crash Course
• Previous Year Paper
• NCERT Based Short Notes
• NCERT Based Tests
• NEET Sample Paper
• Previous Year Papers
• Quantitative Aptitude
• Numerical Aptitude Data Interpretation
• General Knowledge
• Mathematics
• Agriculture
• Accountancy
• Business Studies
• Political science
• Enviromental Studies
• Mass Media Communication
• Teaching Aptitude
• NAVODAYA VIDYALAYA
• SAINIK SCHOOL (AISSEE)
• Mechanical Engineering
• Electrical Engineering
• Electronics & Communication Engineering
• Civil Engineering
• Computer Science Engineering
• CBSE Board News
• Scholarship Olympiad
• School Admissions
• Entrance Exams
• All Board Updates
• Miscellaneous
• State Wise Books
• Engineering Exam

Karnataka 1st PUC Computer Science Chapter 5 Problem Solving Methodology Question Banks

Karnataka 1st puc computer science chapter 5 problem solving methodology question banks in pdf - download here.

The Karnataka 1st PUC Computer Science Chapter 5 Problem Solving Methodology Question Bank is a very useful and handy resource that helps students in scoring good marks. While preparing for the Examination students are advised to practice solving these question banks because it will boost their confidence for the final exam. By practicing these questions students can overcome their weaknesses. Also, solving these questions helps students in understanding the best way of attempting the questions. 

It is considered as one of the most effective ways of getting a general idea of the exam question papers and their difficulty levels. That is why this is advisable to the students to practice these Karnataka Class 11 PUC Question Banks. 

Here on this website we are providing the complete set of Karnataka Board 1st PUC Question Bank. Students can download them from the given links on this website. It is free of cost.

Subject Wise Karnataka 1st PUC Computer Science Chapter 5 Problem Solving Methodology Question Bank

Subject Wise Karnataka 1st PUC Computer Science Chapter 5 Problem Solving Methodology Question Bank helps students to navigate through each of the chosen subjects nicely. It provides an organised or well compiled question bank that promotes the productivity of students while doing the preparation of Karnataka PUC Board Exam. 

Subjects such as Physics, Chemistry, Biology, Accountancy, Mathematics, etc consist of numerous questions so that students can go through the entire subjects to give a boost to their preparation.

It also helps students to prepare according to the Karnataka PUC 1st Syllabus. Apart from that the question banks are developed chapter wise as well.

Chapter Wise Karnataka Board Class 11th Question Bank for Computer Science Chapter 5 Problem Solving Methodology

Chapter Wise Karnataka Board Class 11th Question Bank for Computer Science Chapter 5 Problem Solving Methodology gives students a very simple and effective tool to prepare for the exam. Each chapter has their own dedicated questions. Hence the chapter wise Karnataka PUC 1st question bank includes several questions from the chapters and from the reference books to provide an ample amount of practice sets.

These are prepared for the karnataka students to prepare for the board examination. Question banks are a collection of several sets of question papers for every single subject. Students studying in Karnataka 1st PUC need these question banks to assess the preparation levels.

All these Karnataka Board Class 11th Question Banks are prepared on the basis of 1st PUC Syllabus . This question bank aims to provide the students with a very comprehensive set of questions to be prepared for the final board exam.

The Most Effective PUC 2 Question Bank

The Karnataka PU Board Question Bank is completely based on the Karnataka 1st PUC Syllabus so that at the time of examination preparation students can get a very guided and accurate amount of questions to boost the preparation. The effectiveness can also be observed by practicing the 1st PUC Question Banks Karnataka Board. Once you will start practicing the questions on a daily basis. You will start observing the improvements in the preparation such as better grip over the topics, chapters and the sharpness of memory. 

Also these question banks are intentionally effective at the last month of exam preparation. Moreover the question banks are filled with many questions that are already asked in the examination so it will help you a lot.

Need of An Organised Question Bank 

These Question Banks are organized in a very specific manner and it was needed to increase the productivity of students. Each set of question papers has their respective marks. For instance One Marks Questions, Two Marks Questions, etc. And they have an adequate number of problems that are generally asked in the actual PUC Board Exam. 

These well organized questions in the Karnataka Class 11 PUC Question Bank makes it more useful, handy and productive to become ready for the board exam. 

Also, the Computer Science Chapter 5 Problem Solving Methodology question banks contain many sets of questions that have some kind of possibility to appear in the final board examination. Those questions may appear in the examination but not like the test formats they will have very specific ways of formatting to appear in the actual Exam question papers. 

Although, many seniors and teachers recommended practicing as many questions as possible from the Question banks. 

karnataka class 11 puc question bank download pdf here on this website. 

Why should students solve Question Papers?

Students should solve the question papers because of the following given reasons

• Students will be able to learn time management. 
• The fear of exams will vanish.
• Confident in attempting the questions. 
• It will make them familiar with the questions that may be asked in the exam.

About Karnataka Board

Karnataka Secondary Education Examination Board has been presented since 1964. The board is focused on regulating the functions of education across the Karnataka state. The actual aim of this board is to promote education in the state. Also the karnataka board is responsible for developing the own syllabus for the school’s students who are affiliated from the Karnataka Board.

• NCERT Solutions for Class 12 Maths
• NCERT Solutions for Class 10 Maths
• CBSE Syllabus 2023-24
• Social Media Channels
• Login Customize Your Notification Preferences

One Last Step...

• Second click on the toggle icon

Provide prime members with unlimited access to all study materials in PDF format.

Allow prime members to attempt MCQ tests multiple times to enhance their learning and understanding.

Provide prime users with access to exclusive PDF study materials that are not available to regular users.

Problem Solving Toolbox: Problems Solving Methodologies

• Inquiry & Analysis/Judging
• Problems Solving Methodologies
• Critical Thinking
• Creative Thinking & Innovation
• Quantitative Literacy
• Digital Literacy
• Organizations

Problem Solving Methodologies tool

• A 5-Step Problem-Solving Strategy (https://academic.cuesta.edu/acasupp/as/407.htm) Appreciate the Complexities Involved in Decision-Making & Problem Solving
• Problem-Solving Techniques (http://www.mindtools.com/pages/main/newMN_TMC.htm) The 25+ tools in this section help you solve complicated business problems

Journal Articles & eBooks

• Analyses of Information Systems Students' Applications of Two Holistic Problem Solving Methodologies. by Musa, P. F., Edmondson, V., & Munchus, G. Journal of Information Systems Education. Winter2005, Vol. 16 Issue 4, p391-408. 18p.
• Breakthrough problem solving with action learning: Concepts and cases by Marquardt, M. J., & Yeo, R. K Publication Date: 2012 eBooks on EBSCOhost
• Decision making and problem solving strategies by Adair, John Publication Date: 2010 Ebrary
• Diagnostic Quality Problem Solving: A Conceptual Framework and Six Strategies. by DE MAST, JEROEN Quality Management Journal. 2013, Vol. 20 Issue 4, p21-36. 16p.
• Problem posing based on investigation activities by university students. by Ponte, J., & Henriques, A. Educational Studies in Mathematics; May2013, Vol. 83 Issue 1, p145-156, 12p, 1 Diagram
• Problem Solving for Teams : Make Consensus More Achievable by Pokras, Sandy Publication Date: 2010 eBooks on EBSCOhost
• Scenario Visualization : An Evolutionary Account of Creative Problem Solving by Arp, Robert Publication Date: 2008 eBooks on EBSCOhost
• Solving Everyday Problems with the Scientific Method : Thinking Like a Scientist by Mak, Don K., Angela T. Mak, and Anthony B. Mak. Publication Date: 2009 eBooks on EBSCOhost
• Solving Problems with Design Thinking : 10 Stories of What Works by Liedtka, J., Bennett, K. B., & King, A. Publication Date: 2013 eBooks on EBSCOhost
• Toward a creative problem-solving methodology with knowledge provision by Zhu, Z., Nagalingam, S., & Hsu, H. Applied Artificial Intelligence. Oct2011, Vol. 25 Issue 9, p836-881. 46p.

Information Literacy Tools

• BUILD IT An online guide to the Bellevue University Library and all its resources and services
• << Previous: Inquiry & Analysis/Judging
• Next: Critical Thinking >>
• Last Updated: Apr 30, 2024 11:22 AM
• URL: https://libguides.bellevue.edu/ProblemSolving