[Question Paper] Design and Analysis of Algorithms (Old Course) [June / 2014]
•
0 likes•65 views
This is a Question Papers of Mumbai University for B.Sc.IT Student of Semester - II [Design and Analysis of Algorithms] (Old Course). [Year - June / 2014] . . .Solution Set of this Paper is Coming soon..
![D e s i g n a n d A n a l y s i s o f A l g o r i t h m s
Q u e s t i o n P a p e r ( J u n e – 2 0 1 4 ) [ O l d C o u r s e ]
1 | Page
M u m b a i B . S c . I T S t u d y
F a c e b o o k | T w i t t e r | I n s t a g r a m | G o o g l e + | Y o u T u b e
– Kamal T.
Time: 3 Hours Total Marks: 100
N.B.: (1) Questions No. 1 is Compulsory.
(2) Attempt any four questions from Q.2 – Q.7.
Q.1 Attempt the Following Questions: (20 Marks)
(A) Explain Back Tracking General Method of 8 Queen’s Problem. (10)
(B) Explain the Selection Sort Method with suitable diagram and Algorithm. (10)
Q.2 Attempt the Following Questions: (20 Marks)
(A) Explain Greedy Method with suitable algorithm. (10)
(B) Write a short note on:
(i) Game Trees
(ii) AND/OR Graph
(10)
Q.3 Attempt the Following Questions: (20 Marks)
(A) Explain PUSH and POP Operation on stack. (7)
(B) Explain the Binary Search Method. (7)
(C) Draw a Binary Tree for the following set of numbers.
60 17 32 30 5 10 73 111 5 26
(6)
Q.4 Attempt the Following Questions: (20 Marks)
(A) Explain Heap and Heapsort Method with suitable algorithm. (10)
(B) Explain the Breath first search method with suitable algorithm. (6)
(C) Write a short notes on sets and Dijoint Set. (4)
Q.5 Attempt the Following Questions: (20 Marks)
(A) What is Linked List? Explain how to insert and delete any element from Linked List. (8)
(B) Explain Graph and its components. (6)
(C) Explain different Traversal Methods in Binary Tree. (6)](https://image.slidesharecdn.com/daa-qpoldcoursejun-2014-170714203156/85/Question-Paper-Design-and-Analysis-of-Algorithms-Old-Course-June-2014-1-320.jpg)
![D e s i g n a n d A n a l y s i s o f A l g o r i t h m s
Q u e s t i o n P a p e r ( J u n e – 2 0 1 4 ) [ O l d C o u r s e ]
2 | Page
M u m b a i B . S c . I T S t u d y
F a c e b o o k | T w i t t e r | I n s t a g r a m | G o o g l e + | Y o u T u b e
– Kamal T.
Q.6 Attempt the Following Questions: (20 Marks)
(A) Explain Minimal Spanning Tree. Explain with one example. (6)
(B) Explain Merge Sort Algorithm with suitable algorithm. (8)
(C) Explain what is algorithm and its properties. (4)
Q.7 Attempt the Following Questions: (20 Marks)
(A) Explain stack and its features. (5)
(B) Explain Divide and Conquer General Method. (8)
(C) Explain Queues how to insert and delete any item from queues. (7)](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
Recommended
More Related Content
What's hot
What's hot (20)
Similar to [Question Paper] Design and Analysis of Algorithms (Old Course) [June / 2014]
Similar to [Question Paper] Design and Analysis of Algorithms (Old Course) [June / 2014] (20)
More from Mumbai B.Sc.IT Study
More from Mumbai B.Sc.IT Study (20)
Recently uploaded
Recently uploaded (20)
[Question Paper] Design and Analysis of Algorithms (Old Course) [June / 2014]
- 1. D e s i g n a n d A n a l y s i s o f A l g o r i t h m s Q u e s t i o n P a p e r ( J u n e – 2 0 1 4 ) [ O l d C o u r s e ] 1 | Page M u m b a i B . S c . I T S t u d y F a c e b o o k | T w i t t e r | I n s t a g r a m | G o o g l e + | Y o u T u b e – Kamal T. Time: 3 Hours Total Marks: 100 N.B.: (1) Questions No. 1 is Compulsory. (2) Attempt any four questions from Q.2 – Q.7. Q.1 Attempt the Following Questions: (20 Marks) (A) Explain Back Tracking General Method of 8 Queen’s Problem. (10) (B) Explain the Selection Sort Method with suitable diagram and Algorithm. (10) Q.2 Attempt the Following Questions: (20 Marks) (A) Explain Greedy Method with suitable algorithm. (10) (B) Write a short note on: (i) Game Trees (ii) AND/OR Graph (10) Q.3 Attempt the Following Questions: (20 Marks) (A) Explain PUSH and POP Operation on stack. (7) (B) Explain the Binary Search Method. (7) (C) Draw a Binary Tree for the following set of numbers. 60 17 32 30 5 10 73 111 5 26 (6) Q.4 Attempt the Following Questions: (20 Marks) (A) Explain Heap and Heapsort Method with suitable algorithm. (10) (B) Explain the Breath first search method with suitable algorithm. (6) (C) Write a short notes on sets and Dijoint Set. (4) Q.5 Attempt the Following Questions: (20 Marks) (A) What is Linked List? Explain how to insert and delete any element from Linked List. (8) (B) Explain Graph and its components. (6) (C) Explain different Traversal Methods in Binary Tree. (6)
- 2. D e s i g n a n d A n a l y s i s o f A l g o r i t h m s Q u e s t i o n P a p e r ( J u n e – 2 0 1 4 ) [ O l d C o u r s e ] 2 | Page M u m b a i B . S c . I T S t u d y F a c e b o o k | T w i t t e r | I n s t a g r a m | G o o g l e + | Y o u T u b e – Kamal T. Q.6 Attempt the Following Questions: (20 Marks) (A) Explain Minimal Spanning Tree. Explain with one example. (6) (B) Explain Merge Sort Algorithm with suitable algorithm. (8) (C) Explain what is algorithm and its properties. (4) Q.7 Attempt the Following Questions: (20 Marks) (A) Explain stack and its features. (5) (B) Explain Divide and Conquer General Method. (8) (C) Explain Queues how to insert and delete any item from queues. (7)