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

A. | abstract level |

B. | application level |

C. | implementation level |

D. | all of the above |

Answer» D. all of the above |

View all MCQs in:
Data Structure (DS)

- Which of the following data structure is not linear data structure?
- Which of the following data structure can’t store the non-homogeneous data elements?
- Which of the following data structure can’t store the non-homogeneous data elements?
- Which data structure allows deleting data elements from and inserting at rear?
- Which data structure allows deleting data elements from front and inserting at rear?
- A ……. is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
- In ___ Data Structure data can be processed one by one sequentially
- Suppose implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the following statements is TRUE with respect to this modified stack?
- Consider a standard Circular Queue 'q' implementation (which has the same condition for Queue Full and Queue Empty) whose size is 11 and the elements of the queue are q[0], q[1], q[2].....,q[10]. The front and rear pointers are initialized to point at q[2] . In which position will the ninth element be added?
- Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are: i. isEmpty (Q) — returns true if the queue is empty, false otherwise. ii. delete (Q) — deletes the element at the front of the queue and returns its value. iii. insert (Q, i) — inserts the integer i at the rear of the queue. Consider the following function: void f (queue Q) { int i ; if (!isEmpty(Q)) { i = delete(Q); f(Q); insert(Q, i); } }What operation is performed by the above function f ?

We want to make our service better for you. Please take a moment to fill out our survey.

Take SurveyLogin to Continue

It will take less than 2 minutes

Report MCQ