Computers and Technology, 21.01.2021 06:30 Ryvers

Learning Task 1 Match Column A with Colum B. Write the letter only
Column A
Column B
1. Macramé textile
A. Uses materials like reed, cane, willow,
oak and ash
2. Chinese Macrame'
B. Like textile weaving where the material is
plaited
3. Macramé bracelet
4. Macramé earrings
5. Y-shaped necklace
6. Cavandoli macramé
7. Coiled basketry
C. Uses materials from roots and tree barks
D. Comes in various styles and shapes de-
pending on the materials used and the
type of stitch used to interlock the coil
together.
E. Uses knots instead of weaving or knitting
F. Famous style of macramé necklace
G. Used to decorate the palace hall and
country households
H. Light and various sizes and shapes
I. Made of nylon waxed twine
J. Used to form geometric patterns specially
on weaving
8. Plaiting basketry
9. Twinning basketry
10. Wicker and Splint basketry

Answers: 1

Show answers

Another question on Computers and Technology

Computers and Technology, 22.06.2019 03:30

Jessie has received a contract to build a real-time application for a baker. however, the baker doesn't want to invest too much money. his only requirement is that he wants the customers to know which cupcakes are available at what time and in what quantity. so his core requirement is that the details of product should be in real time. what platform can jessie use to develop this application?

Answers: 1

Answer

Computers and Technology, 22.06.2019 15:20

The north and south regions had very diferent economies in the 1800s.

Answers: 1

Answer

Computers and Technology, 22.06.2019 17:30

Rachel completed typing an official document with a word processing program. she wants to make sure that her document has no typographical errors. she also wants all headings to have the same font. which features in a word processing program should she use? rachel should use the feature in a word processing program to find typographical errors. she should apply to have uniform headings.

Answers: 1

Answer

Computers and Technology, 22.06.2019 20:00

What is the worst-case complexity of the maxrepeats function? assume that the longest string in the names array is at most 25 characters wide (i.e., string comparison can be treated as o( class namecounter { private: int* counts; int nc; string* names; int nn; public: namecounter (int ncounts, int nnames); int maxrepeats() const; }; int namecounter: : maxrepeats () { int maxcount = 0; for (int i = 0; i < nc; ++i) { int count = 1; for (int j = i+1; j < nc; ++j) { if (names[i] == names[j]) ++count; } maxcount = max(count, maxcount); } return maxcount; }

Answers: 3

Answer

You know the right answer?

Learning Task 1 Match Column A with Colum B. Write the letter only
Column A
Column B

Questions