Reviews and Analysis in testing

Reviews and Analysis:
In general, the software development process starts with
requirements gathering & analysis. In this phase, the Business Analyst category
people develop BRS and SRS. They conduct review on the documents for
completeness & correctness. The Business Analyst prepares these questions on
BRS / SRS.

Are they Right Requirements?
Are they Complete Requirements?
Are they Achievable Requirements?
Are they Reasonable Requirements?
Are they Testable Requirements?

II. Reviews in Design
After completion of Analysis & their reviews the designer category
people develops HLD & LLD􀂶s are conducts reviews on the documents for
completeness & correctness.
The designers prepare these questions on the HLD & LLDs.

Are they understandable designs?
Are they meeting the right requirements?
Are they complete designs?
Are they followable designs?
Are they handling errors?

Comments

Post a Comment

Popular posts from this blog

Handling of Skew

Handling of Skew 􀂄 The distribution of tuples to disks may be skewed — that is, some disks have many tuples, while others may have fewer tuples. 􀂄 Types of skew: 􀃌 Attribute-value skew. 􀂾 Some values appear in the partitioning attributes of many tuples; all the tuples with the same value for the partitioning attribute end up in the same partition. 􀂾 Can occur with range-partitioning and hash-partitioning. 􀃌 Partition skew. 􀂾 With range-partitioning, badly chosen partition vector may assign too many tuples to some partitions and too few to others. 􀂾 Less likely with hash-partitioning if a good hash-function is chosen. Handling Skew in Range-Partitioning 􀂄 To create a balanced partitioning vector (assuming partitioning attribute forms a key of the relation): 􀃌 Sort the relation on the partitioning attribute. 􀃌 Construct the partition vector by scanning the relation in sorted order as follows. 􀂾 After every 1/nth of the relation has been read, the value...
Read more

Fragment-and-Replicate Join

Fragment-and-Replicate Join 􀂄 Partitioning not possible for some join conditions 􀃌 e.g., non-equijoin conditions, such as r.A > s.B. 􀂄 For joins were partitioning is not applicable, parallelization can be accomplished by fragment and replicate technique 􀃌 Depicted on next slide 􀂄 Special case – asymmetric fragment-and-replicate: 􀃌 One of the relations, say r, is partitioned; any partitioning technique can be used. 􀃌 The other relation, s, is replicated across all the processors. 􀃌 Processor Pi then locally computes the join of ri with all of s using any join technique. 􀂄 General case: reduces the sizes of the relations at each processor. 􀃌 r is partitioned into n partitions,r0, r1, ..., r n-1;s is partitioned into m partitions, s0, s1, ..., sm-1. 􀃌 Any partitioning technique may be used. 􀃌 There must be at least m * n processors. 􀃌 Label the processors as 􀃌 P0,0, P0,1, ..., P0,m-1, P1,0, ..., Pn-1m-1. 􀃌 Pi,j computes the join of ri with sj. In ...
Read more

Interquery Parallelism

Interquery Parallelism 􀂄 Queries/transactions execute in parallel with one another. 􀂄 Increases transaction throughput; used primarily to scale up a transaction processing system to support a larger number of transactions per second. 􀂄 Easiest form of parallelism to support, particularly in a sharedmemory parallel database, because even sequential database systems support concurrent processing. 􀂄 More complicated to implement on shared-disk or shared-nothing architectures 􀃌 Locking and logging must be coordinated by passing messages between processors. 􀃌 Data in a local buffer may have been updated at another processor. 􀃌 Cache-coherency has to be maintained — reads and writes of data in buffer must find latest version of data. Cache Coherency Protocol 􀂄 Example of a cache coherency protocol for shared disk systems: 􀃌 Before reading/writing to a page, the page must be locked in shared/exclusive mode. 􀃌 On locking a page, the page must be read from disk ...
Read more