Q. In problem solving solution defined constraints should be of form

View solution

Q. An ADT is defined to be a mathematical model of a user-defined type along with the collection of all ____________ operations on that model

View solution

Q. When data is input in numeric form, data type in program is classified as

View solution

Q. In line '300 IF NAME$="***" THEN Average= Total Mark/N' of BASIC program, "***" is classified as

View solution

Q. Sum of reciprocals from 1 to n, called

View solution

Q. Duplicate-valued elements can be attributed in a

View solution

Q. A task to be performed is known as

View solution

Q. If every pair of distinct elements in a partial order are comparable, then order is called a

View solution

Q. Which of the following is not the part of ADT description?

View solution

Q. Match the following.

a) Completeness i) How long does it take to find a solution
b) Time Complexity ii) How much memory need to perform the search.
c) Space Complexity iii) Is the strategy guaranteed to find the solution when there in one.

View solution

Q. Which of the following algorithms has very high compression ratio, used by 7zip and xz?

View solution

Q. Inputs of a function can also be referred to

View solution

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

View solution

Q. Set on which partial order is defined is called

View solution

Q. Data must be represented, organized, stored, processed and managed in a way that facilitates_________.

View solution

Q. Each member of a set can be thought of an/a

View solution

Q. Which of the following sorting algorithm is of divide-and-conquer type?

View solution

Q. A solution is assumed to be efficient if it is able to solve problem within required

View solution

Q. If elements of the data structure forms a sequence of list then it is called as ____________.

View solution

Q. Which file open mode would be used to write data only to the end of an existing file?

View solution