Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Solved Assignments
Asked Questions
Answered Questions
state as location within a program in this traditional approach location of control inside a program totally defines the program state any finite
what are the overlapping elements overlapping elements can be found by scanning all the elements in front of deleted element in priority list for the
determine the derived attribute to avoid re-computationeach class box consists of an ordered list of attributes and operations each represented as a
saving derived attributes to avoid re-computation data that is derived from other data should be stored in the computed form to avoid re-computation
define the step - rearranging the execution order for efficiency as we know that algorithm and data structure are closely related to one another but
explain the paths in the association network we can analyze use of paths in the association network as given below calculate each operation find
adding redundant associations for efficient access redundant associations do not add any type of information therefore during design we should
write a linux command to display lines from 25 - 45 of directory quotedcpasswordquot write a linux command to display directory in
assigning responsibility for operation many operations might have obvious target objects but some of these operations could be used at numerous
defining internal classes and operations when we enlarge algorithms new classes can be added to the store intermediate results a complex operation
ways for selecting data structure algorithms operate on data structure therefore selection of the best algorithm means selecting the best data
name the metrics for selecting top algorithmthere are a number of metrics for selecting top algorithmi computational complexity computational
determine the method of choosing algorithmsin general most of operations are easy and have a satisfactory algorithm since description of what is to
package classes and associations into models programs are made of separate physical units which could be edited imported complied or otherwise
determine object representation as a designer we must choose properly that when to use primitive types in representing objects and when to combine
demonstrate the design of associations during object design phase we must design a strategy to implement associations association may be
explain the term - adjustment of inheritance the inheritance can be enlarged as object design progresses by changing class structure the designer
implementing software control to implement software control designer must redesign strategy of state event model which is present in dynamic
what are the requirements of algorithm designeralgorithm designer should i select proper algorithm so as to minimize implementation costii find most
design an algorithm to implement operations each and every operation specified in the functional model could be formulated as an algorithm the
state the data flow diagram of functional modelany action initiated by transition in the state diagram can be extended into an entire data flow
how can we classify the operations on classes this step fundamentally means all three models functional object and dynamic studied in last
state the steps of object design object design is a very iterative process in which various classes relationships among objects are added when you
state the function of functional modelfunctional model this defines operation which the system must implementfor every operation from analysis model
explain the function of object modelobject model describes the classes of objects in system including their attributes and operations which they