I) Network is a graph that has weights or costs associated with it. traversal we process all of a vertex’s descendants before we move to an adjacent vertex. if there is a path from each vertex to every other vertex in the digraph.Ģ2. To represent hierarchical relationship between elements, Which data structure is suitable?Ģ1. Which of the following data structure is linear type?Ģ0. Which of the following data structure is non linear type?ġ9. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.ġ8. Which data structure is used in breadth first search of a graph to hold nodes?ġ7. Which of the following is non-liner data structure?ġ5. 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.ġ4. Which of the following data structure can’t store the non-homogeneous data elements?ġ3. Which data structure allows deleting data elements from and inserting at rear?ġ2. ………… is very useful in situation when data have to stored and then retrieved in reverse order.ġ1. Is a pile in which items are added at one end and removed from the other.ġ0. Operation and deletion of item form the stack, when stack is not empty is called ……….operation.ĩ. Inserting an item into the stack when stack is not full is called …………. Which of the following is not the part of ADT description?Ĩ. …………… is not the component of data structure.ħ. Which of the following is true about the characteristics of abstract data types?Ħ. level is where the model becomes compatible executable codeĭ) All of the above DATA STRUCTURES and ALGORITHMS MCQsĥ. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……ģ. Which if the following is/are the levels of implementation of data structureĢ. Data Structures and Algorithms Multiple Choice Questions :-ġ.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |