Data Structures And Algorithms Question Paper - Dec 18 - Electronics And Telecomm (Semester 3)

2views

written 6.9 years ago by

teamques10 ★ 70k

Data Structures And Algorithms - Dec 18

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:

27,10,12,25,34,16,15,31

(6 marks) 00

1.b. Write a C function with and without pointers to arrays for checking whether the given string is palindrome or not.

(6 marks) 00

2.a. Explain the following:

i. Call by value.

ii. Call by reference.

(6 marks) 00

2.b. Write the followin 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

3.a. Define Queue and explain any one application of queue.

(6 marks) 00

3.b. Identify the expressions and convert them into remaining two forms:

i. ab/cd-e/f

ii. (a+b)/(c+d)

(7 marks) 00

4.a. Differentiate singly linked list and doubly linked list.

(6 marks) 00

4.b. Write a 'C' function to delete a number from singly linked list.

(7 marks) 00

5.a. Define binary tree. Name and explain with suitable example the following terms :

i. Root node

ii. Left sub tree and right sub tree.

iii. Depth of tree.

(6 marks) 00

5.b. Construct the binary search tree (BST) from the following elements:

10,60,40,28,14,50,5

(6 marks) 00

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

5,2,8,4,1,9,7

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

(6 marks) 00

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

i. Strictly Binary Tree

ii. Completely Binary Tree

iii. Binary Search Tree

(6 marks) 00

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

Note: Consider graph of minimum 6 vertices.

(6 marks) 00

7.b. What do you mean by adjacency matrix and adjacency list? Give the adjacency matrix and adjacency list as shown in figure

enter image description here

(7 marks) 00

8.a. FInd out the minimum spanning tree of the following graph figure using :

1.Prim's Algorithm.

Kruskal's Algorithm

enter image description here

(6 marks) 00

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

enter image description here

(7 marks) 00

ADD COMMENT EDIT