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

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. Variable which can be accessed by all modules of the program is called as __________.

View solution

Q. Which of the following data structure is non linear type?

View solution

Q. Records can be accessed by unique numbers, that are known to be

View solution

Q. An ADT and data related to its implementation together make up a

View solution

Q. Which of the following data structure is linear type?

View solution

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

View solution

Q. The hierarchical relationship between data elements can be easily represented using a nonlinear data structure called_______.

View solution

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

View solution

Q. Duplicate-valued elements can be attributed in a

View solution

Q. A collection of elements having an specific order is called

View solution

Q. Relation defining a function by means of an expression that includes one or more instances of itself is known to be

View solution

Q. Atomic Data is also called as _____________.

View solution

Q. A simple type whose values contain no subparts, is called

View solution

Q. A record is modifiable only when medication does not affect its

View solution

Q. Which case of data structure operation takes maximum time?

View solution

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

View solution

Q. _________________ defines a set of primitive elements which do not involves any other element as its sub-part.

View solution

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

View solution