Answer:
b) Single source shortest path
Explanation:
These are the options for the question
a) All pair shortest path
b) Single source shortest path
c) Network flow
d) Sorting
Dijkstra's algorithm is algorithm by
Edsger Dijkstra arround the year 1956, this algorithm determine the shortest path, this path could be between two nodes/vertice of a graph.
The steps involves are;
✓setting up of the distances base on the algorithm.
✓ calculation of the first vertice up to vertice adjacent to it
✓The shortest path result.
It should be noted that maximum number of times the decrease key operation performed in Dijkstra's algorithm will be equal to Single source shortest path.
Answer:
A. grep -E "(John|Bob)" salesemployees.csv
Explanation:
The grep command is used to search text. It searches the given file for lines containing a match to the given strings or words.
How to use Grep Command:
grep 'letter' filename – Search any line that contains word 'letter' in filename on Linux
grep -i 'Alphabet' file1 – A case-insensitive search for the word ‘Alphabet’ in Linux and Unix
grep -R 'root' . – Search all files in the current directory and in all of its subdirectories in Linux for the word ‘root’
Solution :
public class NewMain {
public_static void main_(String[] args) {
boolean[] _locker = new boolean_[101];
// to set all the locks to a false NOTE: first locker is the number 0. Last locker is the 99.
for (int_i=1;i<locker_length; i++)
{
locker[i] = false;
}
// first student opens all lockers.
for (int i=1;i<locker.length; i++) {
locker[i] = true;
}
for(int S=2; S<locker.length; S++)
{
for(int k=S; k<locker.length; k=k+S)
{
if(locker[k]==false) locker[k] = true;
else locker[k] = false;
}
}
for(int S=1; S<locker.length; S++)
{
if (locker[S] == true) {
System.out.println("Locker " + S + " Open");
}
/* else {
System.out.println("Locker " + S + " Close");
} */
}
}
}
The question is incomplete as the scenarios are not given that were to be matched by the given encryption algorithms.
By finding the question from internet i have attached the image of the scenarios in the form of table and answered below accordingly
<h2>
Answer:</h2>
<u>Scenario A:</u>
Advanced Encryption Standard (AES) is a technique that uses 256-bit cipher texts for encryption process. The data encrypted by AES cannot be attacked and even it cannot be decrypted unless a brute-force search is used through all of possible 256-bit keys.For mobile security it is known as one of the best algorithms.
<u>Scenario B:</u>
Following are the techniques of encryption used for given scenario:
- ECC
- Digital Signature
- AES
- Blowfish
<u>Scenario C:</u>
Following are the techniques of encryption used for given scenario:
<u>Scenario D:</u>
Secure Sockets Layer (SSL) - SSL is a protocol that is commonly-used for managment of the message transmission security over the Internet)
<u>Scenario E:</u>
Advanced Encryption Standard (AES) - AES is an encryption algorithm used by U.S. Government agencies for securing sensitive but unclassified material .
i hope it will help you!
Answer:
Big Oh notation is used to asymptotically bound the growth of running time above and below the constant factor.
Big Oh notation is used to describe time complexity, execution time of an algorithm.
Big Oh describes the worst case to describe time complexity.
For the equation; T(N) = 10000*N + 0.00001*N^3.
To calculate first of all discard all th constants.
And therefore; worst case is the O(N^3).
