Ask
Login
0
600views
Data Structures And Algorithms Question Paper - Jun 17 - Electronics And Telecomm (Semester 3) - Pune University (PU)
written 6.9 years ago by gravatar for teamques10 teamques10 ★ 70k
ADD COMMENT EDIT
1 Answer
0
3views
written 6.9 years ago by gravatar for teamques10 teamques10 ★ 70k

Data Structures And Algorithms - Jun 17

Electronics And Telecomm (Semester 3)

Total marks: 80
Total time: 3 Hours INSTRUCTIONS
(1) Question 1 is compulsory.
(2) Attempt any three from the remaining questions.
(3) Draw neat diagrams wherever necessary.

1.a. Sort the following data using merge sort and selection sort.

142,317,45,222,187

(6 marks) 00

1.b. What will be the output of the following code ? Justify your answer.

enter image description here

(6 marks) 00

OR

2.a. Write the following functions in 'C':

i. STRCOPY() To copy a string to another string using array.

ii. STRLENGTH() To find length of string using array

Note : Do not use standard library functions.

(6 marks) 00

2.b. Explain Algorithm Binary search with example.
(6 marks) 00

3.a. Convert the given infix expression to postfix expression using stack.

$(a \$ b)*c-d/d$

Note : $ \$ $ = Exponent operator

(5 marks) 00

3.b. Define Queue and explain any one application of Queue.
(4 marks) 00

3.c. Differentiate Singly Linked List and Doubly Linked List.
(4 marks) 00

OR

4.a. Write a 'C' function to delete a number from singly linked list.
(5 marks) 00

4.b. Explain Stack operations PUSH and POP with example.
(4 marks) 00

4.c. Compare array and linked list.
(4 marks) 00

5.a. Construct the binary search tree from the following elements :

12,8,25,14,9,6,18

Also show preorder, inorder and postorder traversal for the same.

(6 marks) 00

5.b. Define Binary Tree. Name and explain with suitable example the following terms:
1. Root node

2.Left sub-tree and Right sub-tree

3.Depth of tree

(6 marks) 00

OR

6.a. Define the following terms with example with respect to Binary Tree :

  1. Strictly Binary Tree

  2. Completely Binary Tree

  3. Binary Search Tree

(6 marks) 00

6.b. Explain the different cases to delete an element from binary search tree.
(6 marks) 00

7.a. Explain with suitable example, BFS and DFS traversal of a graph.
(6 marks) 00

7.b. What is MST ? Explain with suitable example Kruskal's Algorithm to find the MST.
(7 marks) 00

OR

8.a. Explain with suitable example the techniques to represent a Graph

Note: Consider Graph of minimum 6 vertices.

(6 marks) 00

8.b. Find shortest path from node A to all nodes in the graph shown in the figure using Dijkstra's algorithm.

enter image description here

(7 marks) 00

ADD COMMENT EDIT
Please log in to add an answer.