Answer:
Following are the code to the given question:
#include <iostream>//header file
using namespace std;
int main()//main method
{
int r=26,x,y;//defining integer variable
char c;//defining a character variable
for(x= 1; y<= r; x++)//using for loop for count value
{
for(y= 1; y<= x; y++)//using for loop to convert value in triangle
{
c=(char)(y+64);//convert value into character
cout << c;//print character value
}
cout << "\n";//use print method for line break
}
return 0;
}
Output:
Please find the attachment file.
Explanation:
In this code, three integer variable "x,y, and r", and one character variable "c" is declared, that is used in the nested for loop, in the first for loop it counts the character value and in the next for loop, it converts the value into a triangle and uses the char variable to print its character value.
Answer:
The fundamental limitation of symmetric (secret key) encryption is ... how do two parties (we may as well assume they are Alice and Bob) agree on a key? In order for Alice and Bob to communicate securely they need to agree on a secret key. In order to agree on a secret key, they need to be able to communicate securely. In terms of the pillars of IA, To provide CONFIDENTIALITY, a secret key must first be shared. But to initially share the key, you must already have CONFIDENTIALITY. It's a whole chicken-and-egg problem.
This problem is especially common in the digital age. We constantly end up at websites with whom we decide we want to communicate securely (like online stores) but with whom we there is not really an option to communicate "offline" to agree on some kind of secret key. In fact, it's usually all done automatically browser-to-server, and for the browser and server there's not even a concept of "offline" — they only exist online. We need to be able to establish secure communications over an insecure channel. Symmetric (secret key) encryption can't do this for us.
Asymmetric (Public-key) Encryption
Yet one more reason I'm barred from speaking at crypto conferences.
xkcd.com/177/In asymmetric (public key) cryptography, both communicating parties (i.e. both Alice and Bob) have two keys of their own — just to be clear, that's four keys total. Each party has their own public key, which they share with the world, and their own private key which they ... well, which they keep private, of course but, more than that, which they keep as a closely guarded secret. The magic of public key cryptography is that a message encrypted with the public key can only be decrypted with the private key. Alice will encrypt her message with Bob's public key, and even though Eve knows she used Bob's public key, and even though Eve knows Bob's public key herself, she is unable to decrypt the message. Only Bob, using his secret key, can decrypt the message ... assuming he's kept it secret, of course.
Explanation:
Ffkjlfdhaslkjfhlaksdfhlkajsdfh
Answer:
Select the slide that you want to insert a table on.On the Insert tab, in the Tables group, click Table, and then click Excel Spreadsheet.To add text to a table cell, click the cell, and then enter your text
Explanation:
Answer:
3 bits
Explanation:
Given a 4- way set associative cache that has 64 blocks of 16 words.
Therefore, the number of sets cache has:
Now,
Cache data size is 16kB
The number of cache blocks can be calculated as:
Now,
Total sets = 
Total sets = 
Now,
n = 6
For 15 bit address for the architecture, the bits in tag field is given by:
15 - (6 + 6) = 3 bits
Thus the tag field will have 3 bits
