Skip to main content

Adaptive Software Development (ASD)

Adaptive Software Development (ASD) :-

  • Adaptive Software Development(ASD) has been proposed by Jim High smith as technique for building complex software and system.
  • ASD focus on human collaboration and team self-organization.
  • Jim High smith defines an ASD "Life Cycle" that consist of three phases 
    1. Speculation
    2. Collaboration
    3. learning
  •  During speculation, the project is initiated and adaptive cycle planning is conducted.
    • Adaptive cycle planning uses project Initiation information,the customer's mission statement ,basic requirements and project constraint to define the set of release cycles that will be required for the project.
  • Collaboration encompasses communication and team-work but it also enphasizes individualism because individual creativity plays an important role in collaborative thinking.It is all above all,a matter of trust.
    • people working together must trust one another to
      1. comment without war
      2. help without irritation
      3. work as hard as or more than they do.
      4. have the skill set to contribute to the work at hand.
      5. communicate problems or concerns in a way that leads to effective action.
  • The learning cycles are based on the short iterations with design,build and testing.during these iterations knowledge is gathered by making small mistakes based on false assumptions and correcting those mistakes,thus It leads to greater experience and eventually mastery in the problem domain.
    • ASD teams learns in three ways:
      1. Focus Groups
      2. Technical Reviews
      3. Project Postmortems

Labels:

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

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