Answer:
Contiguous
Explanation:
A Contiguous memory allocation is known to be a classical memory allocation model. In this situation, we have a system which assigns consecutive memory blocks to a process. It is one of the oldest methods of memory allocation. If the process is in need of execution, the memory would be requested by the process. The processes size would then be compared to the amount of Contiguous memory that is available for the execution of the process.
Answer:
C
Explanation:
No explanation, self-explanatory. I used class main instead...
Answer:
Option a: Trojan
Explanation:
A Trojan or Trojan horse is one of the computer malware that exist in computing world. Trojan often appears as a legitimate software to deceive user to activate it by social engineering. Once the Trojan is activated in the user computer, a hacker can remote control the infected computer for malicious purposes such as removing files, sending files, displaying message or rebooting computer.
However, Trojan cannot be replicated in the infected computer.
Answer:
The flashdrive can hold 35389 400-pages-books
Explanation:
If 
of a page occupies 1 kB of memory, we can calculate how much memory a book will take
Now that we know that a book average file size is about 266,67 kB, we calculate how many of them can a 9 GB flash drive hold.
To do the calculation, we have to know how many kilobytes are in 9 gigabytes.
There is 1024 kilobytes in a megabyte, and 1024 megabytes in a gigabyte, so:
Finally, knowing the average file size of a book and how much memory in kilobytes the 9 GB flash drive holds, we calculate how many books can it hold.
The flashdrive can hold 35389 400-pages-books, or 14155776 pages of typical text.
This is a tough question. I’m not sure if I’ll get it right but I’ll try.
Data structures used for file directories typically have a hierarchical tree structure, referred to as a directory structure. The tree has a root directory, and every file in that system has a unique path.
The simplest method of implementing a directory is to use a linear list of file names with pointers to the data blocks. But another way that you can format a file directory is by using a hash table. With this method, the linear list stores the directory entries, but a hash data structure is also used. The hash table takes a value computed from the file name and return the pointer to the file name any linear list.
So I think it’s C. But I’m not 100% sure.
I hope that helps.
