BSc CS Sem 4 ATKT FUNDAMENTALS OF ALGORITHM Question Paper - Mumbai University | munotes

Questions asked in this paper

• 2) Figures to the right indicate marks

1. Q3 Draw suitable diagrams and illustrations
2. Q4 Mixing of sub-questions is not allowed. FES
3. Q1 Attempt All the Questi ) Choose the correct alternative
   • i) A path that starts and ends on the same vertex is
   • a) cycle b)
   • ii) Prim's and Kruskal's algorithm are examples of
   • iii) Which of the following hold i, An AVL tree is an example of balanced binary search tree
   • ii. Number of vertices in the path gives the length of the path SERS
   • v) is a into tl
   • a) output, lie its subtrees,
   • ii) to make, we make the choice that without results from subproblems inary tree is a tree in which every node has either 0 or 2 children algorithm finds the aths fron algoriun paths from the source vertex to all otl ices j RS nodes represent the nodes that do not have any ain the following two lines
   • ii) es Paper Subject Code: 78901 Fundamentals of Algotrithm following: (Any THREE) What is meant by asymptotic analysis of algorithm? Explain Write a note on theta (6)-Notation. Give example. se C What are the essential properties of algorithms? Explain D Briefly describe the Master Theorem for and Conquer E Write a note on Method of Guessing and Confirming. S F Briefly describe the Master Theorem for Subtract and. Rectirrérives
4. Q3 Attempt the following: (Any THREE) 5M) What is a binary tree? What are its B What is preorder and post order of Briefly the concept D Write a note on graphs: E Explain with al F Outline any that B sof designing algorithms. What are its a threaded binary tree? Explain with suitable illustration of medians algorithm What of Greedy Method? Why is it important?

Read from the scan above, so a character or two may differ. The scan is the original.