New Frameworks for Automated Test and Retest (ATRT) Test Case Requirement Traceability Matrix |
Author : R.Padmavathi, P.Saravanan |
Abstract | Full Text |
Abstract :In the software testing domain
the research paper implementing automated
test and retest (ATRT) is one of the an
Innovative technical solution provider that
solves the uniqueness testing problem the
ATRT is one of the numerous automated
testing tools. The ATRT is a one of the way
that handle are related test cases and test
management activities, the test case
processing. The processing is a hierarchical
break down of test cases into test scenario
and test steps and test sub steps the user to
import their requirement and map test cases
to requirements. In the research Framework
successfully built by reusing the test cases
in the research paper implementing
continuous improvements and continuous
integration. The integration merging and
testing, test case requirements through the
frequent intervals applying in this method
prevent integration problem and increasing
quality control and improved technical
performance, decrease cost and increasing
speed. The automated testing using matrix
technology accessing and improving
customer requirements the automated
testing process. The process and tracking
its status and matrix is a standard of
measurement, a metrics can be performed
at as a measure can utilized and
implementing to display past and present
performance and predicting future
performance |
|
New Frameworks for Automated Test and Retest (ATRT) Test Case Requirement Traceability Matrix |
Author : R.Padmavathi, P.Saravanan |
Abstract | Full Text |
Abstract :n the software testing domain
the research paper implementing automated
test and retest (ATRT) is one of the an
Innovative technical solution provider that
solves the uniqueness testing problem the
ATRT is one of the numerous automated
testing tools. The ATRT is a one of the way
that handle are related test cases and test
management activities, the test case
processing. The processing is a hierarchical
break down of test cases into test scenario
and test steps and test sub steps the user to
import their requirement and map test cases
to requirements. In the research Framework
successfully built by reusing the test cases
in the research paper implementing
continuous improvements and continuous
integration. The integration merging and
testing, test case requirements through the
frequent intervals applying in this method
prevent integration problem and increasing
quality control and improved technical
performance, decrease cost and increasing
speed. The automated testing using matrix
technology accessing and improving
customer requirements the automated
testing process. The process and tracking
its status and matrix is a standard of
measurement, a metrics can be performed
at as a measure can utilized and
implementing to display past and present
performance and predicting future
performance. |
|
A Study on Cyber and Network Forensic in Computer Security Management |
Author : Baboloki Janet Phuthologo, Srinath Doss |
Abstract | Full Text |
Abstract :Cybercrime has become more
popular in the World of internet. The paper
here will outline more on cyber and network
forensics. There is lot of crime related cases
nowadays that needs digital or electronic
proof as a form of evidence. For evidence to
be presented, certain procedures need to be
followed from the collection of data to
keeping it safe for the evidence time in a
particular case. This paper shall try
summarizes information relevant to security
and cyber Forensics in general and how
those cases are solved.
|
|
Unique Enresdowed Graphs |
Author : Dr.P.Sumathi, R.Esther Felicia |
Abstract | Full Text |
Abstract :Let G = (V, E) be a non empty, finite, simple graph. k - ?r enresdowed graph is one in
which every restrained dominating set of cardinality k contains a minimum restrained dominating
set. In this paper, we discovered a few outcomes for the k - ?r enresdowed graph related to
private neighborhood. |
|
Quotient-3 Cordial Labelling For Cycle Related Graphs |
Author : Dr.P.Sumathi, A.Mahalakshmi A.Rathi |
Abstract | Full Text |
Abstract :Let G be a graph of order p and size q. Let f: V (G) Z4 – {0} be a function. For
each E (G) define f*: E (G) Z3 by f*(uv) = (mod 3) where f (u) f (v). If the number
of vertices having label i and the number of vertices having label j differ by maximum 1, the
number of edges having label k and the number of edges having label l differ by maximum 1
then the function f is said to be quotient-3 cordial labeling of G. 1 = i, j = 3, i and 0 = k, l
= 2, k l. Here we proved that Cn and some cycle related graphs like [Cn ; C3], n=3,6,9,…,
(P2 mk1) + N2 , S (Cn ; S2), joint sum of Cn and two cycles Cn having a common vertex is
quotient-3 cordial. |
|