Q. How many cases are there, which are used to compare various data structure's execution time in a relative manner?

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. A problem definition should not include any

View solution

Q. Critical resource for a program is most often its

View solution

Q. Duplicate-valued elements can be attributed in a

View solution

Q. Which is an example of a dynamic data structure?

View solution

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

View solution

Q. Term Data Structure refers to _________ and interrelationship between them.

View solution

Q. Which of the following statement is false ?

View solution

Q. If element in array has two subscripts, then array is

View solution

Q. ……………….. level is where the model becomes compatible executable code.

View solution

Q. Number of steps composed by an algorithm should be

View solution

Q. Outputs of a function can also be referred to

View solution

Q. Efficiency of an algorithm is measured by

View solution

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

View solution

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

View solution

Q. A function or a mapping of inputs to outputs is called

View solution

Q. Operation(s) that an algorithm must fulfill is/are

View solution

Q. Which of the following is non-liner data structure?

View solution

Q. Non Primitive data Structures are those which define set of _________.

View solution