Answer: clip art
Explanation:
- The clip arts are graphic images that are pre-made illustrations for the purpose of creating any medium (designs or art).
- It has no restrictions to use them, it can be used by anyone, hence its copyright-free.
- It comes in both electronic and printed form.
- But mostly they are designed and distributed and used by a person in an electronic form.
Hence, the complete statement is "Pre-made, copyright-free illustrations are called <u>clip art</u>".
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.
In conclusion there are many different data structures. Each data structure has strengths and weaknesses which affect performance depending on the task. Today, we explored two data structures: arrays and linked lists. Arrays allow random access and require less memory per element (do not need space for pointers) while lacking efficiency for insertion/deletion operations and memory allocation. On the contrary, linked lists are dynamic and have faster insertion/deletion time complexities. However, linked list have a slower search time and pointers require additional memory per element in the list. Figure 10 below summarizes the strength and weakness of arrays and linked lists.
Answer:
An algorithm is a specific procedure for solving a well-defined computational problem. ... It requires an understanding of the alternatives available for solving a computational problem, including the hardware, networking, programming language, and performance constraints that accompany any particular solution.
