Which of the following data structure store the homogeneous data elements?ĥ3. Which of the following data structures are indexed structures?ĥ2. Ii) In strictly binary tree, the out-degree of every node is either o or 2.ĥ1. Is a directed tree in which outdegree of each node is less than or equal to two. A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.Ĥ9. Which is/are the application(s) of stackĤ8. is not an operation performed on linear listĪ) Insertion b) Deletion c) Retrieval d) TraversalĤ7. Ii) A node is child node if out degree is one.Ĥ6. I) A node is a parent if it has successor nodes. Any node is the path from the root to the node is called Ii) Nodes that are not root and not leaf are called as internal nodes.Ĥ4. I) The degree of root node is always zero. Which of the following is not the type of queue?Ī) The first subset is called left subtreeī) The second subtree is called right subtree In general, the binary search method needs no more than ……………. is a graph that has weights of costs associated with its edges.Ĥ0. A graph is a collection of nodes, called ………. There is an extra element at the head of the list called a ……….ģ8. ………… is not the operation that can be performed on queue.ģ7. What will be the value of top, if there is a size of stack STACK_SIZE is 5ģ6. But disadvantage in that is they are sequential lists.ģ5. is that they solve the problem if sequential storage representation. Ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.ģ4. I) Using singly linked lists and circular list, it is not possible to traverse the list backwards. Which of the following statement is true? In a circular queue the value of r will be. In a queue, the initial values of front pointer f rare pointer r should be ……. A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.ģ1. Ii) A graph is said to be complete if there is an edge between every pair of vertices.ģ0. I) An undirected graph which contains no cycles is called forest. Which of the following is not the internal sort? Ii) The time complexity of binary search is O(logn).Ģ8. I) Binary search is used for searching in a sorted array. In ……………, search start at the beginning of the list and check every element in the list. The number of comparisons done by sequential search is ………………Ģ6. Iii) A graph is said to be complete if there is no edge between every pair of vertices.Ī) Completeness i) How long does it take to find a solutionī) Time Complexity ii) How much memory need to perform the search.Ĭ) Space Complexity iii) Is the strategy guaranteed to find the solution when there in one.Ģ5. Ii) An undirected graph which contains no cycles is called a forest. 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.ĩ.
FUNDAMENTALS OF DATA STRUCTURES IN C ANSWERS FULL
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 kommentar(er)
