Q. Operations on a data structure may be …..

View solution

Q. Which of the following are the operations applicable an primitive data structures?

View solution

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

View solution

Q. The indirect change of the values of a variable in one module by another module is called

View solution

Q. The operation of processing each element in the list is known as

View solution

Q. Finding the location of the element with a given value is:

View solution

Q. Which of the following data structure can't store the non-homogeneous data elements?

View solution

Q. Which of the following data structure store the homogeneous data elements?

View solution

Q. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called

View solution

Q. The difference between linear array and a record is

View solution

Q. Type data abstraction which allows conceptual representation of data in database management system is considered as

View solution

Q. Considering abstraction concepts, process of assigning similar entities to similar entity types systematically is called

View solution

Q. Identification, aggregation and instantiation are abstraction concepts used in

View solution

Q. Which if the following is/are the levels of implementation of data structure

View solution

Q. Process of abstraction in which objects and classes are identified with some kind of identifier is classified as

View solution

Q. The format identifier ‘%i’ is also used for _____ data type?

View solution

Q. Which data type is most suitable for storing a number 65000 in a 32-bit system?

View solution

Q. Which of the following is a User-defined data type?

View solution

Q. What is the size of an int data type?

View solution

Q. What is short int in C programming?

View solution