Answer:
Pharming involves:
redirecting users to a fraudulent website even when the user has typed in the correct address in the web browser.
Explanation:
- When a hacker steals your confidential and private information by installing a malicious code on your computer which misdirects you to fake and fraudulent websites, this is called pharming.
- Hacker installs virus on your computer which manipulates the host files on your computer.
- The hacker uses DNS cache poisoning to attack DNS services on your computer which makes many users to enter fraudulent site, unknowingly, as they type the URL of the real website.
- These fraudulent website developed by hacker can install virus on your computer and steal confidential information from your computer.
- Pharming is done by hackers in order to steal sensitive data from a person's computer.
Answer:
1.
DIM myArray(10) as INTEGER
LET A = 0
FOR I = 1 TO 10 STEP 2
INPUT “INPUT NUMBER”; myArray(i)
LET A = A + myArray(i)
NEXT
PRINT A
END
2.
REM PROGRAM FOR CALCULATING THE SIMPLE INTEREST
CLS
INPUT “INPUT THE PRINCIPAL”; P
INPUT “INPUT THE TIME”; T
INPUT “INPUT THE RATE”;R
SI = P* T * R / 100
PRINT “SIMPLE INTEREST =”; SI
END
Explanation:
Please find the respective programs in the answer section.
C.) New discoveries make the current model inaccurate. Since
science is all about observation and experimentation, it is logical that
whenever new findings are gathered, scientific models must be modified to adapt
to the information. As new ideas and concepts are uncovered, models should be
updated to make them correct.
Answer:
I find 5 categories
Explanation:
1 Overview
2 Necessity
3 Types
4 Attended installation
4.1 Silent installation
4.2 Unattended installation
4.3 Headless installation
4.4 Scheduled or automated installation
4.5 Clean installation
4.6 Network installation
5 Installer
5.1 Bootstrapper
5.2 Common types
5.3 System installer
Solution:
The process of transaction can guarantee the reliability of business applications. Locking resources is widely used in distributed transaction management (e.g; two phase commit, 2PC) to keep the system consistent. The locking mechanism, however, potentially results in various deadlocks. In service oriented architecture, the deadlock problem becomes even worse because multiple transactions try to lock shared resources in the unexpectable way due to the more randomicity of transaction requests, which has not been solved by existing research results. In this paper, we investigate how to prevent local deadlocks, caused by the resource competition among multiple sub-transactions of a gl obal transaction, and global deadlocks from the competition among different global transactions. We propose a replication based approach to avoid the local deadlocks, and a timestamp based approach to significantly mitigate the global deadlocks. A general algorithm is designed for both local and global deadlock prevention. The experimental results demonstrate the effectiveness and efficiency of our deadlock prevention approach. Further, it is also proved that our approach provides higher system performance than traditional resource allocation schemes.
This is the required answer.
