Education: Data Structure

Solved MCQ on Searching and Sorting Algorithms in Data Structure set-2

<div dir="ltr" style="text-align: left;" trbidi="on"><div style="text-align: left;"><br /></div><div style="text-align: left;">1) The worst case occur in linear search algorithm when .......</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Item is somewhere in the middle of the array</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Item is not in the array at all</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Item is the last element in the array</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Item is the last element in the array or item is not there at all</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">2) If the number of records to be sorted is small, then ...... sorting can be efficient.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Merge </div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Heap</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Selection</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Bubble</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">3) The complexity of sorting algorithm measures the ...... as a function of the number n of items to be sorter.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. average time</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. running time</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. average-case complexity</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. case-complexity</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">4) Which of the following is not a limitation of binary search algorithm?</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. must use a sorted array</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. requirement of sorted array is expensive when a lot of insertion and deletions are needed</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. there must be a mechanism to access middle element directly</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. binary search algorithm is not efficient when the data elements more than 1500.</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">5) The Average case occurs in linear search algorithm ..........</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. when item is somewhere in the middle of the array</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. when item is not the array at all</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. when item is the last element in the array </div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Item is the last element in the array or item is not there at all</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">6) Binary search algorithm cannot be applied to ...</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. sorted linked list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. sorted binary trees</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. sorted linear array</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. pointer array</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">7) Complexity of linear search algorithm is .........</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. O(n)</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. O(logn)</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. O(n2)</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. O(n logn)</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">8) Sorting algorithm can be characterized as ......</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Simple algorithm which require the order of n2 comparisons to sort n items.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Sophisticated algorithms that require the O(nlog2n) comparisons to sort items.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Both of the above</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. None of the above</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">9) The complexity of bubble sort algorithm is .....</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. O(n)</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. O(logn)</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. O(n2)</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. O(n logn)</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">10) State True or False for internal sorting algorithms.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">i) Internal sorting are applied when the entire collection if data to be sorted is small enough that the sorting can take place within main memory.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">ii) The time required to read or write is considered to be significant in evaluating the performance of internal sorting.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. i-True, ii-True</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. i-True, ii-False</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. i-False, ii-True</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. i-False, ii-False</div><div style="text-align: left;"><br /><a name="more"></a></div><div style="text-align: left;"><br /></div><div style="text-align: left;">11) The complexity of merge sort algorithm is ......</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. O(n)</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. O(logn)</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. O(n2)</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. O(n logn)</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">12) .......... is putting an element in the appropriate place in a sorted list yields a larger sorted order list.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Insertion</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Extraction</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Selection</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Distribution</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">13) ............order is the best possible for array sorting algorithm which sorts n item.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. O(n logn)</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. O(n2)</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. O(n+logn)</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. O(logn)</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">14) ......... is rearranging pairs of elements which are out of order, until no such pairs remain.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Insertion</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Exchange</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Selection</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Distribution</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">15) ............ is the method used by card sorter.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Radix sort</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Insertion </div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Heap</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Quick</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">16) Which of the following sorting algorithm is of divide and conquer type?</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Bubble sort</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Insertion sort</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Merge sort</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Selection sort</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">17) ........ sorting algorithm is frequently used when n is small where n is total number of elements.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Heap </div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Insertion</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Bubble</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Quick</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">18) Which of the following sorting algorithm is of priority queue sorting type?</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Bubble sort</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Insertion sort</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Merge sort</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Selection sort</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">19) Which of the following is not the required condition for binary search algorithm?</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. The list must be sorted</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. There should be the direct access to the middle element in any sub list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. There must be mechanism to delete and/or insert elements in list.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Number values should only be present</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">20) Partition and exchange sort is ........</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. quick sort</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. tree sort</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. heap sort</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. bubble sort</div><div style="text-align: left;"></div><div style="text-align: left;"></div><h4 style="text-align: left;">Answers:</h4><div style="text-align: left;">1) D. Item is the last element in the array or item is not there at all </div><div style="text-align: left;">2) C. Selection </div><div style="text-align: left;">3) B. running time  </div><div style="text-align: left;">4) D. binary search algorithm is not efficient when the data elements more than 1500. </div><div style="text-align: left;">5) A. when item is somewhere in the middle of the array </div><div style="text-align: left;">6) D. pointer array </div><div style="text-align: left;">7) A. O(n) </div><div style="text-align: left;">8) C. Both of the above </div><div style="text-align: left;">9) C. O(n2) </div><div style="text-align: left;">10) B. i-True, ii-False </div><div style="text-align: left;">11) D. O(n logn) </div><div style="text-align: left;">12) A. Insertion </div><div style="text-align: left;">13) C. O(n+logn) </div><div style="text-align: left;">14) B. Exchange </div><div style="text-align: left;">15) A. Radix sort </div><div style="text-align: left;">16) C. Merge sort </div><div style="text-align: left;">17) B. Insertion </div><div style="text-align: left;">18) D. Selection sort </div><div style="text-align: left;">19) C. There must be mechanism to delete and/or insert elements in list.</div><div style="text-align: left;">20) A. quick sort </div><h3 style="text-align: left;"><br /> Related Posts </h3><ul style="text-align: left;"><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/solved-mcq-on-stack-queue-in-data-structure.html">Solved MCQ on Stack and Queue in Data Structure set-1</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/interview-questions-stack-queue-data-structure.html">Interview Questions on Stack and Queue in Data Structure set-2</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/solved-mcq-on-tree-graph-data-structure.html">Solved MCQ on Tree and Graph in Data Structure set-1 </a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/objective-questions-tree-graph-data-structure.html">Objective Questions on Tree and Graph in Data Structure set-2</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2012/12/solved-mcq-of-data-structure-set-1.html">Solved MCQ of Data Structure Set - 1</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2012/12/solved-mcq-of-data-structure-set-2.html">Solved MCQ of Data Structure Set - 2</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2013/03/solved-objective-questions-of-data-structure.html">Solved Objective questions of computer data structure set-3</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2013/10/solved-mcq-data-structure-algorithm.html">Solved MCQ of Data Structure and Algorithm set-4</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2013/10/mcq-of-data-structure-and-algorithm.html">MCQ of Data Structure and Algorithm with Answer set-5</a> </h3></li></ul><h3 style="text-align: left;"> For other more Multiple Choice Questions (MCQs): <a href="http://www.siteforinfotech.com/p/mcqs.html">Click Here</a></h3></div>

Solved MCQ on Searching and Sorting Algorithms in Data Structure set-2

1) The worst case occur in linear search algorithm when ....... A. Item is somewhere in the middle of the array B. Item is not in the array ...

مزيد من المعلومات »

MCQ on Searching, Merging and Sorting Methods in Data Structure set-1

<div dir="ltr" style="text-align: left;" trbidi="on"><br />1) Finding the location of a given item in a collection of items is called ......<br /><br />A. Discovering<br /><br />B. Finding<br /><br />C. Searching<br /><br />D. Mining<br /><br /><br />2) Which of the following is an external sorting?<br /><br />A. Insertion Sort<br /><br />B. Bubble Sort<br /><br />C. Merge Sort<br /><br />D. Tree Sort<br /><br /><br />3) Very slow way of sorting is ..........<br /><br />A. Insertion sort<br /><br />B. Heap sort<br /><br />C. Bubble sort<br /><br />D. Quick sort<br /><br /><br />4) Which of the following is an internal sorting?<br /><br />A. Tape Sort<br /><br />B. 2-way Merge Sort<br /><br />C. Merge Sort<br /><br />D. Tree Sort<br /><br /><br />5) Sorting a file F usually refers to sorting F with respect to a particular key called .....<br /><br />A. Basic key<br /><br />B. Primary key<br /><br />C. Starting key<br /><br />D. Index key<br /><br /><br />6) The time complexity of quick sort is ........<br /><br />A. O(n)<br /><br />B. O(logn)<br /><br />C. O(n2)<br /><br />D. O(n logn)<br /><br /><br />7) Selection sort first finds the .......... element in the list and put it in the first position.<br /><br />A. Middle element<br /><br />B. Largest element<br /><br />C. Last element<br /><br />D. Smallest element<br /><br /><br />8) Quick sort is also known as ........<br /><br />A. merge sort<br /><br />B. tree sort<br /><br />C. shell sort<br /><br />D. partition and exchange sort<br /><br /><br />9) The operation that combines the element is of A and B in a single sorted list C with n=r+s element is called ....<br /><br />A. Inserting<br /><br />B. Mixing<br /><br />C. Merging<br /><br />D. Sharing <br /><br /><br />10) A tree sort is also known as ......... sort.<br /><br />A. quick<br /><br />B. shell <br /><br />C. heap<br /><br />D. selection <br /><br /><a name="more"></a><br /><br />11) .......... sorting is good to use when alphabetizing large list of names.<br /><br />A. Merge <br /><br />B. Heap<br /><br />C. Radix<br /><br />D. Bubble<br /><br /><br />12) The easiest sorting is ........<br /><br />A. quick sort<br /><br />B. shell sort<br /><br />C. heap sort<br /><br />D. selection sort <br /><br /><br />13) Which of the following sorting algorithm is of divide and conquer type?<br /><br />A. Bubble sort<br /><br />B. Insertion sort<br /><br />C. Quick sort<br /><br />D. Merge sort<br /><br /><br />14) Merging k sorted tables into a single sorted table is called ......<br /><br />A. k way merging<br /><br />B. k th merge<br /><br />C. k+1 merge<br /><br />D. k-1 merge<br /><br /><br />15) The function used to modify the way of sorting the keys of records is called ........<br /><br />A. Indexing function<br /><br />B. Hash function<br /><br />C. Addressing function<br /><br />D. All of the above<br /><br /><br />16) If the number of record to be sorted large and the key is short, then ...... sorting can be efficient.<br /><br />A. Merge <br /><br />B. Heap<br /><br />C. Radix<br /><br />D. Bubble<br /><br /><br />17) The total number of comparisons in a bubble sort is ....<br /><br />A. O(n logn)<br /><br />B. O(2n)<br /><br />C. O(n2)<br /><br />D. O(n)<br /><br /><br />18) If the number of record to be sorted large and the key is long, then ...... sorting can be efficient.<br /><br />A. Merge <br /><br />B. Heap<br /><br />C. Quick<br /><br />D. Bubble<br /><br /><br />19) The time complexity of heap sort is ....<br /><br />A. O(n)<br /><br />B. O(logn)<br /><br />C. O(n2)<br /><br />D. O(n logn)<br /><br /><br />20) The complexity of selection sort is .......<br /><br />A. O(n)<br /><br />B. O(n2)<br /><br />C. O(n logn)<br /><br />D. O(logn)<br /><br /><br /><br /><h4 style="text-align: left;">Answers:</h4><br />1) C. Searching <br />2) C. Merge Sort <br />3) A. Insertion sort <br />4) D. Tree Sort <br />5) B. Primary key <br />6) D. O(n logn) <br />7) D. Smallest element <br />8) D. partition and exchange sort <br />9) C. Merging <br />10) C. heap <br />11) C. Radix <br />12) D. selection sort <br />13) C. Quick sort <br />14) A. k way merging <br />15) B. Hash function <br />16) C. Radix <br />17) A. O(n logn) <br />18) C. Quick <br />19) D. O(n logn) <br />20) B. O(n2)  <br /><br /><br /><h4 style="text-align: left;">Related Posts </h4><ul style="text-align: left;"><li><a href="http://www.siteforinfotech.com/2014/12/solved-mcq-on-stack-queue-in-data-structure.html">Solved MCQ on Stack and Queue in Data Structure set-1</a></li><li><a href="http://www.siteforinfotech.com/2014/12/interview-questions-stack-queue-data-structure.html">Interview Questions on Stack and Queue in Data Structure set-2</a></li><li><a href="http://www.siteforinfotech.com/2014/12/solved-mcq-on-tree-graph-data-structure.html">Solved MCQ on Tree and Graph in Data Structure set-1 </a></li><li><a href="http://www.siteforinfotech.com/2014/12/objective-questions-tree-graph-data-structure.html">Objective Questions on Tree and Graph in Data Structure set-2</a></li><li><a href="http://www.siteforinfotech.com/2012/12/solved-mcq-of-data-structure-set-1.html">Solved MCQ of Data Structure Set - 1</a> </li><li><a href="http://www.siteforinfotech.com/2012/12/solved-mcq-of-data-structure-set-2.html">Solved MCQ of Data Structure Set - 2</a> </li><li><a href="http://www.siteforinfotech.com/2013/03/solved-objective-questions-of-data-structure.html">Solved Objective questions of computer data structure set-3</a></li><li><a href="http://www.siteforinfotech.com/2013/10/solved-mcq-data-structure-algorithm.html">Solved MCQ of Data Structure and Algorithm set-4</a></li><li><a href="http://www.siteforinfotech.com/2013/10/mcq-of-data-structure-and-algorithm.html">MCQ of Data Structure and Algorithm with Answer set-5</a> </li></ul><h4 style="text-align: left;">For other more Multiple Choice Questions (MCQs): <a href="http://www.siteforinfotech.com/p/mcqs.html">Click Here</a></h4></div>

MCQ on Searching, Merging and Sorting Methods in Data Structure set-1

1) Finding the location of a given item in a collection of items is called ...... A. Discovering B. Finding C. Searching D. Mining 2) Which ...

مزيد من المعلومات »

Objective Questions on List and Linked List in Data Structure set-2

<div dir="ltr" style="text-align: left;" trbidi="on"><div style="text-align: left;"><br /></div><div style="text-align: left;">1) To insert a new node in linked list free node will be available in ........</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Available list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Avail list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Free node list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Memory space list</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">2) A singly linked list is also called as ........</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. linked list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. one way chain</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. two way chain</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. right link </div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">3) A ..... list is a header list where the node points back to the header node.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Circular header</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Grounded header</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Two way header</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. One way header</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">4) A doubly linked list has .......... pointers with each node.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. 0</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. 1</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. 2</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. 3</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">5) Header linked lists are frequently used for maintaining ........ in memory.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Polynomials</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Binomial</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Trinomial </div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Quadratic equation</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">6) The pointer that points to the first node in the list is ........</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. FIRST</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. AVAIL</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. TOP</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. REAR</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">7) Two-way list may be maintained in memory by means of .............</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Queues</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Linear arrays</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Non linear arrays</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Stacks</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">8) A doubly linked list is also called as ..........</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. linked list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. one way chain</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. two way chain</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. right link </div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">9) The list that requires two pointer variables FIRST and LAST is called ........</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Circular list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Header list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. One way list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Two way list</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">10) If the availability list is null, then the condition is said to be .........</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. nil block</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. availability list underflow</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. availability list overflow</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. memory loss</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /><a name="more"></a></div><div style="text-align: left;">11) The list which has its own pointer is called ........</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. pointer list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. self pointer</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. free pool</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. own pointer</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">12) Which of the following is two way lists?</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Grounded header list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Circular header list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Linked list with header and trailer nodes</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. None of the above</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">13) A .......... is a header list where the last node contains the null pointer.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. grounded header list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. bottom header list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. down header list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. dropped header list</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">14) RLINK is the pointer pointing to the ...</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. successor node</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. predecessor node</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. head node</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. last node</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">15) A ............. is a header list where the last node points back to the header node.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. rounded header list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. circular header list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. common header list </div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. forward header list</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">16) In a linked list, insertion can be done as .........</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. beginning</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. end</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. middle</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. all of the above</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">17) In a two-way lists each node is divided into .......parts.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. 1</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. 2</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. 3</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. 4</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">18) The disadvantage in using a circular linked list is .......</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. it is possible to get into infinite loop</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. last node points to fist node.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. time consuming</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. requires more memory space.</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">19) Which of the following conditions checks available free space in avail list?</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Avail=Null</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Null=Avail</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Avail=Max stack</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Avail=Top</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">20) A linear list in which each node has point to the predecessor and successors nodes is called ........</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. singly linked list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. circular linked list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. doubly linked list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. linear linked list</div><div style="text-align: left;"><br /></div><h4 style="text-align: left;">Answers:</h4><div style="text-align: left;">1) B. Avail list </div><div style="text-align: left;">2) B. one way chain</div><div style="text-align: left;">3) A. Circular header</div><div style="text-align: left;">4) C. 2</div><div style="text-align: left;">5) A. Polynomials</div><div style="text-align: left;">6) A. FIRST</div><div style="text-align: left;">7) B. Linear arrays </div><div style="text-align: left;">8) C. two way chain</div><div style="text-align: left;">9) D. Two way list</div><div style="text-align: left;">10) B. availability list underflow</div><div style="text-align: left;">11) C. free pool</div><div style="text-align: left;">12) D. None of the above</div><div style="text-align: left;">13) A. grounded header list</div><div style="text-align: left;">14) A. successor node</div><div style="text-align: left;">15) B. circular header list</div><div style="text-align: left;">16) D. all of the above</div><div style="text-align: left;">17) C. 3</div><div style="text-align: left;">18) A. it is possible to get into infinite loop</div><div style="text-align: left;">19) A. Avail=Null</div><div style="text-align: left;">20) C. doubly linked list</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><br /><h3 style="text-align: left;">Related Posts </h3><ul style="text-align: left;"><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/solved-mcq-on-stack-queue-in-data-structure.html">Solved MCQ on Stack and Queue in Data Structure set-1</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/interview-questions-stack-queue-data-structure.html">Interview Questions on Stack and Queue in Data Structure set-2</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/solved-mcq-on-tree-graph-data-structure.html">Solved MCQ on Tree and Graph in Data Structure set-1 </a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/objective-questions-tree-graph-data-structure.html">Objective Questions on Tree and Graph in Data Structure set-2</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2012/12/solved-mcq-of-data-structure-set-1.html">Solved MCQ of Data Structure Set - 1</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2012/12/solved-mcq-of-data-structure-set-2.html">Solved MCQ of Data Structure Set - 2</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2013/03/solved-objective-questions-of-data-structure.html">Solved Objective questions of computer data structure set-3</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2013/10/solved-mcq-data-structure-algorithm.html">Solved MCQ of Data Structure and Algorithm set-4</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2013/10/mcq-of-data-structure-and-algorithm.html">MCQ of Data Structure and Algorithm with Answer set-5</a> </h3></li></ul><h3 style="text-align: left;"> For other more Multiple Choice Questions (MCQs): <a href="http://www.siteforinfotech.com/p/mcqs.html">Click Here</a></h3></div>

Objective Questions on List and Linked List in Data Structure set-2

1) To insert a new node in linked list free node will be available in ........ A. Available list B. Avail list C. Free node list D. Memory s...

مزيد من المعلومات »

Solved MCQ on List and Linked List in Data Structure set-1

<div dir="ltr" style="text-align: left;" trbidi="on"><div style="text-align: left;"><br /></div><div style="text-align: left;">1) Linked lists are best suited .....</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. for relatively permanent collections of data.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. for the size of the structure and the data in the structure are constantly changing.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. data structure</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. for none of above situation</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">2) The operation of processing each element in the list is known as ......</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. sorting</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. merging</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. inserting</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. traversal</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">3) The situation when in a linked list START=NULL is ....</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Underflow </div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Overflow</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Houseful</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Saturated</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">4) Each node in singly linked list has ........ fields.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. 2</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. 3</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. 1</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. 4</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">5) Which of the following is two way lists?</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Grounded header list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Circular header list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Linked list with header and trailer nodes</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. List traversed in two directions</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">6) Which is the pointer associated with the availability list?</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. FIRST</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. AVAIL</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. TOP</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. REAR</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">7) Value of first linked list index is ....</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. 0</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. 1</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. -1</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. 2</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">8) In linked lists there are no NULL links in </div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. single linked list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. linear doubly linked list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. circular linked list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. linked list</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">9) Each node in a linked list must contain at least .....</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Three fields</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Two fields</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Four fields</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Five fields</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">10) The dummy header in linked list contain .....</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. first record of the actual data</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. last record of the actual data</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. pointer to the last record of the actual data</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. middle record of the actual data</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /><a name="more"></a></div><div style="text-align: left;">11) In a linked list the .......... field contains the address of next element in the list.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Link field</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Next element field</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Start field</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Info field</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">12) LLINK is the pointer pointing to the ...</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. successor node</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. predecessor node</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. head node</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. last node</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">13) .......... refers to a linear collection of data items.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. List</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Tree</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Graph</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Edge</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">14) A run list is ......</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. small batches of records from a file</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. number of elements having same value</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. number of records </div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. number of files in external storage</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">15) A ...... indicates the end of the list.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Guard</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Sentinel</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. End pointer</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Last pointer</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">16) A ........ is a linear list in which insertions and deletions are made to from either end of the structure.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. circular queue</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. random of queue</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. priority</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. dequeue</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">17) Indexing the ........ element in the list is not possible in linked lists.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. middle</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. first</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. last</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. any where in between     </div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">18) A linear list in which the pointer points only to the successive node is ......</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. singly linked list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. circular linked list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. doubly linked list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. none of the above</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">19) .......... may take place only when there is some minimum amount(or) no space left in free storage list. </div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Memory management</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Garbage collection</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Recycle bin</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Memory management</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">20) A linear list in which the last node points to the first node is ........</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. singly linked list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. circular linked list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. doubly linked list</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. none of the above</div><h4 style="text-align: left;">Answers:</h4><div style="text-align: left;">1) B. for the size of the structure and the data in the structure are constantly changing.</div><div style="text-align: left;">2) D. traversal</div><div style="text-align: left;">3) A. Underflow </div><div style="text-align: left;">4) A. 2</div><div style="text-align: left;">5) D. List traversed in two directions</div><div style="text-align: left;">6) B. AVAIL</div><div style="text-align: left;">7) A. 0</div><div style="text-align: left;">8) C. circular linked list</div><div style="text-align: left;">9) B. Two fields</div><div style="text-align: left;">10) A. first record of the actual data</div><div style="text-align: left;">11) A. Link field</div><div style="text-align: left;">12) B. predecessor node</div><div style="text-align: left;">13) A. List</div><div style="text-align: left;">14) A. small batches of records from a file</div><div style="text-align: left;">15) B. Sentinel</div><div style="text-align: left;">16) D. dequeue</div><div style="text-align: left;">17) A. middle</div><div style="text-align: left;">18) A. singly linked list</div><div style="text-align: left;">19) B. Garbage collection</div><div style="text-align: left;">20) B. circular linked list</div><div style="text-align: left;"><br /></div><br /><h3 style="text-align: left;">Related Posts </h3><ul style="text-align: left;"><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/solved-mcq-on-stack-queue-in-data-structure.html">Solved MCQ on Stack and Queue in Data Structure set-1</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/interview-questions-stack-queue-data-structure.html">Interview Questions on Stack and Queue in Data Structure set-2</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/solved-mcq-on-tree-graph-data-structure.html">Solved MCQ on Tree and Graph in Data Structure set-1 </a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/objective-questions-tree-graph-data-structure.html">Objective Questions on Tree and Graph in Data Structure set-2</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2012/12/solved-mcq-of-data-structure-set-1.html">Solved MCQ of Data Structure Set - 1</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2012/12/solved-mcq-of-data-structure-set-2.html">Solved MCQ of Data Structure Set - 2</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2013/03/solved-objective-questions-of-data-structure.html">Solved Objective questions of computer data structure set-3</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2013/10/solved-mcq-data-structure-algorithm.html">Solved MCQ of Data Structure and Algorithm set-4</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2013/10/mcq-of-data-structure-and-algorithm.html">MCQ of Data Structure and Algorithm with Answer set-5</a> </h3></li></ul><h3 style="text-align: left;"> For other more Multiple Choice Questions (MCQs): <a href="http://www.siteforinfotech.com/p/mcqs.html">Click Here</a></h3></div>

Solved MCQ on List and Linked List in Data Structure set-1

1) Linked lists are best suited ..... A. for relatively permanent collections of data. B. for the size of the structure and the data in the ...

مزيد من المعلومات »

Objective Questions on Tree and Graph in Data Structure set-2

<div dir="ltr" style="text-align: left;" trbidi="on"><div style="text-align: left;"><br /></div><div style="text-align: left;">1) The post order traversal of binary tree is DEBFCA. Find out the pre order traversal.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. ABFCDE</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. ADBFEC</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. ABDECF</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. ABDCEF</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">2) While converting binary tree into extended binary tree, all the original nodes in binary tree are .......</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Internal nodes on extended tree</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. External nodes on extended tree</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Vanished on extended tree</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Intermediate nodes on extended tree</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">3) The in-order traversal of tree will yield a sorted listing of elements of tree in ........</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. binary trees </div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. binary search trees </div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. heaps </div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. binary heaps</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">4) In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called .........</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Leaf</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Branch</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Path</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Thread</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">5) In a head tree .....</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. values in a node is greater than every value every value in left sub tree and smaller than right sub tree.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. values in a node is greater than every value in children of it.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. conditions.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. terms.</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">6) The in order traversal of tree will yield a sorted listing of elements of tree in ....</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Binary trees</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Binary search trees</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Merging</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. AVL Trees</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">7) In a graph if e=(u,v) means .......</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. u is adjacent to v but v is not adjacent to u.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. e begins at u and ends at v </div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. u is node and v is an edge.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. both u and v are edges.</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">8) A binary tree whose every node has either zero or two children is called .........</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Complete binary tree</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Binary Search tree</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Extended binary tree</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. E2 tree</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">9) If every node u in G is adjacent to every other node v in G,A graph is said to be ........</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. isolated</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. complete</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. finite</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. strongly connected.</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">10) The post order traversal of a binary tree is DEBFCA. Find out the pre order Traversal.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. ABFCDE</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. ADBFEC</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. ABDECF</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. ABDCEF</div><div style="text-align: left;"><br /><a name="more"></a></div><div style="text-align: left;"><br /></div><div style="text-align: left;">11) In a graph if e=[u,v], then u and v are called </div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. endpoints of e</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. adjacent nodes</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. neighbours</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. all of the above</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">12) In-order traversing a tree resulted E A C K F H D B G; the pre-order traversal would return.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. FAEKCDBHG</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. FAEKCDHGB</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. EAFKHDCBG</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. FEAKDCHBG</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">13) A connected graph T without any cycles is called .</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. a tree graph</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. free tree</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. a tree</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. All of above</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">14) In linked representation of Binary trees LEFT[k] contains the ........ of at the node N, where k is the location. </div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Data</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Location and left child</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Right child address</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Null value</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">15) If every node u in G adjacent to every other node v in G, A graph is said to be </div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. isolated</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. complete</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. finite</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. strongly connected</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">16) Three standards ways of traversing a binary tree T with root R .......</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Prefix, infix, postfix</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Pre-process, in-process, post-process</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Pre-traversal, in-traversal, post-traversal</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Pre-order, in-order, post-order</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">17) A graph is said to be ....... if every node u in G is adjacent to every other node v in G.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Absolute </div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Entire</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Inclusive</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Complete</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">18) In threaded binary tree ......... points to higher nodes in tree.</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Info</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Root</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Threads</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Child</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">19) A graph is said to be ....... if its edges are assigned data. </div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Tagged </div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Marked </div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Lebeled</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Sticked</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><div style="text-align: left;">20) If node N is a terminal node in a binary tree then its .........</div><div style="text-align: left;"><br /></div><div style="text-align: left;">A. Right tree is empty</div><div style="text-align: left;"><br /></div><div style="text-align: left;">B. Left tree is empty</div><div style="text-align: left;"><br /></div><div style="text-align: left;">C. Both left & right sub trees are empty</div><div style="text-align: left;"><br /></div><div style="text-align: left;">D. Root node is empty</div><div style="text-align: left;"><br /></div><h4 style="text-align: left;">Answers:</h4><div style="text-align: left;">1) C. ABDECF</div><div style="text-align: left;">2) A. Internal nodes on extended tree</div><div style="text-align: left;">3) B. binary search trees </div><div style="text-align: left;">4) D. Thread</div><div style="text-align: left;">5) B. values in a node is greater than every value in children of it.</div><div style="text-align: left;">6) B. Binary search trees</div><div style="text-align: left;">7) B. e begins at u and ends at v </div><div style="text-align: left;">8) C. Extended binary tree</div><div style="text-align: left;">9) B. complete</div><div style="text-align: left;">10) C. ABDECF</div><div style="text-align: left;">11) D. all of the above</div><div style="text-align: left;">12) B. FAEKCDHGB</div><div style="text-align: left;">13) D. All of above</div><div style="text-align: left;">14) A. Data</div><div style="text-align: left;">15) B. complete</div><div style="text-align: left;">16) D. Pre-order, in-order, post-order</div><div style="text-align: left;">17) D. Complete</div><div style="text-align: left;">18) C. Threads</div><div style="text-align: left;">19) C. Lebeled</div><div style="text-align: left;">20) C. Both left & right sub trees are empty</div><div style="text-align: left;"><br /></div><br /><h3 style="text-align: left;">Related Posts </h3><ul style="text-align: left;"><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/solved-mcq-on-stack-queue-in-data-structure.html">Solved MCQ on Stack and Queue in Data Structure set-1</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/interview-questions-stack-queue-data-structure.html">Interview Questions on Stack and Queue in Data Structure set-2</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/solved-mcq-on-tree-graph-data-structure.html">Solved MCQ on Tree and Graph in Data Structure set-1 </a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/objective-questions-tree-graph-data-structure.html">Objective Questions on Tree and Graph in Data Structure set-2</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2012/12/solved-mcq-of-data-structure-set-1.html">Solved MCQ of Data Structure Set - 1</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2012/12/solved-mcq-of-data-structure-set-2.html">Solved MCQ of Data Structure Set - 2</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2013/03/solved-objective-questions-of-data-structure.html">Solved Objective questions of computer data structure set-3</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2013/10/solved-mcq-data-structure-algorithm.html">Solved MCQ of Data Structure and Algorithm set-4</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2013/10/mcq-of-data-structure-and-algorithm.html">MCQ of Data Structure and Algorithm with Answer set-5</a> </h3></li></ul><h3 style="text-align: left;"> For other more Multiple Choice Questions (MCQs): <a href="http://www.siteforinfotech.com/p/mcqs.html">Click Here</a></h3></div>

Objective Questions on Tree and Graph in Data Structure set-2

1) The post order traversal of binary tree is DEBFCA. Find out the pre order traversal. A. ABFCDE B. ADBFEC C. ABDECF D. ABDCEF 2) While con...

مزيد من المعلومات »

Solved MCQ on Tree and Graph in Data Structure set-1

<div dir="ltr" style="text-align: left;" trbidi="on"><br />1) The operation of processing each element in the list is known as ......<br /><br />A. sorting<br /><br />B. merging<br /><br />C. inserting<br /><br />D. traversal<br /><br /><br />2) Other name for directed graph is ..........<br /><br />A. Direct graph<br /><br />B. Digraph<br /><br />C. Dir-graph<br /><br />D. Digraph<br /><br /><br />3) Binary trees with threads are called as .......<br /><br />A. Threaded trees<br /><br />B. Pointer trees<br /><br />C. Special trees<br /><br />D. Special pointer trees<br /><br /><br />4) Graph G is .............. if for any pair u, v of nodes in G there is a path from u to v or path from v to u.<br /><br />A. Leterally connected<br /><br />B. Widely Connected<br /><br />C. Unliterally connected<br /><br />D. Literally connected<br /><br /><br />5) In Binary trees nodes with no successor are called ......<br /><br />A. End nodes<br /><br />B. Terminal nodes<br /><br />C. Final nodes<br /><br />D. Last nodes<br /><br /><br />6) A connected graph T without any cycles is called ........<br /><br />A. free graph<br /><br />B. no cycle graph<br /><br />C. non cycle graph<br /><br />D. circular graph<br /><br /><br />7) Trees are said .......... if they are similar and have same contents at corresponding nodes.<br /><br />A. Duplicate<br /><br />B. Carbon copy<br /><br />C. Replica<br /><br />D. Copies<br /><br /><br />8) A connected graph T without any cycles is called a ........<br /><br />A. A tree graph<br /><br />B. Free tree<br /><br />C. A tree d<br /><br />D. All of the above<br /><br /><br />9) Every node N in a binary tree T except the root has a unique parent called the ......... of N.<br /><br />A. Antecedents<br /><br />B. Predecessor<br /><br />C. Forerunner<br /><br />D. Precursor<br /><br /><br />10) In a graph if E=(u,v) means ......<br /><br />A. u is adjacent to v but v is not adjacent to u<br /><br />B. e begins at u and ends at v<br /><br />C. u is processor and v is successor<br /><br />D. both b and c<br /><br /><a name="more"></a><br /><br />11) Sequential representation of binary tree uses ........<br /><br />A. Array with pointers<br /><br />B. Single linear array<br /><br />C. Two dimentional arrays<br /><br />D. Three dimentional arrays<br /><br /><br />12) In a graph if e=[u,v], Then u and v are called ........<br /><br />A. End points of e<br /><br />B. Adjacent nodes<br /><br />C. Neighbours<br /><br />D. All of the above<br /><br /><br />13) TREE[1]=NULL indicates tree is ........<br /><br />A. Overflow<br /><br />B. Underflow<br /><br />C. Empty<br /><br />D. Full<br /><br /><br />14) A binary tree whose every node has either zero or two children is called .......<br /><br />A. complete binary tree<br /><br />B. binary search tree<br /><br />C. extended binary tree<br /><br />D. data structure<br /><br /><br />15) Linked representation of binary tree needs ......... parallel arrays.<br /><br />A. 4<br /><br />B. 2<br /><br />C. 3<br /><br />D. 5<br /><br /><br />16) The depth of complete binary tree is given by ......<br /><br />A. Dn = n log2n<br /><br />B. Dn= n log2n+1<br /><br />C. Dn = log2n<br /><br />D. Dn = log2n+1<br /><br /><br />17) In a 2-tree, nodes with 0 children are called ............<br /><br />A. Exterior node<br /><br />B. Outside node<br /><br />C. Outer node<br /><br />D. External node<br /><br /><br />18) Which indicates pre-order traversal?<br /><br />A. Left sub-tree, Right sub-tree and root<br /><br />B. Right sub-tree, Left sub-tree and root<br /><br />C. Root, Left sub-tree, Right sub-tree<br /><br />D. Right sub-tree, root, Left sub-tree<br /><br /><br /><br />19) In a extended-binary tree nodes with 2 children are called ........<br /><br />A. Interior node<br /><br />B. Domestic node<br /><br />C. Internal node<br /><br />D. Inner node<br /><br /><br />20) A terminal node in a binary tree is called ............<br /><br />A. Root<br /><br />B. Leaf<br /><br />C. Child<br /><br />D. Branch<br /><br /><br /><br /><br /><br /><h4 style="text-align: left;">Answers:</h4><br />1) D. traversal<br /><div style="margin-bottom: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px;">2) D. Digraph</div>3) A. Threaded trees<br />4) C. Unliterally connected<br />5) B. Terminal nodes<br />6) A. free graph<br />7) D. Copies<br />8) D. All of the above<br />9) B. Predecessor<br />10) D. both b and c<br />11) A. Array with pointers<br />12) D. All of the above<br />13) C. Empty<br />14) C. extended binary tree<br />15) C. 3<br />16) D. Dn = log2n+1<br />17) D. External node<br /><div style="margin-bottom: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px;">18) C. Root, Left sub-tree, Right sub-tree</div>19) C. Internal node<br />20) B. Leaf<br /><br /><br /><h3 style="text-align: left;">Related Posts </h3><ul style="text-align: left;"><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/solved-mcq-on-stack-queue-in-data-structure.html">Solved MCQ on Stack and Queue in Data Structure set-1</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/interview-questions-stack-queue-data-structure.html">Interview Questions on Stack and Queue in Data Structure set-2</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/solved-mcq-on-tree-graph-data-structure.html">Solved MCQ on Tree and Graph in Data Structure set-1 </a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/objective-questions-tree-graph-data-structure.html">Objective Questions on Tree and Graph in Data Structure set-2</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2012/12/solved-mcq-of-data-structure-set-1.html">Solved MCQ of Data Structure Set - 1</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2012/12/solved-mcq-of-data-structure-set-2.html">Solved MCQ of Data Structure Set - 2</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2013/03/solved-objective-questions-of-data-structure.html">Solved Objective questions of computer data structure set-3</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2013/10/solved-mcq-data-structure-algorithm.html">Solved MCQ of Data Structure and Algorithm set-4</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2013/10/mcq-of-data-structure-and-algorithm.html">MCQ of Data Structure and Algorithm with Answer set-5</a> </h3></li></ul><h3 style="text-align: left;"> For other more Multiple Choice Questions (MCQs): <a href="http://www.siteforinfotech.com/p/mcqs.html">Click Here</a></h3></div>

Solved MCQ on Tree and Graph in Data Structure set-1

1) The operation of processing each element in the list is known as ...... A. sorting B. merging C. inserting D. traversal 2) Other name for...

مزيد من المعلومات »

Interview Questions on Stack and Queue in Data Structure set-2

<div dir="ltr" style="text-align: left;" trbidi="on"><br />1) The queue in which the insertion takes place in the first position after of last element is a ......<br /><br />A. priority<br /><br />B. dequeue <br /><br />C. circular<br /><br />D. linked <br /><br /><br />2) Before inserting into stack one must check the condition .........<br /><br />A. Overflow<br /><br />B. Underflow<br /><br />C. Maximum elements<br /><br />D. Existing elements<br /><br /><br />3) The another name of dequeue is .........<br /><br />A. divided queue<br /><br />B. distributed queue<br /><br />C. double ended queue<br /><br />D. design queue<br /><br /><br />4) Before deletion condition into stack ...... has to be checked.<br /><br />A. Overflow<br /><br />B. Underflow<br /><br />C. Maximum elements<br /><br />D. Existing elements<br /><br /><br />5) In dequeue, insertion and deletion takes place of ..........<br /><br />A. front, rear end<br /><br />B. only at rear end<br /><br />C. only at front end<br /><br />D. both the ends<br /><br /><br />6) When does Top value of stack change in insertion process?<br /><br />A. Before insertion<br /><br />B. After insertion<br /><br />C. At the time of insertion<br /><br />D. While checking overflow<br /><br /><br />7) A queue in which insertion and deletion takes places from any position is called ......<br /><br />A. circular queue<br /><br />B. random of queue<br /><br />C. priority<br /><br />D. dequeue<br /><br /><br />8) Deletion in the linked stack takes place by deleting ........<br /><br />A. Node pointed by the start process.<br /><br />B. End of the list<br /><br />C. Beginning of the list<br /><br />D. Middle of the list<br /><br /><br />9) Which of the following name does not relate to stacks?<br /><br />A. FIFO lists<br /><br />B. LIFO list<br /><br />C. piles<br /><br />D. push-down lists<br /><br /><br />10) The condition ........ indicate the queue is empty.<br /><br />A. Front=Null<br /><br />B. Null=Front<br /><br />C. Front=Rear<br /><br />D. Rear=Null <br /><br /><br /><a name="more"></a><br />11) Which of the following is not the type of queue?<br /><br />A. Ordinary queue<br /><br />B. Special queue<br /><br />C. Priority queue<br /><br />D. Circular queue<br /><br /><br />12) The value of REAR is increased by 1 when .......<br /><br />A. An element is deleted in a queue<br /><br />B. An element is traversed in a queue<br /><br />C. An element is added in a queue<br /><br />D. An element is merged in a queue<br /><br /><br />13) The operations that can be done in a circular queue is/are .....<br /><br />A. Insert from the front end<br /><br />B. Delete from front end<br /><br />C. Display queue contents<br /><br />D. All of the above<br /><br /><br />14) The term dequeue is the contraction of the name ........<br /><br />A. Double ended queue<br /><br />B. Double sided queue<br /><br />C. Double headed queue<br /><br />D. Double address queue<br /><br /><br />15) The various operations that can be performed on stacks is/are .....<br /><br />A. Insert an item into the stack <br /><br />B. Delete an item from the stack <br /><br />C. Display the contents of the stack<br /><br />D. All of the above<br /><br /><br />16) ............. is a collection of elements such that each element has been assigned a processing priority. <br /><br />A. Priority queue<br /><br />B. Procedure queue<br /><br />C. Main queue<br /><br />D. Interrupt queue<br /><br /><br />17) The deletion operation in stack is called ......<br /><br />A. insert<br /><br />B. push<br /><br />C. pop <br /><br />D. top<br /><br /><br />18) Link fields holds pointers to the .......... element in the linked representation of stack. <br /><br />A. Neighbouring<br /><br />B. Last<br /><br />C. First<br /><br />D. Middle<br /><br /><br />19) The pointer associated with the stack is ...........<br /><br />A. front<br /><br />B. rear<br /><br />C. top <br /><br />D. link<br /><br /><br />20) Reversing a great deal of space for each stack in memory will ...........<br /><br />A. Decrease the numbers of times overflow may occur<br /><br />B. Increase the numbers of times overflow may occur<br /><br />C. Increase the number of times underflow may occur<br /><br />D. Increase the number of times underflow may occur.<br /><br /><br /><br /><br /><br /><h4 style="text-align: left;">Answers:</h4><br />1) C. circular<br />2) A. Overflow <br />3) C. double ended queue<br />4) B. Underflow<br />5) D. both the ends<br />6) A. Before insertion<br />7) C. priority<br />8) A. Node pointed by the start process<br />9) A. FIFO lists<br />10) A. Front=Null<br />11) B. Special queue<br />12) C. An element is added in a queue<br />13) D. All of the above<br />14) A. Double ended queue<br />15) D. All of the above<br />16) A. Priority queue<br />17) C. pop <br />18) A. Neighbouring<br />19) C. top <br />20) A. Decrease the numbers of times overflow may occur<br /><br /><br /><h3 style="text-align: left;">Related Posts </h3><ul style="text-align: left;"><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/solved-mcq-on-stack-queue-in-data-structure.html">Solved MCQ on Stack and Queue in Data Structure set-1</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/interview-questions-stack-queue-data-structure.html">Interview Questions on Stack and Queue in Data Structure set-2</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/solved-mcq-on-tree-graph-data-structure.html">Solved MCQ on Tree and Graph in Data Structure set-1 </a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/objective-questions-tree-graph-data-structure.html">Objective Questions on Tree and Graph in Data Structure set-2</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2012/12/solved-mcq-of-data-structure-set-1.html">Solved MCQ of Data Structure Set - 1</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2012/12/solved-mcq-of-data-structure-set-2.html">Solved MCQ of Data Structure Set - 2</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2013/03/solved-objective-questions-of-data-structure.html">Solved Objective questions of computer data structure set-3</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2013/10/solved-mcq-data-structure-algorithm.html">Solved MCQ of Data Structure and Algorithm set-4</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2013/10/mcq-of-data-structure-and-algorithm.html">MCQ of Data Structure and Algorithm with Answer set-5</a> </h3></li></ul><h3 style="text-align: left;"> For other more Multiple Choice Questions (MCQs): <a href="http://www.siteforinfotech.com/p/mcqs.html">Click Here</a></h3></div>

Interview Questions on Stack and Queue in Data Structure set-2

1) The queue in which the insertion takes place in the first position after of last element is a ...... A. priority B. dequeue C. circular D...

مزيد من المعلومات »

Solved MCQ on Stack and Queue in Data Structure set-1

<div dir="ltr" style="text-align: left;" trbidi="on"><br />1) ......... form of access is used to add and remove nodes from a queue.<br /><br />A. LIFO, Last In First Out<br /><br />B. FIFO, First In First Out<br /><br />C. Both a and b<br /><br />D. None of these<br /><br /><br />2) In liked representation of stack ....... holds the elements of the stack.<br /><br />A. INFO fields<br /><br />B. TOP fields<br /><br />C. LINK fields<br /><br />D. NULL fields<br /><br /><br />3) ........ form of access is used to add remove nodes from a stack.<br /><br />A. LIFO<br /><br />B. FIFO<br /><br />C. Both A and B<br /><br />D. None of these<br /><br /><br />4) In the linked representation of the stack ......... behaves as the top pointer variable of stack.<br /><br />A. Stop pointer<br /><br />B. Begin pointer<br /><br />C. Start pointer<br /><br />D. Avail pointer<br /><br /><br />5) New nodes are added to the ......... of the queue.<br /><br />A. Front<br /><br />B. Back<br /><br />C. Middle<br /><br />D. Both A and B<br /><br /><br />6) In linked representation of stack the null pointer of the last node in the list signals ..........<br /><br />A. Beginning of the stack<br /><br />B. Bottom of the stack<br /><br />C. Middle of the stack<br /><br />D. In between some value<br /><br /><br />7) What happens when you push a new node onto a stack?<br /><br />A. The new node is placed at the front of the linked list<br /><br />B. The new node is placed at the back of the linked list<br /><br />C. The new node is placed at the middle of the linked list<br /><br />D. No Changes happens<br /><br /><br />8) A queue is a .........<br /><br />A. FIFO<br /><br />B. LIFO<br /><br />C. FILO<br /><br />D. LOFI<br /><br /><br />9) Which of the following name does not relate to stacks?<br /><br />A. FIFO lists<br /><br />B. LIFO lists<br /><br />C. Piles<br /><br />D. Push down lists<br /><br /><br />10) The retrieval of items in a stack is ........... operation.<br /><br />A. push<br /><br />B. pop<br /><br />C. retrieval<br /><br />D. access<br /><br /><br /><a name="more"></a><br />11) The term push and pop is related to<br /><br />A. Array <br /><br />B. Lists<br /><br />C. Stacks<br /><br />D. Trees<br /><br /><br />12) Which is the pointer associated with the stack?<br /><br />A. FIRST<br /><br />B. FRONT<br /><br />C. TOP <br /><br />D. REAR<br /><br /><br />13) The elements are removal from a stack in .......... order.<br /><br />A. Reverse<br /><br />B. Hierarchical<br /><br />C. Alternative<br /><br />D. Sequential<br /><br /><br />14) The insertion operation in the stack is called .........<br /><br />A. insert<br /><br />B. push<br /><br />C. pop <br /><br />D. top<br /><br /><br />15) ...... is the term used to insert an element into stack.<br /><br />A. Push<br /><br />B. Pull<br /><br />C. Pop<br /><br />D. Pump<br /><br /><br />16) Stack follows the strategy of ........<br /><br />A. LIFO<br /><br />B. FIFO<br /><br />C. LRU<br /><br />D. RANDOM <br /><br /><br />17) .......... is the term used to delete an element from the stack.<br /><br />A. Push<br /><br />B. Pull<br /><br />C. Pop<br /><br />D. Pump<br /><br /><br />18) Deletion operation is done using ......... in a queue.<br /><br />A. front<br /><br />B. rear<br /><br />C. top <br /><br />D. list<br /><br /><br />19) A pointer variable which contains the location at the top element of the stack is called .....<br /><br />A. Top<br /><br />B. Last<br /><br />C. Final<br /><br />D. End<br /><br /><br />20) Which of the following is an application of stack?<br /><br />A. finding factorial<br /><br />B. tower of Hanoi<br /><br />C. infix to postfix<br /><br />D. all of the above<br /><br /><br /><h4 style="text-align: left;">Answers:</h4>1) B. FIFO, First In First Out <br />2) A. INFO fields <br />3) A. LIFO <br />4) C. Start pointer <br />5) B. Back <br />6) B. Bottom of the stack<br />7) A. The new node is placed at the front of the linked list <br />8) A. FIFO <br />9) A. FIFO lists <br />10) B. pop <br />11) C. Stacks <br />12) C. TOP <br />13) A. Reverse <br />14) B. push <br />15) A. Push <br />16) A. LIFO <br />17) C. Pop <br />18) A. front <br />19) A. Top <br />20) D. all of the above<br /><br /><br /><h3 style="text-align: left;">Related Posts </h3><ul style="text-align: left;"><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/solved-mcq-on-stack-queue-in-data-structure.html">Solved MCQ on Stack and Queue in Data Structure set-1</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/interview-questions-stack-queue-data-structure.html">Interview Questions on Stack and Queue in Data Structure set-2</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/solved-mcq-on-tree-graph-data-structure.html">Solved MCQ on Tree and Graph in Data Structure set-1 </a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2014/12/objective-questions-tree-graph-data-structure.html">Objective Questions on Tree and Graph in Data Structure set-2</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2012/12/solved-mcq-of-data-structure-set-1.html">Solved MCQ of Data Structure Set - 1</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2012/12/solved-mcq-of-data-structure-set-2.html">Solved MCQ of Data Structure Set - 2</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2013/03/solved-objective-questions-of-data-structure.html">Solved Objective questions of computer data structure set-3</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2013/10/solved-mcq-data-structure-algorithm.html">Solved MCQ of Data Structure and Algorithm set-4</a> </h3></li><li><h3 style="text-align: left;"><a href="http://www.siteforinfotech.com/2013/10/mcq-of-data-structure-and-algorithm.html">MCQ of Data Structure and Algorithm with Answer set-5</a> </h3></li></ul><h3 style="text-align: left;"> For other more Multiple Choice Questions (MCQs): <a href="http://www.siteforinfotech.com/p/mcqs.html">Click Here</a></h3><h4 style="text-align: left;"></h4></div>

Solved MCQ on Stack and Queue in Data Structure set-1

1) ......... form of access is used to add and remove nodes from a queue. A. LIFO, Last In First Out B. FIFO, First In First Out C. Both a a...

مزيد من المعلومات »

Objective Questions of Data Structure with Answer set-6

<div dir="ltr" style="text-align: left;" trbidi="on"><br />1. .......................... is a variable that can hold the address of the variables, structure and functions that are used in the program.<br /><br />A) Array<br /><br />B) Pointer<br /><br />C) Structure<br /><br />D) None of the above<br /><br /><br /><br />2. .................. is the organization of the data in a computers memory or in a file.<br /><br />A) Array<br /><br />B) Data Structure<br /><br />C) Data Management<br /><br />D) Data Organization<br /><br /><br /><br />3. Which of the following is/are the advantages of using an array?<br /><br />i) Multi huge quantity of data items can be stored.<br />ii) Arrays saves the memory space<br />iii) Arrays helps to arrange the data items in particular order.<br />iv) Data item searching is faster.<br /><br />A) i, ii and iii only<br /><br />B) ii, iii and iv only<br /><br />C) i, iii and iv only<br /><br />D) All i, ii, iii and iv <br /><br /><br /><br />4.  Some examples of data structures are<br /><br />i) array<br />ii) stack<br />iii) queue<br />iv) binary tree<br />v) hybrid tree<br /><br />A) i, ii, iii and iv only<br /><br />B) ii, iii, iv and v only<br /><br />C) i, ii, iii and v only<br /><br />D) All i, ii, iii, iv and v<br /><br /><br /><br />5. Match the following components of data structure based on the concept of Abstract Data Type (ADT) with their definitions.<br />a) Operations                                i) Organizations of data implemented in lower level data structure.<br />b) Storage structures         ii) Description on how to manipulate information in the storage structure.<br />c) Algorithms                             iii) Specifies the external appearance of data structure.<br /><br />A) a-i, b-ii, c-iii<br /><br />B) a-ii, b-iii, c-i<br /><br />C) a-iii, b-i, c-ii<br /><br />D) a-i, b-iii, c-ii<br /><br /><br /><br />6. Match the following properties of an array with their descriptions.<br /><br />a) Homogeneous           i) the list size is constant.<br />b) Ordered                              ii) there is a first and last element.<br />c) Finite                                    iii) there is a next and previous in the natural order of the structure<br />d) fixed-length                iv) every element is the same.<br /><br />A) a-i, b-ii, c-iii, d-iv<br /><br />B) a-ii, b-iii, c-iv, d-i<br /><br />C) a-iii, b-i, c-ii, d-iii<br /><br />D) a-iv, b-iii, c-ii, d-i<br /><br /><br /><br />7. Which of the following  are linear type of data structure?<br /><br />i) Linked list<br />ii) Stack<br />iii) Binary Tree<br />iv) Array<br />v) Queue<br /><br />A) i, ii, iii and iv only<br /><br />B) ii, iii, iv and v only<br /><br />C) i, ii, iv and v only<br /><br />D) All i, ii, iii, iv and v<br /><br /><br /><br />8. Which of the following  are non linear type of data structure?<br /><br />i) Tree<br />ii) Graphs<br />iii) Hash tables<br />iv) List<br /><br />A) i, ii and iii only<br /><br />B) ii, iii and iv only<br /><br />C) i, iii and iv only<br /><br />D) All i, ii, iii and iv <br /><br /><br /><br /><br />9. State whether the following statements is/are True or False.<br /><br />i) An ancestor is any node in the path from the root to the node.<br />ii) A sub-tree is any connected structure below the root.<br />iii) Binary tree is a directed tree in which out degree of each node is less than or equal to one.<br />iv) A tree consists of finite set of elements called nodes.<br />v) Nodes that are not root and not leaf are called intermediate nodes.<br /><br />A) True, True, True, False, True<br /><br />B) True, False, True, True, False<br /><br />C) True, True, True, False, False<br /><br />D) True, True, False, True, False<br /><br /><br /><br />10. In a binary search tree the node to be deleted will have two cases which are<br /><br />i) An empty left sub-tree and non empty right sub-tree and vice versa.<br />ii) Non empty left sub-tree and right sub-tree.<br />iii) Empty left sub-tree and right sub-tree.<br /><br />A) i and ii only<br /><br />B) ii, and iii only<br /><br />C) i and iii only<br /><br />D) None of the above<br /><br /><br /><br /><br /><h4 style="text-align: left;"><a href="javascript:ReverseDisplay('showhide')">View Answers:</a></h4><div id="showhide" style="text-align: left;"><br />1. B) Pointer<br /><br />2. B) Data Structure<br /><br />3. D) All i, ii, iii and iv <br /><br />4. A) i, ii, iii and iv only<br /><br />5. C) a-iii, b-i, c-ii<br /><br />6. D) a-iv, b-iii, c-ii, d-i<br /><br />7. C) i, ii, iv and v only<br /><br />8. A) i, ii and iii only<br /><br />9. D) True, True, False, True, False<br /><br />10. A) i and ii only</div><div style="text-align: left;"></div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br /></div><h4 style="text-align: left;">Related Posts: </h4><ul style="text-align: left;"><li><a href="http://www.siteforinfotech.com/2012/12/solved-mcq-of-data-structure-set-1.html">Solved MCQ of Data Structure Set - 1</a> </li><li><a href="http://www.siteforinfotech.com/2012/12/solved-mcq-of-data-structure-set-2.html">Solved MCQ of Data Structure Set - 2</a> </li><li><a href="http://www.siteforinfotech.com/2013/03/solved-objective-questions-of-data-structure.html">Solved Objective questions of computer data structure set-3</a></li><li><a href="http://www.siteforinfotech.com/2013/10/solved-mcq-data-structure-algorithm.html">Solved MCQ of Data Structure and Algorithm set-4</a></li><li><a href="http://www.siteforinfotech.com/2013/10/mcq-of-data-structure-and-algorithm.html">MCQ of Data Structure and Algorithm with Answer set-5</a></li></ul></div>

Objective Questions of Data Structure with Answer set-6

1. .......................... is a variable that can hold the address of the variables, structure and functions that are used in the program...

مزيد من المعلومات »

MCQ of Data Structure and Algorithm with Answer set-5

<div dir="ltr" style="text-align: left;" trbidi="on"><br />1. Arrays are best data structures<br /><br />A) for relatively permanent collections of data<br /><br />B) for the size of the structure and the data in the structure are constantly changing<br /><br />C) for both of above situation<br /><table cellpadding="0" cellspacing="0" class="tr-caption-container zemanta-img zemanta-action-dragged" style="float: right; margin-left: 1em; text-align: right;"><tbody><tr><td style="text-align: center;"><a href="http://commons.wikipedia.org/wiki/File:LinkedList.jpg" imageanchor="1" style="margin-bottom: 1em; margin-left: auto; margin-right: auto; text-align: clear:left;"><img alt="MCQ of Data Structure and Algorithm" border="0" class="zemanta-img-inserted" height="208" src="http://upload.wikimedia.org/wikipedia/commons/thumb/1/17/LinkedList.jpg/300px-LinkedList.jpg" style="border: medium none; font-size: 0.8em;" title="MCQ of Data Structure and Algorithm" width="300" /></a></td></tr><tr><td class="tr-caption zemanta-img-attribution" style="text-align: center; width: 300px;">A Linked List data structure that starts with a head reference to the first node, and each node contains a 'next' field that points to the next node. The final node has a 'next' value of null. (Photo credit: <a href="http://commons.wikipedia.org/wiki/File:LinkedList.jpg" target="_blank">Wikipedia</a>)</td></tr></tbody></table><br /><br />D) for none of above situation<br /><br /><br />2. Which of the following data structure is not linear data structure?<br /><br />A) Arrays <br /><br />B) Linked lists<br /><br />C) Both of the above<br /><br />D) None of the above<br /><br /><br />3.  The disadvantage in using a circular linked list is .........................<br /><br />A) It is possible to get into infinite loop.<br /><br />B) Last node points to first node.<br /><br />C) Time consuming<br /><br />D) Requires more memory space<br /><br /><a name="more"></a><br />4. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..<br /><br />A) <a class="zem_slink" href="http://en.wikipedia.org/wiki/Linked_list" rel="wikipedia nofollow" target="_blank" title="Linked list">Singly Linked List</a><br /><br />B) Circular Linked List<br /><br />C) Doubly Linked List<br /><br />D) Linear Linked List<br /><br /><br />5. A .................... is a linear list in which insertions and deletions are made to from either end of the structure.<br /><br />A) <a class="zem_slink" href="http://en.wikipedia.org/wiki/Circular_buffer" rel="wikipedia nofollow" target="_blank" title="Circular buffer">circular queue</a><br /><br />B) random of queue<br /><br />C) priority<br /><br />D) <a class="zem_slink" href="http://en.wikipedia.org/wiki/Queue_%28abstract_data_type%29" rel="wikipedia nofollow" target="_blank" title="Queue (abstract data type)">dequeue</a><br /><br /><br />6. In a priority queue, insertion and deletion takes place at ..................<br /><br />A) front, rear end<br /><br />B) only at rear end<br /><br />C) only at front end<br /><br />D) any position<br /><br /><br />7. The <a class="zem_slink" href="http://en.wikipedia.org/wiki/Time_complexity" rel="wikipedia nofollow" target="_blank" title="Time complexity">time complexity</a> of <a class="zem_slink" href="http://en.wikipedia.org/wiki/Quicksort" rel="wikipedia nofollow" target="_blank" title="Quicksort">quick sort</a> is ..............<br /><br />A) O(n)<br /><br />B) O(n2)<br /><br />C) O(n log n)<br /><br />D) O(log n)<br /><br /><br />8. Which of the following is an application of stack?<br /><br />A) finding factorial<br /><br />B) <a class="zem_slink" href="http://en.wikipedia.org/wiki/Tower_of_Hanoi" rel="wikipedia nofollow" target="_blank" title="Tower of Hanoi">tower of Hanoi</a><br /><br />C) infix to postfix conversion<br /><br />D) all of the above<br /><br /><br />9.  The data structure which is one ended is  ..................<br /><br />A) queue<br /><br />B) stack <br /><br />C) tree<br /><br />D) graph<br /><br /><br /><br />10. A list which displays the relationship of adjacency between elements is said to be<br /><br />A) linear <br /><br />B) non linear<br /><br />C) linked list<br /><br />D) trees<br /><br /><br /><br /><br /><h4 style="text-align: left;">Answers: </h4><div style="text-align: left;"><br />1. Arrays are best data structures<br /><br />A) for relatively permanent collections of data</div><div style="text-align: left;"><br /></div><div style="text-align: left;"><br />2. Which of the following data structure is not linear data structure?<br /><br />D) None of the above<br /><br /><br />3.  The disadvantage in using a circular linked list is .........................<br /><br />A) It is possible to get into infinite loop.<br /><br /><br />4. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..<br /><br />C) Doubly Linked List<br /><br /><br />5. A .................... is a linear list in which insertions and deletions are made to from either end of the structure.<br /><br />D) dequeue<br /><br /><br />6. In a priority queue, insertion and deletion takes place at ..................<br /><br />D) any position<br /><br /><br />7. The time complexity of quick sort is ..............<br /><br />C) O(n log n)<br /><br /><br />8. Which of the following is an application of stack?<br /><br />D) all of the above<br /><br /><br />9.  The data structure which is one ended is  ..................<br /><br />B) stack <br /><br /><br />10. A list which displays the relationship of adjacency between elements is said to be<br /><br />A) linear <br /><br /><br /><br /></div><h4 style="text-align: left;">Related Posts</h4><br /><ul style="text-align: left;"><li><a href="http://www.siteforinfotech.com/2012/12/solved-mcq-of-data-structure-set-1.html">Solved MCQ of Data Structure Set - 1</a> </li><li><a href="http://www.siteforinfotech.com/2012/12/solved-mcq-of-data-structure-set-2.html">Solved MCQ of Data Structure Set - 2</a> </li><li><a href="http://www.siteforinfotech.com/2013/03/solved-objective-questions-of-data-structure.html">Solved Objective questions of computer data structure set-3</a></li><li><a href="http://www.siteforinfotech.com/2013/10/solved-mcq-data-structure-algorithm.html">Solved MCQ of Data Structure and Algorithm set-4</a> </li><li><a href="http://www.siteforinfotech.com/2014/08/objective-questions-of-data-structure.html">Objective Questions of Data Structure with Answer set-6</a> </li><li><a href="http://www.siteforinfotech.com/2014/12/solved-mcq-on-stack-queue-in-data-structure.html">Solved MCQ on Stack and Queue in Data Structure set-1</a></li><li><a href="http://www.siteforinfotech.com/2014/12/interview-questions-stack-queue-data-structure.html">Interview Questions on Stack and Queue in Data Structure set-2</a></li><li><a href="http://www.siteforinfotech.com/2014/12/solved-mcq-on-tree-graph-data-structure.html">Solved MCQ on Tree and Graph in Data Structure set-1 </a></li><li><a href="http://www.siteforinfotech.com/2014/12/objective-questions-tree-graph-data-structure.html">Objective Questions on Tree and Graph in Data Structure set-2</a></li></ul><div style="text-align: left;"><br /></div></div>

MCQ of Data Structure and Algorithm with Answer set-5

1. Arrays are best data structures A) for relatively permanent collections of data B) for the size of the structure and the data in the stru...

مزيد من المعلومات »

Education

Solved MCQ on Searching and Sorting Algorithms in Data Structure set-2

MCQ on Searching, Merging and Sorting Methods in Data Structure set-1

Objective Questions on List and Linked List in Data Structure set-2

Solved MCQ on List and Linked List in Data Structure set-1

Objective Questions on Tree and Graph in Data Structure set-2

Solved MCQ on Tree and Graph in Data Structure set-1

Interview Questions on Stack and Queue in Data Structure set-2

Solved MCQ on Stack and Queue in Data Structure set-1

Objective Questions of Data Structure with Answer set-6

MCQ of Data Structure and Algorithm with Answer set-5

…

…

…

الاكثر زيارة