Answer:a) Mainframes, miniframes, PCs, desktop Internet computing, mobile computing
Explanation: The hierarchy of the computers or computing are in the generation is:-
- Mainframe:-designed for the execution of huge data processing , storage and execution.
- Miniframe:-has similar functioning as the mainframe but on smaller scale and version.
- Personal computer(PC):-It is designed for the individual purpose and according the need of the user.
- Mobile computing:-computing that can be done on the mobile phone similar to the computing on the personal computer
- Internet computing:-the computing of the mobile and computer system with the facility of the internet connectivity.
Answer:
(a) What is the best case time complexity of the algorithm (assuming n > 1)?
Answer: O(1)
(b) What is the worst case time complexity of the algorithm?
Answer: O(n^4)
Explanation:
(a) In the best case, the if condition will be true, the program will only run once and return so complexity of the algorithm is O(1)
.
(b) In the worst case, the program will run n^4 times so complexity of the algorithm is O(n^4).
Answer:
java” xargs grep -i "Hello World”
Answer:
Required memory size is 16k x 8
16k = 24 x 210 = 214
Hence, No. of address lines = 14
No. of data lines = 8
a) Size of IC 1024 x 1
Total number of ICs required = 16k x 8 / 1024 x 1 = 16 x 8 = 128
b) Size of IC 2k x 4
Total number of ICs required = 16k x 8 / 2k x 4 = 8 x 2 = 16
c) Size of IC 1k x 8
Total number of ICs required = 16k x 8 / 1k x 8 = 16 x 1 = 16
Explanation:
For a, 10 address lines from A0 to A9 are used to select any one of the memory location out of 1024 memory locations present in a IC.
For b, 11 address lines from A0 to A10 are used to select any one of the memory location out of 2k=2048 memory locations present in a IC.
For c, 10 address lines from A0 to A9 are used to select any one of the memory location out of 1k=1024 memory locations present in a IC.
