I usually include my teachers name in the upper right hand corner along with the date my name and the subject.
The missing word here is social.
Social engineering involves using simple human methods to steal data, such as looking through peoples’ drawers for pieces of paper on which they might have written down passwords, or perhaps sneaking a look at the keys you press while walking past your desk as you are typing your password. Such behaviors designed to steal your personal information are methods of social engineering.
Let me know if you have any questions.
Answer:
There are different phases of railroad expansion with the innovations in technology.
Explanation:
Few of the technological innovations are described below that leads in railroad expansion more rapid.
1. Centralized Traffic control (CTC) is introduced in 1960's that is used to control the traffic on railroads using different signal control.
2. In 1990's after computer technology involvement, railway ticket and reservation system is automate and being centralized. That makes the railroad expansion improve.
3. Bullet train technology has been introduced, that makes the railway trains more faster.
4. Electric trains has been introduced to use green energy and reduce the dependency on the fuel to make environment clean and green.
Answer:
See explaination for the program code
Explanation:
The code below
Pseudo-code:
//each item ai is used at most once
isSubsetSum(A[],n,t)//takes array of items of size n, and sum t
{
boolean subset[n+1][t+1];//creating a boolean mtraix
for i=1 to n+1
subset[i][1] = true; //initially setting all first column values as true
for i = 2 to t+1
subset[1][i] = false; //initialy setting all first row values as false
for i=2 to n
{
for j=2 to t
{
if(j<A[i-1])
subset[i][j] = subset[i-1][j];
if (j >= A[i-1])
subset[i][j] = subset[i-1][j] ||
subset[i - 1][j-set[i-1]];
}
}
//returns true if there is a subset with given sum t
//other wise returns false
return subset[n][t];
}
Recurrence relation:
T(n) =T(n-1)+ t//here t is runtime of inner loop, and innner loop will run n times
T(1)=1
solving recurrence:
T(n)=T(n-1)+t
T(n)=T(n-2)+t+t
T(n)=T(n-2)+2t
T(n)=T(n-3)+3t
,,
,
T(n)=T(n-n-1)+(n-1)t
T(n)=T(1)+(n-1)t
T(n)=1+(n-1)t = O(nt)
//so complexity is :O(nt)//where n is number of element, t is given sum
