Question-41. How Kruskal’s algorithm works?
Answer- This algorithm treats the graph as a forest and every node it as an individual tree. A tree connects to another only and only if it has least cost among all available options and does not violate MST properties.
Question-42. How Prim’s algorithm finds spanning tree?
Answer- Prim’s algorithm treats the nodes as a single tree and keeps on adding new nodes to the spanning tree from the given graph.
Question-43. What is a minimum spanning tree (MST)?
Answer- In a weighted graph, a minimum spanning tree is a spanning tree that has minimum weight that all other spanning trees of the same graph.
Question-44. What is a heap in data structure?
Answer- Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.
Question-45. What is a recursive function?
Answer- A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration
Question-46. What is tower of hanoi?
Answer- Tower of Hanoi, is a mathematical puzzle which consists of three tower (pegs) and more than one rings. All rings are of different size and stacked upon each other where the large disk is always below the small disk. The aim is to move the tower of disk from one peg to another, without breaking its properties.
Question-46. What is fibonacci series?
Answer- Fibonacci Series generates subsequent number by adding two previous numbers. For example − 0 1 1 2 3 5 8 13.
Question-47. What is hashing?
Answer- Hashing is a technique to convert a range of key values into a range of indexes of an array. By using hash tables, we can create an associative data storage where data index can be find by providing its key values.
Question-48. What is interpolation search technique?
Answer- Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.
Question-49. What is the prefix and post fix notation of (a + b) * (c + d) ?
Answer-
• Prefix Notation − * + a b + c d • Postfix Notation − a b + c d + *
Question-50. In which areas data structures are applied extensively?
Answer- Data structures are applied extensively in the following areas of computer science:
Compiler Design,Operating System,Database Management System,Statistical analysis package,Numerical Analysis,Graphics,Artificial Intelligence,Simulation