B.Sc. (Computer Science) Sem 2 Design and Analysis of Algorithms 2022-23 Question Paper - Mumbai University | munotes

Questions asked in this paper

• 2) Figures to the right indicate marks

1. Q3 in-depth answers and diagrams will be appreciated
2. Q4 Mixing of sub-questions is not allowed
3. Q1 Attempt the following (Any FOUR)(Each of 5Marks) 20 marks
   • a. What is Algorithm? Explain goals of analysis of algorithm
   • b. What are different types of Data Structures?
   • c. What are advantages and disadvantages of Arrays?
   • d. Write short note on Big-O
   • e. How to represent Polynomials using Linked List? Consider following polynomial equations and represent in Linked List
   • f. Convert following expressions from Infix into Postfix notation step by step
4. Q1 li. 2+4/5*(5-3)+5-4
5. Q2 Attempt the following (Any FOUR) (Each of 5Marks) 20 marks
   • a. Differentiate between Recursion and Iteration
   • b. Consider following members and sort using Bubble Sort
   • c. What is Searching? Write an algorithm for Binary Search
   • d. What is String? Consider following string T=ababaabababacaababa and Pattern P=abab apply Pattern Matching technique and find the positions where pattern get
   • c. Write an algorithm for finding sum of all integers from | to n using iteration
   • f. What is Selection? Write algorithm for Kth Smallest elements in sorted order
6. Q3 Attempt the following (Any FOUR) (Each of 20 marks
   • a. Explain various Algorithm design techniques of classification by Implementation
   • b. What is Greedy Strategy? Explain different elements of Greedy Algorithm
   • c. What are advantages and disadvantages of Divide-n-Conquer method?
   • d. Consider following A and B and find multiplication using Starssen’s Matrix
   • e. Explain Dynamic Programming. What are different approaches of Dynamic
   • f. What is Backtracking? Solve n-Queen problem where n=4 using backtracking
   • F.Y.B.Sc.-CS Design and Analysis of Algorithms HR: MARKS:75
7. Q4 Attempt the following (Any FIVE)(Each of 3Marks) 15 marks
   • a. Write an algorithm to find largest among three numbers
   • b. Write short note on Time complexity
   • c. Explain comparative analysis between Bubble, Insertion, Selection Sort
   • d. What is Transform and Conquer?
   • e. List down Applications of Greedy Techniques
   • f. What are techniques to solve Dynamic Programming?

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