1. Relation between Initial algorithm and Refining algorithm.
This is the first attempt of preparing an algorithm to solve a specific job that let the computer to do. In this algorithm, it may miss some sequence of steps or it may have any logical error.
A series of refinements after initial algorithm to make the process more efficient and to include some steps that we had failed to consider in our initial algorithm.
2. What is the difference between compiler and interpreter?
A compiler searches all the errors of a program and lists them. If the program is error free then it converts the code of program into machine code and then the program can be executed by separate commands.
An interpreter checks the errors of a program statement by statement. After checking one statement, it converts that statement into machine code and then executes that statement. The process continues until the last statement of program occurs.
3. What are the differences between flowchart and structural chart?
4. What is the different between internal and external subroutines?
5. Define the programming process?
6. What are the advantages of using High-Level Languages?
7. Write down the steps of programming process.
8. What do you mean by counter variable?
9.What do you mean by debugging and testing?
10. What do you mean by documenting a program? Write down the benefits of it.
11. What do you mean by desk-checking?
12. Write down 5 (five) flowchart guidelines.
13.Write down the advantage and disadvantage of Modular programming
14. What do you mean by decision table? Write largest number decision table in 3 numbers.
16. Evaluate NOT (A and B) or C with the all possible combinations.
17. What is sequential and binary search?
18.What is top down programming approach?
19.What is pseodocode?
20.What is sentinal value?
21. Define error routine? what are syntax,logical and run-time error?
22. Define input validation? classify input validation.
23. Define three program structure: sequence , selection and loop. draw flowchart for each.
Comments 3