Q. Match the following.

a) Completeness i) How long does it take to find a solution
b) Time Complexity ii) How much memory need to perform the search.
c) Space Complexity iii) Is the strategy guaranteed to find the solution when there in one.

View solution

Q. When new data are to be inserted into a data structure, but there is not available space; this situation is usually called ….

View solution

Q. The way in which the data item or items are logically related defines …..

View solution

Q. The logical or mathematical model of a particular organization of data is called a ………

View solution

Q. The simplest type of data structure is ………………

View solution

Q. Linear arrays are also called ……………….

View solution

Q. The data structure which is one ended is ………………

View solution

Q. A list which displays the relationship of adjacency between elements is said to be

View solution

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