I would say don't use more than 8-9 graph lines
<span>Would you expect all the devices listed in bios setup to also be listed in device manager? = Yes
Would you expect all devices listed in device manager to also be listed in bios setup? = No, the BIOS doesn't know anything about your peripherals etc. that is all managed by the OS.</span>
Answer:
Option (c) Remote code exploits aim to escalate attackers’ privileges, while XSS attacks aim to gain access only
Explanation:
- XSS stands for Cross-site Scripting. In this types of attacks, a malicious code is injected in the trusted web sites and it sends the malicious code into the users. The users think that the genuine code was sent but not.
- This involves sending server side scripts which are executed by the user and these may even change the html pages too.
- Remote code exploitation means the user can inject the code and try to gain access. Usually, all the programming languages have evaluation functions if used the user can try to gain the access with this evaluation functions.
- This can lead to the compromise of the whole web server too.So, it is not a good practice to use the evaluation functions by the developers.
- In this type of attack, the attacker tries to inject the code remotely.
- Option (c) is correct and options (a),(b) and (d) are wrong options.
Answer:
"Materials requirement planning" is the correct answer for the above question.
Explanation:
- The "Materials requirement planning" is a software system that is used to hold the record of the raw materials.
- It is used to tell about the material which is present in the stocks. It also used to schedule the delivery.
- This software is used to enhance the productivity of the company.
- The above question asked about the software which is needed to keep the record of the raw material. This software is known as "Materials requirement planning".
Answer:
Running time of algorithm is O(n).
Explanation:
n is power of 2
n =2,4,8,16,32,...................................
A is an array having n elements
B is an array of size 0 to (n/2)-1
if n=4 B then (4/2)-1 =1 So B has size 2
for(i=0;i<=(n/2)-1;++)
{
B[i]=A[2i]+A[2i+1];
}
This for loop will run n/2 times so complexity in terms of Big Oh is O(n/2) =O(n)
Running time of algorithm is O(n).
