💫💫💫💫ለመላው የኢትዮጵያ እስልምና እምነት ተከታዮች ለ1440ኛው ሂጅሪያ የኢድ አል ፊጥር በዓል እንኳን አደረሳችሁ፡፡

How do u find the 11 sorting algorithms? Is is helpful? How many of you find it useful? Let us know by 🗳 voting 👍🏽👌🏽

Question 2:

Class Q2 {
int num1 = 9;
int num2 = 3;
public static void main (String []args)
{
if(num1 % num2 == 0)
System.out.printf(“%s the multiple of %s”, num1, num2);
else
System.out.printf(“%s is not the multiple of %s”, num1, num2);
}
}

Multimedia Systems - Data Compression
————————————————
Compression is the process of coding that will effectively reduce the total number of bits needed to represent certain information.

There are two types of compressions lossy and lossless

Lossless
✔️ Does not lose information (i.e., the signal is perfectly reconstructed after decompression)
✔️ Produces a variable bit-rate
✔️ It is not guaranteed to actually reduce the data size
✔️ Lower compression ratio

Lossy
✔️ Loses some information (i.e., the signal is not perfectly reconstructed after decompression)
✔️ Produces any desired constant bit-rate
✔️ Higher compression ratio
✔️ Perceptual loss of information reduced (controlled)

Lossless Compression Techniques
💡 Shannon-Fano Coding
💡 Huffman Coding

Lossy Compression Techniques
💡 Distortion Measures ( MSE & SNR)
💡 Uniform Scalar Quantization
💡 Vector Quantization

( In the coming posts we will give you notes about lossless techniques and we will implement by tree data structure method using C++ programming)
Stay Wake & Tuned! 😳
————————————————
Join The Underground Coding Movement!
AI Programming @freecodecs
As Always: Have a Great Study 🙌🏽

Tree (Data Structure in C++)
• Insert
• InOrder
• PreOrder
• PostOrder
• Delete
• Search
—————————————————
AI Programming @freecodecs
Have a Lit🔥 Practice Folks 🙌🏽