Program Development Notes

1) Select the correct alternative and rewrite the following:

1. A diamond box is used to indicate in flow charts:

- c) decision

2. Writing the program task in simple sequence and in simple English is known as:

- a) algorithm

3. Arranging the items in a list in descending or ascending order is called:

- b) sorting

4. Pictorial representation of a program:

- a) flowchart

5. The number of comparisons in linear search are:

- b) greater than binary search

6. ___ is midway between an algorithm and a program:

- b) pseudocode

---

2) What are the steps involved in program development? Explain in brief.

1. Problem Analysis: Understanding the problem and the requirements before writing the solution. It

involves identifying inputs, outputs, storage, and processes.

2. Design: Dividing the solution into small modules, designing each module separately using

methods like structured programming or object-oriented programming.

3. Coding: Converting the program design into a specific programming language.

4. Testing: Verifying if the program executes correctly, identifying and correcting any errors.

5. Documentation: Maintaining written information about the program for both developers and users,

including design documents, code, testing reports, and user manuals.

---

3) What are various symbols used while drawing a flowchart? Explain them.

1. Terminal (Start/Stop): Represented by rectangles with rounded corners, used at the beginning

and end of a flowchart.

2. Input/Output: Represented by parallelograms, indicating input operations like keyboard entry or

output processes like printing.

3. Processing: Represented by rectangles, used for calculations or processing steps.

4. Decision Box: Represented by diamonds, used for decision-making steps where conditions are

checked.

5. Arrows: Indicate the direction of flow in the program.

6. Connector: Represented by small circles, used to connect parts of a flowchart, especially when

flow lines cross or continue onto another page.

---
4) Define and explain the algorithm concept with a suitable example.

An algorithm is a logical sequence of steps prepared for solving a problem, written in simple steps

using natural language. It guides the programmer in developing the program.

Example: Algorithm to exchange the value of two variables:

1. Store the value of A in X.

2. Transfer B value to A.

3. Transfer X to B.

---

5) What are the characteristics of an algorithm?

1. It should be easy and simple in language.

2. It should not repeat tasks unnecessarily.

3. Each step must be accurate and complete.

4. It should be easy to modify if necessary.

5. It should be understandable and concise.

6. It should optimize computer time, storage, and resources.

7. It should be correct for clearly defined situations.

---

6) Define Flowchart and write the advantages of flowcharts.

A flowchart is a method to represent an algorithm in a pictorial form using standard symbols. It is

used to formulate and understand algorithms, illustrating loops, decisions, inputs, and outputs.

Advantages of Flowcharts:

1. Better programming steps.

2. Systematic analysis.

3. Minimum length.

4. Minimization of errors.

5. Effective testing and results.

6. Universal logical solution.

---

7) Explain the following terms:

a) Sorting: The process of arranging data items in ascending or descending order using algorithms

like selection sort, bubble sort, etc.

b) Pseudocode: A programming analysis tool used for planning program logic using simple phrases

in natural language. It focuses on the program's logic without following strict programming syntax.

---

8) What is the difference between modular programming and structured programming?

- Structured Programming: A programming method where the program is developed in a hierarchy

of modules using a top-to-bottom approach. It often includes sequences, decisions, and repetitions.

- Modular Programming: A programming method where a main module controls various submodules

(functions or procedures). Each submodule handles specific tasks, allowing for reuse and simplicity

in the main program.

---

9) What is sorting? State various algorithms used for it.

Sorting is the process of arranging data in a specific order (ascending or descending).

Algorithms used for sorting:

1. Selection sort

2. Bubble sort

3. Shell sort

4. Heap sort

---

10) What is binary searching? Explain it.

Binary Searching: A method to search a sorted list by repeatedly dividing the list in half.

Procedure:

1. Calculate the midpoint.

2. Compare the desired value with the midpoint.

3. If the desired value is smaller, search the left half; if larger, search the right half.

4. Repeat until the item is found or the segment is empty.

Applications: Used to search ordered arrays and to find a target element's position.

Limitations: Requires the list to be sorted and allows random access to the middle element.

---

11) Explain the whole programming process in brief.

1. Problem Analysis: Understanding the problem requirements, identifying the inputs, outputs, and

determining the processing steps.

2. Algorithm Development: Writing down the sequence of steps (algorithm) that describe how to

solve the problem.

3. Flowchart Design: Drawing a flowchart to visualize the logic of the algorithm. This helps in

understanding the program flow.

4. Coding: Translating the algorithm into a programming language.

5. Compilation/Interpretation: Converting the written code into machine language using a compiler or

interpreter.

6. Testing and Debugging: Running the program with various inputs to identify and fix any errors or

bugs.

7. Documentation: Writing notes and comments for better understanding and maintaining the code.

8. Maintenance: Making necessary updates or improvements to the program over time.

---

12) Write algorithms and draw flowcharts for the following problems:

a) To find the minimum number among given 3 numbers.

b) To check whether the number is odd or even.

c) To calculate the sum of all odd numbers between 1 and 100.