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)

Null Branches

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. Given tree:
A

B

C

D

E

F

G

H

I

J

 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? 1

2

3

4 At location 6 5 1 Root 2 LC1 3 RC1 LC2 RC2 4 LC3 RC3 LC4 5 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
L

Since pivot is not yet changed the same process is continued after interchanging the values at positions 65 65 65 65 45 45 45 45 75 L 50 50 50 80 80 L 55 55 85 85 85 L 60 R 60 60 60 R 85 L 55 55 R 80 80 50 R 75 75 75 70 70 70 70

and

R

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 55 L 50 L

45 45 45 R

50 50 R 55

55 R 60 60

65 65 65

85 L 70 R 70

80 80 L 80 L

75 75 75 R

70 R 85 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? The given graph:

 BFS:  DFS:

AXGHPEMYJ AXHPEYMJG

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
11

-

5

7

19

24

4

-

6

-

8

-

16

-

20

22

78

92

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 doesn’t 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.

1
410

600

612
2985 1421

3
310

200

1 2

3

5
400

the equivalent minimal spanning tree is:

410

612 2

4 310 4

200 5

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) *

*

A

B

+

/

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

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

02
NAME

02
YEAR_OF_STUDY

03
FIRST_NAME

03
LAST_NAME

03
FIRST_SEM

03
SECOND_SEM

Q. Difference between calloc and malloc? A. malloc: allocate n bytes calloc: allocate m times n bytes initialized to 0 Q. What are the major data structures used in the following areas : RDBMS, Network data model & Hierarchical data model. A. 1. RDBMS– Array (i.e. Array of structures) 2. Network data model– Graph 3. Hierarchical data model– Trees. Q. Which file contains the definition of member functions? A. Definitions of member functions for the Linked List class are contained in the LinkedList.cpp file. Q. How is any Data Structure application is classified among files? A. A linked list application can be organized into a header file, source file and main application file. The first file is the header file that contains the definition of the NODE structure and the LinkedList class definition. The second file is a source code file containing the implementation of member functions of the LinkedList class. The last file is the application file that contains code that creates and uses the LinkedList class. Q. What member function places a new node at the end of the linked list? A. The appendNode() member function places a new node at the end of the linked list. The appendNode() requires an integer representing the current data of the node. Q. What is Linked List ? A. Linked List is one of the fundamental data structures. It consists of a sequence of nodes, each containing arbitrary data fields and one or two (”links”) pointing to the next and/or previous nodes. A linked list is a self-referential datatype because it contains a pointer or link to another data of the same type. Linked lists permit insertion and removal of nodes at any point in the list in constant time, but do not allow random access. Q. What does each entry in the Link List called? A. Each entry in a linked list is called a node. Think of a node as an entry that has three sub entries. One sub entry contains the data, which may be one attribute or many attributes. Another points to the previous node, and the last points to the next node. When you enter a new item on a linked list, you allocate the new node and then set the pointers to previous and next nodes. Q. How is the front of the queue calculated ? A. The front of the queue is calculated by front = (front+1) % size. Q. Why is the isEmpty() member method called?

A. The isEmpty() member method is called within the dequeue process to determine if there is an item in the queue to be removed i.e. isEmpty() is called to decide whether the queue has at least one element. This method is called by the dequeue() method before returning the front element. Q. Which process places data at the back of the queue? A. Enqueue is the process that places data at the back of the queue. Q. What is the relationship between a queue and its underlying array? A. Data stored in a queue is actually stored in an array. Two indexes, front and end will be used to identify the start and end of the queue. When an element is removed front will be incremented by 1. In case it reaches past the last index available it will be reset to 0. Then it will be checked with end. If it is greater than end queue is empty. When an element is added end will be incremented by 1. In case it reaches past the last index available it will be reset to 0. After incrementing it will be checked with front. If they are equal queue is full. Q. What method removes the value from the top of a stack? A. The pop() member method removes the value from the top of a stack, which is then returned by the pop() member method to the statement that calls the pop() member method. Q. What method is used to place a value onto the top of a stack? A. push() method, Push is the direction that data is being added to the stack. push() member method places a value onto the top of a stack. Q. Run Time Memory Allocation is known as…. A. Allocating memory at runtime is called a dynamically allocating memory. In this,you dynamically allocate memory by using the new operator when declaring the array, for example:int grades[] = new int[10]; Q. How do you assign an address to an element of a pointer array ? A. We can assign a memory address to an element of a pointer array by using the address operator, which is the ampersand (&), in an assignment statement such as ptemployee[0] = &projects[2]; Q. Why do we Use a Multidimensional Array? A. A multidimensional array can be useful to organize subgroups of data within an array. In addition to organizing data stored in elements of an array, a multidimensional array can store memory addresses of data in a pointer array and an array of pointers. Multidimensional arrays are used to store information in a matrix form. Q. What is significance of ” * ” ? A. The symbol “*” tells the computer that you are declaring a pointer. Actually it depends on context. In a statement like int *ptr; the ‘*’ tells that you are declaring a pointer. In a statement like int i = *ptr; it tells that you want to assign value pointed to by ptr to variable i.

The symbol “*” is also called as Indirection Operator/ Dereferencing Operator Q. What is Data Structure? A. A data structure is a group of data elements grouped together under one name. These data elements, known as members, can have different types and different lengths. Some are used to store the data of same type and some are used to store different types of data. Q. Is Pointer a variable? A. Yes, a pointer is a variable and can be used as an element of a structure and as an attribute of a class in some programming languages such as C++, but not Java. Q. How many parts are there in a declaration statement? A. There are two main parts, variable identifier and data type and the third type is optional which is type qualifier like signed/unsigned. Q. How memory is reserved using a declaration statement ? A. Memory is reserved using data type in the variable declaration. A programming language implementation has predefined sizes for its data types. For example, in C# the declaration int i; will reserve 32 bits for variable i. Q. What is impact of signed numbers on the memory? A. Sign of the number is the first bit of the storage allocated for that number. So you get one bit less for storing the number. For example if you are storing an 8-bit number, without sign, the range is 0-255. If you decide to store sign you get 7 bits for the number plus one bit for the sign. So the range is -128 to +127 Q. What is precision? A. Precision refers the accuracy of the decimal portion of a value. Precision is the number of digits allowed after the decimal point Q. What is the difference bitween NULL AND VOID pointer? A. NULL can be value for pointer type variables. VOID is a type identifier which has not size. NULL and void are not same. Example: void* ptr = NULL; Q. What is the difference between ARRAY and STACK? A. STACK follows LIFO. Thus the item that is first entered would be the last removed. In array the items can be entered or removed in any order. Basically each member access is done using index. No strict order is to be followed here to remove a particular element. Q. Tell how to check whether a linked list is circular. A. Create two pointers, each set to the start of the list. Update each as follows:
while (pointer1)

{ pointer1 = pointer1->next; pointer2 = pointer2->next; if (pointer2) pointer2=pointer2->next; if (pointer1 == pointer2) { print (\”circular\n\”); } }

Q. Whether Linked List is linear or Non-linear data structure? A. According to Access strategies Linked list is a linear one. According to Storage Linked List is a Non-linear one Q. What is the data structures used to perform recursion? A. 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. Q. If you are using C language to implement the heterogeneous linked list, what pointer type will you use? A. 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. Q. List out the areas in which data structures are applied extensively?  A. Compiler Design,  Operating System,  Database Management System,  Statistical analysis package,  Numerical Analysis,  Graphics,  Artificial Intelligence,  Simulation Q. What is placement new? A. When you want to call a constructor directly, you use the placement new. Sometimes you have some raw memory that’s already been allocated, and you need to construct an object in the memory you have. Operator new’s special version placement new allows you to do it. Q. When can you tell that a memory leak will occur? A. A memory leak occurs when a program loses the ability to free a block of dynamically allocated memory. Q. What is a node class? A. A node class is a class that has added new services or functionality beyond the services inherited from its base class. Q. How many different trees are possible with 10 nodes ?

A. 1014 - For example, consider a tree with 3 nodes(n=3), it will have the maximum combination of 5 different (ie, 23 - 3 = 5) Q. Minimum number of queues needed to implement the priority queue? A. Two. One queue is used for actual storing of data and another for storing priorities. Q. In an AVL tree, at what condition the balancing is to be done? A. If the ‘pivotal value’ (or the ‘Height factor’) is greater than 1 or less than –1. Q. What is the bucket size, when the overlapping and collision occur at same time? A. 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. Q. What is the easiest sorting method to use? A. The answer is the standard library function qsort(). It’s the easiest sort by far for several reasons: It is already written. It is already debugged. It has been optimized as much as possible (usually). Void qsort(void *buf, size_t num, size_t size, int (*comp)(const void *ele1, const void *ele2)); Q. What is the heap? A. The heap is where malloc(), calloc(), and realloc() get memory. Getting memory from the heap is much slower than getting it from the stack. On the other hand, the heap is much more flexible than the stack. Memory can be allocated at any time and deallocated in any order. Such memory isn’t deallocated automatically; you have to call free(). Q. How can I search for data in a linked list? A. Unfortunately, the only way to search a linked list is with a linear search, because the only way a linked list’s members can be accessed is sequentially. Sometimes it is quicker to take the data from a linked list and store it in a different data structure so that searches can be more efficient. Q. What is the quickest sorting method to use? A. The answer depends on what you mean by quickest. For most sorting problems, it just doesn’t matter how quick the sort is because it is done infrequently or other operations take significantly more time anyway. Even in cases in which sorting speed is of the essence, there is no one answer. It depends on not only the size and nature of the data, but also the likely order. Q. what is quick short? A. The Quick Sort The quick sort algorithm is of the “divide and conquer” type. That means it works by reducing a sorting problem into several easier sorting problems and solving each of them. A “dividing” value is chosen from the input data, and the data is partitioned into three sets: elements that belong before the dividing value, the value itself, and elements that come after the dividing value. The partitioning is performed by exchanging elements that are in the first set but belong in the third with elements that are in the third set but belong in the first Elements that are equal to the dividing element can be put in any of the three sets—the algorithm will still work properly. Q. what is merge short?

A. The Merge Sort The merge sort is a “divide and conquer” sort as well. It works by considering the data to be sorted as a sequence of already-sorted lists (in the worst case, each list is one element long). Adjacent sorted lists are merged into larger sorted lists until there is a single sorted list containing all the elements. The merge sort is good at sorting lists and other data structures that are not in arrays, and it can be used to sort things that don’t fit into memory. It also can be implemented as a stable sort. Q. what is radix short? A. The Radix Sort The radix sort takes a list of integers and puts each element on a smaller list, depending on the value of its least significant byte. Then the small lists are concatenated, and the process is repeated for each more significant byte until the list is sorted. The radix sort is simpler to implement on fixed-length data such as ints. Q. Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes? A. Minimal spanning tree assures that the total weight of the tree is kept at its minimum. But it doesn’t mean that the distance between any two nodes involved in the minimum-spanning tree is minimum. Q. What is a spanning Tree? A. 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. Q. In RDBMS, what is the efficient data structure used in the internal storage representation? A. 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. Q. List out few of the Application of tree data-structure? A. The manipulation of Arithmetic expression,Symbol Table construction,Syntax analysis Q. What are the methods available in storing sequential files ? A. Straight merging,Natural merging,Polyphase sort,Distribution of Initial runs