1. Dictionary based compression... Is a lossless compression format Doesn't need to send the dictionary with the data Is a lossless compression format All of the options 2. What is the correct Run-length encoding for the data: cccmmmmmsssssdcccccc Cmsdc35516 C3m5s5d1c6 3c5m5s1d6c Cccmmmmmsssssdcccccc 3. Coding redundancy works on Pixels Coordinates Intensity Matrix 4. Run-length encoding.. Can be used for a wide variety of file types Records the number of repeats of an individual element Is Lossless All of the options 5. Which of the following are not in a compressed format? MP3 Bitmap MPEG JPEG 6. The Attribute Used To Define A New Namespace Is Xmlns Xmlns Xmlnamespace XMLNS 7. Digitizing the image intensity amplitude is called Framing Sampling Both Sampling And Quantization Quantization 8. Sequence of code assigned is called Word Code Word Nibble Byte 9. Compressed image can be recovered back by Image Contrast Image Equalization Image Enhancement Image Decompression 10. Compression is done for saving Money Both Storage And Bandwidth Storage Bandwidth 11. Hashing gives each item A unique address No address A logarithmic address A sequential address 12. Digital video is sequence of Matrix Frames Pixels Coordinates 13. The best visual compression quality is achieved using Dolby Fourier transform Wavelets DCT 14. Identify types of lossless compression Dictionary encoding Run length encoding Transform Coding Dictionary encoding and Run length encoding 15. Every run length pair introduce new Frames Pixels Intensity Matrix 16. An xml component that defines the structure of a document is known as a(n): #PCDATA. DOCTYPE. HTML Stylesheet. DTD 17. In the coding redundancy technique we use Fixed Length Code Byte Variable Length Code Both Fixed Length Code And Variable Length Code 18. When is Run Length Encoding used? When we want to compress patterns of data When we want to decompress patterns of data When we want to encode running videos Option. 19. The xml dom object is Comment Data Comment Reference Entity Reference Entity 20. System of symbols to represent event is called Code Nibble Word Storage 21. With XML: Documents can automatically be generated from database data only. Database data can automatically be extracted from xml documents only. With xml, All of the options are true. Views are not limited to one multi-valued path only. 22. What is not true about xml? XML Documents Have Two Sections. With XML, There Is A Clear Separation Between Document Structure, Content And Materialization. XML Is More Powerful Than HTML. Web Page Display Is The Most Important Application Of XML. 23. Information lost when expressed mathematically is called Fidelity Criteria Finite Memory Source Markov Noiseless Theorem 24. Whats so great about xml? Only b.is correct Easy data exchange High speed on network Both Easy data exchange & High speed on network 25. What does xml stand for? Example Markup Language Extensible Markup Language X-Markup Language Extra Modern Link 26. Which of the following would not be suitable for Lossy Compression? Videos Images Text Sounds 27. In Huffman coding, the actual output of the encoder is determined by a set of Function Probabilities Model Codes 28. Entropy coding can be used for Regular of digital data values Random of digital data values Sequence of digital data values None of the options 29. The PNG standard is one of the first standards to be collaboratively developed over the Image Internet File None of the options 30. Limitations of huffman coding is Each symbol is encoded with integer number of bits Each symbol is encoded with integer number of value Each symbol is encoded with integer number of level None of the options 31. The set of binary sequences is called a code, and the individual members of the set are called Sequence Model Codewords. Unit Model None of the options 32. The main aim of arithmetic coding is to assign the _____to each symbol. Image Interval Symbol None of the options 33. Lz77 exploits the fact that words and phrases within a ____would be repeated. Image File Text File Video File None of the options 34. Probability Models Know As.. Statistical model Ignorance model Knowledge model None of the options 35. LZB achieves a better compression than LZB LZSS LZH None of the options 36. The ITU-T recommendation V.42 bis is a compression standard devised for use over a Telephone Network Text File Network Image Network None of the options 37. Arithmetic coding completely bypass the idea of replacing every input symbol with a Bits String Codeword None of the options 38. Once we have started decoding, all we have to do is ___the encoder algorithm. Long Mimic Static None of the options 39. The set of binary sequences is called a Unit Digit Code None of the options 40. Arithmetic algorithms as well as huffman algorithms are based on Statistical model String model Probability model None of the options 41. Advantage of arithmetic coding is that It is easy to implement a system with single arithmetic codes It is easy to implement a system with multiple arithmetic codes It is hard to implement a system with multiple arithmetic codes None of the options 42. LZH is performed in ___ phases One Two Four None of the options 43. Limitations of arithmetic coding The precision required to represent the intervals grows with length of the message. The precision required to represent the intervals grows with bit of the message. The precision required to represent the random grows with length of the message. None of the options 44. Entropy coding can be used for compression of any type of data in a Media system Bit system File system. None of the options 45. In LZ77 encoding process one reference (a triple) is transmitted for several input symbols and hence it is Less Quick. Quick. Very Quick. None of the options 46. RLE Is Designed Especially For Data With Strings of repeated symbols Sound of repeated symbols Image of repeated symbols None of the options Submit Answers Retake Test More Computer Science Engineering Study Material › Computer Science Engineering Mock Tests with Answers Distributed Computing System Mock Test Software Project Management Mock TestArtificial Intelligence and Robotics Mock TestBasics of Database Management Mock TestC# Programming Mock TestC#.NET Programming Mock TestCloud Computing Mock TestCommunication Network Mock TestComputer Architecture Mock TestComputer Architecture and Organization Mock TestComputer Fundamentals Mock TestComputer Networking Mock TestComputer Networks Mock TestCPP Programming Mock TestData Analysis Mock TestData Communication and Computer Network Mock TestData Compression and Data Retrieval Mock TestData Mining and Business Intelligence Mock TestData Mining and Data Warehouse Mock TestData Structure and Algorithms Mock TestData Structures Mock TestDataBase Management System Mock TestDesign and Analysis of Algorithms Mock TestDigital Electronics and Logic Design Mock TestDigital Logic Circuits Mock TestDigital Principles and System Design Mock TestDiscrete Mathematics Mock TestDiscrete Structure Mock TestDotNet Technology Mock TestEmbedded Real Time Operating System Mock TestGreen Computing Mock TestHigh Performance Computing Mock TestInformation Cyber Security Mock TestInformation and Network Security Mock TestInformation Retrival Techniques Mock TestInformation Systems and Engineering Economics Mock TestMachine Learning Mock TestMicroprocessor and Interfacing Technique Mock TestMicroprocessors Mock TestMuli core Architectures and Pro Mock TestMulti core processors Mock TestNetwork Security Mock TestNeural Networks and Fuzzy Control Object Oriented Programming Mock TestOperating System Architecture Mock TestOperating System Mock TestProblem Solving and Python Programming Mock TestProgramming for Problem Solving Mock TestPython Programming Mock TestSoft Computing Mock TestSoftware Design Modeling Mock TestSoftware Engineering Mock TestSoftware Testing Mock TestSoftware Testing and Quality Assurance Mock TestTheory of Computation and Compiler Design Mock TestTheory of Computation Mock TestUbiquitous Computing System Mock Test Computer Science Engineering Mock Tests
