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
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.
TutorialAICSIP
A best blog for CBSE Class IX to Class XII
Introduction to problem solving Computer Science Class 11 Notes
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)
By Sanjay Parmar
More on this, computer science class 11 sample paper 2023-24 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.
- Engineering Mathematics
- Discrete Mathematics
- Operating System
- Computer Networks
- Digital Logic and Design
- C Programming
- Data Structures
- Theory of Computation
- Compiler Design
- Computer Org and Architecture
- Last Minute Notes Computer Organization
- How GeeksforGeeks helped me to get into IIT
- Last Minute Notes – Discrete Mathematics
- GATE 2016 Important Dates and Links
- GATE CS 2016 Sec 6
- GATE CS 2016 Sec 1
- GATE CS 2016 Sec 8
- GATE CS 2016 Sec 10
- GATE CS 2016 Sec 9
- GATE CS 2016 Sec 7
- GATE CS 2016 Sec 4 – C
- GATE CS 2016 Sec 4 – Linked Lists
- GATE CS 2016 Sec 4 – Queues
- GATE CS 2016 Sec 4 – Stacks
- GATE CS 2016 Sec 4 – Arrays
- GATE CS 2016 Sec 5 – Divide and Conquer
- GATE CS 2016 Sec 5 – Dynamic Programming
- GATE CS 2016 Sec 5 – Greedy
- GATE CS 2015
CBSE Class 11 Computer Science Syllabus 2024-25
CBSE 11 Class Computer Science Syllabus covers a wide range of topics, from basic computational thinking to more advanced concepts such as algorithms, data structures, and operating systems. The syllabus is designed to give students a solid foundation in computer science and to prepare them for further study in the field.
CBSE Class 11 Computer Science: Course Structure
Cbse class 11 computer science unit-wise syllabus 2023-24, unit 1: computer systems and organisation.
- Central Processing Unit (CPU)
- Input Devices
- Output Devices
- Evolution of Computer
- Computer Memory
- Data Transfer between Memory and CPU
- Microprocessors
- Data and Information
Encoding Schemes and Number System
- Introduction
- Number System
- Conversion from Decimal to other Number Systems
- Conversion from other Number Systems to Decimal Number Systems
- Conversion from Binary Number to Octal/ Hexadecimal Number and Vice-Versa
- Conversion of a Number with Fractional Part
- Unicode ( UTF8 and UTF32 )
Unit 2: Computational Thinking and Programming – I
Introduction to problem-solving.
- Steps for Problem-Solving
- Flowchart — Visual Representation of Algorithms
Flow of Control
- Verifying Algorithms
- Comparison of Algorithm
- Decomposition
Getting Started with Python
- Introduction to Python
- Python Keywords
- Identifiers
- Everything is an Object
- Expressions
- Input and Output
- Type Conversion
- Syntax Errors
- Logical Errors
- Runtime Error
- Indentation
- The ‘For’ Loop
- The ‘While’ Loop
- Break Statement
- Continue Statement
- Nested Loops
- User Defined Functions
- Scope of a Variable
- Python Standard Library
- String Operations
- Traversing a String
- String Methods and Built-in Functions
- Handling Strings
- Introduction to List
- Concatenate
- Traversing a List
- List Methods and Built-in Functions
- Nested Lists
- Copying Lists
- List as Arguments to Function
- List Manipulation
Tuples and Dictionaries
- Introduction to Tuples
- Concatenation
- Tuple Methods and Built-in Functions
- Tuple Assignment
- Nested Tuples
- Tuple Handling
- Introduction to Dictionaries
- Adding a new item
- Modifying an Existing Item
- Dictionary Operations
- Traversing a Dictionary
- Dictionary Methods and Built-in Functions
- Manipulating Dictionaries
Unit 3: Society, Law and Ethics
- Digital Footprints
- Digital Society and Netizen
- Data Protection
- Cyber Crime
- Indian Information Technology Act (IT Act)
- Impact on Health
- E-Waste Management
Emerging Trends
- Artificial Intelligence (AI)
- Internet of Things (IoT)
- Cloud Computing
- Grid Computing
- Blockchains
The CBSE Class 11 Computer Science Syllabus is a comprehensive and well-rounded curriculum that covers a wide range of topics related to Computer Science. The syllabus is designed to help students develop the skill set and knowledge they need to use information technology effectively in their personal and professional lives.
FAQs on CBSE Class 11 Computer Science Syllabus
Q1: what are the objectives of the cbse class 11 computer science syllabus.
The objectives of the CBSE Class 11 Computer Science Syllabus are to: Provide students with the knowledge and skills they need to use Computer Science effectively in their personal and professional lives. Help students develop critical thinking and problem-solving skills. Prepare students for further studies in computer science or related fields. Raise awareness of the social and ethical implications of the use of technology.
Q2: What are the key topics covered in the CBSE Class 12 Computer Science Syllabus?
The key topics covered in the CBSE Class 12 Computer Science Syllabus are: Fundamentals of Computer System Problem-Solving techniques Basics to Python Programming Societal impacts
Q3: What are the assessment methods for the CBSE Class 12 Computer Science Syllabus?
The assessment methods for the CBSE Class 12 Computer Science Syllabus are: 30% theory 70% practical The theory component will be assessed through a written examination. The practical component will be assessed through project work and a practical examination.
Please Login to comment...
Similar reads.
- 10 Ways to Use Microsoft OneNote for Note-Taking
- 10 Best Yellow.ai Alternatives & Competitors in 2024
- 10 Best Online Collaboration Tools 2024
- 10 Best Autodesk Maya Alternatives for 3D Animation and Modeling in 2024
- 30 OOPs Interview Questions and Answers (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
- Book Solutions
- State Boards
NCERT Solutions Class 11 Computer Science Chapter 4 Introduction to Problem Solving
NCERT Solutions Class 11 Computer Science Chapter 4 Introduction to Problem Solving: National Council of Educational Research and Training Class 11 Computer Science Chapter 4 Solutions – Introduction to Problem Solving. NCERT Solutions Class 11 Computer Science Chapter 4 PDF Download.
NCERT Solutions Class 11 Computer Science Chapter 4: Overview
Question 3. Write the pseudocode to print all multiples of 5 between 10 and 25 (including both 10 and 25).
FOR EACH I := 10 TO 15
IF I % 5 :=0 THEN
Question 4. Give an example of a loop that is to be executed a certain number of times.
Answer: Suppose we certain number starting from 11 to 16. The loop will be executed as follow:
SET i: = 11
FOR i: = 11 to 16 do
Question 5. Suppose you are collecting money for something. You need ` 200 in all. You ask your parents, uncles and aunts as well as grandparents. Different people may give either ` 10, ` 20 or even ` 50. You will collect till the total becomes 200. Write the algorithm.
Step 1: Set need Money := 0
Step 2: While Loop (need Money <200)
Input money
Step 3: need Money : = need Money + money
Step 4: End Loop
Question 6. Write the pseudocode to print the bill depending upon the price and quantity of an item. Also print Bill GST, which is the bill after adding 5% of tax in the total bill.
INPUT all_Item
INPUT price_for_each_Item
COMPUTE bill :=totalItem * price_for_each_Item
COMPUTE tax := bill * (5 / 100)
COMPUTE bill_with_gst := bill + tax
PRINT bill_with_gst
Question 7. Write pseudocode that will perform the following: a) Read the marks of three subjects: Computer Science, Mathematics and Physics, out of 100 b) Calculate the aggregate marks c) Calculate the percentage of marks.
INPUT Computer_Science, maths, physics
COMPUTE aggregate := (Computer_Science + maths + physics) / 3
COMPUTE percentage := ((Computer_Science + math + physics) / 300) * 100
PRINT aggregate
PRINT percentage
Question8. Write an algorithm to find the greatest among two different numbers entered by the user.
Step1: READ num1
Step2: READ num2
Step3:IF (num1 > num2)
Question9 . Write an algorithm that performs the following: Ask a user to enter a number. If the number is between 5 and 15, write the word GREEN. If the number is between 15 and 25, write the word BLUE. if the number is between 25 and 35, write the word ORANGE. If it is any other number, write that ALL COLOURS ARE BEAUTIFUL.
Step 1: INPUT n
Step 2: IF n>5 And n<15 THEN
Step 3: PRINT “GREEN”
Step 4: ELSE IF n>15 And n<225 THEN
Step 5: PRINT “BLUE”
Step 6 : ELSE IF n>25 And n<35 THEN
Step 7: PRINT “ORANGE”
Step 8: ELSE
PRINT “ALL COLOURS ARE BEAUTIFUL”
Step 9: End IF
Question 10. Write an algorithm that accepts four numbers as input and find the largest and smallest of them.
Question11. Write an algorithm to display the total water bill charges of the month depending upon the number of units consumed by the customer as per the following criteria:
- for the first 100 units @ 5 per unit
- for next 150 units @ 10 per unit
- more than 250 units @ 20 per unit Also add meter charges of 75 per month to calculate the total water bill .
Step 1: INPUT units
Setp 2: SET bill := 0
Step 3: IF units > 250 THEN
COMPUTE bill := units * 20
IF units <= 100 THEN
COMPUTE bill := units * 5
COMPUTE bill := 100 * 5 + (units – 100) * 10
Step 4: END IF
Step 5: COMPUTE total_Bill := bill + 75
Step 6: PRINT total_Bil
Question 12. What are conditionals? When they are required in a program?
In programming conditionals are used for providing the condition to values, input and output. There are various conditional statements are there to evaluate the expression. Generally conditional statement give us a output in the form of true or false which is known as Boolean value.
Conditionals are required in program to check whether the value is satisfied with required output or not.
In case you are missed :- Previous Chapter Solution
Question 13. Match the pairs
Question14. Following is an algorithm for going to school or college. Can you suggest improvements in this to include other options?
Reach_School_Algorithm
b) Get ready
c) Take lunch box
d) Take bus
e) Get off the bus
f) Reach school or college
- Brush our teeth
- Do some exercise
- Take a bath
- Take a breakfast
- Take a lunch box
- Go to bus stand
- Get off the bus
- Reach school or college
Question 15. Write a pseudocode to calculate the factorial of a number (Hint: Factorial of 5, written as 5!=5 4 3 21 ×××× )
INPUT number
SET factorial := 1, i := 1
WHILE i<= number DO
COMPUTE factorial := factorial * i
INCREASE i by 1
PRINT factorial
Question 16. Draw a flowchart to check whether a given number is an Armstrong number. An Armstrong number of three digits is an integer such that the sum of the cubes of its digits is equal to the number itself. For example, 371 is an Armstrong number since 3**3 + 7**3 + 1**3 = 371.
Question 17. Following is an algorithm to classify numbers as “Single Digit”, “Double Digit” or “Big”. Classify_Numbers_Algo
INPUT Number
IF Number < 9
“Single Digit”
Else If Number < 99
“Double Digit”
Verify for (5, 9, 47, 99, 100 200) and correct the algorithm if required.
For given data,
5 and 9 are single digit number, so it will print “single digit”
47 and 99 are double digit number, so it will print “double digit”
100 and 200 is a three digit number, so it will print “big”
Correct algorithm:
Step 1: INPUT Number
Step 2: IF Number <= 9
Step 3: Else If Number <= 99
Step 4: Else
Step 5: End IF
Question 18. For some calculations, we want an algorithm that accepts only positive integers upto 100.Accept_1to100_Algo
IF (0<= Number) AND (Number <= 100)
a) On what values will this algorithm fail?
b) Can you improve the algorithm?
This algorithm fails at value 0. Because in condition we specify “greater than equal to operator”. So it will accept zero also.
IF (0<Number) AND (Number <= 100)
In case you are missed :- Next Chapter Solution
Leave a Reply Cancel reply
Your email address will not be published. Required fields are marked *
Save my name, email, and website in this browser for the next time I comment.
We have a strong team of experienced Teachers who are here to solve all your exam preparation doubts
RS Aggarwal Class 8 Math First Chapter Rational Numbers Exercise 1B Solution
Bse odisha 8th english questions answer solution, odisha board class 8 english the olympic champion and the ducks question answers solution, sikkim scert class 5 english chapter 2f sweet treat dreams solution.
Sign in to your account
Username or Email Address
Remember Me
IMAGES
VIDEO
COMMENTS
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 ...
This video will help you to understand Verifying Algorithms, which is a subtopic of Chapter 5 introduction to Problem-solving Class 11 Computer Science.Hasht...
Chapter 5 Introduction to Problem Solving One Shot | Class 11 Computer Science | Vishal Kumar | Connect with Me: INSTAGRAM: @tbhvishalkumarhttps://www.instag...
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.
Flow Chart. 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. Flow chart.
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.
Maximum CBSE Class 11 Computer Science students prefer NCERT Textbook Solutions to score more in exams. Get the free view of Chapter 5, Getting Started with Python Class 11 Computer Science additional questions for Mathematics Class 11 Computer Science CBSE, and you can use Shaalaa.com to keep it handy for your exam preparation.
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 ... Chapter 5 Class 11 ...
Get free chapter-wise NCERT Solutions for Class 11 Computer Science solved by expert according to latest syllabus. CBSE Science (English Medium) Class 11. Textbook Solutions 17413 ... • Chapter 4: Introduction to Problem Solving • Chapter 5: Getting Started with Python • Chapter 6: Flow of Control • Chapter 7: Functions • Chapter 8 ...
"Computer Science is a science of abstraction -creating the right model for a problem and devising the appropriate mechanizable techniques to solve it." -A. Aho and J. Ullman C˜˚˛˝˙ˆ 4 Iˇ˝ˆ˘ ˝ ˘ˇ ˝˘ Pˆ˘ ˙ S˘ ˇ In this chapter » Introduction » Steps for Problem Solving » Algorithm » Representation of Algorithms
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.
Question 11. Write a Python program to calculate the amount payable if money has been lent on simple interest. Notes Ch 5.indd 117 08-Apr-19 12:35:13 PM 2020-21 118 Computer Science - Class xi Principal or money lent = P, Rate of interest = R% per annum and Time = T years. Then Simple Interest (SI) = (P x R x T)/ 100.
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 ...
Analyzing the Problem:Involvesidentifying the problem,inputsthe program should accept and the desiredoutputof the program.Developing an Algorithm:Thesolution to the problem represented in natural languageis called Algorithm. For a given problem, more than one algorithm is possible and we have to sel.
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.
This video will help you to understand Problem-solving cycle, which is a subtopic of Chapter 5 introduction to problem-solving Class 11 Computer Science.Hash...
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.
Chapter 5 Introduction to Problem Solving | Class 11 Computer Science | in HindiHastags: #class11 #class11th #class11python #online #education #newvideo CBSE...
Maximum CBSE Class 11 Computer Science students prefer NCERT Textbook Solutions to score more in exams. Get the free view of Chapter 4, Introduction to Problem Solving Class 11 Computer Science additional questions for Mathematics Class 11 Computer Science CBSE, and you can use Shaalaa.com to keep it handy for your exam preparation.
The objectives of the CBSE Class 11 Computer Science Syllabus are to: Provide students with the knowledge and skills they need to use Computer Science effectively in their personal and professional lives. Help students develop critical thinking and problem-solving skills. Prepare students for further studies in computer science or related fields.
🚀This video Unlock the Power of Problem Solving! 💡 🔎I'll guide you through the essential Steps for Problem Solving. 💥 Learn Decomposition a break down co...
Introduction to Problem Solving Class 11 MCQ. 25/02/202302/10/2022 by CBSEskilleducation. 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. Contents show.
NCERT Solutions Class 11 Computer Science Chapter 4 Introduction to Problem Solving. Question 3. Write the pseudocode to print all multiples of 5 between 10 and 25 (including both 10 and 25). Answer: FOR EACH I := 10 TO 15. IF I % 5 :=0 THEN. PRINT I. END IF. END LOOP. Question 4. Give an example of a loop that is to be executed a certain ...