BSc CS Sem 3 BSc CS Semester 3 (2016 2017) 2017 COMPUTER III Question Paper - Mumbai University | munotes

Questions asked in this paper

1. Q2 All questions are
2. Q3 Right side indicates marks
3. Q1 Answer the following. (Attempt Any 4)
   • a) Write short note on time and space Explain in detail N-Log-N and Quadratic function: b) W Write short note on theta notation? regarding : Wt
   • d) Explain in detail precondition and post ression using stack. d) E
   • e) Writea Program to match parenthesis an
   • f) Write short note on Dynamic programming
   • h) Explain in detail evaluation postfix expression? Answer the following. (Attempt Any 4)
   • a) Write program to implement Queue?
   • b) Write a program for deletion of a node at front of single linke : C) Explain in linked list? = Write short on trees and explain their properties? | och Explain following concepts of binary trees
   • ii. Depth an algorithm for insertion of element at the head of a Single Linked : Write a program for insertion of a node in a Tree?
   • h) Write a program to simulate stack using Linked
4. Q3 Answer the following. (Attempt Any 4) { 20 marks
   • a) Explain post order traversal algorithm?
   • b) Write a program to implement Breadth First traversal in tree? Explain in details data Structures for graphs?
   • d) Explain in detail adjacency matrix in graph? Write the Map ADTS? he
   • f) an algorithm for Dijkstra’s algorithm
   • g) List the problems of reachability in graph? 3
   • h). Write a program to implement adjacency list structure ingraph? Answer the following. (Attempt Any 3) marks
   • a) Explain best Case, worst case, and average case regarding algorithm analysis:
   • b) Write a program to implement different methods of stack? Write a program for insertion of node in Double Linked List?
   • d) Explain in detail Binary trees? Explain the following behaviors of Maps
   • iv. M.popitem()
   • M.items() Write a program to implement inorder tree traversals?

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