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.

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

Thu. Aug 29th, 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

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

You are learning...

Computer Science - Class 11

Click on any of the links below to start learning from Teachoo ...

Do you want to learn more about the fascinating and diverse field of computer science? Do you want to develop your skills and knowledge in programming, data structures, algorithms, databases, networking, etc.? Do you want to prepare yourself for higher studies and careers in computer science and related fields?

If you answered yes to any of these questions, then you will benefit from studying computer science class 11. Computer science class 11 is a comprehensive and rigorous course that covers the core concepts and principles of computer science. Computer science class 11 will help you understand how computers work and how they can be used to solve various problems.

Some of the topics you will cover in computer science class 11 are:

The introduction to computer science: How computer science is defined, divided, and related to other disciplines. 📚🔎👥
The basics of Python: How Python is a simple and powerful programming language that can be used for various purposes. 🐍👍
The data types and operators: How data types and operators are used to store and manipulate data in Python. 📊📈📉
The control structures: How control structures such as if, else, elif, for, while, etc. are used to control the flow of execution in Python. 💻🖱️👍
The functions: How functions are used to modularize and reuse code in Python. 💬🔎👏
The lists, tuples, and dictionaries: How lists, tuples, and dictionaries are used to store and access data in Python. 💥😥🚱💧
The strings: How strings are used to store and manipulate text data in Python. 📄💵🔙
The file handling: How file handling is used to store and manage data in files using Python. 📒👀
The object-oriented programming: How object-oriented programming is used to create and use objects, classes, methods, inheritance, etc. in Python. 🐶🐱🐭
The database concepts: How database concepts such as tables, records, fields, keys, etc. are used to store and manipulate data in databases. 🗄️🗃️
The structured query language: How structured query language (SQL) is used to communicate with databases and perform various operations on data. 🗣️👂

By studying computer science class 11, you will gain a deeper understanding of how computer science is the study of computation and its applications . You will also develop critical thinking skills to solve various problems and cases using computer science. You will also appreciate the importance of Python as a versatile and powerful language for various domains and purposes.

Chapter 2 Class 11 - Encoding Schemes and Number System

Chapter 12 class 11 - boolean algebra, chapter 4 class 11 - introduction to problem solving, chapter 5 class 11 - getting started with python, chapter 1 class 11 - computer systems, chapter 6 class 11 - flow of control, chapter 7 class 11 - functions, chapter 8 class 11 - strings, chapter 9 class 11 - lists, teachoo sample paper, chapter 10 class 11 - tuples and dictionaries, chapter 11 class 11 - societal impact, chapter 13 class 11 - cyber safety.

What's in it?

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

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

NCERT Solutions for Class 11 Computer Science

Cbse class 11 computer science (python) solutions guide.

Shaalaa.com provides the CBSE Class 11 Computer Science (Python) Solutions Digest. Shaalaa is undoubtedly a site that most of your classmates are using to perform well in exams.

You can solve the Class 11 Computer Science (Python) Book Solutions CBSE textbook questions by using Shaalaa.com to verify your answers, which will help you practise better and become more confident.

CBSE Class 11 Computer Science (Python) Textbook Solutions

Questions and answers for the Class 11 Computer Science (Python) Textbook are on this page. NCERT Solutions for Class 11 Computer Science (Python) Digest CBSE will help students understand the concepts better.

NCERT Solutions for Class 11 Computer Science (Python) Chapterwise List | Class 11 Computer Science (Python) Digest

The answers to the NCERT books are the best study material for students. Listed below are the chapter-wise NCERT Computer Science (Python) Class 11 Solutions CBSE.

• Chapter 1: Computer System
• Chapter 2: Encoding Schemes and Number System
• Chapter 3: Emerging Trends
• Chapter 4: Introduction to Problem Solving
• Chapter 5: Getting Started with Python
• Chapter 6: Flow of Control
• Chapter 7: Functions
• Chapter 8: Strings
• Chapter 9: Lists
• Chapter 10: Tuples and Dictionaries
• Chapter 11: Societal Impact
Science (English Medium) Class 11 CBSE

NCERT Solutions for Class 11 Computer Science - Shaalaa.com

NCERT Class 11 solutions for other subjects

NCERT solutions for Biology Class 11
NCERT solutions for Biology Class 11 [जीव विज्ञान ११ वीं कक्षा]
NCERT solutions for Chemistry Part 1 and 2 Class 11
NCERT solutions for Chemistry Part 1 and 2 Class 11 [रसायन विज्ञान भाग १ व २ कक्षा ११ वीं]
NCERT solutions for Accountancy - Financial Accounting Class 11
NCERT solutions for Ncert Class 11 Business Studies
NCERT solutions for Introductory Microeconomics - Textbook in Economics for Class 11
NCERT solutions for Economics - Statistics for Economics Class 11
NCERT solutions for Ncert Class 11 English (Core Course) - Hornbill
NCERT solutions for Ncert Class 11 English (Core Course) - Snapshots
NCERT solutions for Ncert Class 11 English (Elective Course) - Woven Words
NCERT solutions for Geography - Fundamentals of Physical Geography Class 11
NCERT solutions for Geography - India Physical Environment Class 11
NCERT solutions for Geography - Practical Work in Geography Class 11
NCERT solutions for Geography Class 11 [भूगोल - भौतिक भूगोल के मूल सिद्धांत ११ वीं कक्षा]
NCERT solutions for Ncert Class 11 History - Themes in World History
NCERT solutions for Ncert Class 11 Political Science - Indian Constitution at Work
NCERT solutions for Ncert Class 11 Political Science - Political Theory
NCERT solutions for Ncert Class 11 Psychology
NCERT solutions for Ncert Class 11 Sociology - Introducing Sociology
NCERT solutions for Ncert Class 11 Sociology - Understanding Society
NCERT solutions for Economics Class 11 [अर्थशास्त्र - अर्थशास्त्र में सांख्यिकी ११ वीं कक्षा]
NCERT solutions for Economics - Introductory Microeconomics Class 11 CBSE [अर्थशास्त्र - व्यष्टि अर्थशास्त्र एक परिचय परिचय ११ वीं कक्षा]
NCERT solutions for Geography Class 11 [भूगोल - भारत: भौतिक पर्यावरण ११ वीं कक्षा]
NCERT solutions for Geography Class 11 [भूगोल - भूगोल में प्रयोगात्मक कार्य ११ वीं कक्षा]
NCERT solutions for Hindi - Aaroh Class 11 [हिंदी - आरोह ११ वीं कक्षा]
NCERT solutions for Hindi - Antara Class 11 [हिंदी - अंतरा ११ वीं कक्षा]
NCERT solutions for Hindi - Vitan Class 11 [हिंदी - वितान ११ वीं कक्षा]
NCERT solutions for History Class 11 [इतिहास - विश्व इतिहास के कुछ विषय ११ वीं कक्षा]
NCERT solutions for Mathematics Class 11
NCERT solutions for Mathematics Class 11 [गणित ११ वीं कक्षा]
NCERT solutions for Physics Part 1 and 2 Class 11
NCERT solutions for Physics Class 11 (Part 1 and 2) [भौतिकी भाग १ व २ कक्षा ११ वीं]
NCERT solutions for Political Science Class 11 [राजनीति विज्ञान - भारत का संविधान सिद्धांत और व्यवहार ११ वीं कक्षा]
NCERT solutions for Political Science Class 11 [राजनीति विज्ञान - राजनीतिक सिद्धांत ११ वीं कक्षा]
NCERT solutions for Psychology Class 11 [मनोविज्ञान ११ वीं कक्षा]
NCERT solutions for Sanskrit - Bhaswati Class 11 [संस्कृत - भास्वती कक्षा ११]
NCERT solutions for Sanskrit - Sahitya Parichay Class 11 and 12 [संस्कृत - साहित्य परिचय कक्षा ११ एवं १२]
NCERT solutions for Sanskrit - Shashwati Class 11 [संस्कृत - शाश्वत कक्षा ११]
NCERT solutions for Sociology Class 11 [समाजशास्त्र - समाज का बोध ११ वीं कक्षा]
NCERT solutions for Sociology Class 11 [समाजशास्त्र - समाजशास्त्र परिचय ११ वीं कक्षा]

Chapters covered in NCERT Solutions for Class 11 Computer Science

Ncert solutions for class 11 computer science (python) (11th) chapter 1: computer system, ncert class 11 computer science (python) (11th) chapter 1: computer system exercises.

Exercise	No. of questions	Pages
	36	24 to 26

NCERT Solutions for Class 11 Computer Science (Python) (11th) Chapter 2: Encoding Schemes and Number System

Ncert class 11 computer science (python) (11th) chapter 2: encoding schemes and number system exercises.

Exercise	No. of questions	Pages
	48	43 to 44

NCERT Solutions for Class 11 Computer Science (Python) (11th) Chapter 3: Emerging Trends

Ncert class 11 computer science (python) (11th) chapter 3: emerging trends exercises.

Exercise	No. of questions	Pages
	23	59 to 60

NCERT Solutions for Class 11 Computer Science (Python) (11th) Chapter 4: Introduction to Problem Solving

Ncert class 11 computer science (python) (11th) chapter 4: introduction to problem solving exercises.

Exercise	No. of questions	Pages
	18	83 to 85

NCERT Solutions for Class 11 Computer Science (Python) (11th) Chapter 5: Getting Started with Python

Ncert class 11 computer science (python) (11th) chapter 5: getting started with python exercises.

Exercise	No. of questions	Pages
	62	115 to 119

NCERT Solutions for Class 11 Computer Science (Python) (11th) Chapter 6: Flow of Control

Ncert class 11 computer science (python) (11th) chapter 6: flow of control exercises.

Exercise	No. of questions	Pages
	24	139 to 141

NCERT Solutions for Class 11 Computer Science (Python) (11th) Chapter 7: Functions

Ncert class 11 computer science (python) (11th) chapter 7: functions exercises.

Exercise	No. of questions	Pages
	27	170 to 173

NCERT Solutions for Class 11 Computer Science (Python) (11th) Chapter 8: Strings

Ncert class 11 computer science (python) (11th) chapter 8: strings exercises.

Exercise	No. of questions	Pages
	25	187 to 188

NCERT Solutions for Class 11 Computer Science (Python) (11th) Chapter 9: Lists

Ncert class 11 computer science (python) (11th) chapter 9: lists exercises.

Exercise	No. of questions	Pages
	25	204 to 206

NCERT Solutions for Class 11 Computer Science (Python) (11th) Chapter 10: Tuples and Dictionaries

Ncert class 11 computer science (python) (11th) chapter 10: tuples and dictionaries exercises.

Exercise	No. of questions	Pages
	33	223 to 227

NCERT Solutions for Class 11 Computer Science (Python) (11th) Chapter 11: Societal Impact

Ncert class 11 computer science (python) (11th) chapter 11: societal impact exercises.

Exercise	No. of questions	Pages
	34	245 to 250

Class 11 NCERT solutions answers all the questions given in the NCERT textbooks in a step-by-step process. Our Computer Science (Python) tutors have helped us put together this for our Class 11 Students. The solutions on Shaalaa will help you solve all the NCERT Class 11 Computer Science (Python) questions without any problems. Every chapter has been broken down systematically for the students, which gives fast learning and easy retention.

Shaalaa provides free NCERT solutions for Class 11 Computer Science. Shaalaa has carefully crafted NCERT solutions for Class 11 Computer Science (Python) that can help you understand the concepts and learn how to answer properly in your board exams. You can also share our link for free Class 11 Computer Science (Python) NCERT solutions with your classmates.

If you have any doubts while going through our Class 11 Computer Science (Python) NCERT solutions, then you can go through our Video Tutorials for Computer Science (Python). The tutorials should help you better understand the concepts.

NCERT Solutions for Class 11 Computer Science (Python) CBSE

Class 11 NCERT Solutions answer all the questions in the NCERT textbooks in a step-by-step process. Our Computer Science (Python) tutors helped us assemble this for our Class 11 students. The solutions on Shaalaa will help you solve all the NCERT Class 11 Computer Science (Python) questions without any problems. Every chapter has been broken down systematically for the students, which gives them fast learning and easy retention.

Shaalaa provides a free NCERT answer guide for Computer Science (Python) Class 11, CBSE. Shaalaa has carefully crafted NCERT solutions for the Class 11 Computer Science (Python) to help you understand the concepts and adequately answer questions in your board exams.

If you have any doubts while going through our Class 11 Computer Science (Python) NCERT solutions, you can go through our Video Tutorials for Computer Science (Python). The tutorials help you better understand the concepts.

Finding the best Computer Science (Python) Class 11 NCERT Solutions Digest is significant if you want to prepare for the exam fully. It's crucial to ensure that you are fully prepared for any challenges that can arise, and that's why a heavy, professional focus can be an excellent idea. As you learn the answers, obtaining the desired results becomes much easier, and the experience can be staggering every time.

NCERT Class 11 Computer Science (Python) Guide Book Back Answers

The following CBSE NCERT Class 11 Computer Science (Python) Book Answers Solutions Guide PDF Free Download in English Medium will be helpful to you. Answer material is developed per the latest exam pattern and is part of NCERT Class 11 Books Solutions. You will be aware of all topics or concepts discussed in the book and gain more conceptual knowledge from the study material. If you have any questions about the CBSE New Syllabus Class 11 Computer Science (Python) Guide PDF of Text Book Back Questions and Answers, Notes, Chapter Wise Important Questions, Model Questions, etc., please get in touch with us.

Comprehensive NCERT Solutions for CBSE Computer Science (Python) Class 11 Guide

The NCERT Computer Science (Python) Class 11 CBSE solutions are essential as they can offer a good improvement guideline. You must push the boundaries and take things to the next level to improve. That certainly helps a lot and can bring tremendous benefits every time. It takes the experience to the next level, and the payoff alone can be extraordinary.

You want a lot of accuracy from the NCERT solution for Computer Science (Python) Class 11. With accurate answers, you'll have the results and value you want. That's why you want quality, reliability, and consistency with something like this. If you have it, things will undoubtedly be amazing, and you will get to pursue your dreams.

Proper Formatting

Suppose you acquire the Computer Science (Python) NCERT Class 11 solutions from this page. In that case, they are fully formatted and ready to use, helping make the experience simpler and more convenient while offering the results and value you need. That's what you want to pursue, a genuine focus on quality and value, and the payoff can be great thanks to that.

Our NCERT Computer Science (Python) Answer Guide for the Class 11 CBSE covers all 11 chapters. As a result, you will be able to fully prepare for the exam without worrying about missing anything. You rarely get such a benefit, which makes the Computer Science (Python) Class 11 CBSE NCERT solutions provided here such an extraordinary advantage that you can always rely on. Consider giving it a try for yourself, and you will find it very comprehensive, professional, and convenient at the same time.

Our CBSE NCERT solutions for Computer Science (Python) Class 11 cover everything from Computer System, Encoding Schemes and Number System, Emerging Trends, Introduction to Problem Solving, Getting Started with Python, Flow of Control, Functions, Strings, Lists, Tuples and Dictionaries, Societal Impact and the other topics.

Yes, these are the best NCERT Class 11 Computer Science (Python) solution options on the market. You must check it out for yourself; the experience can be impressive. You get to prepare for the exam reliably, comprehensively, and thoroughly.

Please look at our Computer Science (Python) Class 11 CBSE answer guide today if you'd like to handle this exam efficiently. Just browse our solutions right now, and you will master the NCERT exam questions in no time! It will offer an extraordinary experience every time, and you will not have to worry about any issues.

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

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

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?

_COMPUTER SCIENCE
_SOCIAL STUDIES
MCQ QUESTIONS
IMP QUESTIONS

Introduction to Problem Solving Class 11 Notes | CBSE Computer Science

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.

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

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

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

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

Posted by Amresh Academy

You may like these posts, post a comment, social plugin, subscribe us.

"Empowering learners with free expert notes and enriching YouTube courses at Amresh Academy"

NS MATHS 10TH
NS SCI 10TH EM
NS SS 10TH EM

दो ध्रुवीयता का अंत Important Questions || Class 12 Political Science Book 1 Chapter 2 In Hindi ||

समकालीन विश्व में अमरीकी वर्चस्व Important Questions || Class 12 Political Science Book 1 Chapter 3 In Hindi ||

शीत युद्ध का दौर Important Questions || Class 12 Political Science Book 1 Chapter 1 In Hindi ||

Footer menu widget.

VISIT FOR HUMANTIES SUBJECT

Contact form

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
Lakhmir Singh and Manjit Kaur Solution
I.E.Irodov solutions
ICSE - Goyal Brothers Park
ICSE - Dorothy M. Noronhe
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
Important Question
Value Based Questions
CBSE Syllabus
CBSE MCQs PDF
Assertion & Reason
New Revision Notes
Revision Notes
Question Bank
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 Previous Year Paper
JEE Mock Test
JEE Crash Course
JEE Sample Papers
Important Info
SRM-JEEE Previous Year Paper
SRM-JEEE Mock Test
VITEEE Previous Year Paper
VITEEE Mock Test
BITSAT Previous Year Paper
BITSAT Mock Test
Manipal Previous Year Paper
Manipal Engineering Mock Test
AP EAMCET Previous Year Paper
AP EAMCET Mock Test
COMEDK Previous Year Paper
COMEDK Mock Test
GUJCET Previous Year Paper
GUJCET Mock Test
KCET Previous Year Paper
KCET Mock Test
KEAM Previous Year Paper
KEAM Mock Test
MHT CET Previous Year Paper
MHT CET Mock Test
TS EAMCET Previous Year Paper
TS EAMCET Mock Test
WBJEE Previous Year Paper
WBJEE Mock Test
AMU Previous Year Paper
AMU Mock Test
CUSAT Previous Year Paper
CUSAT Mock Test
AEEE Previous Year Paper
AEEE Mock Test
UPSEE Previous Year Paper
UPSEE Mock Test
CGPET 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
Verbal Ability & Reading Comprehension
Logical Reasoning & Data Interpretation
CAT Mock Test
CAT Important Question
CAT Vocabulary
CAT English Grammar
MBA General Knowledge
CAT Mind Map
CAT Study Planner
CMAT Mock Test
SRCC GBO Mock Test
SRCC GBO PYQs
XAT Mock Test
SNAP Mock Test
IIFT Mock Test
MAT Mock Test
CUET PG Mock Test
CUET PG PYQs
MAH CET Mock Test
MAH CET PYQs
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

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

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

NCERT Class 11 Computer Science Chapter 4 Introduction to Problem Solving Books are available here for the students willing to score higher marks in the board exams. In addition to that it is extremely helpful for those who want to prepare for the competitive exams. Therefore, it is very important to study the NCERT books class 11 Computer Science Chapter 4 Introduction to Problem Solving to understand it thoroughly.

The links to Download NCERT Books For Class 11 are available here on this website. It is available in PDF file format.

NCERT Books For Class 11 Computer Science Chapter 4 Introduction to Problem Solving is designed and developed by the subject matter experts in the most systematic manner. It helps in having hassle free access to a plethora of important topics of Computer Science Chapter 4 Introduction to Problem Solving. Every single chapter has been illustrated in simple language which aids in better understanding of the topics. Also, many real life examples have been given to make the learners aware of the fact that these topics have real life implementations.

Having such useful information and resources makes students interested in the subject. The new edition of NCERT Class 11 Computer Science Chapter 4 Introduction to Problem Solving Textbook 2021-22 has been developed according to the latest research and development. So, students can expect fresh and updated data or information in the textbooks.

This textbook helps in covering the prescribed syllabus of CBSE for the 11th class students. The Computer Science Chapter 4 Introduction to Problem Solving class 11 syllabus has been crafted by keeping in mind the requirement and understanding level of students. Therefore, students get access to the topics that are important to them.

Free NCERT Books For Class 11 Chapter Wise

Chapter wise NCERT Class 11 Books are very helpful because it makes the learning process easier. The complete set of chapter wise books aid students to become precise and focus on active learning. Having said that, this book is very effective to learn new things, improve the already known things and excel in the board papers and competitive exams.

Learning topics of Computer Science Chapter 4 Introduction to Problem Solving is not as hard as students often think. They just need the most systematic approaches that can boost their overall learning process and enhance their cognitive skills. Hence, students of class 11th should only study from the NCERT Books. Because, it helps the students in all these mentioned ways. It is simple, effective, contains lots of questions and their short notes help in revision as well.

The Download link for this book is given here on this page for free of cost.

NCERT Computer Science Chapter 4 Introduction to Problem Solving Class 11 Book English Medium

NCERT Computer Science Chapter 4 Introduction to Problem Solving Class 11 Book English Medium is useful for those who have opted for the English Medium Textbooks. It is very handy to solve various types of questions whether it is 1 mark, 2 marks, Case Study, Assertion and Reason or Long types Answer, etc. English Medium Class 11th NCERT Computer Science Chapter 4 Introduction to Problem Solving Textbooks are useful in all aspects.

A thorough understanding of all the concepts of NCERT Computer Science Chapter 4 Introduction to Problem Solving Class 11 helps in answering any types of questions asked in the board papers. The textbooks are only resources which are prescribed by the board to study and give the assessment. Many questions in the board papers are asked directly from the Textbooks.

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.

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.

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?

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.

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.

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.

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?

13. Match the pairs

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

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

Introduction to Problem Solving

Problems cannot be resolved by computers alone. We must provide clear, step-by-step directions on how to solve the issue. Therefore, the effectiveness of a computer in solving a problem depends on how exactly and correctly we describe the problem, create an algorithm to solve it, and then use a programming language to implement the algorithm to create a programme. So, the process of identifying a problem, creating an algorithm to solve it, and then putting the method into practise to create a computer programme is known as problem solving.

Steps for Problem Solving

To identify the best solution to a difficult problem in a computer system, a Problem Solving methodical approach is necessary. To put it another way, we must use problem-solving strategies to solve the difficult problem in a computer system. Problem fixing starts with the accurate identification of the issue and concludes with a fully functional programme or software application. Program Solving Steps are – 1. Analysing the problem 2. Developing an Algorithm 3. Coding 4. Testing and Debugging

Analyzing the problem – It is important to clearly understand a problem before we begin to find the solution for it. If we are not clear as to what is to be solved, we may end up developing a program which may not solve our purpose.

Developing an Algorithm – Before creating the programme code to solve a particular problem, a solution must be thought out. Algorithm is a step by step process where we write the problem and the steps of the programs.

Coding – After the algorithm is completed, it must be translated into a form that the computer can understand in order to produce the desired outcome. A programme can be written in a number of high level programming languages.

Testing and Debugging – The developed programme needs to pass different parameter tests. The programme needs to fulfil the user’s requirements. It must answer in the anticipated amount of time. For all conceivable inputs, it must produce accurate output.

What is the purpose of Algorithm?

A programme is created by a programmer to tell the computer how to carry out specific activities. Then, the computer executes the instructions contained in the programme code. As a result, before creating any code, the programmer first creates a roadmap for the software. Without a roadmap, a programmer might not be able to visualise the instructions that need to be written clearly and might end up creating a software that might not function as intended. This roadmap is known as algorithm.

Why do we need an Algorithm?

The purpose of using an algorithm is to increase the reliability, accuracy and efficiency of obtaining solutions.

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 and pseudocode. Either of the methods can be used to represent an algorithm while keeping in mind the following: • it showcases the logic of the problem solution, excluding any implementational details • it clearly reveals the flow of control during execution of the program

Flowchart — Visual Representation of Algorithms

There are standardized symbols to draw flowcharts. Some are given below –

Flow Chart Syntax

How to draw flowchart

Q. Draw a flowchart to find the sum of two numbers?

algorithm and flowchart for addition of two numbers

Q. Draw a flowchart to print the number from 1 to 10?

Another way to represent an algorithm is with a pseudocode, which is pronounced Soo-doh-kohd. It is regarded as a non-formal language that aids in the creation of algorithms by programmers. It is a thorough explanation of the steps a computer must take in a specific order.

The word “pseudo” means “not real,” so “pseudocode” means “not real code”. Following are some of the frequently used keywords while writing pseudocode –

Write an algorithm to display the sum of two numbers entered by user, using both pseudocode and flowchart.

Pseudocode for the sum of two numbers will be – input num1 input num2 COMPUTE Result = num1 + num2 PRINT Result

Flowchart for this pseudocode or algorithm –

Flow of Control

The flow of control depicts the flow of events as represented in the flow chart. The events can flow in a sequence, or on branch based on a decision or even repeat some part for a finite number of times.

Sequence – These algorithms are referred to as executing in sequence when each step is carried out one after the other.

Selection – An algorithm may require a question at some point because it has come to a stage when one or more options are available. This type of problem we can solve using If Statement and Switch Statement in algorithm or in the program.

Repetition – We often use phrases like “go 50 steps then turn right” while giving directions. or “Walk to the next intersection and turn right.” These are the kind of statements we use, when we want something to be done repeatedly. This type of problem we can solve using For Statement, While and do-while statement.

Verifying Algorithms

Software is now used in even more important services, such as the medical industry and space missions. Such software must function properly in any circumstance. As a result, the software designer must ensure that every component’s operation is accurately defined, validated, and confirmed in every way.

To verify, we must use several input values and run the algorithm for each one to produce the desired result. We can then tweak or enhance the algorithm as necessary.

Comparison of Algorithm

There may be more than one method to use a computer to solve a problem, If you wish to compare two programmes that were created using two different approaches for resolving the same issue, they should both have been built using the same compiler and executed on the same machine under identical circumstances.

Once an algorithm is decided upon, it should be written in the high-level programming language of the programmer’s choice. By adhering to its grammar, the ordered collection of instructions is written in that programming language. The grammar or set of rules known as syntax controls how sentences are produced in a language, including word order, punctuation, and spelling.

Decomposition

A problem may occasionally be complex, meaning that its solution cannot always be found. In these circumstances, we must break it down into simpler components. Decomposing or breaking down a complicated problem into smaller subproblems is the fundamental concept behind addressing a complex problem by decomposition. These side issues are more straightforward to resolve than the main issue.

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

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…

CBSE Class 11 Physics Revision Notes


Video Lectures	Live Sessions
Study Material	Tests
Previous Year Paper	Revision

All the CBSE Class 11 Physics Notes are also available in the PDF format on the official website of eSaral. Once you download these notes in PDF, you do not need an internet connection to go through the notes for a quick revision. These 11th class 11 Physics notes pdf can also be printed as a hard copy to have an additional mode of revising all your chapters easily. These notes are designed keeping in mind the understanding level of Class 11th students; so you will get clarification at the concept level so that they do not need to mug up the solutions. The Physics Notes for Class 11 by our expert teacher prepares you better for your exams as you will be able to manage your time well and deal with stressful exam environments more efficiently with these solutions in your hands.

CBSE Class 11 Physics Weightage 2024-25


Unit - I	Physical World and Measurement	23
	Chapter–2: Units and Measurements
Unit - II	Kinematics
	Chapter–3: Motion in a Straight Line
	Chapter–4: Motion in a Plane
Unit - III	Laws of Motion
	Chapter–5: Laws of Motion
Unit - IV	Work, Energy and Power	17
	Chapter–6: Work, Energy and Power
Unit - V	Motion of System of Particles and Rigid Body
	Chapter–7: System of Particles and Rotational Motion
Unit - VI	Gravitation
	Chapter–8: Gravitation
Unit - VII	Properties of Bulk Matter	20
	Chapter–9: Mechanical Properties of Solids
	Chapter–10: Mechanical Properties of Fluids
	Chapter–11: Thermal Properties of Matter
Unit–VIII	Thermodynamics
	Chapter–12: Thermodynamics
Unit–IX	Behaviour of Perfect Gases and Kinetic Theory of Gases
	Chapter–13: Kinetic Theory
Unit–X	Oscillations and Waves	10
	Chapter–14: Oscillations
	Chapter–15: Waves
Total		70

Overview of Revision Notes CBSE Class 11 Physics

Students of Class 11 have Physics as one of their main subjects for their boards. The subject of Physics introduces students to different concepts such as Thermodynamics, Kinematics, the Physical World & Measurements, Gravitation, Motion of Particles, Oscillation & Waves, Kinetic Theory of Gases and so many. There are important concepts, principles, functions, processes, and equations that are included in the chapters so that you can study the chapters in more detail with the help of 11th Physics Notes. Prepared by experts at esaral with vast experience in the field of Physics, these notes provide a detailed understanding of all the chapters in the Physics syllabus for students.

Solving these questions in the textbook and preparing the Physics topics properly will help you perform well in your board exams. You can download and practice from Physics Notes for Class 11 PDF in order to gain a proper understanding of the topics. These notes contain precise and step-by-step explanations of all the concepts and principles mentioned in the chapters.

Revision Notes of Physics Class 11

Chapter 1 - Physical World

In this Revision Notes of Physics Class 11 Chapter 1, students will get acquainted with the basics of physics and its origin. The main points covered in this chapter are:

Details on Scientific method of observation and Mathematical modelling.

The two principal types of approaches in Physics (Unification and Reduction).

How Physics has impacted the development of devices and the use of concepts of Physics in different facets.

Different scopes of Physics and its categorization into two types based on the scope (Classical Physics and Modern Physics).

Macroscopic and Microscopic phenomena in Physics.

Chapter 2 - Units and Measurements

Physics Quick Revision Notes for Chapter 2 talks about various units of measurements and their use in measuring distance or time between multiple objects. The main topics covered in this chapter are:

Measurement and units for fundamental quantities like length, time, etc.

How to measure large distances using the parallax method.

Use of an electron microscope to measure very small distances.

Measurement of time using an atomic clock.

Chapter 3 - Motion in a Straight Line

Our revision notes of Chapter 3 cover the important terms related to kinematics like:

Motion in one dimension and important terms related to it.

Rest and motion.

Position, distance, and placement.

Difference between speed and velocity.

Chapter 4 - Motion in a Plane

Our Class 11 Physics revision Notes of Motion in a Plane cover the basics of motion in two dimensions. The main feature points discussed in Chapter 4 are:

Scalar and vector - unit vector, parallel vectors.

Addition, subtraction, and scalar multiplication of vectors

Average and instantaneous velocity.

Position vector and displacement.

Projectile motion.

Chapter 5 - Law of Motion

In our key 11th Class Physics Notes, you will understand what force is and the laws of motion. The chapter covers:

Definition of force and basic forces.

Newton’s law of motion.

Linear momentum.

Principle of conservation of momentum.

Chapter 6 - Work, Energy, and Power

Our revision notes for Chapter 6 will give you brief of formulas and equations on Work, Power, and Energy. Your concept on the following will get cleared:

Work and dimensions of the unit of work.

Conservative and non-conservative forces.

Kinetic energy and its relationship with momentum.

Chapter 7 - Systems of Particles and Rotational Motion

The notes of Chapter 7 contain detailed knowledge of how the system of particles moves in our daily lives. The main focus is on the following key points:

Kinematics of a system of particles- various types of motions like translational motion, rotational motion, and rotational plus translational motion.

Rotational dynamics - This comprises Newtons' laws, the moment of inertia, and theorems related to these concepts.

Angular momentum and impulse.

Work and Energy - The work is done by a torque, kinetic energy.

Rolling - rolling and sliding on an inclined plane.

Chapter 8 - Gravitation

In our revision notes for gravitation, we explain the law of gravitation given by Newton and many examples and problems that will clarify this law to you. It has the following topics in detail:

Newton’s law of gravitation

The universal constant of gravitation (g) and variation in g based on the distance of the object above the earth’s surface

Satellite - How a satellite is projected to form a circular orbit around a planet

Orbital velocity

Period of revolution of a satellite

Chapter 9 - Mechanical Properties of Solids

Our crucial revision notes in this chapter will help you understand how even rigid bodies can be bent and stretched by applying sufficient external force. As part of this chapter, you would learn about:

Deforming force

Perfect elastic body

Types of stress - Longitudinal, Tangential or shearing, Normal

Hooke’s law

Chapter 10 - Mechanical Properties of Fluids

Our revision notes of Physics Chapter 10 explain Pascal’s and Archimedes' principles related to fluid dynamics. Here is a synopsis of what all you would learn in this chapter:

Fluid mechanics - fluid pressure, atmospheric pressure

Pascal’s law

Archimedes Principle

Fluid dynamics - steady flow, line of flow

The velocity of Efflux

Bernoulli’s theorem

Chapter 11 - Thermal Properties of Matter

The important notes of the matter's thermal properties will take you through a detailed course on heat and thermodynamics. You would learn about following rules and theorems in this chapter:

Thermal properties of matter - temperature, heat, absolute temperature scale, and measurement of temperature

Thermal expansion

Heat transfer - Conduction, Convection, and Radiation

Newton’s law of cooling

Chapter 12 - Thermodynamics

In our revision notes of Chapter 12, students would learn about the interrelation between heat and other forms of energy. It covers the following key concepts:

Thermal equilibrium

Heat, work, and internal energy

Important thermodynamic terms like static variables, equation of state, Quasi-static process

Isothermal process

1st law of thermodynamics and its applications

Chapter 13 - Kinetic Theory

These crucial notes on kinetic theory will teach students about the following important topics:

Definition of kinetic theory

Molecular nature of matter - Dalton’s atomic theory, Avogadro’s law, Gay Lussac’s law

Molecular structure of solids, liquids, and gases

The behaviour of gases and the perfect gas equation

Deduction of Boyle’s and Charle’s Laws

Chapter 14 - Oscillations and Waves

Our revision notes of Class 11 Chapter 14 will teach you about what oscillation is and different types of oscillations. You can learn the following in this chapter:

Definition of oscillation and waves

Important terms related to oscillation like amplitude, period, acceleration, etc.

The time of simple harmonic motion

Damped and forced oscillations

Benefits of Class 11 Physics Notes PDF Download

All Class 11 Physics revision notes have been explained in detail in these revision notes. The learned experts at eSaral have used simple language to get the concepts explained. You can rely on these notes to get proper guidance about the chapters and develop their knowledge.

The notes are amazing study resources that can help you build a strong foundation in Physics subjects. You will get familiar with the concepts such as units of fundamental quantities, Newton’s laws of gravitation, Satellites, Angular Momentum, Energy, Work, and much more. The concepts have been clearly explained using different examples to make you understand better.

The notes for class 11 Physics will help students clarify any doubts that they might have about the chapters. Students can easily refer to the revision notes and find out the areas where they need to make improvements. Thus, these class 11 Physics notes pdf will also help them in rectifying their errors and strengthen their answering skills.

The revision notes have been designed in a very systematic manner for the students. Thus, if you are looking for Class 11 Physics notes, you will be able to find the details right there. This makes it easier for you to access the files and get what they are looking for.

Before the exams start, you might not have the time to go through the whole Physics textbook and learn the details one by one. You can refer to the revision notes and get details about the chapters easily and this will make sure that students are able to revise their concepts before the exams.

eSaral Gurukul

JEE Coaching in Kota
NEET Coaching in Kota
NEET Question Paper
NEET 2024 Question Paper
NEET 2024 Exam Date
JEE Main 2025
JEE Main Question Paper
JEE Main 2024 Question Paper
JEE Main 2023 Question Paper
JEE Main 2022 Question Paper
JEE Main 2021 Question Paper

JEE Advanced

JEE Advanced Question Paper
JEE Advanced 2023 Question Paper

Our Telegram Channel

eSaral NEET
eSaral Class 9-10

All Study Material

COMMENTS

Introduction to Problem Solving Class 11 Notes
Steps for problem solving. There are 4 basic steps involved in problem solving. Analyze the problem. Developing an algorithm. Coding. Testing and debugging. Analyze the problem. Analyzing the problem is basically understanding a problem very clearly before finding its solution. Analyzing a problem involves.
PDF Introduction to Problem Solving
to apply problem solving techniques. Problem solving begins with the precise identification of the problem and ends with a complete working solution in terms of a program or software. Key steps required for solving a problem using a computer are shown in Figure 4.1 and are discussed in following subsections. 4.2.1 Analysing the problem
Class 11 Computer Science Complete Notes
In conclusion, these Class 11 Computer Science Notes cover all key topics in the CBSE curriculum, from computer systems basics to programming and digital ethics. Designed to be clear and concise, these notes will help you excel in exams and deepen your understanding of computer science. ... CBSE Class 11 | Problem Solving Methodologies.
Introduction to Problem Solving
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.
Introduction to problem solving Computer Science Class 11 Notes
So it is a step-by-step process. These steps are as follows: Analysing the problem. Developing an algorithm. Coding. Testing and debugging. The first step in the introduction to problem solving Computer Science Class 11 is analyzing the problem.
Chapter 4 Class 11
In this chapter, you will learn about the basic concepts and techniques of problem solving using computers. You will learn how to: Define a problem and its specifications 📝. Analyze a problem and identify its inputs, outputs and processing steps 🔎. Design an algorithm to solve a problem using various methods such as pseudocode, flowcharts ...
Chapter 4 : Introduction to Problem Solving
Introduction to Problem Solving Notes Topics: 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…
Class 11 27. Computer Science 4. Introduction to Problem Solving NCERT
Introduction to Problem Solving Chapter of the NCERT Class 11 27. Computer Science book serves as a gateway to the rich and diverse world of mathematical exploration and inquiry. As students embark on their journey through this chapter in the academic session of 2024-25, they are greeted with a concepts, definations and knowledge that lie ahead.
Chapter 4 Introduction to Problem Solving
👍Welcome to Playlist of CBSE Class 11- Computer Science with Python_____📚Chapter 4 - Introduction to Problem Sol...
NCERT solutions for Class 11 Computer Science chapter 4
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.
Chapter 5 Introduction to Problem Solving
in this video I have started chapter 5 Introduction to problem Solving of class 11 computer Science and in this part 1 video I have explained the following ...
Steps for Problem Solving
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 ...
Computer Science Class 11
Computer science class 11 is a comprehensive and rigorous course that covers the core concepts and principles of computer science. Computer science class 11 will help you understand how computers work and how they can be used to solve various problems. ... Chapter 4 Class 11 - Introduction to Problem Solving Concepts MCQ questions (1 mark each ...
NCERT Solutions for Class 11 Computer Science
Class 11 NCERT solutions answers all the questions given in the NCERT textbooks in a step-by-step process. ... Guide PDF of Text Book Back Questions and Answers, Notes, Chapter Wise Important Questions, Model Questions, etc., please get in touch with us. ... Introduction to Problem Solving, Getting Started with Python, Flow of Control ...
NCERT Solutions Class 11 Computer Science Chapter 4 Introduction to
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: 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".
CBSE Class 11
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.
Introduction to Problem Solving Class 11 Notes
Steps for problem solving. There are 4 basic steps involved in problem solving. Analyze the problem; Developing an algorithm; Coding; Testing and debugging; Analyze the problem. Analyzing the problem is basically understanding a problem very clearly before finding its solution. Analyzing a problem involves. List the principal components of the ...
NCERT Books for Class 11 Computer Science Chapter 4 ...
The new edition of NCERT Class 11 Computer Science Chapter 4 Introduction to Problem Solving Textbook 2021-22 has been developed according to the latest research and development. So, students can expect fresh and updated data or information in the textbooks. This textbook helps in covering the prescribed syllabus of CBSE for the 11th class ...
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 ...
Chapter 4 : Introduction to Problem Solving
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. 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…
Introduction to Problem Solving Class 11 Questions and Answers
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.
Introduction to Problem Solving Class 11 Notes
Write an algorithm to display the sum of two numbers entered by user, using both pseudocode and flowchart. Pseudocode for the sum of two numbers will be -. input num1. input num2. COMPUTE Result = num1 + num2. PRINT Result. Flowchart for this pseudocode or algorithm -. Introduction to Problem Solving Class 11 Notes.
NCERT Class 11 Physics Chapter 11 Thermodynamics
Given: V 2 = V 1 / 2. Rearrange the equation to solve for P 2 /P 1:. P 2 /P 1 = (V 1 /V 2) γ = (2) 1.4 = 2.639. 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.
CBSE Class 11 Physics Revision Notes
The notes for class 11 Physics will help students clarify any doubts that they might have about the chapters. Students can easily refer to the revision notes and find out the areas where they need to make improvements. Thus, these class 11 Physics notes pdf will also help them in rectifying their errors and strengthen their answering skills.

Introduction to Problem Solving Class 11 Notes | CBSE Computer Science

What is Problem Solving?

Steps for problem solving

What is Algorithm?

Why do we need Algorithm?

Representation of Algorithm

Flow Chart Examples

Pseudo Code Example

Flow of Control

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

Algorithm, Pseudocode, Flowchart with Repetition ( Loop ) Examples

Decomposition

Related Posts

Leave a Comment Cancel Reply

Introduction to Problem Solving – Notes

Representation of Algorithms

Flow of Control :

Related Posts

Society, Law, and Ethics: Societal Impacts – Notes

Python Revision Tour I : Basics of Python – Notes

Introduction to Python Module – Notes

Sorting Techniques in Python – Notes

Introduction to problem solving Computer Science Class 11 Notes

By Sanjay Parmar

Introduction to problem solving Computer Science class 11

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

Analysing the problem

Why algorithm is needed?

Characteristics of a good algorithm

Flowchart – Visual representation of an algorithm

Share this:

Related Post

Interesting

Computer Science - Class 11

Chapter 2 Class 11 - Encoding Schemes and Number System

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

NCERT Solutions for Class 11 Computer Science

CBSE Class 11 Computer Science (Python) Textbook Solutions

NCERT Solutions for Class 11 Computer Science (Python) Chapterwise List | Class 11 Computer Science (Python) Digest

Advertisements

NCERT Class 11 solutions for other subjects

Chapters covered in NCERT Solutions for Class 11 Computer Science

NCERT Solutions for Class 11 Computer Science (Python) (11th) Chapter 2: Encoding Schemes and Number System

NCERT Solutions for Class 11 Computer Science (Python) (11th) Chapter 3: Emerging Trends

NCERT Solutions for Class 11 Computer Science (Python) (11th) Chapter 4: Introduction to Problem Solving

NCERT Solutions for Class 11 Computer Science (Python) (11th) Chapter 5: Getting Started with Python

NCERT Solutions for Class 11 Computer Science (Python) (11th) Chapter 6: Flow of Control

NCERT Solutions for Class 11 Computer Science (Python) (11th) Chapter 7: Functions

NCERT Solutions for Class 11 Computer Science (Python) (11th) Chapter 8: Strings

NCERT Solutions for Class 11 Computer Science (Python) (11th) Chapter 9: Lists

NCERT Solutions for Class 11 Computer Science (Python) (11th) Chapter 10: Tuples and Dictionaries

NCERT Solutions for Class 11 Computer Science (Python) (11th) Chapter 11: Societal Impact

NCERT Solutions for Class 11 Computer Science (Python) CBSE

NCERT Class 11 Computer Science (Python) Guide Book Back Answers

Comprehensive NCERT Solutions for CBSE Computer Science (Python) Class 11 Guide

Proper Formatting

Select a course

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

Leave a Reply Cancel reply

CBSE Class 11 | Problem Solving Methodologies

Problem Solving Methodology(The solution for the problem)

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

Please Login to comment...

Improve your Coding Skills with Practice

What kind of Experience do you want to share?

Introduction to Problem Solving Class 11 Notes | CBSE Computer Science

What is Problem Solving?

Steps for problem solving

What is Algorithm?

Why do we need Algorithm?

Representation of Algorithm

Flow Chart Examples

Pseudo Code Example

Flow of Control

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

Algorithm, Pseudocode, Flowchart with Repetition ( Loop ) Examples

Decomposition

Posted by Amresh Academy

Popular Posts

दो ध्रुवीयता का अंत Important Questions || Class 12 Political Science Book 1 Chapter 2 In Hindi ||