What is load testing, Computer Engineering

Assignment Help:

Load testing is to test that if the application works well with the loads that result from large number of concurrent users, transactions and to verify whether it can handle peak usage periods. 

 


Related Discussions:- What is load testing

Illustrate diffrent types of modems, Q. Illustrate Diffrent types of modems...

Q. Illustrate Diffrent types of modems? There are four different types of modems: half-duplex, full-duplex, synchronous, and asynchronous.With half-duplex modems data can be tr

cellfun function, There is a built-in function function known as cellfun t...

There is a built-in function function known as cellfun that evaluates a function for each element of a cell array.  Make a cell array, then call the cellfun function, passing the h

Differentiate between rom test and the ram test, Probelm : a) What is t...

Probelm : a) What is the purpose of "Jumps" in the 8051 Microcontroller? Describe three types of "Jumps". b) What is the purpose of a "call"? c) Differentiate between ROM

NachoS, Can I get the scheduling code for NachOS?

Can I get the scheduling code for NachOS?

Interaction design, This unit introduces the most important ID terminology,...

This unit introduces the most important ID terminology, explains why ID is important, and gives a description of the main ID activities and the characteristics of the ID process. I

Mac and llc, how can we improve the way LLC and MAC are used for LAN operat...

how can we improve the way LLC and MAC are used for LAN operation.?

Explain busy hour calling rate in telephone traffic, With reference to tele...

With reference to telephone traffic, explain the terms BHCR. BHCR: Busy hour calling rate is explained as the average number of calls originated through a subscriber througho

Define process, Define Process. Process: It is a program in executi...

Define Process. Process: It is a program in execution; process execution should progress into sequential fashion. Process contains: program counter stack dat

Rules for minimisation using k maps, 1) All squares containing a 1 must be ...

1) All squares containing a 1 must be grouped. 2) The largest possible groups must be formed. 3) Groups can overlap if this allows larger groups to be formed. 4) Groups mu

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd