http://www.indiastudychannel.com/resources/13954-data-structure-questions-with-answers.

aspx

Data Structure 1. What is data structure? A data structure is a way of organizing data that considers not only the items stored, but also their relationship to each other. Advance knowledge about the relationship between data items allows designing of efficient algorithms for the manipulation of data. 2. List out the areas in which data structures are applied extensively? ? Compiler Design, ? Operating System, ? Database Management System, ? Statistical analysis package, ? Numerical Analysis, ? Graphics, ? Artificial Intelligence, ? Simulation 3. What are the major data structures used in the following areas : RDBMS, Network data model & Hierarchical data model. ? RDBMS Array (i.e. Array of structures) ? Network data model Graph ? Hierarchical data model Trees 4. If you are using C language to implement the heterogeneous linked list, what pointer type will you use? The heterogeneous linked list contains different data types in its nodes and we need a link, pointer to connect them. It is not possible to use ordinary pointers for this. So we go for void pointer. Void pointer is capable of storing pointer to any type as it is a generic pointer type. 5. Minimum number of queues needed to implement the priority queue? Two. One queue is used for actual storing of data and another for storing priorities. 6. What is the data structures used to perform recursion? Stack. Because of its LIFO (Last In First Out) property it remembers its caller so knows whom to return when the function has to return. Recursion makes use of system stack for storing the return addresses of the function calls. Every recursive function has its equivalent iterative (non-recursive) function. Even when such equivalent iterative procedures are written, explicit stack is to be used.

7. What are the notations used in Evaluation of Arithmetic Expressions using prefix and postfix forms? Polish and Reverse Polish notations. 8. Convert the expression ((A + B) * C (D E) ^ (F + G)) to equivalent Prefix and Postfix notations. Prefix Notation:

^ - * +ABC - DE + FG Postfix Notation: AB + C * DE - - FG + ^ 9. Sorting is not possible by using which of the following methods? (a) Insertion (b) Selection (c) Exchange (d) Deletion (d) Deletion. Using insertion we can perform insertion sort, using selection we can perform selection sort, using exchange we can perform the bubble sort (and other similar sorting methods). But no sorting method can be done just using deletion. 10. A binary tree with 20 nodes has null branches? 21 Let us take a tree with 5 nodes (n=5)

It will have only 6 (ie,5+1) null branches. In general, A binary tree with n nodes has exactly n+1 null nodes. 11. What are the methods available in storing sequential files ? ? Straight merging, ? Natural merging, ? Polyphase sort, ? Distribution of Initial runs.

12. How many different trees are possible with 10 nodes ? 1014 For example, consider a tree with 3 nodes(n=3), it will have the maximum combination of 5 different (ie, 23 - 3 = 5) trees.

i ii iii iv v

In general: If there are n nodes, there exist 2n-n different trees.

13. List out few of the Application of tree data-structure? ? The manipulation of Arithmetic expression, ? Symbol Table construction, ? Syntax analysis. 14. List out few of the applications that make use of Multilinked Structures? ? Sparse matrix, ? Index generation. 15. In tree construction which is the suitable efficient data structure? (a) Array (b) Linked list (c) Stack (d) Queue (e) none (b) Linked list 16. What is the type of the algorithm used in solving the 8 Queens problem? Backtracking 17. In an AVL tree, at what condition the balancing is to be done? If the pivotal value (or the Height factor) is greater than 1 or less than 1. 18. What is the bucket size, when the overlapping and collision occur at same time? One. If there is only one entry possible in the bucket, when the collision occurs, there is no way to accommodate the colliding value. This results in the overlapping of values.

19. Traverse the given tree using Inorder, Preorder and Postorder traversals. ? Inorder : D H B E A F C I G J ? Preorder: A B D H E C F G I J ? Postorder: H D E B F I J G C A 20. There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could have formed a full binary tree? 15. In general: There are 2n-1 nodes in a full binary tree. By the method of elimination: Full binary trees contain odd number of nodes. So there cannot be full binary trees with 8 or 14 nodes, so rejected. With 13 nodes you can form a complete binary tree but not a full binary tree. So the correct answer is 15. Note: Full and Complete binary trees are different. All full binary trees are complete binary trees but not vice versa. 21. In the given binary tree, using array you can store the node 4 at which location?

At location 6

123--4--5 Root LC1 RC1 LC2 RC2 LC3 RC3 LC4 RC4 where LCn means Left Child of node n and RCn means Right Child of node n 22. Sort the given values using Quick Sort?

65 70 75 80 85 60 55 50 45 Sorting takes place from the pivot value, which is the first value of the given elements, this is marked bold. The values at the left pointer and right pointer are indicated using L and R respectively. 65 70L 75 80 85 60 55 50 45R Since pivot is not yet changed the same process is continued after interchanging the values at L and R positions 65 45 75 L 80 85 60 55 50 R 70 65 45 50 80 L 85 60 55 R 75 70 65 45 50 55 85 L 60 R 80 75 70

65 45 50 55 60 R 85 L 80 75 70 When the L and R pointers cross each other the pivot value is interchanged with the value at right pointer. If the pivot is changed it means that the pivot has occupied its original position in the sorted order (shown in bold italics) and hence two different arrays are formed, one from start of the original array to the pivot position-1 and the other from pivot position+1 to end. 60 L 45 50 55 R 65 85 L 80 75 70 R 55 L 45 50 R 60 65 70 R 80 L 75 85 50 L 45 R 55 60 65 70 80 L 75 R 85 In the next pass we get the sorted form of the array. 45 50 55 60 65 70 75 80 85

23. For the given graph, draw the DFS and BFS?

? BFS: A X G H P E M Y J ? DFS: A X H P E Y M J G

24. Classify the Hashing Functions based on the various methods by which the key value is found. ? Direct method, ? Subtraction method, ? Modulo-Division method, ? Digit-Extraction method, ? Mid-Square method, ? Folding method, ? Pseudo-random method. 25. What are the types of Collision Resolution Techniques and the methods used in each of the type? ? Open addressing (closed hashing), The methods used include: Overflow block, ? Closed addressing (open hashing) The methods used include: Linked list, Binary tree

26. In RDBMS, what is the efficient data structure used in the internal storage representation? B+ tree. Because in B+ tree, all the data is stored only in leaf nodes, that makes searching easier. This corresponds to the records that shall be stored in leaf nodes. 27. Draw the B-tree of order 3 created by inserting the following data arriving in sequence 92 24 6 7 11 8 22 4 5 16 19 20 78

28. Of the following tree structure, which is, efficient considering space and time complexities? (a) Incomplete Binary Tree (b) Complete Binary Tree (c) Full Binary Tree (b) Complete Binary Tree. By the method of elimination: Full binary tree loses its nature when operations of insertions and deletions are done. For incomplete binary trees, extra storage is required and overhead of NULL node checking takes place. So complete binary tree is the better one since the property of complete binary tree is maintained even after operations like additions and deletions are done on it. 29. What is a spanning Tree? A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree organized so that the total edge weight between nodes is minimized. 30. Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes? No. Minimal spanning tree assures that the total weight of the tree is kept at its minimum. But it doesnt mean that the distance between any two nodes involved in the minimum-spanning tree is minimum.

31. Convert the given graph with weighted edges to minimal spanning tree.

the equivalent minimal spanning tree is: 32. Which is the simplest file structure? (a) Sequential (b) Indexed (c) Random (a) Sequential 33. Whether Linked List is linear or Non-linear data structure? According to Access strategies Linked list is a linear one. According to Storage Linked List is a Non-linear one. 34. Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)

35. For the following COBOL code, draw the Binary tree? 01 02 03 03 STUDENT_REC. NAME. FIRST_NAME PIC X(10). LAST_NAME PIC X(10).

02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.

http://www.psexam.com/MCQs-from-Data-Structures-and-Algorithms/data-structures-a-algorithmsmultiple-choice-questions-mcqs-objective-set-2.html

Set - 2
1. The memory address of the first element of an array is called a. floor address b. foundation address

c. first address d. base address

2. The memory address of fifth element of an array can be calculated by the formula a. LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array b. LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array c. LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array d. None of above

3. Which of the following data structures are indexed structures? a. linear arrays b. linked lists c. both of above d. none of above

4. Which of the following is not the required condition for binary search algorithm? a. The list must be sorted b. there should be the direct access to the middle element in any sublist c. There must be mechanism to delete and/or insert elements in list d. none of above

5. Which of the following is not a limitation of binary search algorithm? a. must use a sorted array b. requirement of sorted array is expensive when a lot of insertion and deletions are needed c. there must be a mechanism to access middle element directly d. binary search algorithm is not efficient when the data elements are more than 1000.

6. Two dimensional arrays are also called a. tables arrays b. matrix arrays

c. both of above d. none of above

7. A variable P is called pointer if a. P contains the address of an element in DATA. b. P points to the address of first element in DATA c. P can store only memory addresses d. P contain the DATA and the address of DATA

8. Which of the following data structure can't store the non-homogeneous data elements? a. Arrays b. Records c. Pointers d. None

9. Which of the following data structure store the homogeneous data elements? a. Arrays b. Records c. Pointers d. None

10. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called a. elementary items b. atoms c. scalars d. all of above

11. The difference between linear array and a record is a. An array is suitable for homogeneous data but hte data items in a record may have different data type b. In a record, there may not be a natural ordering in opposed to linear array. c. A record form a hierarchical structure but a lienear array does not

d. All of above

12. Which of the following statement is false? a. Arrays are dense lists and static data structure b. data elements in linked list need not be stored in adjecent space in memory c. pointers store the next data element of a list d. linked lists are collection of the nodes that contain information part and next pointer

13. Binary search algorithm can not be applied to a. sorted linked list b. sorted binary trees c. sorted linear array d. pointer array

14. When new data are to be inserted into a data structure, but there is no available space; this situation is usually called a. underflow b. overflow c. housefull d. saturated

15. The situation when in a linked list START=NULL is a. underflow b. overflow c. housefull d. saturated

16. Which of the following is two way list? a. grounded header list b. circular header list c. linked list with header and trailer nodes d. none of above

17. Which of the following name does not relate to stacks? a. FIFO lists b. LIFO list c. Piles d. Push-down lists

18. The term "push" and "pop" is related to the a. array b. lists c. stacks d. all of above

19. A data structure where elements can be added or removed at either end but not in the middle a. Linked lists b. Stacks c. Queues d. Deque

20. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return a. FAEKCDBHG b. FAEKCDHGB c. EAFKHDCBG d. FEAKDCHBG

Answers
1. The memory address of the first element of an array is called d. base address

2. The memory address of fifth element of an array can be calculated by the formula a. LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array

3. Which of the following data structures are indexed structures? a. linear arrays

4. Which of the following is not the required condition for binary search algorithm? c. There must be mechanism to delete and/or insert elements in list

5. Which of the following is not a limitation of binary search algorithm? d. binary search algorithm is not efficient when the data elements are more than 1000.

6. Two dimensional arrays are also called c. both of above

7. A variable P is called pointer if a. P contains the address of an element in DATA.

8. Which of the following data structure can't store the non-homogeneous data elements? a. Arrays

9. Which of the following data structure store the non-homogeneous data elements? b. Records

10. Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called d. all of above

11. The difference between linear array and a record is d. All of above

12. Which of the following statement is false? c. pointers store the next data element of a list

13. Binary search algorithm can not be applied to a. sorted linked list

14. When new data are to be inserted into a data structure, but there is no available space; this situation is usually called b. overflow

15. The situation when in a linked list START=NULL is a. underflow

16. Which of the following is two way list? d. none of above

17. Which of the following name does not relate to stacks? a. FIFO lists

18. The term "push" and "pop" is related to the c. stacks

19. A data structure where elements can be added or removed at either end but not in the middle d. Deque

20. When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return b. FAEKCDHGB

http://www.cs.colorado.edu/~main/questions/chap11q.html

The Purpose of These Questions These are typical exam questions from Chapter 11 of the textbook. These exact questions might not be on your exam, but if you research and find the right answers to these questions, that should be good preparation for a real exam. (It's also possible that some of this material was not covered in your class.) At the moment there are 14 short answer questions and 12 multiple choice questions in this file. Short Answers

1. Suppose that we want to create a heap where each node contains Short Answers information of some data type called Item (which has a default Section 11.1 constructor and a correct value semantics). What additional factor Heaps is required for the Item data type? 2. A heap is a binary tree where the entries can be compared using the usual six comparison operations (that form a total order semantics). Write the two rules that the binary tree must follow in order for the structure to actually be a heap. 3. Give two different reasons to explain why the following binary tree is not a heap:
4. 5. 6. 7. 8. 10. 11. 12. 13. 14. 16. 17. 18. 19. 20. 91 / \ 77 46 / \ \ 68 81 11 910 / \ 77 66 / \ / \ 68 1 3 11 910 / \ 77 66 / \ / \ 68 1 3 11

9. Draw a new heap that is created by inserting 82 into the following heap:

15. Draw a new heap that is created by removing one item from the following heap:

21. Suppose that you are performing a reheapification downward. Write a precise condition that describes the situation that causes the reheapification to stop. 22. Suppose that you are performing a reheapification upward. Write a precise condition that describes the situation that causes the reheapification to stop. 23. Suppose that a non-leaf node in a B-tree contains 42 entries. How Short Answers many children does the node have? Section 11.2 24. Draw an example of a B-tree with four nodes and seven integer B-Trees entries. The value of MINIMUM is 1 for this tree. 25. Draw a new B-tree that is created by inserting 82 into the following B-tree. For this example, the minimum number of items in each node is 1. Note that the rightmost leaf starts with two entries, 71 and 93.
26. 27. 28. 29. 30. 56 / \ 7 / \ 2 8 66 / \ 63 71 and 93

31. Draw a new B-tree that is created by deleting 63 from the following B-tree. For this example, the minimum number of items in each node is 1. Note that the rightmost leaf starts with two entries, 71 and 93.
32. 33. 34. 35. 36. 56 / \ 7 / \ 2 8 66 / \ 63 71 and 93

37. Suppose that a B-tree is declared so that MAXIMUM (the maximum number of items in a node) is 84. What is the value of MINIMUM (the minimum number of items in a nonroot node)? 38. Suppose that a B-tree is declared so that MAXIMUM (the maximum number of items in a node) is 84. Write one clear sentence to describe why each node's data array is set up to hold up to 85 items (one more than MAXIMUM). 39. Suppose that a and b are two positive integers and n is some non-negative number. Write an equation to show the relationship between log base a of n and log base b of n. Give a derivation to show that the relationship is valid. Multiple Choice 1. What feature of heaps allows them to be efficiently implemented Multiple Choice using a partially filled array? Section 11.1 o A. Heaps are binary search trees. Heaps o B. Heaps are complete binary trees. o C. Heaps are full binary trees. o D. Heaps contain only integer data. 2. If a heap is implemented using a partially filled array called data, and the array contains n elements (n > 0), where is the entry with the greatest value? o A. data[0] o B. data[n-1] o C. data[n] o D. data[2*n + 1] o E. data[2*n + 2] 3. Select the true statement about the worst-case time for operations on heaps. o A. Niether insertion nor removal is better than linear. o B. Insertion is better than linear, but removal is not. o C. Removal is better than linear, but insertion is not. o D. Both insertion and removal are better than linear. 4. Suppose that we have implemented a priority queue by storing the items in a heap (using an array for the heap items). We are now executing a reheapification upward and the outof-place node is at data[i] with priority given by data[i]. Which of the following boolean expressions is TRUE to indicate that the reheapification IS NOT YET DONE. o A. (i > 0) o B. (data[(i-1)/2] < data[i]) o C. (i > 0) && (data[(i-1)/2] < data[i]) o D. (i > 0) || (data[(i-1)/2] < data[i]) 5. Suppose that we have implemented a priority queue by storing the items in a heap. We are now executing a reheapification downward and the out-of-place node has priority of 42. The node's parent has a priority of 72, the left child has priority 52 and the node's right child has priority 62. Which statement best describes the status of the reheapification. o A. The reheapification is done. Short Answers Section 11.3 Trees, Logs, and Time Analysis

B. The next step will interchange the two children of the out-of-place node. C. The next step will swap the out-of-place node with its parent. D. The next step will swap the out-of-place node with its left child. E. The next step will swap the out-of-place node with its right child. 6. Which formula is the best approximation for the depth of a heap with n nodes? o A. log (base 2) of n o B> The number of digits in n (base 10) o C. The square root of n o D. n o E. The square of n
o o o o

7. Which statement is true for a B-tree? Multiple Choice o A. All entries of a node are greater than or equal to the Section 11.3 entries in the node's children. B-trees o B. All leaves are at the exact same depth. o C. All nodes contain the exact same number of entres. o D. All non-leaf nodes have the exact same number of children. 8. Suppose that a non-leaf node in a B-tree has 41 entries. How many children will this node have? o A. 2 o B. 40 o C. 41 o D. 42 o e. 82 9. Suppose that a B-tree has MAXIMUM of 10 and that a node already contains the integers 1 through 10. If a new value, 11, is added to this node, the node will split into two pieces. What values will be in these two pieces? o A. The first piece will have only 1 and the second piece will have the rest of the numbers. o B. The first piece will have 1 through 5 and the second piece will have 6 through 11. o C. The first piece will have 1 through 5 and the second piece will have 7 through 11. o D. The first piece will have 1 through 6 and the second piece will have 7 through 11. o E. The first piece will have 1 through 10 and the second piece will have only 11. 10. Suppose that X is a B-tree leaf containing 41 entries and having at least one sibling. Which statement is true? o A. Any sibling of X is also a leaf. o B. Any sibling of X contains at least 41 entries. o C. The parent of X has exactly 42 entries. o D. X has at least 41 siblings. Multiple Choice Section 11.3 Trees, Logs,

11. Suppose you run a O(log n) algorithm with an input size of and Time Analysis 1000 and the algorithm requires 110 operations. When you double the input size to 2000, the algorithm now requires 120 operations. What is your best guess for the number of operations required when you again double the input size to 4000? o A. 130 o B. 140 o C. 150 o D. 160 o E. 170 12. Tree algorithms typically run in time O(d) . What is d? o A. The depth of the tree. o B. The number of divisions at each level. o C. The number of entries in each node. o D. The number of nodes in the tree. o E. The total number of entries in all the nodes of the tree.