What is Generating code in Analysis and Design of algorithm ?

Generating code: After analysing the algorithm we move to next step i.e. writing the program of code.  Generating code means implement the program by using the languages such as c, c++, java, dot net, visual basic etc.

What is Analysis of algorithm ?

Analysis of algorithm: After deciding the strategy or technique to solve the given problem. we design the algorthm in detail. Analysis of an algorthm is nothing but the selection of proper and efficient algorithm which solution of given problem with respect to the time and space.The provides algorithm must be simple and easy to understand and execute. The algorithm must provide exact and corect solution in minimum time and with minimum memory use during the execution. In this step we concentrate on each part of algorithm. Here can calculate which we step part take time or extra memory space. According to the analysis we can modify that part more of instead of modifying whole algorithm.

How is Checking of an algorithm done ?

Checking of an algorithm: After deciding strategy or technique to solve problem and generate an algorithm. We first check that the algorithm is suitable for given problem i.e. in other words we check that the algorithm give desired result for the set of input. To check the algorithm with set of input we generally use techniques such as proof by contradiction, proof by direct method or direct proof, proof by contraposition, proof by counterexample, proofby mathematical induction. By using these techniques we check that algorithm provides correct solution or not. If not then make changes according to it.

What is Detailed design of an algorithm

Detailed design of an algorithm: This step is dependent on all previous steps and decides the techniques which we used to solve given problem and generates an algorithm. There are various method by using which we solve the given problems such as Brute force method, Divide and conquer method, dynamic progamming, Greedy approach, Backtracking. Optimization technique.

What Selection of proper data structure in Analysis and Design of Algorithm ?

Selection of proper data structure: This step is the step where we start to think about the progrm. The progrm is nothing but step by step instructions which is used to cary out particular task or to solve the given problem we create program only when we use some lgorthm in it. Some technique or some logic must be there with the proper data structure. when we choose proper data structure and eficient algonthm [Either exact algorithm or approximate algorithm] then result must be an efficient program with respect to time and space.

What is Abstraction ? (In object oriented technology)

Abstraction refers to the act of representing essential features without including the background details or explanations. Classes use the concept of abstraction and are defined as a list of abstract attributes such as size, weight and cost, and function to operate on these attributes. They encapsulate all the essential properties of the objects that are to be created The attributes are sometimes called data members, because they hold information. The functions that operate on these data are sometimes called methods or member functions. Since the classes use the concept of data abstraction, they are known as use Abstract Data Types (ADT).
The of deciding what parts of a real world object are essential to process modeling the solution to a paricular problem is called abstaction. Abstraction is the representation of all the essential features of an object which means its possible states and behaviours. These are 'encapsulated' into an "abstract data type" which define how all objects in class (type) of object are to be represented and how they behave.
Abstraction is mechanism that enables the designer to focus on the a essential details of a program component with little concern for lower-level detail. Abstraction is a relative concept. As we move to higher levels of abstraction we ignore more and more details,  I.e. we give a more general look of a concept or item.

What do you understand by Memory in computer science ?

Memory is an integral part of a computer system. It's primary function is to store all information required by the system. Typically, a memory unit holds programs and data. A computer designer has to pay attention to the memory unit design, since the memory system cost is a significant fraction of the cost of total system.  The system performances largely dependent on the oganization, is storage capacity, and speed of operation of the memory system.