class 11 computer science chapter 5 introduction to problem solving

THE PATH TO SUCCESS IN EXAM...

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.

• Input Output in Python

Related Posts

Society, Law, and Ethics: Societal Impacts – Notes

Data structure: stacks – notes.

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

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

Related Posts

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

Leave a Comment Cancel Reply

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

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

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

Advertisements

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.

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.

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.

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.

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.

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.

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

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

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

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

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

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

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.

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.

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 Books

NCERT Books for Class 11 Computer Science PDF Download

NCERT Books Class 11 Computer Science : The National Council of Educational Research and Training (NCERT) publishes Computer Science textbooks for Class 11. The NCERT Class 11th Computer Science textbooks are well known for it’s updated and thoroughly revised syllabus. The NCERT Computer Science Books are based on the latest exam pattern and CBSE syllabus.

NCERT keeps on updating the Computer Science books with the help of the latest question papers of each year. The Class 11 Computer Science books of NCERT are very well known for its presentation. The use of NCERT Books Class 11 Computer Science is not only suitable for studying the regular syllabus of various boards but it can also be useful for the candidates appearing for various competitive exams, Engineering Entrance Exams, and Olympiads.

NCERT Class 11 Computer Science Books in English PDF Download

NCERT Class 11 Computer Science Books are provided in PDF form so that students can access it at any time anywhere. Class 11 NCERT Computer Science Books are created by the best professors who are experts in Computer Science and have good knowledge in the subject.

NCERT Books for Class 11 Computer Science – English Medium

• 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

NCERT Books for Class 11 Computer Science English Medium PDF-Download

The NCERT syllabus mainly focuses on this book to make it student-friendly to make it useful for both the students and the competitive exam aspirants. The book covers a detailed Computer Science based on the syllabuses of various boards. NCERT Computer Science Books for Class 11 is perfectly compatible with almost every Indian education state and central boards.

We hope that this detailed article on NCERT Books Class 11 Computer Science helps you in your preparation and you crack the Class 11 exams or competitive exams with excellent scores.

Leave a Comment Cancel reply

You must be logged in to post a comment.

NCERT Solutions Class 11 Computer Science Chapter 5 Getting Started with Python

NCERT Solutions Class 11 Computer Science Chapter 5 Getting Started with Python: National Council of Educational Research and Training Class 11 Computer Science Chapter 5 Solutions – Getting Started with Python. NCERT Solutions Class 11 Computer Science Chapter 5 PDF Download.

NCERT Solutions Class 11 Computer Science Chapter 5: Overview

ii 1st_Room                   vi total-Marks

iv Total Marks                viii True

ii) 1st_Room :- Invalid

v) Total_Marks :- Valid

Reason- We can’t use keyword as a identifier

Question 2 . Write the corresponding Python assignment statements:

d) Assign the strings ‘Mohandas’, ‘Karamchand’, and ‘Gandhi’ to variables first, middle and last.

a) Assign 10 to variable length and 20 to variable breadth.

first = ‘Mohandas’

middle= ‘Karamchand’

a) 0 == 1 == 2

Question 5 . Write the output of the following:

num1, num2 = num2, num1 + 2

print (num1, num2, num3)

g) Name of the student

a) num1 += num2 + num3

h) num1 = float(10)

l) print(10 + 6 * 2 ** 2 != 9//4 -3 and 29

c) num1 **= num2 + num3

j) print(‘Bye’ == ‘BYE’)

print(volume_sphere(16))

print (‘Hello %s.  You will turn 100 years old in %s.’ % (name,x))

Leave a Reply Cancel reply

We have a strong team of experienced teachers who are here to solve all your exam preparation doubts, kerala scert class 8 english the sower question answer, up scert solutions class 6 english chapter 10 – the story of a bicycle, up scert solutions class 5 english chapter 7 people who help us, up scert solutions class 6 english chapter 9 – the rainbow fairies.

• Thu. Sep 5th, 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:

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

Share this:

• Click to share on WhatsApp (Opens in new window)
• Click to share on Telegram (Opens in new window)
• Click to share on Facebook (Opens in new window)
• Click to share on Twitter (Opens in new window)
• Click to share on LinkedIn (Opens in new window)

Related Post

Computer science class 11 sample papers comprehensive guide, split up syllabus computer science class 11 comprehensive guide, comprehensive notes types of software class 11, leave a reply cancel reply.

You must be logged in to post a comment.

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

Interesting

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

Are you in school ? Do you love Teachoo?

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

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

Steps for Problem Solving

Last updated at April 16, 2024 by Teachoo

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

Davneet Singh

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

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

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

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

Class 11 Computer Science Complete Notes

These complete Class 11 Computer Science Notes for every unit are tailored to help you easily grasp the essential topics covered in your CBSE Class 11 computer science curriculum. So, whether you are studying for exams, or working on assignments, these notes provide a clear and straightforward guide about the topics.

This guide covers all 3 units of Class 11 Computer Science, like Computer Systems and Organisation where you get to know all the fundamentals of computer systems. Computational Thinking and Programming where you will learn the basics of programming, including key concepts like variables, data types, and basic algorithms, to help you start coding confidently. And in last, you will learn about Society, Law, and Ethics here you will get to know all about the computer society, IT laws, and ethics.

Introduction to Unit I: Computer Systems and Organisation

Welcome to Unit I: Computer Systems and Organisation ! This unit is all about understanding computers’ essential components and workings, helping you grasp how they process, store, and manage information. Here’s a quick tour of what we’ll cover:

• Computer System Basics : We’ll start with the foundation of what a computer system is, including both hardware (the physical parts like the CPU, memory, and input/output devices) and software (the programs and operating systems that run on the hardware).
• Hardware : Dive into the major components such as the Central Processing Unit ( CPU ), which acts as the brain of the computer, and the various types of memory—primary ( RAM ), cache, and secondary storage (hard drives and SSDs). We’ll also look at how these elements work together to perform tasks.
• Software : Learn about the different types of software, from system software (like operating systems and utilities) that manage hardware to application software that helps you perform specific tasks such as word processing or web browsing. We’ll also touch on programming tools that help developers create software.
• Boolean Logic : Understand the basics of Boolean logic, including operators like AND, OR, and NOT, and how they form the foundation of computer operations and digital circuits.
• Number Systems : Explore different number systems (binary, octal, decimal, hexadecimal) and how to convert between them. This is crucial for understanding how computers process and represent data.
• Encoding Schemes : Discover how computer characters and symbols are represented using encoding schemes like ASCII , ISCII, and Unicode.

This unit sets the stage for your journey into computing, giving you the tools to understand how computers work and interact with the digital world. Whether you’re curious about the inner workings of your device or eager to dive deeper into programming and technology, this unit provides the essential knowledge you’ll build on throughout your studies.

Introduction to Unit II: Computational Thinking and Programming

Welcome to Unit II: Computational Thinking and Programming ! This unit is designed to introduce you to the fundamental concepts of problem-solving and programming, essential skills for anyone interested in technology and computing. Here’s a quick overview of what you’ll learn:

• Computational Thinking : We’ll begin by exploring computational thinking, a method of problem-solving that involves breaking down complex problems into smaller, manageable parts. You’ll learn about key strategies such as pattern recognition, abstraction, and algorithm design, which are crucial for developing efficient solutions.
• Programming Basics : Dive into the world of programming with a focus on understanding how to write and interpret code. You’ll be introduced to basic programming concepts such as variables, data types, control structures (like loops and conditionals), and functions. These are the building blocks of creating software and solving computational problems.
• Algorithms and Flowcharts : Learn how to design algorithms—step-by-step procedures for solving problems—and represent them using flowcharts. This helps in visualizing and organizing your approach to solving a problem before writing code.
• Introduction to Programming Languages : Get familiar with different programming languages and their uses. We’ll cover the basics of popular languages and highlight how they can be applied to various tasks, from web development to data analysis.
• Debugging and Testing : Discover techniques for finding and fixing errors in your code. Understanding how to debug and test your programs ensures they run smoothly and perform as expected.
• Project Development : Apply what you’ve learned by working on practical programming projects. These projects will help you understand how to implement computational thinking and programming concepts to build functional software.

This unit provides the foundational skills needed to tackle computational problems and start programming. Whether you’re interested in building your own apps, solving complex problems, or just understanding how software works, Unit II equips you with the essential tools and techniques to get started in the world of programming.

Introduction to Unit III: Society, Law, and Ethics

Welcome to Unit III: Society, Law, and Ethics ! This unit explores the important intersection of technology with societal norms, legal frameworks, and ethical considerations. Here’s a quick guide to what we’ll cover:

• Digital Footprints : Understand the concept of digital footprints—how your online activities leave traces that can impact your privacy and reputation. We’ll discuss ways to manage and protect your personal information in the digital world.
• Digital Society and Netiquette : Explore the norms and etiquette for interacting online. This includes understanding netiquette (internet etiquette), communication etiquette, and social media behavior to ensure respectful and effective online interactions.
• Data Protection : Learn about intellectual property rights like copyrights, patents, and trademarks. We’ll also cover what happens when these rights are violated through plagiarism, copyright infringement, or trademark misuse, and why respecting these rights is crucial.
• Open Source Software and Licensing : Discover what open-source software is and the various licensing models that govern its use, including Creative Commons, GPL, and Apache licenses. This helps in understanding how software can be shared and used legally.
• Cyber Crime : Get to know different types of cyber crimes , such as hacking, eavesdropping , phishing, ransomware , cyber trolls, and cyberbullying . We’ll discuss their impact and how to stay safe from these threats.
• Cyber Safety : Learn essential practices for safe online behavior, including browsing safely, protecting your identity, and maintaining confidentiality. This section emphasizes practical steps to enhance your security in the digital world.
• Malware : Understand various types of malware, including viruses, trojans, and adware. We’ll explore how they infect systems and what you can do to protect your computer from these malicious threats.
• E-Waste Management : Learn the importance of properly disposing of electronic gadgets to minimize environmental impact. We’ll discuss ways to recycle and manage electronic waste responsibly.

This unit equips you with the knowledge to navigate the digital world responsibly, understand legal and ethical implications, and protect yourself from various online risks. By integrating societal and legal perspectives with technology, you’ll be better prepared to handle the challenges and responsibilities of the modern digital landscape.

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. Use them to confidently master the subject and achieve top grades.

Class 11 Computer Science Notes – FAQs

What topics are covered in the cbse class 11 computer science notes.

The notes cover all key topics in the CBSE Class 11 Computer Science syllabus, including Computer Systems and Organization, Computational Thinking and Programming, Boolean Algebra, Number Systems, and Society, Law, and Ethics in technology.

How can these notes help me prepare for my Class 11 Computer Science exams?

These notes provide a clear, concise, and structured overview of all the topics you need to know for your exams. They simplify complex concepts, making it easier for you to understand and retain information, which is crucial for exam preparation.

Are the notes suitable for beginners in computer science?

Yes, the notes are designed to be student-friendly and easy to understand, making them perfect for beginners who are new to computer science concepts and programming.

Can I use these notes for assignments and classwork?

Absolutely! These notes are well-organized and comprehensive, providing detailed explanations and examples that can help you with both assignments and classwork.

Do these notes include practical examples and exercises?

Yes, the notes include practical examples and exercises to help you apply the concepts you learn, enhancing your understanding and skills in computer science.

Please Login to comment...

Similar reads.

• School Programming
• CBSE - Class 11
• Top Android Apps for 2024
• Top Cell Phone Signal Boosters in 2024
• Best Travel Apps (Paid & Free) in 2024
• The Best Smart Home Devices for 2024
• 15 Most Important Aptitude Topics For Placements [2024]

Improve your Coding Skills with Practice

What kind of Experience do you want to share?

Introduction to Problem Solving Class 11 MCQ

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Computer Science Class 11 Notes

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

Computer Science Class 11 MCQ

Computer science class 11 ncert solutions.

• Unit 2 : Tuples and Dictionary in Python

• 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 | Computer Science Important Questions

• Uncategorized
• Chapter 4 : Introduction to…

Table of Contents

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. The first person to win three flips wins the cake. An input of 1 means player 1 wins a flip, and a 2 means player 2 wins a flip. Design an algorithm to determine who takes the cake? Answer – Set p1 = 0 Set p2 = 0 For i in range (5): Input coin If coin = 1 then P1 += 1 Elif coin = then P2 += 1 If p1 > 2 then P1 wins Elif p2 > 2 then P2 wins

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

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

5. Suppose you are collecting money for something. You need ` 200 in all. You ask your parents, uncles and aunts as well as grandparents. Different people may give either ` 10, ` 20 or even ` 50. You will collect till the total becomes 200. Write the algorithm. Answer – Step 1 : Start Step 2 : Set money := 0 Step 3 : While Loop (money <200) Input money Step 4 : money = money + money Step 5 : End Loop Step 6 : Stop

6. Write the pseudocode to print the bill depending upon the price and quantity of an item. Also print Bill GST, which is the bill after adding 5% of tax in the total bill. Answer – INPUT Item INPUT price CALCULATE bill := Item * price PRINT bill CALCULATE tax := bill * (5 / 100) CALCULATE GST_Bill := bill + tax PRINT GST_Bill

7. Write pseudocode that will perform the following: a) Read the marks of three subjects: Computer Science, Mathematics and Physics, out of 100 b) Calculate the aggregate marks c) Calculate the percentage of marks Answer – INPUT computer, maths, phy COMPUTE average := (computer + maths + phy) / 3 COMPUTE percentage := (average / 300) * 100 PRINT average PRINT percentage

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

9. Write an algorithm that performs the following: Ask a user to enter a number. If the number is between 5 and 15, write the word GREEN. If the number is between 15 and 25, write the word BLUE. if the number is between 25 and 35, write the word ORANGE. If it is any other number, write that ALL COLOURS ARE BEAUTIFUL. Answer – INPUT num IF num >=5 AND num < 15 THEN PRINT ‘GREEN’ ELSE IF num >= 15 AND num < 25 THEN PRINT ‘BLUE’ ELSE IF num >= 25 AND num < 35 THEN PRINT ‘ORANGE’ ELSE PRINT ‘ALL COLOURS ARE BEAUTIFUL’ END IF

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

11. Write an algorithm to display the total water bill charges of the month depending upon the number of units consumed by the customer as per the following criteria: • for the first 100 units @ 5 per unit • for next 150 units @ 10 per unit • more than 250 units @ 20 per unit Also add meter charges of 75 per month to calculate the total water bill . Answer – INPUT units SET bill := 0 IF units > 250 THEN CALCULATE bill := units * 20 ELIF units <= 100 THEN CALCULATE bill := units * 5 ELSE CALCULATE bill := 100 * 5 + (units – 100) * 10 END IF END IF CALCULATE totalBill := bill + 75 PRINT totalBill

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

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

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

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

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

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 Answer – INPUT Number IF Number <= 9 “Single Digit” Else If Number <= 99 “Double Digit” Else “Big”

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

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

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

Author:  noor arora

Related posts.

Class 10th NCERT Science All Activity & Comptency Bases Questions | Important Topics February 29, 2024

Class 10th Science Mind Maps February 29, 2024

NCERT Class 10th Mind Maps February 29, 2024

Chemical reaction and equation Case based question Class 10 November 19, 2023

Chapter 7 Alternating Current Chapter assertation & reasoning Questions class 12th physics May 24, 2023

Chapter 6 Electromagnetic Induction assertation & reasoning Questions class 12th physics May 24, 2023

Leave a Reply Cancel reply

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

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

Post comment