Skip to main content

Posts

What is meant by Data flow design? Explain the symbols used for showing different components of data flow diagram.

Recent posts

Differential verification from validation .Describe validation testing and validation test Criteria briefly?

Differential verification from validation .Describe validation testing and validation test Criteria briefly? Answer : Definition of Validation : Validation process to evaluate the final product to check  the software meets the customer expectations and requirements. It is a dynamic mechanism of validating and testing the actual product. Definition Verification : The process of evaluating software to determine whether the products of a given development phase satisfy the conditions imposed at the start of that phase. Verification is a static practice of verifying documents, design, code and program. It includes all the activities associated with producing high quality software: inspection, design analysis and specification analysis. It is a relatively objective process. Verification helps to determine whether the software is of high quality, but it dose not ensure  that the system is useful. Verification is concerned with whether the system is well-engin...

Define complexity of the algorithm. Explain asymptotic notations.

Define complexity of the algorithm. Explain asymptotic notations.   Answer :when we want an estimate of the running time or other resource requirements of an algorithm. the analysis and keeps us thinking about the most important aspect: the growth rate. it is called asymptotic algorithm analysis To be precise, asymptotic analysis refers to the study of an algorithm as the input size “gets big” or reaches a limit (in the calculus sense). However, it has proved to be useful to ignore all constant factors it  asymptotic analysis is used for most algorithm comparisons Asymptotic is a form of “back of the envelope” estimation for algorithm resource consumption. It provides a simplified model of the running time or other resource needs of an algorithm. This simplification usually helps you understand the behavior of your algorithms. Just be aware of the limitations to asymptotic analysis in the rare situation where the constant is importent The following 3 a...