Data Compression and Data Retrieval MCQs | Page - 4

Dear candidates you will find MCQ questions of Data Compression and Data Retrieval here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.

M

Mr. Dubey • 100.69K Points
Coach

Q. In the coding redundancy technique we use

  • (A) Fixed Length Code
  • (B) Variable Length Code
  • (C) Byte
  • (D) Both A And B
Show Answer Discuss Share

M

Mr. Dubey • 100.69K Points
Coach

Q. Information lost when expressed mathematically is called

  • (A) Markov
  • (B) Finite Memory Source
  • (C) Fidelity Criteria
  • (D) Noiseless Theorem
Show Answer Discuss Share

M

Mr. Dubey • 100.69K Points
Coach

Q. What does xml stand for?

  • (A) Extra Modern Link
  • (B) Extensible Markup Language
  • (C) Example Markup Language
  • (D) X-Markup Language
Show Answer Discuss Share

M

Mr. Dubey • 100.69K Points
Coach

Q. 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
Show Answer Discuss Share

M

Mr. Dubey • 100.69K Points
Coach

Q. 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
Show Answer Discuss Share

M

Mr. Dubey • 100.69K Points
Coach

Q. 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
Show Answer Discuss Share

Jump to

Download our easy to use, user friendly Android App from Play Store. And learn MCQs with one click.

Image