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

View solution

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

View solution

Q. Which of the following statement is false ?

View solution

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

View solution

Q. Which of the following can be used as a criterion for classification of data structures used in language processing ?

View solution

Q. The OS of a computer may periodically collect all the free memory space to form contiguous block of free space. This is called

View solution

Q. A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a

View solution

Q. ___________ is neither an algorithm nor a program.

View solution

Q. The concepts in programming languages are essential knowledge to anyone who wants to become skilled in_________________.

View solution

Q. Which model is used to organize data in the main memory is called data structure?

View solution

Q. A ________is a linear list of data elements in which the addition of a new element or the deletion of an element occurs only at one end.

View solution

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

View solution

Q. What is the process of finding the location of a given data element in the data structure called?

View solution

Q. What plays an important role in programming?

View solution

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

View solution

Q. __________ is a collection of data elements of similar data types.

View solution

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

View solution

Q. A data structure is a group of data elements grouped together under ______.

View solution

Q. To write fixed-length records, use file open mode:

View solution

Q. A random access file is organized most like a(n):

View solution