McqMate
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the following areas: Computer Science Engineering (CSE) , Information Technology Engineering (IT) .
| 1. |
Makes the file smaller by deleting parts of the file permanently (forever) |
| A. | Lossy Compression |
| B. | Lossless Compression |
| Answer» A. Lossy Compression | |
| 2. |
Which of these is an advantage for Lossy compression? |
| A. | The file size becomes significantly (much) smaller |
| B. | The file size does not become much smaller than 50% |
| Answer» A. The file size becomes significantly (much) smaller | |
| 3. |
Which of the following would not be suitable for Lossy Compression? |
| A. | Images |
| B. | Sounds |
| C. | Videos |
| D. | Text |
| Answer» D. Text | |
| 4. |
Lossy or lossless? This type of compression does not get rid of any data |
| A. | Lossy |
| B. | Lossless |
| C. | Both |
| Answer» B. Lossless | |
| 5. |
Lossy or lossless? Used for web images as it gives the smallest file size - this makes images easier to upload/download/share. |
| A. | Lossy |
| B. | Lossless |
| C. | Both |
| Answer» A. Lossy | |
| 6. |
What type of compression allows you to reconstruct the original data? |
| A. | Lossless compression |
| B. | Lossy compression |
| Answer» A. Lossless compression | |
| 7. |
What are the key reasons for compressing data? |
| A. | Less space needed for storage |
| B. | Less time to transmit |
| C. | Reduced amount of processing power |
| D. | A and b |
| Answer» D. A and b | |
| 8. |
Lossless compression... |
| A. | Is used when not all the information is needed |
| B. | Would be a sensible choice for a music download site |
| C. | Can fully regenerate the original file |
| D. | a and c |
| Answer» D. a and c | |
| 9. |
Lossy compression... |
| A. | Permanently removes data from a file |
| B. | Aims to remove redundant data |
| C. | Would be a sensible choice for a music download site. |
| D. | all of the above |
| Answer» D. all of the above | |
| 10. |
Dictionary based compression... |
| A. | Is a lossless compression format |
| B. | Doesn't need to send the dictionary with the data |
| C. | Is a lossless compression format |
| D. | all of the above |
| Answer» D. all of the above | |
| 11. |
Run-length encoding.. |
| A. | Is Lossless |
| B. | Records the number of repeats of an individual element |
| C. | Can be used for a wide variety of file types |
| D. | all of the above |
| Answer» D. all of the above | |
| 12. |
Hashing gives each item |
| A. | A sequential address |
| B. | A logarithmic address |
| C. | No address |
| D. | A unique address |
| Answer» D. A unique address | |
| 13. |
When is Run Length Encoding used? |
| A. | When we want to compress patterns of data |
| B. | When we want to decompress patterns of data |
| C. | When we want to encode running videos |
| D. | Option. |
| Answer» A. When we want to compress patterns of data | |
| 14. |
What is the correct Run-length encoding for the data: cccmmmmmsssssdcccccc |
| A. | 3c5m5s1d6c |
| B. | C3m5s5d1c6 |
| C. | Cmsdc35516 |
| D. | Cccmmmmmsssssdcccccc |
| Answer» A. 3c5m5s1d6c | |
| 15. |
Which of the following are not in a compressed format? |
| A. | JPEG |
| B. | Bitmap |
| C. | MPEG |
| D. | MP3 |
| Answer» B. Bitmap | |
| 16. |
Identify types of lossless compression |
| A. | Run length encoding |
| B. | Dictionary encoding |
| C. | Transform Coding |
| D. | a and b |
| Answer» D. a and b | |
| 17. |
Digitizing the image intensity amplitude is called |
| A. | Sampling |
| B. | Quantization |
| C. | Framing |
| D. | Both A And B |
| Answer» B. Quantization | |
| 18. |
Compressed image can be recovered back by |
| A. | Image Enhancement |
| B. | Image Decompression |
| C. | Image Contrast |
| D. | Image Equalization |
| Answer» B. Image Decompression | |
| 19. |
Digital video is sequence of |
| A. | Pixels |
| B. | Matrix |
| C. | Frames |
| D. | Coordinates |
| Answer» C. Frames | |
| 20. |
Coding redundancy works on |
| A. | Pixels |
| B. | Matrix |
| C. | Intensity |
| D. | Coordinates |
| Answer» C. Intensity | |
| 21. |
An Alphabet Consist Of The Letters A, B, C And D. The probability of occurrence is
|
| A. | A = 0 , B = 11 , C = 10 , D = 111 |
| B. | A = 0 , B = 111 , C = 110 , D = 10 |
| C. | A = 01 , B = 111 , C = 110 , D = 10 |
| D. | A = 0 , B = 111 , C = 11 , D = 101 |
| Answer» B. A = 0 , B = 111 , C = 110 , D = 10 | |
| 22. |
The basic idea behind huffman coding is to |
| A. | Compress data by using more bits to encode more frequently occurring characters |
| B. | Compress data by using fewer bits to encode more frequently occurring characters |
| C. | Expand data by using fewer bits to encode more frequently occurring characters |
| D. | Compress data by using fewer bits to encode fewer frequently occurring characters |
| Answer» B. Compress data by using fewer bits to encode more frequently occurring characters | |
| 23. |
Huffman coding is an encoding algorithm used for |
| A. | Lossy Data Compression |
| B. | Broadband Systems |
| C. | Lossless Data Compression |
| D. | Files Greater Than 1 Mbit |
| Answer» C. Lossless Data Compression | |
| 24. |
A huffman encoder takes a set of characters with fixed length and produces a set of characters of |
| A. | Constant Length |
| B. | Random Length |
| C. | Fixed Length |
| D. | Variable Length |
| Answer» D. Variable Length | |
| 25. |
A Huffman Code: A = 1, B = 000, C = 001, D = 01, P(A) = 0.4, P(B) = 0.1, P(C) = 0.2, P(D) = 0.3 The Average Number Of Bits Per Letter Is |
| A. | 8.0 Bit |
| B. | 2.0 Bit |
| C. | 2.1 Bit |
| D. | 1.9 Bit |
| Answer» D. 1.9 Bit | |
| 26. |
The idea with wavelets is to represent a complicated function by |
| A. | Sinus Functions |
| B. | Simple Basic Functions |
| C. | Lines |
| D. | Square Functions |
| Answer» B. Simple Basic Functions | |
| 27. |
Down sampling is to make a digital image file smaller by |
| A. | Removing noise |
| B. | Adding noise |
| C. | Removing pixels |
| D. | Adding pixels |
| Answer» C. Removing pixels | |
| 28. |
In a typical picture, most pixels will be |
| A. | Very similar to their neighbors |
| B. | Very different to their neighbors |
| C. | Bright |
| D. | Equal |
| Answer» A. Very similar to their neighbors | |
| 29. |
Without losing quality, JPEG-2000 can achieve compression ratios of |
| A. | 2000:1 |
| B. | 20:1 |
| C. | 200:1 |
| D. | 2:1 |
| Answer» C. 200:1 | |
| 30. |
The best visual compression quality is achieved using |
| A. | Dolby |
| B. | Wavelets |
| C. | Fourier transform |
| D. | DCT |
| Answer» B. Wavelets | |
| 31. |
Sequence of code assigned is called |
| A. | Code Word |
| B. | Word |
| C. | Byte |
| D. | Nibble |
| Answer» A. Code Word | |
| 32. |
Every run length pair introduce new |
| A. | Pixels |
| B. | Matrix |
| C. | Frames |
| D. | Intensity |
| Answer» D. Intensity | |
| 33. |
In the coding redundancy technique we use |
| A. | Fixed Length Code |
| B. | Variable Length Code |
| C. | Byte |
| D. | Both A And B |
| Answer» D. Both A And B | |
| 34. |
Compression is done for saving |
| A. | Storage |
| B. | Bandwidth |
| C. | Money |
| D. | Both A And B |
| Answer» D. Both A And B | |
| 35. |
System of symbols to represent event is called |
| A. | Storage |
| B. | Word |
| C. | Code |
| D. | Nibble |
| Answer» C. Code | |
| 36. |
Information lost when expressed mathematically is called |
| A. | Markov |
| B. | Finite Memory Source |
| C. | Fidelity Criteria |
| D. | Noiseless Theorem |
| Answer» C. Fidelity Criteria | |
| 37. |
What does xml stand for? |
| A. | Extra Modern Link |
| B. | Extensible Markup Language |
| C. | Example Markup Language |
| D. | X-Markup Language |
| Answer» B. Extensible Markup Language | |
| 38. |
What is the correct syntax of the declaration which defines the xml version? |
| A. | <Xml Version="A.0" /> |
| B. | <?Xml Version="A.0"?> |
| C. | <?Xml Version="A.0" /> |
| D. | None Of The Above |
| Answer» B. <?Xml Version="A.0"?> | |
| 39. |
Which of the following programs support xml or xml applications? |
| A. | Internet Explorer 5.5 |
| B. | Netscape D.7 |
| C. | Realplayer. |
| D. | Both A And B |
| Answer» D. Both A And B | |
| 40. |
Well formed xml document means |
| A. | It Contains A Root Element |
| B. | It Contain An Element |
| C. | It Contains One Or More Elements |
| D. | Must Contain One Or More Elements And Root Element Must Contain All Other Elements |
| Answer» D. Must Contain One Or More Elements And Root Element Must Contain All Other Elements | |
| 41. |
Comment in xml document is given by |
| A. | <?-- --> |
| B. | <!-- --!> |
| C. | <!-- --> |
| D. | </-- -- > |
| Answer» C. <!-- --> | |
| 42. |
Xml document can be viewed in |
| A. | IE C.0 |
| B. | IE B.0 |
| C. | IE 6.0 |
| D. | IE X.0 |
| Answer» C. IE 6.0 | |
| 43. |
How can we make attributes have multiple values |
| A. | <Myelement myattribute="value1 value2"/> |
| B. | <Myelement myattribute="value1" myattribute="value2"/> |
| C. | <Myelement myattribute="value1, value2"/> |
| D. | Attributes cannot have multiple values |
| Answer» D. Attributes cannot have multiple values | |
| 44. |
Attribute standalone="no" should be included in xml declaration if a document |
| A. | Is linked to an external xsl stylesheet |
| B. | Has external general references |
| C. | Has processing instructions |
| D. | Has an external dtd |
| Answer» D. Has an external dtd | |
| 45. |
The xml dom object is |
| A. | Entity |
| B. | Entity Reference |
| C. | Comment Reference |
| D. | Comment Data |
| Answer» B. Entity Reference | |
| 46. |
Whats so great about xml? |
| A. | Easy data exchange |
| B. | High speed on network |
| C. | Only b.is correct |
| D. | Both A. & B. |
| Answer» D. Both A. & B. | |
| 47. |
The Attribute Used To Define A New Namespace Is |
| A. | XMLNS |
| B. | Xmlnamespace |
| C. | Xmlns |
| D. | Xmlns |
| Answer» C. Xmlns | |
| 48. |
With XML: |
| A. | Views are not limited to one multi-valued path only. |
| B. | Documents can automatically be generated from database data only. |
| C. | Database data can automatically be extracted from xml documents only. |
| D. | With xml, all of the above are true. |
| Answer» D. With xml, all of the above are true. | |
| 49. |
An xml component that defines the structure of a document is known as a(n): |
| A. | DOCTYPE. |
| B. | DTD |
| C. | #PCDATA. |
| D. | HTML Stylesheet. |
| Answer» B. DTD | |
| 50. |
What is not true about xml? |
| A. | Web Page Display Is The Most Important Application Of XML. |
| B. | With XML, There Is A Clear Separation Between Document Structure, Content And Materialization. |
| C. | XML Is More Powerful Than HTML. |
| D. | XML Documents Have Two Sections. |
| Answer» A. Web Page Display Is The Most Important Application Of XML. | |
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready for the next step? Take a quiz to solidify what you've just studied.