Q. Data structure that allows extremely fast exact-match search, is known to be

View solution

Q. A data item can be thought of a member of a

View solution

Q. Data structure that support efficient insertion of new records, is said to be

View solution

Q. A record or a piece of information whose value is generated from a type, is called

View solution

Q. Space requirement of a data item, defined by its variables are referred to as

View solution

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

View solution

Q. In mathematical means, problems can be viewed as

View solution

Q. In a function, values that make up an input are known to be

View solution

Q. An instantiation of an algorithm in a computer programming language is called

View solution

Q. A given algorithm is able to compute

View solution

Q. A function can be thought as a matching between

View solution

Q. For parameters, a specific selection of values is called

View solution

Q. A problem definition should not include any

View solution

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

View solution

Q. An algorithm is composed of a series of

View solution

Q. A task to be performed is known as

View solution

Q. Number of steps composed by an algorithm should be

View solution

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

View solution

Q. Outputs of a function can also be referred to

View solution

Q. An implementation for function that transforms an input to corresponding output is called

View solution