If the language is zero indexed:
a[ 33 ]
Answer:
B.O(1)
Explanation:
When we are implementing ADT stack using linked chain we can pop an entry from the stack having O(1) time complexity because in linked chain we have the head or top pointer in linked chain only.Popping and pushing in stack happens on only one end that is top.So we have move to move top in linked chain to the next and delete prev node.
Answer:
B. Symmetric key encryption
Explanation:
Symmetric key encryption is one in which a single encryption key is sent to the receiver so both sender and receiver share the same key. In this type of encryption, the sender uses a particular key to encrypt the data and sends the encrypted data (cipher data) to the receiver and then the receiver uses the same key to decrypt the data.
Public key encryption, or asymmetric encryption uses two keys - a private key and a public key. The public key is know to everyone while the private key is known only to those for whom the message is intended. An application of this type of encryption is in SSL (Secure Sockets Layer) - a protocol for transmitting data privately on the internet.
Private key encryption is not exactly one of the encryption methods but rather, a private key and a public key are used in encryption.
The best option is therefore <em>symmetric key encryption</em>.
<em>Hope this helps!</em>
Answer:
Explanation:
The following is written in Python. It takes in a file, it then reads all of the elements in the file and adds them to a list called myList. Then it sorts the list and uses the elements in that list to calculate the median. Once the median is calculated it returns it to the user. The code has been tested and the output can be seen in the image below.
def find_median(file):
file = open(file, 'r')
mylist = []
for number in file:
mylist.append(int(number))
numOfElements = len(mylist)
mylist.sort()
print(mylist)
if numOfElements % 2 == 0:
m1 = numOfElements / 2
m2 = (numOfElements / 2) + 1
m1 = int(m1) - 1
m2 = int(m2) - 1
median = (mylist[m1] + mylist[m2]) / 2
else:
m = (numOfElements + 1) / 2
m = int(m) - 1
median = mylist[m]
return median
print("Median: " + str(find_median('file1.txt')))
Answer: True
Explanation: Domain name system(DNS) is the kind of attack that exploits the functioning of the DNS .This process is also known as the DNS spoofing .The corrupted data is invoked in the cache database and thus creates spoof.
It creates diversion of the traffic from the actual servers to the fake servers and entering the exploited data in the cache database.Thus, the given statement is true.
