introduction to problem solving class 11 notes

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.

introduction to problem solving class 11 notes

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

18.what is missing data 19. why is missing data filled in dataframe with some value 20. name the function you can use for filling missing data 21. name some function to handle missing data., 2. what will be the output of the following code 2. select concat (concat(‘inform’, ‘atics’), ‘practices’); 3. select lcase (’informatics practices class 11th‘); 4. select ucase (’computer studies‘); 5. select concat (lower (‘class’), upper (‘xii’));, 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

Introduction to Problem Solving – Notes

Introduction to problem solving.

Steps for problem solving ( analysing the problem, developing an algorithm, coding, testing and debugging).
flow chart and
pseudo code,

Decomposition

Introduction

Computers is machine that not only use to develop the software. It is also used for solving various day-to-day problems.

Computers cannot solve a problem by themselves. It solve the problem on basic of the step-by-step instructions given by us.

Thus, the success of a computer in solving a problem depends on how correctly and precisely we –

Identifying (define) the problem
Designing & developing an algorithm and
Implementing the algorithm (solution) do develop a program using any programming language.

Thus problem solving is an essential skill that a computer science student should know.

Steps for Problem Solving-

1. Analysing the problem

Analysing the problems means understand a problem clearly before we begin to find the solution for it. Analysing a problem helps to figure out what are the inputs that our program should accept and the outputs that it should produce.

2. Developing an Algorithm

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 algorithm.

Algorithm: A set of exact steps which when followed, solve the problem or accomplish the required task.

Coding is the process of converting the algorithm into the program which can be understood by the computer to generate the desired solution.

You can use any high level programming languages for writing a program.

4. Testing and Debugging

The program created should be tested on various parameters.

The program should meet the requirements of the user.
It must respond within the expected time.
It should generate correct output for all possible inputs.
In the presence of syntactical errors, no output will be obtained.
In case the output generated is incorrect, then the program should be checked for logical errors, if any.

Software Testing methods are

unit or component testing,
integration testing,
system testing, and
acceptance testing

Debugging – 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.

Algorithm is a set of sequence which followed to solve a problem.

Algorithm for an activity ‘riding a bicycle’: 1) remove the bicycle from the stand, 2) sit on the seat of the bicycle, 3) start peddling, 4) use breaks whenever needed and 5) stop on reaching the destination.

Algorithm for Computing GCD of two numbers:

Step 1: Find the numbers (divisors) which can divide the given numbers.

Step 2: Then find the largest common number from these two lists.

A finite sequence of steps required to get the desired output is called an algorithm. Algorithm has a definite beginning and a definite end, and consists of a finite number of steps.

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.

While writing an algorithm, it is required to clearly identify the following:

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 Algorithms

There are two common methods of representing an algorithm —

Flowchart — Visual Representation of Algorithms

A flowchart is a visual representation of an algorithm. A flowchart is a diagram made up of boxes, diamonds and other shapes, connected by arrows. Each shape represents a step of the solution process and the arrow represents the order or link among the steps. There are standardised symbols to draw flowcharts.

Start/End – Also called “Terminator” symbol. It indicates where the flow starts and ends.

Process – Also called “Action Symbol,” it represents a process, action, or a single step. Decision – A decision 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.

Input / Output – Also called data symbol, this parallelogram shape is used to input or output data.

Arrow – Connector to show order of flow between shapes.

Question: Write an algorithm to find the square of a number. Algorithm to find square of a 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

The algorithm to find square of a number can be represented pictorially using flowchart

A pseudocode (pronounced Soo-doh-kohd) is another way of representing an algorithm. It is considered as a non-formal language that helps programmers to write algorithm. It is a detailed description of instructions that a computer must follow in a particular order.

It is intended for human reading and cannot be executed directly by the computer.
No specific standard for writing a pseudocode exists.
The word “pseudo” means “not real,” so “pseudocode” means “not real code”.

Keywords are used in pseudocode:

Question : Write an algorithm to calculate area and perimeter of a rectangle, using both pseudocode and flowchart.

Pseudocode for calculating area and perimeter of a rectangle.

INPUT length INPUT breadth COMPUTE Area = length * breadth PRINT Area COMPUTE Perim = 2 * (length + breadth) PRINT Perim The flowchart for this algorithm

Benefits of Pseudocode

A pseudocode of a program helps in representing the basic functionality of the intended program.
By writing the code first in a human readable language, the programmer safeguards against leaving out any important step.
For non-programmers, actual programs are difficult to read and understand, but pseudocode helps them to review the steps to confirm that the proposed implementation is going to achieve the desire output.

Flow of Control :

The flow of control depicts the flow of process as represented in the flow chart. The process can flow in

In a sequence steps of algorithms (i.e. statements) are executed one after the other.

In a selection, steps of algorithm is depend upon the conditions i.e. any one of the alternatives statement is selected based on the outcome of a condition.

Conditionals are used to check possibilities. The program checks one or more conditions and perform operations (sequence of actions) depending on true or false value of the condition.

Conditionals are written in the algorithm as follows: If is true then steps to be taken when the condition is true/fulfilled otherwise steps to be taken when the condition is false/not fulfilled

Question : Write an algorithm to check whether a number is odd or even. • Input: Any number • Process: Check whether the number is even or not • Output: Message “Even” or “Odd” Pseudocode of the algorithm can be written as follows: PRINT “Enter the Number” INPUT number IF number MOD 2 == 0 THEN PRINT “Number is Even” ELSE PRINT “Number is Odd”

The flowchart representation of the algorithm

Repetitions are used, when we want to do something repeatedly, for a given number of times.

Question : Write pseudocode and draw flowchart to accept numbers till the user enters 0 and then find their average. Pseudocode is as follows:

Step 1: Set count = 0, sum = 0 Step 2: Input num Step 3: While num is not equal to 0, repeat Steps 4 to 6 Step 4: sum = sum + num Step 5: count = count + 1 Step 6: Input num Step 7: Compute average = sum/count Step 8: Print average The flowchart representation is

Once an algorithm is finalised, it should be coded in a high-level programming language as selected by the programmer. The ordered set of instructions are written in that programming language by following its syntax.

The syntax is the set of rules or grammar that governs the formulation of the statements in the language, such as spelling, order of words, punctuation, etc.

Source Code: A program written in a high-level language is called source code.

We need to translate the source code into machine language using a compiler or an interpreter so that it can be understood by the computer.

Decomposition is a process to ‘decompose’ or break down a complex problem into smaller subproblems. It is helpful when we have to solve any big or complex problem.

Breaking down a complex problem into sub problems also means that each subproblem can be examined in detail.
Each subproblem can be solved independently and by different persons (or teams).
Having different teams working on different sub-problems can also be advantageous because specific sub-problems can be assigned to teams who are experts in solving such problems.

Once the individual sub-problems are solved, it is necessary to test them for their correctness and integrate them to get the complete solution.

Computer Science Answer Key Term 2 Board Examination

Input Output in Python

Society, Law, and Ethics: Societal Impacts – Notes

Data structure: stacks – notes.

Class 12 computer science Python revision tour - I

Python Revision Tour I : Basics of Python – Notes

Introduction to Python Module – Notes

Sorting Techniques in Python – Notes

Dictionary handling in python – notes, tuples manipulation in python notes, list manipulation – notes, leave a comment cancel reply.

You must be logged in to post a comment.

You cannot copy content of this page

Tue. Sep 3rd, 2024

TutorialAICSIP

A best blog for CBSE Class IX to Class XII

Introduction to problem solving Computer Science Class 11 Notes

By Sanjay Parmar

This article – introduction to problem solving Computer Science Class 11 offers comprehensive notes for Chapter 4 of the CBSE Computer Science Class 11 NCERT textbook.

Topics Covered

Introduction to problem solving Computer Science class 11

Computers, mobiles, the internet, etc. becomes our essentials nowadays for our routine life. We are using the to make our tasks easy and faster.

For example, earlier we were going to banks and standing in long queues for any type of transaction like money deposits or withdrawals. Today we can do these tasks from anywhere without visiting banks through internet banking and mobiles.

Basically, this was a complex problem and solved by a computer. The system was made online with the help of computers and the internet and made our task very easy.

This process is termed “Computerisations”. The problem is solved by using software to make a task easy and comfortable. Problem solving is a key term related to computer science.

The question comes to your mind how to solve a complex problem using computers? Let’s begin the article introduction to problem-solving Computer Science 11.

Introduction to problem solving Computer Science Class 11 – Steps for problem solving

“Computer Science is a science of abstraction -creating the right model for a problem and devising the appropriate mechanizable techniques to solve it.”

Solving any complex problem starts with understanding the problem and identifying the problem.

Suppose you are going to school by your bicycle. While riding on it you hear some noise coming from it. So first you will try to find that from where the noise is coming. So if you couldn’t solve the problem, you need to get it repaired.

The bicycle mechanic identifies the problem like a source of noise, causes of noise etc. then understand them and repair it for you.

So there are multiple steps involved in problem-solving. If the problem is simple and easy, we will find the solution easily. But the complex problem needs a few methods or steps to solve.

So complex problem requires some tools, a system or software in order to provide the solution. So it is a step-by-step process. These steps are as follows:

Analysing the problem

Developing an algorithm, testing and debugging.

The first step in the introduction to problem solving Computer Science Class 11 is analyzing the problem.

When you need to find a solution for a problem, you need to understand the problem in detail. You should identify the reasons and causes of the problem as well as what to be solved.

So this step involves a detailed study of the problem and then you need to follow some principles and core functionality of the solution.

In this step input and output, elements should be produced.

The second step for introduction to problem solving Computer Science class 11 is developing an algorithm.

An algorithm is a step-by-step process of a solution to a complex problem. It is written in natural language. An algorithm consists of various steps and begins from start to end. In between input, process and output will be specified. More details we will cover in the next section.

In short, the algorithm provides all the steps required to solve a problem.

For example:

Finding the simple interest, you need to follow the given steps:

Gather required information and data such as principle amount, rate of interest and duration.
Apply the formula for computing simple interest i.e. si=prn/100
Now store the answer in si
Display the calculated simple interest

In the above example, I have started and completed a task in a finite number of steps. It is completed in 4 finite steps.

Why algorithm is needed?

The algorithm helps developers in many ways. So it is needed for them for the following reasons:

It prepares a roadmap of the program to be written before writing code.
It helps to clearly visualise the instructions to be given in the program.
When the algorithm is developed, a programmer knows the number of steps required to follow for the particular task.
Algorithm writing is the initial stage (first step) of programming.
It makes program writing easy and simple.
It also ensures the accuracy of data and program output.
It increases the reliability and efficiency of the solution.

Characteristics of a good algorithm

The characteristics of a good algorithm are as follows:

It starts and ends with a finite number of steps. Therefore the steps are precisely stated or defined.
In the algorithm, the result of each step is defined uniquely and based on the given input and process.
After completion of the task, the algorithm will end.
The algorithm accepts input and produces the output.

While writing the algorithm the following things should be clearly identified:

The input required for the task
The computation formula or processing instructions

After writing the algorithm, it is required to represent it. Once the steps are finalised, it is required to be represented logically. This logical representation of the program clearly does the following:

Clears the logic of the program
The execution of the program

The algorithm is steps written in the form of text. So it is difficult to read sometimes. So if it is represented in pictorial form it would be better for analysis of the program.

The flowchart is used to represent the algorithm in visual form.

Flowchart – Visual representation of an algorithm

A flowchart is made of some symbols or shapes like rectangles, squares, and diamonds connected by arrows. Every shape represents each step of an algorithm. The arrow basically represents the order or link of the steps.

The symbols used in the flow chart are as follows:

flow chart symbols introduction to problem solving computer science class 11

Coding is an essential part of the introduction to problem solving ComputerScience11.

It is pronounced as soo-doh-kohd
It is one of the ways of representing algorithms in a systematic way
The word pseudo means not real, therefore pseudocode means not real code
It is non-formal language, that helps programmers to write code
It is written in human understandable language
It cannot be directly read by computers
There is no specific standard or way of writing pseudocode is there

When an algorithm is prepared, the next step is writing code. This code will be written in a specific programming language. The code follows certain rules and regulations of the programing language and provides solutions.

When coding is done you need to maintain it with proper documentation as well. The best practices for coding procedures must be followed. Because this code can be reviewed a number of times for further development and upgradation.

Let’s understand this step with a simple example!!

When your mother prepares a cake at your home, she will give peace of cake to someone before serving it to check the taste of the cake, right!!! If anything is needed like sugar or softness or hardness should be improved she will decide and do the improvement.

Similarly after writing code testing and debugging are required to check the software whether is providing the solution in a good manner not.

Have look at this also: Computer Science Class XI

NCERT solutions for Class 11 Computer Science chapter 4 - Introduction to Problem Solving [Latest edition]

NCERT solutions for Class 11 Computer Science chapter 4 - Introduction to Problem Solving - Shaalaa.com

Solutions for chapter 4: introduction to problem solving.

Below listed, you can find solutions for Chapter 4 of CBSE NCERT for Class 11 Computer Science.

NCERT solutions for Class 11 Computer Science Chapter 4 Introduction to Problem Solving Exercise [Pages 83 - 85]

Write a pseudocode that reads two numbers and divides one by another and displays the quotient.

Two friends decide who gets the last slice of a cake by flipping a coin five times. The first person to win three flips wins the cake. An input of 1 means player 1 wins a flip, and a 2 means player 2 wins a flip. Design an algorithm to determine who takes the cake.

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

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

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.

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

Write pseudocode that will perform the following:

Read the marks of three subjects: Computer Science, Mathematics, and Physics, out of 100.
Calculate the aggregate marks.
Calculate the percentage of marks.

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

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.

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

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.

What are conditionals? When they are required in a program?

Match the pairs.


	Flow of Control
	Process Step
	Start/Stop of the Process
	Data
	Decision Making

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

Reach_School_Algorithm

Take lunch box
Take the bus
Get off the bus
Reach school or college

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

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.

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

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

For some calculations, we want an algorithm that accepts only positive integers up to 100.

On what values will this algorithm fail?
Can you improve the algorithm?

NCERT solutions for Class 11 Computer Science chapter 4 - Introduction to Problem Solving

Shaalaa.com has the CBSE Mathematics Class 11 Computer Science CBSE solutions in a manner that help students grasp basic concepts better and faster. The detailed, step-by-step solutions will help you understand the concepts better and clarify any confusion. NCERT solutions for Mathematics Class 11 Computer Science CBSE 4 (Introduction to Problem Solving) include all questions with answers and detailed explanations. This will clear students' doubts about questions and improve their application skills while preparing for board exams.

Further, we at Shaalaa.com provide such solutions so students can prepare for written exams. NCERT textbook solutions can be a core help for self-study and provide excellent self-help guidance for students.

Concepts covered in Class 11 Computer Science chapter 4 Introduction to Problem Solving are Flowchart, Pseudocode, Introduction to Flow of Control, Sequence, Selection, Repetition, Verifying Algorithms, Comparison of Algorithm, Coding, Decomposition, Problem Solving, Steps for Problem Solving, Algorithms, Why Do We Need an Algorithm?, Representation of Algorithms.

Using NCERT Class 11 Computer Science solutions Introduction to Problem Solving exercise by students is an easy way to prepare for the exams, as they involve solutions arranged chapter-wise and also page-wise. The questions involved in NCERT Solutions are essential questions that can be asked in the final exam. Maximum CBSE Class 11 Computer Science students prefer NCERT Textbook Solutions to score more in exams.

Get the free view of Chapter 4, Introduction to Problem Solving Class 11 Computer Science additional questions for Mathematics Class 11 Computer Science CBSE, and you can use Shaalaa.com to keep it handy for your exam preparation.

Maharashtra Board Question Bank with Solutions (Official)
Balbharati Solutions (Maharashtra)
Samacheer Kalvi Solutions (Tamil Nadu)
NCERT Solutions
RD Sharma Solutions
RD Sharma Class 10 Solutions
RD Sharma Class 9 Solutions
Lakhmir Singh Solutions
TS Grewal Solutions
ICSE Class 10 Solutions
Selina ICSE Concise Solutions
Frank ICSE Solutions
ML Aggarwal Solutions
NCERT Solutions for Class 12 Maths
NCERT Solutions for Class 12 Physics
NCERT Solutions for Class 12 Chemistry
NCERT Solutions for Class 12 Biology
NCERT Solutions for Class 11 Maths
NCERT Solutions for Class 11 Physics
NCERT Solutions for Class 11 Chemistry
NCERT Solutions for Class 11 Biology
NCERT Solutions for Class 10 Maths
NCERT Solutions for Class 10 Science
NCERT Solutions for Class 9 Maths
NCERT Solutions for Class 9 Science
CBSE Study Material
Maharashtra State Board Study Material
Tamil Nadu State Board Study Material
CISCE ICSE / ISC Study Material
Mumbai University Engineering Study Material
CBSE Previous Year Question Paper With Solution for Class 12 Arts
CBSE Previous Year Question Paper With Solution for Class 12 Commerce
CBSE Previous Year Question Paper With Solution for Class 12 Science
CBSE Previous Year Question Paper With Solution for Class 10
Maharashtra State Board Previous Year Question Paper With Solution for Class 12 Arts
Maharashtra State Board Previous Year Question Paper With Solution for Class 12 Commerce
Maharashtra State Board Previous Year Question Paper With Solution for Class 12 Science
Maharashtra State Board Previous Year Question Paper With Solution for Class 10
CISCE ICSE / ISC Board Previous Year Question Paper With Solution for Class 12 Arts
CISCE ICSE / ISC Board Previous Year Question Paper With Solution for Class 12 Commerce
CISCE ICSE / ISC Board Previous Year Question Paper With Solution for Class 12 Science
CISCE ICSE / ISC Board Previous Year Question Paper With Solution for Class 10
Entrance Exams
Video Tutorials
Question Papers
Question Bank Solutions
Question Search (beta)
More Quick Links
Privacy Policy
Terms and Conditions
Shaalaa App
Ad-free Subscriptions

Select a course

Class 1 - 4
Class 5 - 8
Class 9 - 10
Class 11 - 12
Search by Text or Image
Textbook Solutions
Study Material
Remove All Ads
Change mode

CBSE Revision Notes
CBSE Free Video Lectures
CBSE Important Questions
CBSE Objective (MCQs)
Assertation & Reasoning Questions
Case Study Questions
CBSE Syllabus
CBSE Sample paper
CBSE Mock Test Paper
Question Bank
Previous Year Board Exam Papers
Project, Practical & Activities
ICSE Free Video Lectures
Class 6 ICSE Revision Notes
CLASS 7 ICSE REVISION NOTES
CLASS 8 ICSE REVISION NOTES
CLASS 9 ICSE REVISION NOTES
CLASS 10 ICSE REVISION NOTES
Class 6 ICSE Solutions
CLASS 7 ICSE Solutions
CLASS 8 ICSE Solutions
CLASS 9 ICSE Solutions
CLASS 10 ICSE Solutions
Class 6 ICSE Important Questions
CLASS 7 ICSE Important Question
CLASS 8 ICSE IMPORTANT QUESTIONS
CLASS 9 ICSE Important Questions
CLASS 10 ICSE Important Question
Class 6 ICSE Mcqs Question
Class 7 ICSE Mcqs Question
CLASS 8 ICSE MCQS QUESTION
CLASS 9 ICSE Mcqs Questions
CLASS 10 ICSE Mcqs Question
ICSE Syllabus
Class 6th Quick Revision Notes
Class 7th Quick Revision Notes
Class 8th Quick Revision Notes
Class 9th Quick Revision Notes
Class 10th Quick Revision Notes
Class 11th Quick revision Notes
Class 12th Quick Revision Notes
Class 6th NCERT Solution
Class 7th NCERT Solution
Class 8th – NCERT Solution
Class 9th NCERT Solution
Class 10th NCERT Solution
Class 11th NCERT Solution
Class 12th NCERT Solution
Class 6th Most Important Questions
Class 7th Important Questions
Class 8th Important Questions
Class 9th Most Important Questions
Class 10th Most Important Questions
Class 11th important questions
Class 12th important questions
Class 6th MCQs
Class 7th MCQs
Class 8th MCQs
Class 9th MCQs
Class 10th MCQs
Class 11th MCQs questions
Class 12th Important MCQs
Case Study Based Questions
NCERT Books in Pdf
NCERT Chapter Mind Maps
OliveTree Books Study Materials
Forever With Books Study Material
Rs Aggrawal Solutions
RD Sharma Solution
HC Verma Solution
Lakhmir Singh Solution
T.R Jain & V.K ohri Solution
DK Goel Solutions
TS Grewal Solution
Our Products
Edugrown-Candy Notes & Solution
Online Tuition Services
Career Advisor Booking
Skill Development Courses
Free Video Lectures

Chapter 4 : Introduction to Problem Solving | class 11th | Ncert solution for computer

Uncategorized
Chapter 4 : Introduction to…

NCERT Class 11 Computer Science Solution

Chapter 4 introduction to problem solving.

1. Write pseudocode that reads two numbers and divide one by another and display the quotient.

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

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

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.

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.

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

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

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

13. Match the pairs

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

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.

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” Else “Big” Verify for (5, 9, 47, 99, 100 200) and correct the algorithm if required

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

Accept_1to100_Algo INPUT Number IF (0<= Number) AND (Number <= 100) ACCEPT Else REJECT a) On what values will this algorithm fail? b) Can you improve the algorithm?

Author: noor arora

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

Ncert solutions class 11 computer science chapter 4: overview.

	NCERT
	11
	Computer Science
	4
	Introduction to Problem Solving
	Exercise Solutions

Step 4: Else

NCERT Books for Class 11 Computer Science Chapter 4 Introduction to Problem Solving

Ncert books for class 11th computer science chapter 4 introduction to problem solving pdfs.

NCERT Books For Class 11th Computer Science Chapter 4 Introduction to Problem Solving are advised by the majority of teachers and schools authorities as study material for students. CBSE has referred the NCERT books for a class I to XII. Apart from The Central Board of Secondary Education other 19 school boards from the 14 states have chosen the NCERT books for their school curriculum. The National Council of Educational Research and Training is part of the Indian government and they have a responsibility to publish the book. Class 11th NCERT Computer Science Chapter 4 Introduction to Problem Solving book is created to keep in mind that the Complex subjects and topics should be easy to understand for the students.

Students often get tired of finding the right place to downloadable books for all subjects. But don’t worry! we understand your problem and the value of your time. Therefore, you can download NCERT books for class 11th for Free of Cost.

There are a bunch of subjects in class 11th. Which includes Chemistry, Physics, Mathematics, Biology, Business Studies, Accountancy, Economics, Psychology, History, Geography and so on. Students can refer to the NCERT Books for class 11th studies. Because NCERT books have a very simplified format. Along with that, The final exam asks questions as per the CBSE syllabus, and for this reason, class 11th students should prepare for their exam by using NCERT books. It will help them to learn the concepts faster and use them in the exams without any confusion.

An Overview of Class 11th Maths

Class 11th Maths has vast topics and concepts. Such as sets, trigonometry, probability, statistics etc. These topics are a bit tricky & challenging but interesting. By solving questions based on these topics students will develop great skills in mathematical calculations and critical thinking.

There are a bunch of collections for Class 11th Maths Solutions & Sample Papers. Which helps students to practice their questions on daily basis. You can download it from here in PDF for free.

An Overview of Class 11th Physics

Class 11th Physics is a very interesting subject. It has a total Number of 15 chapters, such as Laws of Motion, Work, Energy & Power, Gravitation etc. Usually, students complained about the toughness of physics. Because they lack a proper guide and choice of study materials. NCERT Class 11th physics book can be a great choice if you want to grasp the detailed knowledge of all the concepts of the textbook.

An Overview of Class 11th Chemistry

Class 11th Chemistry book is the store of information related to chemicals, materials etc. It consists overall of 14 chapters including Basic concepts of chemistry, Structure of atoms, Thermodynamics, Equilibrium etc. By studying these chapters students can have a good amount of knowledge about chemistry and its field.

An Overview of Class 11th Biology

Class 11th Biology is about the study of life and living organisms. It includes chapters like The Living World, Biological Classification, Plant Kingdom and so on. Class 11th biology helps students to make a strong foundation of the biology subject.

Why NCERT Books for Class 11?

NCERT Books for class 11 is advised to use because it has plenty of benefits. A few of them are listed below

It clears all important concepts This book is so well prepared that all the concepts can be understood with ease. It helps students to learn all the important concepts of the subject very easily. Just because of it students can have a good piece of information and they can save themselves from mugging up the things. It will help students to write answers in their own words.
CBSE follows NCERT Books CBSE Strictly follows the NCERT books. Questions in the annual exams or board exams are asked from the NCERT books.
Extra Study Materials and tricky questions

NCERT Books have tons of questions. But the best thing about these textbooks are. It has an exemplar book for Maths & Science, which is prepared

4 . Department of Education in Science & Mathematics ( DESM ) together with NCERT. Exemplar helps students to increase their analytical and problem-solving abilities.

Features of NCERT Books for Class 11

The features of NCERT Books are irresistible. but, there are some key highlight features listed below:

Concepts in the book are extremely defined.
It is easily available.
CBSE and 19 other boards have adopted this book for their education program.
It is part of the Indian government.
Prepared by professionals of their respective subjects.
Always be updated with the latest syllabus.
All NCERT books have solutions. Download Here

Manipal MET 2024 Application (Released) (All Pages)

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.

Chapter 4 Introduction to Problem Solving Class 11

NCERT Book for Class 11 Computer Science Chapter 4 Introduction to Problem Solving is accessible for persuing/read or download on this page. The situations where you don’t access to its physical copy, its pdf format will help you there. After the jpg format of chapter you will find a link from where you can download it in pdf format for your future reference and for sharing it with your students, friends and teachers.

You will also get links to Class 11, Chapter 4 Introduction to Problem Solving of Computer Science Chapterwise Notes, Important Questions of all Chapters , Sample Papers, Previous Year Papers, Practice Papers, etc.

COMPLETE TEXTBOOK

CLICK HERE TO DOWNLOAD THE PDF OF CLASS 11, Computer Science, Chapter 4 Introduction to Problem Solving.

NCERT SOLUTIONS FOR CLASS XI Computer Science

If you want Stepwise SOLUTIONS of Chapter 4 Introduction to Problem Solving, then CLICK HERE to directly go on page from where you will find Solutions of each and every question of this chapter done by Subject Experts and Experienced Teachers.

You can also CLICK HERE to land on the page, where you’ll find Chapterwise all solutions of Complete NCERT Book of Computer Science of Class XI.

Want to Buy NCERT Computer Science

We Understand the value of your time, that’s why for your convenience & saving your time we have generated direct link to NCERT Book Class 11 Computer Science, so that you need not keep the search for it on different platforms. You can simply visit the link to go to the World’s No -1 trusted website- Amazon and order online.

CLICK HERE TO GO AMAZON WEBSITE TO BUY NCERT – Computer Science, BOOKS OF CLASS XI, ONLINE.

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.

Introduction to Problem Solving Class 11 Questions and Answers

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

1. Write pseudocode that reads two numbers and divide one by another and display the quotient. Answer – Input num1 Input num2 Calculate div = num1 / num2 Print div

2. Two friends decide who gets the last slice of a cake by flipping a coin five times. The first person to win three flips wins the cake. An input of 1 means player 1 wins a flip, and a 2 means player 2 wins a flip. Design an algorithm to determine who takes the cake? Answer – Set p1 = 0 Set p2 = 0 For i in range (5): Input coin If coin = 1 then P1 += 1 Elif coin = then P2 += 1 If p1 > 2 then P1 wins Elif p2 > 2 then P2 wins

3. Write the pseudocode to print all multiples of 5 between 10 and 25 (including both 10 and 25). Answer – FOR num := 10 to 25 DO IF num % 5 = 0 THEN PRINT num END IF END LOOP

4. Give an example of a loop that is to be executed a certain number of times. Answer – SET i: = 1 FOR i: = 1 to 10 do PRINT i END LOOP

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. Answer – Step 1 : Start Step 2 : Set money := 0 Step 3 : While Loop (money <200) Input money Step 4 : money = money + money Step 5 : End Loop Step 6 : Stop

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. Answer – INPUT Item INPUT price CALCULATE bill := Item * price PRINT bill CALCULATE tax := bill * (5 / 100) CALCULATE GST_Bill := bill + tax PRINT GST_Bill

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 Answer – INPUT computer, maths, phy COMPUTE average := (computer + maths + phy) / 3 COMPUTE percentage := (average / 300) * 100 PRINT average PRINT percentage

8. Write an algorithm to find the greatest among two different numbers entered by the user. Answer – INPUT num1, num2 IF num1 > num2 THEN PRINT num1 ELSE IF num2 > num1 THEN PRINT num2 END IF

9. 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. Answer – INPUT num IF num >=5 AND num < 15 THEN PRINT ‘GREEN’ ELSE IF num >= 15 AND num < 25 THEN PRINT ‘BLUE’ ELSE IF num >= 25 AND num < 35 THEN PRINT ‘ORANGE’ ELSE PRINT ‘ALL COLOURS ARE BEAUTIFUL’ END IF

10. Write an algorithm that accepts four numbers as input and find the largest and smallest of them. Answer – INPUT max SET min := max FOR i: = 1 to 3 do INPUT num IF num<max THEN SET max :=num ELSE SET min := num END LOOP PRINT max PINT min

11. 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 . Answer – INPUT units SET bill := 0 IF units > 250 THEN CALCULATE bill := units * 20 ELIF units <= 100 THEN CALCULATE bill := units * 5 ELSE CALCULATE bill := 100 * 5 + (units – 100) * 10 END IF END IF CALCULATE totalBill := bill + 75 PRINT totalBill

12. What are conditionals? When they are required in a program? Answer – Conditionals are programming language elements used in computer science that execute various computations or actions based on whether a boolean condition supplied by the programmer evaluates to true or false.

When a software needs to calculate a result based on a given circumstance, they are necessary (s).

14. Following is an algorithm for going to school or college. Can you suggest improvements in this to include other options? Reach_School_Algorithm a) Wake up b) Get ready c) Take lunch box d) Take bus e) Get off the bus f) Reach school or college Answer – a) Wake up b) Brush your teeth c) Take bath d) Dress up e) Eat breakfast f) Take lunch box g) Take Bus h) Get off the bus i) Reach school or college

15. Write a pseudocode to calculate the factorial of a number (Hint: Factorial of 5, written as 5!=5 4 3 21 ×××× ). Answer – INPUT num SET fact := 1, i := 1 WHILE i <= num DO CALCULATE fact := fact * i INCREASE i by 1 END LOOP PRINT fact

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

Accept_1to100_Algo INPUT Number IF (0<= Number) AND (Number <= 100) ACCEPT Else REJECT a) On what values will this algorithm fail? b) Can you improve the algorithm?

Answer – INPUT number IF (number>0) AND (number <=100) ACCEPT Else REJECT

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

LIVE Course for free

Ask a Question

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

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

To thoroughly grasp this chapter and excel in CBSE exams and competitive tests, utilizing NCERT Solutions is highly recommended. These solutions, crafted by experts in the field, delve into all key concepts covered in the chapter. Specifically designed for the CBSE curriculum, they ensure a comprehensive understanding and invaluable support in your academic endeavors.

In these NCERT Solutions for Class 11 Computer Science , we have discussed all types of NCERT intext questions and exercise questions.

Concepts covered in Class 11 Computer Science chapter- 4 Introduction to Problem Solving , are :

Steps for Problem Solving
Representation of Algorithms
Flow of Control
Verifying Algorithms
Comparison of Algorithm
Decomposition

Our NCERT Solutions for Class 11 Computer Science provide detailed explanations to assist students with their homework and assignments. Proper command and ample practice of topic-related questions provided by our NCERT solutions is the most effective way to achieve full marks in your exams. Begin studying right away to ace your exams.

Easily access all solutions and practice questions at your fingertips to kick-start your preparation immediately.

introduction to problem solving
ncert solutions
ncert solutions 11
ncert solutions class 11 computer science
computer science

Please log in or register to add a comment.

Please log in or register to answer this question..

1. Write pseudocode that reads two numbers and divide one by another and display the quotient.

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

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

It will execute only 3 times.

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

1 - Start 2 - Approach to parents, uncle, aunts, and grandparents 3 - Request for money 4 - Collect the given amount 5 - Add the amount received to make sure it is 200 6 - If not reach 200 7 - Again, request from others 8 - If received 200 goals achieved 9 - Stop

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.

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

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

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

11. 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.

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 there to evaluate the expression.

Generally, conditional statements give us an output in the form of true or false which is known as Boolean values.

13. Match the pairs


	Flow of Control
	Process Step
	Start/Stop of the Process
	Data
	Decision Making


	Start/Stop of the Process
	Data
	Process Step
	Decision Making
	Flow of Control

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

Reach_School_Algorithm

a) Wake up b) Get ready c) Take lunch box d) Take bus e) Get off the bus f) Reach school or college

Do exercise

Brush teeth

Take lunch box

Revise chapters

Get off the bus

Reach school or college

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

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

Classify_Numbers_Algo

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

The correct algorithm is:

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

a) On what values will this algorithm fail?

If we enter 0 then this algorithm will fail.

b) Can you improve the algorithm?

Find MCQs & Mock Test

JEE Main 2025 Test Series
NEET Test Series
Class 12 Chapterwise MCQ Test
Class 11 Chapterwise Practice Test
Class 10 Chapterwise MCQ Test
Class 9 Chapterwise MCQ Test
Class 8 Chapterwise MCQ Test
Class 7 Chapterwise MCQ Test

CBSE Class 11 | Problem Solving Methodologies

Problem solving process.

The process of problem-solving is an activity which has its ingredients as the specification of the program and the served dish is a correct program. This activity comprises of four steps : 1. Understanding the problem: To solve any problem it is very crucial to understand the problem first. What is the desired output of the code and how that output can be generated? The obvious and essential need to generate the output is an input. The input may be singular or it may be a set of inputs. A proper relationship between the input and output must be drawn in order to solve the problem efficiently. The input set should be complete and sufficient enough to draw the output. It means all the necessary inputs required to compute the output should be present at the time of computation. However, it should be kept in mind that the programmer should ensure that the minimum number of inputs should be there. Any irrelevant input only increases the size of and memory overhead of the program. Thus Identifying the minimum number of inputs required for output is a crucial element for understanding the problem.

2. Devising the plan: Once a problem has been understood, a proper action plan has to be devised to solve it. This is called devising the plan. This step usually involves computing the result from the given set of inputs. It uses the relationship drawn between inputs and outputs in the previous step. The complexity of this step depends upon the complexity of the problem at hand.

3. Executing the plan: Once the plan has been defined, it should follow the trajectory of action while ensuring the plan’s integrity at various checkpoints. If any inconsistency is found in between, the plan needs to be revised.

4. Evaluation: The final result so obtained must be evaluated and verified to see if the problem has been solved satisfactorily.

Problem Solving Methodology(The solution for the problem)

The methodology to solve a problem is defined as the most efficient solution to the problem. Although, there can be multiple ways to crack a nut, but a methodology is one where the nut is cracked in the shortest time and with minimum effort. Clearly, a sledgehammer can never be used to crack a nut. Under problem-solving methodology, we will see a step by step solution for a problem. These steps closely resemble the software life cycle . A software life cycle involves several stages in a program’s life cycle. These steps can be used by any tyro programmer to solve a problem in the most efficient way ever. The several steps of this cycle are as follows :

Step by step solution for a problem (Software Life Cycle) 1. Problem Definition/Specification: A computer program is basically a machine language solution to a real-life problem. Because programs are generally made to solve the pragmatic problems of the outside world. In order to solve the problem, it is very necessary to define the problem to get its proper understanding. For example, suppose we are asked to write a code for “ Compute the average of three numbers”. In this case, a proper definition of the problem will include questions like : “What exactly does average mean?” “How to calculate the average?”

Once, questions like these are raised, it helps to formulate the solution of the problem in a better way. Once a problem has been defined, the program’s specifications are then listed. Problem specifications describe what the program for the problem must do. It should definitely include :

what is the input set of the program

What is the desired output of the program and in what form the output is desired?

2. Problem Analysis (Breaking down the solution into simple steps): This step of solving the problem follows a modular approach to crack the nut. The problem is divided into subproblems so that designing a solution to these subproblems gets easier. The solutions to all these individual parts are then merged to get the final solution of the original problem. It is like divide and merge approach.

Modular Approach for Programming :

The process of breaking a large problem into subproblems and then treating these individual parts as different functions is called modular programming. Each function behaves independent of another and there is minimal inter-functional communication. There are two methods to implement modular programming :

Top Down Design : In this method, the original problem is divided into subparts. These subparts are further divided. The chain continues till we get the very fundamental subpart of the problem which can’t be further divided. Then we draw a solution for each of these fundamental parts.
Bottom Up Design : In this style of programming, an application is written by using the pre-existing primitives of programming language. These primitives are then amalgamated with more complicated features, till the application is written. This style is just the reverse of the top-down design style.

3. Problem Designing: The design of a problem can be represented in either of the two forms :

The ways to execute any program are of three categories:

Sequence Statements Here, all the instructions are executed in a sequence, that is, one after the another, till the program is executed.
Selection Statements As it is self-clear from the name, in these type of statements the whole set of instructions is not executed. A selection has to be made. A selected number of instructions are executed based on some condition. If the condition holds true then some part of the instruction set is executed, otherwise, another part of the set is executed. Since this selection out of the instruction set has to be made, thus these type of instructions are called Selection Statements.

Identification of arithmetic and logical operations required for the solution : While writing the algorithm for a problem, the arithmetic and logical operations required for the solution are also usually identified. They help to write the code in an easier manner because the proper ordering of the arithmetic and logical symbols is necessary to determine the correct output. And when all this has been done in the algorithm writing step, it just makes the coding task a smoother one.

Flow Chart : Flow charts are diagrammatic representation of the algorithm. It uses some symbols to illustrate the starting and ending of a program along with the flow of instructions involved in the program.

4. Coding: Once an algorithm is formed, it can’t be executed on the computer. Thus in this step, this algorithm has to be translated into the syntax of a particular programming language. This process is often termed as ‘coding’. Coding is one of the most important steps of the software life cycle. It is not only challenging to find a solution to a problem but to write optimized code for a solution is far more challenging.

Writing code for optimizing execution time and memory storage : A programmer writes code on his local computer. Now, suppose he writes a code which takes 5 hours to get executed. Now, this 5 hours of time is actually the idle time for the programmer. Not only it takes longer time, but it also uses the resources during that time. One of the most precious computing resources is memory. A large program is expected to utilize more memory. However, memory utilization is not a fault, but if a program is utilizing unnecessary time or memory, then it is a fault of coding. The optimized code can save both time and memory. For example, as has been discussed earlier, by using the minimum number of inputs to compute the output , one can save unnecessary memory utilization. All such techniques are very necessary to be deployed to write optimized code. The pragmatic world gives reverence not only to the solution of the problem but to the optimized solution. This art of writing the optimized code also called ‘competitive programming’.

5. Program Testing and Debugging: Program testing involves running each and every instruction of the code and check the validity of the output by a sample input. By testing a program one can also check if there’s an error in the program. If an error is detected, then program debugging is done. It is a process to locate the instruction which is causing an error in the program and then rectifying it. There are different types of error in a program : (i) Syntax Error Every programming language has its own set of rules and constructs which need to be followed to form a valid program in that particular language. If at any place in the entire code, this set of rule is violated, it results in a syntax error. Take an example in C Language

In the above program, the syntax error is in the first printf statement since the printf statement doesn’t end with a ‘;’. Now, until and unless this error is not rectified, the program will not get executed.

Once the error is rectified, one gets the desired output. Suppose the input is ‘good’ then the output is : Output:

(ii) Logical Error An error caused due to the implementation of a wrong logic in the program is called logical error. They are usually detected during the runtime. Take an example in C Language:

In the above code, the ‘for’ loop won’t get executed since n has been initialized with the value of 11 while ‘for’ loop can only print values smaller than or equal to 10. Such a code will result in incorrect output and thus errors like these are called logical errors. Once the error is rectified, one gets the desired output. Suppose n is initialised with the value ‘5’ then the output is : Output:

(iii) Runtime Error Any error which causes the unusual termination of the program is called runtime error. They are detected at the run time. Some common examples of runtime errors are : Example 1 :

If during the runtime, the user gives the input value for B as 0 then the program terminates abruptly resulting in a runtime error. The output thus appears is : Output:

Example 2 : If while executing a program, one attempts for opening an unexisting file, that is, a file which is not present in the hard disk, it also results in a runtime error.

6. Documentation : The program documentation involves :

Problem Definition
Problem Design
Documentation of test perform
History of program development

7. Program Maintenance: Once a program has been formed, to ensure its longevity, maintenance is a must. The maintenance of a program has its own costs associated with it, which may also exceed the development cost of the program in some cases. The maintenance of a program involves the following :

Detection and Elimination of undetected errors in the existing program.
Modification of current program to enhance its performance and adaptability.
Enhancement of user interface
Enriching the program with new capabilities.
Updation of the documentation.

Control Structure- Conditional control and looping (finite and infinite)

There are codes which usually involve looping statements. Looping statements are statements in which instruction or a set of instructions is executed multiple times until a particular condition is satisfied. The while loop, for loop, do while loop, etc. form the basis of such looping structure. These statements are also called control structure because they determine or control the flow of instructions in a program. These looping structures are of two kinds :

In the above program, the ‘for’ loop gets executed only until the value of i is less than or equal to 10. As soon as the value of i becomes greater than 10, the while loop is terminated. Output:

In the above code, one can easily see that the value of n is not getting incremented. In such a case, the value of n will always remain 1 and hence the while loop will never get executed. Such loop is called an infinite loop. Output:

Please Login to comment...

Improve your Coding Skills with Practice

What kind of Experience do you want to share?

Introducing to Problem Solving class 11 Sumita Arora Solution

Introducing to problem solving sumita arora solution || introducing to problem solving class 11 sumita arora solution || introducing to problem solving class 11 sumita arora || introducing to problem solving sumita arora || sumita arora introducing to problem solving || sumita arora introducing to problem solving solution || introducing to problem solving sumita arora practical solution || sumita arora practical solution || introducing to problem solving class 11 solution || introducing to problem solving class 11.

Q1. Write an algorithm to find the square of a number. Q2 Draw a flowchart to solve the problem of a non-functioning light bulb. Q3. Draw a flowchart for calculating grade from marks percentage. Q4 Write an algorithm to double a number in two different ways: (i) n+n, (ii) 2x Q5. Write an algorithm and draw a flowchart to determine if a student passed the exam or not.( Note there are 4 subject papers and passing average is 50 or more.) Q6. Write pseudocode for following :- Dean a flowchart, write an algorithm and pseudo code for following Questions :- Q8.To find the area and perimeter of a rectangle.

Q9. To calculate the area and the circumference of circles. Q10. To calculate the simple interest. Q11. To check whether a year is a leap year or not. Q12. To check if a number is a positive or negative number. Q13. To check if a number is an odd or even number. Q14. To categories a person as either child (<13), teenager (> 13 but <20) or adult (20), based specified. Q15. To print all natural numbers up to n. Q16. To print n odd numbers. Q17. To print square of a number. Q18. To accept 5 numbers and find their average. Q19. To accept numbers till the user enters and then find their average. Q20. To print squares of first n numbers. Q21. To print the cube of a number. Q22. To print to print cubes of first n numbers. Q23. To find sum of n given numbers. Q24. To find factorial of a given number. Q25. Given the following pseudo code: Use variables sum, product, number1, number2 of type real display "Input two numbers" accept number1, number2 sum number1 + number2 print "The sum is", sum product number1* number2 print "The Product is ", product end program Draw a flow chart for the same and dry run the given pseudocode if it is working Q26. Given the following pseudo code: Use variables: choice, of the type character ans, number1, number2, of type integer display "choose one of the following" display "m for multiply" display "a for add" display "s for subtract" accept choice display "input two numbers you want to use" accept number1, number 2 if choice m then ans number1 number2 if choice a then ans number1 + number 21 if choices then ans number1 - number2 display ans Draw a flow chart for the same and dry run the given pseudocode if it is working Q27. Given the following pseudo code: Use variables: mark of type integer If mark> 80, display "distinction" If mark > 60 and mark 80, display "merit" If mark > 40 and mark < 60, display "pass" If mark 40 display, "fail" Draw a flow chart for the same and dry run the given pseudocode if it is working fine. Q28. Given the following pseudo code: Use variables: category of type character Display "input category" Accept category If category= 'U' Display "insurance is not available" Else If category= 'A' then Display "insurance is double" Else If category= 'B' then Display "insurance is normal" Else If category= 'M' then Display "insurance is medically dependent" Else Display "entry invalid" Draw a flow chart for the same and dry run the given pseudocode if it is working fine. Q29. Given the following pseudo code: Use variable: number of type real DISPLAY "Type in a number or zero to stop" ACCEPT number WHILE number 0 Square number number DISPLAY "The square of the number is", square DISPLAY "Type in a number or zero to stop" ACCEPT number ENDWHILE Draw a flow chart for the same and dry run the given pseudocode if it is working fine.

17 Comments

You can help us by Clicking on ads. ^_^ Please do not send spam comment : )

Welcome : )

Please give answers to questions from 25 to 29 and flowcharts for all questions, it was quite helpful though..

We are uploading soon.

sorry friends idk so please forgive me

it was very helpful but i will suggest to add type a questions also. Although it was very helpful and i enjoyed...

Thanks a lot for the solutions! Really very helpful

Always Welcome : )

very useful

Please give solution of type A questions.

All are theoritical questions.

hy i want solution of practical book

i want solutions

NCERT Class 11 Physics Chapter 11 Thermodynamics

NCERT Class 11 Physics Chapter 11 Thermodynamics Solutions , NCERT Class 11 Physics Chapter 11 Thermodynamics Notes to each chapter is provided in the list so that you can easily browse throughout different chapters NCERT Class 11 Physics Chapter 11 Thermodynamics Question Answer and select needs one.

Also, you can read the SCERT book online in these sections NCERT Class 11 Physics Chapter 11 Thermodynamics Solutions by Expert Teachers as per SCERT ( CBSE ) Book guidelines. These solutions are part of SCERT All Subject Solutions . Here we have given NCERT Class 11 Physics Chapter 11 Thermodynamics Solutions for All Subjects, You can practice these here.

Thermodynamics

Chapter: 11

1. A geyser heats water flowing at the rate of 3.0 litres per minute from 27 °C to 77 °C. If the geyser operates on a gas burner, what is the rate of consumption of the fuel if its heat of combustion is 4.0 × 10 4 J/g?

Ans: Energy required to heat the water:

Mass of water

= 3.0 litres/minute × 1000 g/litre

= 3000 g/minute

Heat capacity of water = 4.184 J/g°C

Temperature change = 77°C – 27°C = 50°C

Energy = 3000 g/minute × 4.184 J/g°C × 50°C

= 627600 J/minute

Energy into joules per second (J/s):

627600 J/minute ÷ 60 s/minute = 10460 J/s

Heat of combustion = 4.0 × 10 4 J/g

Rate of fuel consumption:

= 10460 J/s ÷ 4.0 × 10 4 J/g

= 0.2615 g/s or 15.69 g/minute.

2. What amount of heat must be supplied to 2.0 × 10 –2 kg of nitrogen (at room temperature) to raise its temperature by 45 °C at constant pressure? (Molecular Mass of N2 = 28; R = 8.3 J mol –1 K –1 .)

Q = n × Cp × ΔT

n = mass / molecular mass

= 2.0 × 10 –2 kg / 28 kg/kmol

= 7.14 × 10 –4 k mol

Cp = (7/2) × R

= (7/2) × 8.3 J/mol·K

= 29.05 J/mol·K

Q = 7.14 × 10 –4 k mol × 29.05 J/mol·K × 45 K

3. Explain why:

(a) Two bodies at different temperatures T1 and T2 if brought in thermal contact do not necessarily settle to the mean temperature (T1 + T2 )/2.

Ans: Law of conservation of Energy says that the energy is transferred from one body to another and from one format to another. The final temperature can be the mean temperature only when the thermal capacities of both the bodies are equal.

(b) The coolant in a chemical or a nuclear plant (i.e., the liquid used to prevent the different parts of a plant from getting too hot) should have high specific heat.

Ans: If the specific heat of the coolant is high, it can absorb large amounts of heat without heating itself much. Hence, a coolant should have high specific heat.

Ans: Temperature of air in the tyre increases due to friction of tyre with road. Therefore, air pressure inside the tyre increases according to Charle’s law.

(d) The climate of a harbour town is more temperate than that of a town in a desert at the same latitude.

Ans: This is because in a harbour town, the relative humidity is more than in a desert town. Hence, the climate of harbour town is without extremes of hot and cold.

4. A cylinder with a movable piston contains 3 moles of hydrogen at standard temperature and pressure. The walls of the cylinder are made of a heat insulator, and the piston is insulated by having a pile of sand on it. By what factor does the ab pressure of the gas increase if the gas is compressed to half its original volume?

Ans: Here:

P 1 V 1 γ = P 2 V 2 γ

where γ is the adiabatic index (approximately 1.4 for hydrogen).

V 2 = V 1 / 2

Rearrange the equation to solve for P 2 /P 1 :

P 2 /P 1 = (V 1 /V 2 ) γ

5. In changing the state of a gas adiabatically from an equilibrium state A to another equilibrium state B, an amount of work equal to 22.3 J is done on the system. If the gas is taken from state A to B via a process in which the net heat absorbed by the system is 9.35 cal, how much is the net work done by the system in the latter case? (Take 1 cal = 4.19 J)

9.35 cal × 4.19 J/cal = 39.15 J

The first law of thermodynamics:

ΔU = Q – W

For the adiabatic process:

ΔU = 0 – (-22.3 J)

ΔU = 22.3 J

For the non-adiabatic process:

ΔU = 39.15 J – W

Since ΔU is the same for both processes:

22.3 J = 39.15 J – W

W = 16.85 J.

6. Two cylinders A and B of equal capacity are connected to each other via a stopcock. A contains a gas at standard temperature and pressure. B is completely evacuated. The entire system is thermally insulated. The stopcock suddenly opened. Answer the following:

(a) What is the final pressure of the gas in A and B?

P 2 V 2 = P 1 V 1

P 1 = 1 atm,

V 1 = V

V 2 = 2V and P 2 = ?

P 2 = P 1 V 1 /V 2

= 1 × V/ 2V

= 0.5 atm.

(b) What is the change in internal energy of the gas?

Ans: Since the temperature of the system remains unchanged, and the process is adiabatic, the change in internal energy of the gas is zero.

Ans: The system being internally insulated, there is no change in temperature.

(d) Do the intermediate states of the system (before settling to the final equilibrium state) lie on its P-V-T surface?

Ans: No, because the process called free expansion is rapid and cannot be controlled. Therefore, the intermediate states are non – equilibrium states and the gas equation is not satisfied in these states. The gas cannot return to an equilibrium state which lie on the P – T- V surface.

7. An electric heater supplies heat to a system at a rate of 100W. If system performs work at a rate of 75 joules per second. At what rate is the internal

energy increasing?

Ans: The first law of thermodynamics states:

dU/dt = dQ/dt – dW/dt

dQ/dt = 100 W

dW/dt = 75 J/s

dU/dt = 100 W – 75 J/s

8. A thermodynamic system is taken from an original state to an intermediate state by the linear process shown in Fig. (11.13).

Its volume is then reduced to the original value from E to F by an isobaric process. Calculate the total work done by the gas from D to E to F.

Ans: As it is clear from the above figure, Change in pressure, dp = EF.

Area of triangle = (1/2) × base x height

Base = 5.0 m³ – 2.0 m³ = 3.0 m³

Height = 600 N/m² – 300 N/m² = 300 N/m²

Work done from D to E = (1/2) × 3.0 m³ × 300 N/m² = 450 J.

Work done from E to F:

Length = 5.0 m 3 – 2.0 m 3 = 3.0 m 3

Width = 300 N/m 2

Work done from E to F = 3.0 m 3 × 300 N.m 2 = 900 J

Total work done

= 450 j + 900 j

NCERT Class 11 Physics Chapter 1…

NCERT Class 11 Physics Chapter 2…

NCERT Class 11 Physics Chapter 3…

NCERT Class 11 Physics Chapter 4…

NCERT Class 11 Physics Chapter 5…

NCERT Class 11 Physics Chapter 6…

introduction to problem solving class 11 notes

IMAGES

VIDEO

COMMENTS