Class 11 Exam  >  Class 11 Notes  >  NCERT Solution - Algorithms and Flowcharts, Computer Science (Python), Class 11

NCERT Solution - Algorithms and Flowcharts, Computer Science (Python), Class 11 PDF Download

TOPIC – 1 

Problem Solving Methodologies 

Very Short Answer Type Questions (1 mark each) 

Question 1: Write the alternate name of infinite loop. 

Answer: endless loop. 

Question 2: Define looping 

Answer: Looping is repeating a s t of instructions until a specific condition is met 

Question 3: Write the difference bets een finite and infinite loop.

 Answer: A finite loop ends itself. An infinite loop will not end without an outside cause. 

Question 4: Is for loop pretest type of loop ? 

Answer: Yes. The second clause (the condition) is evalu-ated before each iteration through a loop. 

Question 5: Can you use one or more loop inside any another while, for or do., while loop ? 

Answer: Yes. 

Question 7: Define Variable. 

Answer: It is the name of space inside computer memory walues can be stored.


 Short Answer Type Questions-I (2 marks each) 

Question 1: Define infinite loop. 

Answer: An infinite loop is a sequence of instructions in a computer program which loops endlessly, either due to the loop having no terminating condition, having one that can never be met, or one that causes the loop to start over. 

Question 2: Give an example for infinite loop 

Answer: A simple example of an infinite loop is instructing a computer to keep on adding 0 to 1 until 2 is reached. This will never happen. 

Question 3: What is a logical operator ? 

Answer: Logical operator is a operator used to combine relational expressions. In C++, there are three types of logical operators : 

(i) Logical AND 

(ii) Logical OR 

(iii) Logical NOT 

Question 4: What will be the minimum number of inputs for finding a simple interest ? 

Therefore the minimum number of inputs for finding the simple interest is 3 i.e. P R and T.


 Long Answer Type Questions (4 marks each) 

Question 1: Explain Modular programming. 

Answer: 

(i) Modular programming is the technique which divides the entire program into smaller modules, which perform a specific task. 

(ii) It can often be used in variety of applications and functions with other components of the system. 

(iii) The order in which the modules are executed by the computer is controlled by the main program. This describes fully the procedures required in the solution to a problem. The procedures are written in the order of the machine execution.

 (iv) OPP is compatible with the modular programming concept to a large extent. Modular Programming enables multiple programmers to divide up the work and debing pieces of the program independently. 

Question 2: What is the difference between modular programming and structured programming ? 

Answer: Modular programming : It is the act of designing and writing programs as interactions among functions that each perform a single well defined function & which have minimal side effect interaction between them. It is heavily procedural. The focus is entirely on writing code (functions). Data is passive. Any code may access the contents of any data structured passed to it. 

Object Oriented programming : it is a programming using “objects”-data structures consisting of data fields & methods together with their interactions to design applications and computer programs. Programming techniques may include features such as data abstraction, encapsulation, messaging, modularity, polymorphism/and inheritance. 

Question 3: Differentiate between top down and bottom up methods of modular programming. 


Question 4: What are the advantages of using a modular approach in programming ? Answer: It is easy to understand small sections of code in the modular programming. You can store the code across multiple files. Modular programming allows collaborative programming. Collaborative programming means more’ than one program work in one application at the same time. Duplication of code, is not possible in modular programming. The programmers create a single procedure for code. The errors are localized to a subroutine or function and it is easy to find the errors. The code should be used in multiple applications in modular programming. The code should be simple and short in modular programming and it is less need to be written. 


TOPIC – 2 

Algorithms & Flowcharts 

Short Answer Type Questions-II (3 marks each)

Question 2: Write some properties of algorithm. 

Answer: Some properties of algorithm are : 

1. An algorithm should terminate after finite number of steps. 

2. An algorithm should be simple so that anyone can understand them properly. 

3. An algorithm should be universal and lead to an unique solution of the problem. 

4. An algorithm should have capability to handle some unexpected situations which may arise during the solution of a particular problem. 

5. An algorithm should be able to solve all problems of a particular type for which it is designed. [Any 3,1 mark for each correct point] 

Question 3: Write some characteristics of algorithm. 

Answer: Some characteristics of algorithm are : 

1. Each and every instruction should be short and clear. 

2. Each instruction should be such that it can be performed in a finite time.

3. One or more instructions should not be repeated infinitely. 

4. After performing the instructions the desired result must be obtained. [Any 3,1 mark for each correct point] 

Question 4: Write an algorithm to calculate sum of two numbers. 

Answer: Step 1 : Start. 

Step 2 : Read A,B. 

Step 3: Sum=A+B.

Write an algorithm to calculate simple interest.

Answer: Step 1: Start. 

Step 2 : Read RR,T. 

Step 3 : SI=(P*R*T)/100. 

Step 4 : Print SI 

Step 5 : Stop. 3 

Question 6: Write an algorithm to convert temperature from Fahrenheit to Celsius. 

Answer: Step 1: Start. 

Step 2 : Read F. 

Step 3: C=(5(F-32))/9. 

Step 4 : Print C. 

Step 5 : Stop. 3 

Question 7: Write an algorithm to calculate area of triangle. 

Answer: 

Step 1: Start. 

Step 2 : Read a,b,c. 

Step 3: s=(a+b+c)/2. 

Step 4 : Area = (s(s-a)(s-b)(s-c)) . 

Step 5 : Print Area. 

Step 6 : Stop. 3 

Question 8: Write an algorithm that generates the fibbonacci series as: 1,1,2,3, 5,…. N terms.

Step 2 : Read N. Step 3 : Let a = 1, b = 1 

Step 4 : Print a, b. 

Step 5 : ctr = 2. 

Step 6 : c = a + b. 

Step 7 : a = b. 

Step 8 : b = c. 

Step 9 : ctr = ctr + 1. 

Step 10 : If ctr < N then repeat steps 6 to 9. 

Step 11 : Stop. 3 

Question 9: Write an algorithm to compute sum of the square of N numbers. Answer: The algorithm as :

 Step 1: Read N. 

Step 2 : Let ctr = 0, sum = 0. 

Step 3 : Read Num. 

Step 4 : ctr = ctr + 1. 

Step 5 : Compute the square of the number i.e., = sqr (Num * Num). 

Step 6 : sum = sum * sqr. 

Step 7 : If ctr is less than N then repeat steps 3 to 6. 

Step 8 : Print sum. 

Step 9 : End. 3 

Question 10: Write an algorithm for calculating the conversion from rupees to dollars. Answer: Algorithm is defined as follows : Step 1: Start. Step 2: Read the amount in rupees and conversion rate.
Step 3: Calculate the equivalent amount in dollars using the following formula : amount in dollars =

Question 11: Write an algorithm to find the largest among three numbers.
Answer: 
The algorithm is defined as :
Step 1: Read X, Y, Z.
Step 2 : If X > Y continue step 5.
Step 3 : If Y>Z then print “Y is the largest “and continue step 7.
Step 4 : Continue step 6.
Step 5 : If X>Z then print “X is the largest “and continue step 7.
Step 6 : Print “Z is largest”.
Step 7: End. 3
Question 12: Write an algorithm to print the bigger of any two unique given numbers.
Answer: 
The algorithm as :
Step 1: Read two numbers A and B.
Step 2 : Compare A and B.
Step 3 : If A is greater than B then, print A else print B.
Step 4 : Stop. 3 

Question 13: Write an algorithm to input N numbers and find the largest among them. Answer: The algorithm as :
Step 1 : Read N.
Step 2 : Let ctr = 1.
Step 3 : Read Num.
Step 4 : large = Num.
Step 5 : Read next Num.

Question 14: Write an algorithm to compute the sum of odd and even numbers up to N. Answer: The algorithm as :
Step 1: Start.
Step 2 : Input N.
Step 3 : sume = 0. Step 4 : sumo = 0. Step 5 : ctr = 1.
Step 6 : while (ctr < = N). If (ctr mod 2 = 0) sume = sume + ctr else sumo = sumo + ctr.
Step 7: Print “sum of even number is” sume. Step 8 : Print “sum of odd number is” sumo.
Step 9: End. 


Question 1: Draw a flowchart to calculate sum of two numbers

Answer:

NCERT Solution - Algorithms and Flowcharts, Computer Science (Python), Class 11

Question 2: Draw a flow chart to calculate simple interest 

Answer: 

NCERT Solution - Algorithms and Flowcharts, Computer Science (Python), Class 11

Question 3: Draw flowchart to convert temperature from Fahrenheit to Celsius. 

Answer:

NCERT Solution - Algorithms and Flowcharts, Computer Science (Python), Class 11

Question 4: Draw the flowchart to print the largest of any three numbers. 

Answer: 

NCERT Solution - Algorithms and Flowcharts, Computer Science (Python), Class 11

Question 5: Draw the flowchart to print sum of first 100 natural numbers.

Answer:

NCERT Solution - Algorithms and Flowcharts, Computer Science (Python), Class 11

The document NCERT Solution - Algorithms and Flowcharts, Computer Science (Python), Class 11 is a part of Class 11 category.
All you need of Class 11 at this link: Class 11

Top Courses for Class 11

FAQs on NCERT Solution - Algorithms and Flowcharts, Computer Science (Python), Class 11

1. What are algorithms and flowcharts?
Ans. Algorithms are step-by-step instructions or procedures used to solve a problem or perform a task. They provide a clear and unambiguous description of how to achieve a specific outcome. On the other hand, flowcharts are graphical representations of algorithms, using symbols and arrows to depict the sequence of steps in a process.
2. Why are algorithms and flowcharts important in computer science?
Ans. Algorithms and flowcharts are fundamental tools in computer science as they help in designing, analyzing, and implementing efficient programs. They provide a systematic approach to problem-solving and enable programmers to understand the logic and flow of a program before writing the actual code. Moreover, they facilitate communication and collaboration among software developers.
3. How are algorithms and flowcharts related to programming languages?
Ans. Algorithms and flowcharts are independent of any programming language. They serve as a universal method to describe the logical steps of a program, irrespective of the language used for implementation. Once an algorithm is designed and visualized using a flowchart, it can be translated into any programming language of choice to write the actual code.
4. What are the advantages of using flowcharts in program development?
Ans. Flowcharts offer several advantages in program development: - They provide a visual representation of the program's logic, making it easier to understand and debug. - Flowcharts help in identifying errors, bottlenecks, or inefficiencies in the program's flow. - They act as a documentation tool, allowing programmers to communicate and explain the program's functionality to others. - Flowcharts aid in designing and planning complex programs by breaking them down into smaller, manageable steps. - They facilitate the maintenance and modification of programs by providing a clear overview of the program's structure.
5. Can flowcharts be used in real-life scenarios beyond programming?
Ans. Yes, flowcharts can be used in various real-life scenarios beyond programming. They serve as a visual tool to represent and understand the flow of processes or systems. Flowcharts find applications in industries like manufacturing, finance, healthcare, project management, and decision-making. For example, a flowchart can be used to depict the steps involved in a manufacturing process, the decision-making process in an organization, or the flow of patient information in a hospital.
Download as PDF
Explore Courses for Class 11 exam

Top Courses for Class 11

Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
10M+ students study on EduRev
Related Searches

Extra Questions

,

mock tests for examination

,

Sample Paper

,

NCERT Solution - Algorithms and Flowcharts

,

study material

,

Summary

,

past year papers

,

ppt

,

Class 11

,

Exam

,

practice quizzes

,

Objective type Questions

,

Semester Notes

,

pdf

,

Previous Year Questions with Solutions

,

Viva Questions

,

Important questions

,

video lectures

,

Class 11

,

MCQs

,

NCERT Solution - Algorithms and Flowcharts

,

Class 11

,

Computer Science (Python)

,

shortcuts and tricks

,

Computer Science (Python)

,

NCERT Solution - Algorithms and Flowcharts

,

Computer Science (Python)

,

Free

;