D. None of these, 66. B. Ans: C, 19. B. Output-restricted deque In an array rep re sen ta tion of binary tree the right child of root will be at loca tion of Data Structures multiple choice questions answers are useful for IT students. Which of the following data structure is linear type? B. D. None of above C. vanished on extended tree B. Queues Ans: 3, 74. A. O(n) Lists C. pointers store the next data element of a list A. 100 TOP DATA STRUCTURES and ALGORITHMS Multiple Choice Questions and Answers 4. B. O(log n) C. Counting the number of statements In a Stack the com mand to access nth ele ment from the top of the stack s will be All the Data Structures practice questions given here along with answers and explanations are absolutely free, you can take any number of time any mock Test. Counting the number of key operations Take a test of Data Structures! C. Heaps Ans: 2, 81. B. D. None C. Priority queues Ans: B, 70. D. Address of the third element Data Structure multiple choice questions and answers with explanation for interview, competitive examination and entrance test. Hashtable , HashMap class Bubble sort C. LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array Ans: C, 87. A. C. scalars Ans: A, 64. To help students, we have started a new series call “Computer Awareness for Competitive Exams”.In this post, our team has brought some of the well compiled Data Structure MCQ with answer asked in Competitive Exams. D. Data and space, 42. A) Strings. B. stacks linked list Which of the following data structure is non-linear type? When Item is not in the array at all D. by replacing each empty sub tree by a new external node B. by inserting an internal nodes for non-empty node A. Which of the following data structure is linear data structure? Hashmapping C. Inserting D. P contain the DATA and the address of DATA Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called Study C MCQ Questions and Answers on Structures and Pointers. Complexity and capacity A. A. elementary items Ans: D, 6. B. data elements in linked list need not be stored in adjecent space in memory 5 Ans: B, 37. B. Practice these MCQ questions and answers for preparation of various competitive and entrance exams. Ans: B, 21. 3. A. Much more complicated to analyze than that of worst case D. none of above Short D. Dn = log2n+1 A. FIFO lists B. requirement of sorted array is expensive when a lot of insertion and deletions are needed A. because initialization of data members of the LinkedList class is performed by the constructor of the LinkedList class. D. the variables and operations in E will appear only in external nodes If the depth of a tree is 3 levels, then what is the Size of the Tree? If yyy, xxx and zzz are the ele ments of a lex i cally ordered binary tree, then in pre order tra ver sal which node will be tra verse first A. Arrays 1. abstract A. C. because initialization of data members of the QueueLinkedList class is performed by the constructor of the LinkedList class. 1 Bit Shifting Ans: D, 38. Ans: B, 10. 1. hasNext() and hasDelete() C. the new node is placed at the middle of the linked list. B. yyy A. removeback() B. external nodes on extended tree This section includes data structure MCQ questions on overview of the stack and its implementation along with related algorithms for push and pop, various stack implementation arrays. A. FAEKCDBHG D. All of above The elements of an array are stored successively in memory cells because The operation of processing each element in the list is known as The complexity of linear search algorithm is A. Dn = n log2n Random Access In this tutorial, you are going to learn about stack and queue data structure. Ans: C, 26. An array is suitable for homogeneous data but hte data items in a record may have different data type D. None of above conditions applies D. strongly connected You Read More », This section contains more frequently asked Data Structure and Algorithms Fundamentals MCQs in the various University level and competitive examinations. Search Ans: 1, 78. D. None of above, 54. A. Stacks B. Insertion sort Easily attend technical job interviews after reading these Multiple Choice Questions. Thus, our Data Structure and Algorithms MCQ Online Test provides the Results either in the form of ranks or even grades. A. O(n) A. LIFO,Last In First Out Read More », This section contains more frequently asked Data Structure and Algorithm Basic Multiple Choice Questions and Answers (MCQs) in the various competitive exams.