0
Still curious? Ask our experts.
Chat with our AI personalities
Blake
Judy
MaxineAdd your answer:
Earn +20 pts
Is soundproofing a compound word?
yes; sound and proofing
What is sound proofing?
Soundproofing is a method by which you reduce the amount of sound or noise that either enters or leaves a room. Otherwise known as noise or sound control, there are several different methods for soundproofing depending on the type of noise you are soundproofing against and the source from which the noise originates.There are to main methods for soundproofing - sound absorption and sound blocking. Sound absorption is used in situations where you may want to absorb sound before it leaves the room you're in. An example is in a home theater where you may use high volumes but don't want the sound to disturb those in other areas of the house.Sound blocking is a method in which you keep sound from entering a room. An example would be soundproofing your bedroom so that you do not hear noises from your kitchen or laundry room as you try to sleep.In some cases, like in the creation of a sound studio for music recording, you might want to use soundproofing materials that can perform both functions. That way your music isn't marred by outside sounds and you aren't bothering those around you either.
What is soundproofing?
soundproofing is the process of lowering the intensity of a sound by surrounding the source of the noise with noise absorbent materials or surfaces.It is almost like building a room inside a room.Soundproofing has STC based rating.Sound Transmission Class (or STC) is an integer rating of how well a building partition attenuates airborne soundSoundproofing depends on1. mass;2. damping;3. absorption (insulate your wall/ceiling cavities);4. decoupling;5. sealing the room.Materials like QuietRock, Quiet glue and other such products are used for soundproofing.
What materials can make a room soundproof?
Adding mass can help make a room soundproof. Mass can mean another layer of drywall or a layer of Mass loaded vinyl etc. Then there are materials which can enhance the soundproofing properties of your existing materials. for instance using a sound clip like Whisper Clip will add resilience to your wall and ceiling thereby creating a much higher soundproofing value to your wall and ceiling . Another example is adding a damping compound like green Glue to your room.
What is sorting in C language?
Quicksort in any programming language is an algorithm for sorting data sequences. It is typically implemented as follows (example demonstrates a quicksort of an array of type int). Note that a half-open range, [begin:end), includes the one-past-the-end of the range and is the conventional means of defining a range of contiguous array values. When begin==end, the range is deemed empty. // forward declarations void qsort (int* unsigned); // this is the function you will actually invoke void qsort_rec (int*, int*); // recursive function int* partition (int*, int*); // utility functions... int* select_pivot (int*, int*); void swap (int*, int*); int count (int*, int*); // sort a data sequence of length size void qsort (int* data, unsigned size) { qsort_rec (data, data + size); } // recursively sort the half-open range [begin:end) void qsort_rec (int* begin, int* end) { if (count (begin, end) < 2) return; // end point of recursion int* pivot = partition (begin, end); qsort_rec (begin, pivot); qsort_rec (++pivot, end); } // divide the half-open range [begin:end) into two around a pivot value int* partition (int* begin, int* end) { if (count (begin, end) < 2) return begin; int* pivot = select_pivot (begin, end); swap (begin, pivot); --end; while (begin != end) { while (*(begin) <= *pivot && begin != end) ++begin; while (*pivot < *(end) && begin != end) --end; if (begin!=end) swap (begin, end); } assert (begin==end); // sanity check! swap (pivot, begin); return begin; } // select the median of three from a half-open range [begin:end) int* select_pivot (int* begin, int* end) { int* mid = begin + (count (begin, end) / 2); if (*end<*begin) swap (begin, end); if (*mid<*begin) swap (begin, mid); if (*end<*mid) swap (mid, end); return end; } // swap the values referred to by p and q void swap (int* p, int* q) { if (!p !q) return; // sanity check! int t = *p; *p = *q; *q = t; } // count the elements in the half-closed range [begin:end) int count (int* begin, int* end) { int cnt = 0; int add; if (begin>end) { // swap pointers if the range is reversed int* t = begin; begin = end; end = t; add = -1; // count will be negative } else { add = 1; // count will be positive } while (begin++!=end) cnt+=add; return cnt; }
