1. What is a Data Structure?

The Data Structure is the way data is organized (stored) and manipulated for retrieval and access. It also
defines the way different sets of data relate to one another, establishing relationships and forming algorith
ms.

2. Describe the types of Data Structures?

The following are the types of data structures:

Lists: A collection of related things linked to the previous or/and following data items.
Arrays: A collection of values that are all the same.
Records: A collection of fields, each of which contains data from a single data type.
Trees: A data structure that organizes data in a hierarchical framework. This form of data structure follows
the ordered order of data item insertion, deletion, and modification.
Tables: The data is saved in the form of rows and columns. These are comparable to records in that the o
utcome or alteration of data is mirrored across the whole table.

3. What is a Linear Data Structure? Name a few examples.

A data structure is linear if all its elements or data items are arranged in a sequence or a linear order. The
elements are stored in a non-hierarchical way so that each item has successors and predecessors excep
t the first and last element in the list.

Examples of linear data structures are Arrays, Stack, Strings, Queue, and Linked List.

4. What are some applications of Data Structures?

In terms of data structure interview questions, this is one of the most frequently asked question.

Numerical analysis, operating system, AI, compiler design, database management, graphics, statistical an
alysis, and simulation.

5. What is the difference between file structure and storage structure?

The difference lies in the memory area accessed. Storage structure refers to the data structure in the me
mory of the computer system, whereas file structure represents the storage structure in the auxiliary mem
ory.

6. What is a multidimensional array?

A multidimensional array is a multidimensional array with more than one dimension. It is an array of array
s or an array with numerous layers. The 2D array, or two-dimensional array, is the most basic multidimen
sional array. As you’ll see in the code, it’s technically an array of arrays. A 2D array is also referred to as
a matrix or a table with rows and columns. Declaring a multidimensional array is the same as saying a on
e-dimensional array. We need to notify C that we have two dimensions for a two-dimensional array.

7. How are the elements of a 2D array stored in the memory?

Row-Major Order: -In row-major ordering, all of the rows of a 2D array are stored in memory in a contiguo
us manner.
First, the first row of the array is entirely stored in memory, followed by the second row of the array, and s
o on until the final row.

Column-Major Order: In column-major ordering, all of the columns of a 2D array are stored in memory in t
he same order. The first column of the array is entirely saved in memory, followed by the second row of th
e array, and so on until the last column of the array is wholly recorded in memory.

8. What is a linked list Data Structure?

This is one of the most frequently asked data structure interview questions where the interviewer expects
you to give a thorough answer. Try to explain as much as possible rather than finishing your answer in a s
entence!
Its a linear Data Structure or a sequence of data objects where elements are not stored in adjacent memo
ry locations. The elements are linked using pointers to form a chain. Each element is a separate object, c
alled a node. Each node has two items: a data field and a reference to the next node. The entry point in a
linked list is called the head. Where the list is empty, the head is a null reference and the last node has a
reference to null.

A linked list is a dynamic data structure, where the number of nodes is not fixed, and the list has the abilit
y to grow and shrink on demand.

It is applied in cases where:

We deal with an unknown number of objects or dont know how many items are in the list
We need constant-time insertions/deletions from the list, as in real-time computing where time predictabilit
y is critical
Random access to any elements is not needed
The algorithm requires a data structure where objects need to be stored irrespective of their physical addr
ess in memory
We need to insert items in the middle of the list as in a priority queue
Some implementations are stacks and queues, graphs, directory of names, dynamic memory allocation, a
nd performing arithmetic operations on long integers.

9. Are linked lists considered linear or non-linear Data Structures?

Linked lists are considered both linear and non-linear data structures depending upon the application they
are used for. When used for access strategies, it is considered as a linear data-structure. When used for
data storage, it is considered a non-linear data structure.

10. What are the advantages of a linked list over an array? In which scenarios do we use Linked List and
when Array?
This is another frequently asked data structure interview questions! Advantages of a linked list over an arr
ay are:

1. Insertion and Deletion

Insertion and deletion of nodes is an easier process, as we only update the address present in the next p
ointer of a node. Its expensive to do the same in an array as the room has to be created for the new elem
ents and existing elements must be shifted.

2. Dynamic Data Structure

As a linked list is a dynamic data structure, there is no need to give an initial size as it can grow and shrin
k at runtime by allocating and deallocating memory. However, the size is limited in an array as the numbe
r of elements is statically stored in the main memory.

3. No Wastage of Memory
As the size of a linked list can increase or decrease depending on the demands of the program, and mem
ory is allocated only when required, there is no memory wasted. In the case of an array, there is memory
wastage. For instance, if we declare an array of size 10 and store only five elements in it, then the space f
or five elements is wasted.

4. Implementation
Data structures like stack and queues are more easily implemented using a linked list than an array.

Some scenarios where we use linked list over array are:

When we know the upper limit on the number of elements in advance

When there are a large number of add or remove operations
When there are no large number of random access to elements
When we want to insert items in the middle of the list, such as when implementing a priority queue
Some scenarios in which we use array over the linked list are:

When we need to index or randomly access elements

When we know the number of elements in the array beforehand, so we can allocate the correct amount of
memory
When we need speed when iterating through all the elements in the sequence
When memory is a concern; filled arrays use less memory than linked lists, as each element in the array i
s the data but each linked list node requires the data as well as one or more pointers to the other element
s in the linked list
In summary, we consider the requirements of space, time, and ease of implementation to decide whether
to use a linked list or array.

11. What is a doubly-linked list? Give some examples.

It is a complex type (double-ended LL) of a linked list in which a node has two links, one that connects to t
he next node in the sequence and another that connects to the previous node. This allows traversal acros
s the data elements in both directions.

Examples include:

A music playlist with next and previous navigation buttons

The browser cache with BACK-FORWARD visited pages
The undo and redo functionality on a browser, where you can reverse the node to get to the previous pag
e

12. How do you reference all of the elements in a one-dimension array?

Using an indexed loop, we may access all of the elements in a one-dimensional array. The counter count
s down from 0 to the maximum array size, n, minus one. The loop counter is used as the array subscript t
o refer to all items of the one-dimensional array in succession.

13. What are dynamic Data Structures? Name a few.

They are collections of data in memory that expand and contract to grow or shrink in size as a program ru
ns. This enables the programmer to control exactly how much memory is to be utilized.

Examples are the dynamic array, linked list, stack, queue, and heap.

14. What is an algorithm?

An algorithm is a step by step method of solving a problem or manipulating data. It defines a set of instruc
tions to be executed in a certain order to get the desired output.

15. Why do we need to do an algorithm analysis?

A problem can be solved in more than one way using several solution algorithms. Algorithm analysis provi
des an estimation of the required resources of an algorithm to solve a specific computational problem. Th
e amount of time and space resources required to execute is also determined.

The time complexity of an algorithm quantifies the amount of time taken for an algorithm to run as a functi
on of the length of the input. The space complexity quantifies the amount of space or memory taken by an
algorithm, to run as a function of the length of the input.

16. What is a stack?

A stack is an abstract data type that specifies a linear data structure, as in a real physical stack or piles w
here you can only take the top item off the stack in order to remove things. Thus, insertion (push) and del
etion (pop) of items take place only at one end called top of the stack, with a particular order: LIFO (Last I
n First Out) or FILO (First In Last Out).

17. Where are stacks used?

Expression, evaluation, or conversion of evaluating prefix, postfix, and infix expressions
Syntax parsing
String reversal
Parenthesis checking
Backtracking

18. What are the operations that can be performed on a stack?

A stack is a linear data structure that operates on the same concept, in that components in a stack are ad
ded and deleted only from one end, referred to as the TOP. As a result, a stack is known as a LIFO (Last-
In-First-Out) data structure because the piece that was put last is the first to be removed.

A stack may perform three fundamental operations:

PUSH: The push action inserts a new element into the stack. The new feature is placed at the top of the s
tack. However, before inserting the value, we must first verify if TOP=MAX1, since if so, the stack is filled,
and no more insertions are possible. An OVERFLOW message is printed if an attempt is made to put a va
lue into an existing stack.
POP: The pop operation is performed to remove the stack’s topmost element. However, before removing
the value, we must first verify if TOP=NULL, since if it is, the stack is empty, and no further deletions are p
ermitted. An UNDERFLOW notice is produced if an attempt is made to erase a value from a stack that is
already empty.
PEEK: A peek action returns the value of the stack’s topmost element without removing it from the stack.
On the other hand, the Peek operation first checks if the stack is empty, i.e., if TOP = NULL, then an appr
opriate message is written. Otherwise, a value is returned.

19. What is a postfix expression?

A postfix expression is made up of operators and operands, with the operator coming after the operands.
That is, in a postfix expression, the operator comes after the operands. Likewise, what is the proper postfi
x form? The correct postfix phrase is A B + C *.

20. What is a queue Data Structure?

In this type of data structure interview questions, you can also discuss your experience and situations usi
ng queue. A queue is an abstract data type that specifies a linear data structure or an ordered list, using t
he First In First Out (FIFO) operation to access elements. Insert operations can be performed only at one
end called REAR and delete operations can be performed only at the other end called FRONT.

21. List some applications of queue Data Structure.

To prioritize jobs as in the following scenarios:

As waiting lists for a single shared resource in a printer, CPU, call center systems, or image uploads; whe
re the first one entered is the first to be processed
In the asynchronous transfer of data; or example pipes, file IO, and sockets
As buffers in applications like MP3 media players and CD players
To maintain the playlist in media players (to add or remove the songs)
22. What is a Dequeue?
It is a double-ended queue, or a data structure, where the elements can be inserted or deleted at both en
ds (FRONT and REAR).

23. What operations can be performed on queues?

enqueue() adds an element to the end of the queue
dequeue() removes an element from the front of the queue
init() is used for initializing the queue
isEmpty tests for whether or not the queue is empty
The front is used to get the value of the first data item but does not remove it
The rear is used to get the last item from a queue

24. What are the advantages of the heap over a stack?

In this data structure interview questions, try giving various advantages, along with examples, if possible. I
t will show the interviewer your domain expertise. Generally, both heap and stack are part of memory and
used in Java for different needs:

Heap is more flexible than the stack because memory space can be dynamically allocated and de-allocat
ed as needed
Heap memory is used to store objects in Java, whereas stack memory is used to store local variables and
function call
Objects created in the heap are visible to all threads, whereas variables stored in stacks are only visible t
o the owner as private memory
When using recursion, the size of heap memory is more whereas it quickly fill-ups stack memory

25. Where can stack Data Structure be used?

Expression evaluation
Backtracking
Memory management
Function calling and return

26. What is the difference between a PUSH and a POP?

In terms of data structure interview questions, this is one of the most frequently asked question.

The acronyms stand for Pushing and Popping operations performed on a stack. These are ways data is st
ored and retrieved.

PUSH is used to add an item to a stack, while POP is used to remove an item.
PUSH takes two arguments, the name of the stack to add the data to and the value of the entry to be add
ed. POP only needs the name of the stack.
When the stack is filled and another PUSH command is issued, you get a stack overflow error, which mea
ns that the stack can no longer accommodate the last PUSH. In POP, a stack underflow error occurs whe
n youre trying to POP an already empty stack.

27. Which sorting algorithm is considered the fastest? Why?

A single sorting algorithm cant be considered best, as each algorithm is designed for a particular data stru
cture and data set. However, the QuickSort algorithm is generally considered the fastest because it has th
e best performance for most inputs.

Its advantages over other sorting algorithms include the following:

Cache-efficient: It linearly scans and linearly partitions the input. This means we can make the most of ev
ery cache load.
Can skip some swaps: As QuickSort is slightly sensitive to input that is in the right order, it can skip some
swaps.
Efficient even in worst-case input sets, as the order is generally random.
Easy adaption to already- or mostly-sorted inputs.
When speed takes priority over stability.

28. What is the merge sort? How does it work?

Merge sort is a divide-and-conquer algorithm for sorting the data. It works by merging and sorting adjacen
t data to create bigger sorted lists, which are then merged recursively to form even bigger sorted lists until
you have one single sorted list.

29. How does the Selection sort work?

This is one of the most frequently asked data structure interview questions. Selection sort works by repeat
edly picking the smallest number in ascending order from the list and placing it at the beginning. This proc
ess is repeated moving toward the end of the list or sorted subarray.

Scan all items and find the smallest. Switch over the position as the first item. Repeat the selection sort o
n the remaining N-1 items. We always iterate forward (i from 0 to N-1) and swap with the smallest elemen
t (always i).

Time complexity: best case O(n2); worst O(n2)

Space complexity: worst O(1)

30. What is an asymptotic analysis of an algorithm?

Asymptotic analysis is the technique of determining an algorithm’s running time in mathematical units to d
etermine the program’s limits, also known as "run-time performance." The purpose is to identify the best c
ase, worst case, and average-case times for completing a particular activity. While not a deep learning tra
ining technique, Asymptotic analysis is an essential diagnostic tool for programmers to analyze an algorith
m’s efficiency rather than its correctness.

31. What are asymptotic notations?

Asymptotic Notation represents an algorithm’s running time - how long an algorithm takes with a given inp
ut, n. Big O, large Theta (), and big Omega () are the three distinct notations. When the running time is th
e same in all circumstances, big- is used, big-O for the worst-case running time, and big- for the best case
running time.

32. What are some examples of divide and conquer algorithms?

Quicksort is the name of a sorting algorithm. The method selects a pivot element and rearranges the arra
y elements so that all items less than the pivot chosen element go to the left side of the pivot and all elem
ents more significant than the pivot element move to the right side.

Merge Sort is a sorting algorithm as well. The algorithm divides the array into two halves, sorts them recur
sively, and then combines the two sorted halves. The goal of points that are closest together is to identify
the nearest pair of points in an x-y plane collection of points. The issue may be solved in O(n2) time by co
mputing the distances between each pair of locations and comparing them to determine the shortest dista
nce.

33. Define the graph Data Structure?

It is a type of non-linear data structure that consists of vertices or nodes connected by edges or arcs to en
able storage or retrieval of data. Edges may be directed or undirected.

34. What are the applications of graph Data Structure?

Transport grids where stations are represented as vertices and routes as the edges of the graph
Utility graphs of power or water, where vertices are connection points and edge the wires or pipes connec
ting them
Social network graphs to determine the flow of information and hotspots (edges and vertices)
Neural networks where vertices represent neurons and edge the synapses between them

35. List the types of trees?

Data structure interview questions like this are very common and frequently asked

The General Tree

A tree is referred to as a generic tree if its hierarchy is not constrained. In the General Tree, each node ca
n have an endless number of offspring, and all other trees are subsets of the tree.

The Binary Tree

The binary tree is a type of tree in which each parent has at least two offspring. The children are referred t
o as the left and right youngsters. This tree is more popular than most others. When specific limitations an
d features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree
, and so on are also utilized.

Tree of Binary Search

Binary Search Tree (BST) is a binary tree extension that includes numerous optional constraints. In BST,
a node’s left child value should be less than or equal to the parent value, while the correct child value sho
uld always be higher than or equal to the parent’s value.

The AVL Tree

The AVL tree is a self-balancing binary search tree. The term AVL is given in honor of the inventors Adels
on-Velshi and Landis. This was the first tree to achieve dynamic equilibrium. Each node in the AVL tree is
assigned a balancing factor based on whether the tree is balanced or not. The node kids have a maximu
m height of one AVL vine.

Red and Black Tree

Red-black trees are another type of auto-balancing tree. The red-black term is derived from the qualities o
f the red-black tree, which has either red or black painted on each node. It helps to keep the forest in bala
nce. Even though this tree is not perfectly balanced, the searching process takes just O (log n) time.

The N-ary Tree

In this sort of tree with a node, N is the maximum number of children. A binary tree is a two-year tree sinc
e each binary tree node has no more than two offspring. A full N-ary tree is one in which the children of ea
ch node are either 0 or N.

36. What are Binary trees?

A binary tree is a tree data structure made up of nodes, each of which has two offspring, known as the left
and right nodes. The tree begins with a single node called the root.

Each node in the tree carries the following information:

Data

A pointing device indicates the left kid.

An arrow pointing to the correct child

37. What are the differences between the B tree and the B+ tree?
The B tree is a self-balancing m-way tree, with m defining the tree’s order. Depending on the number of m
, Btree is an extension of the Binary Search tree in which a node can have more than one key and more t
han two children. The data is provided in the B tree in a sorted manner, with lower values on the left subtr
ee and higher values on the right subtree.

The B+ tree is an advanced self-balanced tree since every path from the tree’s root to its leaf is the same
length. The fact that all leaf nodes are the same length indicates that they all occur at the same level. Spe
cific leaf nodes cant appear at the third level, while others appear at the second level.

38. What are the advantages of binary search over a linear search?
In a sorted list:

A binary search is more efficient than a linear search because we perform fewer comparisons. With linear
 search, we can only eliminate one element per comparison each time we fail to find the value we are look
ing for, but with the binary search, we eliminate half the set with each comparison.
Binary search runs in O(log n) time compared to linear searchs O(n) time. This means that the more of th
e elements present in the search array, the faster is binary search compared to a linear search.

39. What is an AVL tree?

An AVL (Adelson, Velskii, and Landi) tree is a height balancing binary search tree in which the difference
of heights of the left and right subtrees of any node is less than or equal to one. This controls the height of
the binary search tree by not letting it get skewed. This is used when working with a large data set, with c
ontinual pruning through insertion and deletion of data.

40. Differentiate NULL and VOID

Null is a value, whereas Void is a data type identifier
Null indicates an empty value for a variable, whereas void indicates pointers that have no initial size
Null means it never existed; Void means it existed but is not in effect

41. Do dynamic memory allocations help in managing data? How?

Dynamic memory allocation stores simple structured data types at runtime. It has the ability to combine se
parately allocated structured blocks to form composite structures that expand and contract as needed, thu
s helping manage data of data blocks of arbitrary size, in arbitrary order.

42. Name the ways to determine whether a linked list has a loop.
Using hashing
Using the visited nodes method (with or without modifying the basic linked list data structure)
Floyds cycle-finding algorithm

43. List some applications of multilinked structures?

Sparse matrix
Index generation

44. Explain the jagged array.

It is an array whose elements themselves are arrays and may be of different dimensions and sizes.

45. Explain the max heap Data Structure.

It is a type of heap data structure where the value of the root node is greater than or equal to either of its c
hild nodes.

46. How do you find the height of a node in a tree?

The height of the node equals the number of edges in the longest path to the leaf from the node, where th
e depth of a leaf node is 0.

47. What is data structure?

The logical and mathematical model of a particular organization of data is called data structure. There are
two types of data structure

1.Linear
2.Nonlinear

48. What are the goals of Data Structure?

It must rich enough in structure to reflect the actual relationship of data in real world.
The structure should be simple enough for efficient processing of data.

49. What does abstract Data Type Mean?

Data type is a collection of values and a set of operations on these values. Abstract data type refer to the
mathematical concept that define the data type.It is a useful tool for specifying the logical properties of a d
ata type.ADT consists of two parts

1.Values definition
2.Operation definition

50. What is the difference between a Stack and an Array?

Stack is a ordered collection of items

Stack is a dynamic object whose size is constantly changing as items are pushed and popped .
Stack may contain different data types
Stack is declared as a structure containing an array to hold the element of the stack, and an integer to indi
cate the current stack top within the array.
ARRAY

Array is an ordered collection of items

Array is a static object i.e. no of item is fixed and is assigned by the declaration of the array
It contains same data types.
Array can be home of a stack i.e. array can be declared large enough for maximum size of the stack.

51. What do you mean by recursive definition?

The definition which defines an object in terms of simpler cases of itself is called recursive definition.

52. What is sequential search?

In sequential search each item in the array is compared with the item being searched until a match occurs
. It is applicable to a table organized either as an array or as a linked list.

53. What actions are performed when a function is called?

When a function is called

1.arguments are passed

2.local variables are allocated and initialized
3.transferring control to the function

54. What actions are performed when a function returns?

Return address is retrieved

Functions data area is freed
Branch is taken to the return address

55. What is a linked list?

A linked list is a linear collection of data elements, called nodes, where the linear order is given by pointer
s. Each node has two parts first part contain the information of the element second part contains the addr
ess of the next node in the list.

56. What are the advantages of linked list over array (static data structure)?
The disadvantages of array are

unlike linked list it is expensive to insert and delete elements in the array
One cant double or triple the size of array as it occupies block of memory space.
In linked list

each element in list contains a field, called a link or pointer which contains the address of the next elemen
t
Successive elements need not occupy adjacent space in memory.
57. Can we apply binary search algorithm to a sorted linked list, why?
No we cannot apply binary search algorithm to a sorted linked list, since there is no way of indexing the m
iddle element in the list. This is the drawback in using linked list as a data structure.

58. What do you mean by free pool?

Pool is a list consisting of unused memory cells which has its own pointer.

59. What do you mean by garbage collection?

It is a technique in which the operating system periodically collects all the deleted space onto the free stor
age list.It takes place when there is minimum amount of space left in storage list or when CPU is ideal.Th
e alternate method to this is to immediately reinsert the space into free storage list which is time consumin
g.

60. What do you mean by overflow and underflow?

When new data is to be inserted into the data structure but there is no available space i.e. free storage list
is empty this situation is called overflow.
When we want to delete data from a data structure that is empty this situation is called underflow.

61. What are the disadvantages array implementations of linked list?

1.The no of nodes needed cant be predicted when the program is written.

2.The no of nodes declared must remain allocated throughout its execution

62. What is a queue?

A queue is an ordered collection of items from which items may be deleted at one end (front end) and ite
ms inserted at the other end (rear end).It obeys FIFO rule there is no limit to the number of elements a qu
eue contains.

63. What is a priority queue?

The priority queue is a data structure in which the intrinsic ordering of the elements (numeric or alphabetic
)
Determines the result of its basic operation. It is of two types

Ascending priority queue- Here smallest item can be removed (insertion is arbitrary)
Descending priority queue- Here largest item can be removed (insertion is arbitrary)

64. What are the disadvantages of sequential storage?

1.Fixed amount of storage remains allocated to the data structure even if it contains less element.
2.No more than fixed amount of storage is allocated causing overflow

65. What are the disadvantages of representing a stack or queue by a linked list?

1.A node in a linked list (info and next field) occupies more storage than a corresponding element in an ar
ray.
2.Additional time spent in managing the available list.

66. What is dangling pointer and how to avoid it?

After a call to free(p) makes a subsequent reference to *p illegal, i.e. though the storage to p is freed but t
he value of p(address) remain unchanged .so the object at that address may be used as the value of *p (i.
e. there is no way to detect the illegality).Here p is called dangling pointer.
To avoid this it is better to set p to NULL after executing free(p).The null pointer value doesnt reference a
storage location it is a pointer that doesnt point to anything.
67. What are the disadvantages of linear list?

1.We cannot reach any of the nodes that precede node (p)
2.If a list is traversed, the external pointer to the list must be persevered in order to reference the list agai
n

68. Define circular list?

In linear list the next field of the last node contain a null pointer, when a next field in the last node contain
a pointer back to the first node it is called circular list.
Advantages From any point in the list it is possible to reach at any other point

69. What are the disadvantages of circular list?

1.We cant traverse the list backward

2.If a pointer to a node is given we cannot delete the node

70. Define double linked list?

It is a collection of data elements called nodes, where each node is divided into three parts

1.An info field that contains the information stored in the node
2.Left field that contain pointer to node on left side
3.Right field that contain pointer to node on right side

71. Is it necessary to sort a file before searching a particular item ?

If less work is involved in searching a element than to sort and then extract, then we dont go for sort
If frequent use of the file is required for the purpose of retrieving specific element, it is more efficient to sor
t the file.Thus it depends on situation.

72. What are the issues that hamper the efficiency in sorting a file?
The issues are

1.Length of time required by the programmer in coding a particular sorting program

2.Amount of machine time necessary for running the particular program
3.The amount of space necessary for the particular program .

73. Calculate the efficiency of sequential search?

The number of comparisons depends on where the record with the argument key appears in the table

1.If it appears at first position then one comparison

2.If it appears at last position then n comparisons
3.Average=(n+1)/2 comparisons
4.Unsuccessful search n comparisons
5.Number of comparisons in any case is O (n).

74. Is any implicit arguments are passed to a function when it is called?

Yes there is a set of implicit arguments that contain information necessary for the function to execute and
return correctly. One of them is return address which is stored within the functions data area, at the time o
f returning to calling program the address is retrieved and the function branches to that location.

75. Parenthesis is never required in Postfix or Prefix expressions, why?

Parenthesis is not required because the order of the operators in the postfix /prefix expressions determine
s the actual order of operations in evaluating the expression

76. 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

77. What are the major data structures used in the following areas : network data model & Hierarchical da
ta model?
RDBMS Array (i.e. Array of structures)
Network data model Graph
Hierarchical data model Trees

78. 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 con
nect them. It is not possible to use ordinary pointers for this. So we go for void pointer. Void pointer is cap
able of storing pointer to any type as it is a generic pointer type.

79. 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.

80. 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 w
hen the function has to return. Recursion makes use of system stack for storing the return addresses of th
e function calls.
Every recursive function has its equivalent iterative (non-recursive) function. Even when such equivalent it
erative procedures are written, explicit stack is to be used.

81. What are the notations used in Evaluation of Arithmetic Expressions using prefix and postfix forms?
Polish and Reverse Polish notations.

82. Convert the expression ((A + B) * C (D E) ^ (F + G)) to equivalent Prefix and Postfix notations?
1.Prefix Notation:
^ * +ABC DE + FG
2.Postfix Notation:
AB + C * DE FG + ^

83. 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 exchan
ge we can perform the bubble sort (and other similar sorting methods). But no sorting method can be don
e just using deletion.

84. List out few of the Application of tree data-structure?

The manipulation of Arithmetic expression,

Symbol Table construction,
Syntax analysis.

85. List out few of the applications that make use of Multilinked Structures?
Sparse matrix, Index generation.

86. in tree construction which is the suitable efficient data structure?

(A) Array (b) Linked list (c) Stack (d) Queue (e) none
(b) Linked list

87. What is the type of the algorithm used in solving the 8 Queens problem?
Backtracking

88. 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.

89. 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 co
rresponds to the records that shall be stored in leaf nodes.

90. One of the following tree structures, 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 bina
ry trees,
extra property of complete binary tree is maintained even after operations like additions and deletions are
done on it.

91. 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 mini
mized.

92. 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 me
an that the distance between any two nodes involved in the minimum-spanning tree is minimum.

93. Whether Linked List is linear or Non-linear data structure?

According to Storage Linked List is a Non-linear one.