1. What are the features of an efficient algorithm?
Free of ambiguity
Efficient in execution time
Concise and compact
Completeness
Definiteness
Finiteness
2. List down any four applications of data structures?
Compiler design
Operating System
Database Management system
Network analysis
3. What is binary doubling strategy?
The reverse of binary doubling strategy, i.e. combining small problems in to one is known as binary doubling strategy. This strategy is used to avoid the generation of intermediate results.
4. Where is dynamic programming used?
Dynamic programming is used when the problem is to be solved in a sequence of intermediate steps. It is particularly relevant for many optimization problems, i.e. frequently encountered in Operations research.
5. Define top-down design?
Top-down design is a strategy that can be applied to find a solution to a problem from a vague outline to precisely define the algorithm and program implementation by stepwise refinement.
6. Mention the types of bugs that may arise in a program?
The different types of bugs that can arise in a program are
Syntactic error
Semantic error
Logical error
7. What is program testing?
Program testing is process to ensure that a program solves the smallest possible problem, when all the variables have the same value, the biggest possible problem, unusual cases etc.
8. What is program verification?
Program verification refers to the application of mathematical proof techniques, to verify that the results obtained by the execution of the program with arbitrary inputs are in accord with formally defined output Specifications.
9. How will you verify branches with segments?
To handle the branches that appear in the program segments, it is necessary to set-up and proves verification conditions individually.
10.What is proof of termination?
To prove that a program accomplishes its stated objective in a finite number of steps is called program termini nation. The prooft of termination is obtained directly from the properties of the interactive constructs.
Free of ambiguity
Efficient in execution time
Concise and compact
Completeness
Definiteness
Finiteness
2. List down any four applications of data structures?
Compiler design
Operating System
Database Management system
Network analysis
3. What is binary doubling strategy?
The reverse of binary doubling strategy, i.e. combining small problems in to one is known as binary doubling strategy. This strategy is used to avoid the generation of intermediate results.
4. Where is dynamic programming used?
Dynamic programming is used when the problem is to be solved in a sequence of intermediate steps. It is particularly relevant for many optimization problems, i.e. frequently encountered in Operations research.
5. Define top-down design?
Top-down design is a strategy that can be applied to find a solution to a problem from a vague outline to precisely define the algorithm and program implementation by stepwise refinement.
6. Mention the types of bugs that may arise in a program?
The different types of bugs that can arise in a program are
Syntactic error
Semantic error
Logical error
7. What is program testing?
Program testing is process to ensure that a program solves the smallest possible problem, when all the variables have the same value, the biggest possible problem, unusual cases etc.
8. What is program verification?
Program verification refers to the application of mathematical proof techniques, to verify that the results obtained by the execution of the program with arbitrary inputs are in accord with formally defined output Specifications.
9. How will you verify branches with segments?
To handle the branches that appear in the program segments, it is necessary to set-up and proves verification conditions individually.
10.What is proof of termination?
To prove that a program accomplishes its stated objective in a finite number of steps is called program termini nation. The prooft of termination is obtained directly from the properties of the interactive constructs.
No comments:
Post a Comment