Q. Lossy compression reduces bits by removing unnecessary or less important information.

View solution

Q. Which of the following is Lossless Data Compression Algorithms?

View solution

Q. Which compression loses data?

View solution

Q. How many types of compression there?

View solution

Q. _______ is the process of encoding information using fewer bits than the original representation.

View solution

Q. The [] notation is

View solution

Q. Which of the following belongs to the algorithm paradigm?

View solution

Q. What is the type of the algorithm used in solving the 8 Queens problem?

View solution

Q. In analysis of algorithm, approximate relationship between the size of the job and the amount of work required to do is expressed by using _________.

View solution

Q. The upper bound on the time complexity of the nondeterministic sorting algorithm is?

View solution

Q. In an array representation of binary tree the right child of root will be at location of?

View solution

Q. The time factor when determining the efficiency of algorithm is measured by?

View solution

Q. O(1) means computing time is __________________

View solution

Q. Which of the following analysis known as empirical analysis of an algorithm?

View solution

Q. Which of the following analysis known as theoretical analysis of an algorithm?

View solution

Q. Data items that cannot be divided are called as?

View solution

Q. Which characteristics shows that running time or the execution time of operations of data structure must be as small as possible?

View solution

Q. Which of the following is not a Characteristics of a Data Structure?

View solution

Q. What is true about Interface in data structure?

View solution

Q. __________ is a single elementary unit of information representing an attribute of an entity.

View solution