Skip to main content

Dynamic Systems Development Method (DSDM)

Dynamic Systems Development Method(DSDM) :-
  • Dynamic system development method is approach to system development which as the name suggests develops the system dynamically
  • it is a Rapid application development that uses incremental Prototyping.
  • The DSDM philosophy is borrowed from a modified version of "Pareto Principle"
    • Pareto Principle :- 
      • 80% of an application can be delivered in 20% of the time it would take to deliver the complete(100%) application.
  • DSDM is an iterative software process in which each iteration follows 80% rule.
    • That is only enough work is required for each increment to start next increment
    • The remaining work can be completed later when more requirements are known or changes have been requested.
  • DSDM life cycle defines 3 different cycles preceded by 2 additional life cycle activities (FBFDI)
    • Feasibility Study :- 
      • establishes the basic business requirements and constraint associated with the application to be built.
      • and Identifies whether DSDM is adoptable ?
    • Business Study :-
      • establishes the Functional and information requirements that will allow the application to provide business value .
      • also defines the basic application architecture and identifies the maintainability requirements for the application.
    • Functional Model Iteration :- 
      • the main focus in this phase is on building the prototype and getting it reviewed from the user to bring out the requirements of desired system.
      • Prototype help to better understand what actually customer wants & what is the requirements.
    • Design and Build Iteration:-
      • we visit the prototype once again to ensure that all the requirements are covered in the prototype or not.
      • in some cases Functional model iteration and design and build Iteration occur concurrently.
    • Implementation:-
      • places the latest software increment into the operational environment.
      • but there may be possible that
        1. The increment may not be  completed 100%.
        2. changes may be requested 
      • In either case DSDM development work continuous by returning to the Functional Model Iteration phase.

Comments

Post a Comment

Popular Posts

Dijkstra's algorithm

Djikstra's algorithm   solves the problem of finding the shortest path from a point in a graph (the  source ) to a destination. It turns out that one can find the shortest paths from a given source to  all  points in a graph in the same time, hence this problem is sometimes called the  single-source shortest paths  problem. This problem is related to the spanning tree one. The graph representing all the paths from one vertex to all the others must be a spanning tree - it must include all vertices. There will also be no cycles as a cycle would define more than one path from the selected vertex to at least one other vertex. For a graph, G = (V,E) where V is a set of vertices and E is a set of edges. Dijkstra's algorithm keeps two sets of vertices: S    the set of vertices whose shortest paths from the source have already been determined  and V-    S :   the remaining v...
Post a Comment
Read more

Kruskal’s Minimum Spanning Tree Algorithm & Programme

PROBLEM :                  Kruskal's algorithm is a minimum-spanning-tree algorithm which finds an edge of the least possible weight that connects any two trees in the forest. It is a greedy algorithm in graph theory as it finds a minimum spanning tree for a connected weighted graph adding increasing cost arcs at each step. To understand Kruskal's algorithm let us consider the following example − Step 1 - Remove all loops and Parallel Edges Remove all loops and parallel edges from the given graph. In case of parallel edges, keep the one which has the least cost associated and ove all others. Step 2 - Arrange all edges in their increasing order of weight The next step is to create a set of edges and weight, and arrange them in an ascending order of weightage (cost). Step 3 - Add the edge which has the least weightage Now we start adding edges to the graph beginning from the one which has the least weight. Th...
Post a Comment
Read more

Binary Tree

Given a Binary Tree, convert it into its mirror. What is a Binary Tree? ➤A binary tree is made of nodes, where each node contains a "left" reference, a "right" reference, and a data element. The topmost node in the tree is called the root . Every node (excluding a  root ) in a tree is connected by a directed edge from exactly one other node. This node is called a parent.              Input: ➤The task is to complete the method that takes one argument, root of Binary Tree and modifies the tree. Output:   ➤The function should convert the tree to its mirror. Plus:  Check whether the binary tree and mirror tree is same or not. FOLLOW ME ON  :- INSTAGRAM  :-  https://www.instagram.com/akshay_methaniya_2809/ YOUTUBE :-  https://www.youtube.com/channel/UCDbGAU0c_78ue2IXi6ibtYQ FACEBOOK :-  https://www.facebook.com/akshay.methaniya
1 comment
Read more