Answer:
hope this helps. I am also a learner like you. Please cross check my explanation.
Explanation:
#include
#include
using namespace std;
int main()
{
int a[ ] = {0, 0, 0}; //array declared initializing a0=0, a1=0, a3=0
int* p = &a[1]; //pointer p is initialized it will be holding the address of a1 which means when p will be called it will point to whatever is present at the address a1, right now it hold 0.
int* q = &a[0]; //pointer q is initialized it will be holding the address of a0 which means when q will be called it will point to whatever is present at the address a0, right now it hold 0.
q=p; // now q is also pointing towards what p is pointing both holds the same address that is &a[1]
*q=1
; //&a[0] gets overwritten and now pointer q has integer 1......i am not sure abut this one
p = a; //p is now holding address of complete array a
*p=1; // a gets overwritten and now pointer q has integer 1......i am not sure abut this one
int*& r = p; //not sure
int** s = &q; s is a double pointer means it has more capacity of storage than single pointer and is now holding address of q
r = *s + 1; //not sure
s= &r; //explained above
**s = 1; //explained above
return 0;
}
Answer:
The answer is below
Explanation :
If a company was using a commercial WAN and a vulnerability appeared that allowed attackers find routing information and therefore be able to eavesdrop on corporate transmissions "It is expected that such a company should try to formulate and establish Virtual Private Networks between corporate sites.
This will ultimately lead to intercepted transmissions to be unreadable. Though such means have been seen as time-consuming."
Abstraction make programming languages easier to use as It eliminates the need for codes to be automated.
<h3>How does abstraction make programming languages easier to implement?</h3>
Data abstraction is known to be a tool that helps a person to change a complex data structure into simple ones which can be used easily.
Note that Abstraction make programming languages easier to use as It eliminates the need for codes to be automated.
Learn more about abstraction from
brainly.com/question/7994244
#SPJ1
int sum = 0, n;
do {cin>>n; sum+=n;}while (n!=0);
cout<<sum;
Answer:
Explanation:
The following code is written in Java and creates the recursive function to find the longest common substring as requested.
static int lengthOfLongestSubsequence(String X, String Y) {
int m = X.length();
int n = Y.length();
if (m == 0 || n == 0) {
return 0;
}
if (X.charAt(m - 1) == Y.charAt(n - 1)) {
return 1 + lengthOfLongestSubsequence(X, Y);
} else {
return Math.max(lengthOfLongestSubsequence(X, Y),
lengthOfLongestSubsequence(X, Y));
}
}
