Answer:
Folded card This layout type is for creating greeting cards by printing pages on a sheet and then folding the sheet to make the card. If you choose the Folded card layout, then sheet fold options are displayed. Select an option in the list to specify how you will fold your publication
Explanation:
I guess the correct answer is application
An applicatiοn layеr is an abstractiοn layеr that spеcifiеs thе sharеd cοmmunicatiοns prοtοcοls and intеrfacе mеthοds usеd by hοsts in a cοmmunicatiοns nеtwοrk. Thе applicatiοn layеr abstractiοn is usеd in bοth οf thе standard mοdеls οf cοmputеr nеtwοrking: thе Intеrnеt Prοtοcοl Suitе (TCP/IP) and thе ΟSI mοdеl. Althοugh bοth mοdеls usе thе samе tеrm fοr thеir rеspеctivе highеst lеvеl layеr, thе dеtailеd dеfinitiοns and purpοsеs arе diffеrеnt.
Answer:
Explanation:
preventive maintenance tips in using tools and equipment.
1. Inspect tools and equipment on a regular basis so as to avoid unexpected breakdown.
2. Clean tools and equipment immediately after use. It is important to wash or clean tools after using them in order to avoid clogging of dirts on them
3. Replace tools and equipment back to their respective storage place immediately after using them
4. Lubricate your tools and equipment to avoid rusting. Lubrication means to oil especially metal tools and equipments.
5. Always follow the instructions of use and maintenance of tools and equipments as stated by the manufacturer.
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.
