Answer:
Virtual Machine
Explanation:
<em> I had to look this up, since there were no options from the question. If this is wrong, let me know!</em>
Answer:
The drill down term is basically used in the information technology for the explore the multidimensional information or data by navigating the different layers of the data from the web page applications.
Drill down basically involve in the database by accessing the specific information through the database queries. Each query basically increase the data granularity. This term is also involve with the link for represent the details more specifically.
The drill down is the simple approach or technique for dividing the complex problems into small parts so that it make the technique more efficient.
Answer:
I grew up in the early internet stages. when i was young we would always have to sit at school, meetup somewhere, in town, or use the home phone. But when the internet was invented we could talk to each other through our computers at home. Old computers were so bulky and slow, but that was the coolest thing around. Now i can sit at home with my 20'' moniter on my 5g wifi and talking to my friends like theres no tomorrow. The internet has changed so much in the last years. If you were gonna tell me that one day ill be sitting at home playing games online and working from home on a laptop i would have told you that you were crazy.
Explanation:
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
9) Which date is assigned the serial number of 1?
A. January 1, 1700
B. January 1, 2000
D. January 1, 1800
