# Dr Babasaheb Ambedkar Marathwada University 2010 B.E Electronics

Sunday, 20 January 2013 07:45Web

# part A

1.

**(**describe ADT. Write ADT for stack. 8marks

**a)****(**What is queue? discuss different operation performed on queu

**b)****e.**8marks

2.

**(**Write a 'C' program to perform different operation on stack. 10marks

**a)****(**Convert the subsequent into prefix and postfix expressions: 6marks

**b)****(**A+B*C

**i)****(**(A+B)*(C-D)

**i****i)**3.

**(**discuss and compare singly linked list and Doubly linked list. 8marks

**a)****(**Write a 'C' program to perform different operations on the singly linked list. 8marks

**b)**4.

**(**describe Tre

**a)****e.**discuss Binary Tree and write its 'C' representation. 8marks

**(**Write a 'C' fuction to insert a new node in binary search tre

**b)****e.**8marks

**5.**Write notes on (any thre

**e)**18marks

**(**Sparse matrices;

**i)****(**Tree Traversals;

**i****i)****(**Circularly linked list;

**i****i****i)****(**Shortest path.

**i****v)**# part B

6.

**(**What is Graph? discuss representation of graphs with suitable exampl

**a)****e.**8marks

**(**Write an algorithm for minimum spanning tre

**b)****e.**8marks

7.

**(**discuss the working of bubble sort with an example 8marks

**a)****(**Write a 'C' program to sort a provided integer array using insertion sort. 8marks

**b)**8.

**(**obtain a real root of the formula x^3-x-1=0, using bisection method accurate upto 4 decimal places 8marks

**a)****(**Write a 'C' program for Newton-Raphson metho

**b)****d.**8marks

9.

**(**Solve the subsequent equations by Gauss-Jorden method: 8marks

**a)**3x1+2x2+4x3=20

2x1+x2-x3=2

x1-5x2+3x3=6

**(**Write a program for Bisection metho

**b)****d.**8marks

**10.**Write short notes (any three): 18marks

**(**B trees;

**i)****(**Binary Searching;

**i****i)****(**Minimum cost spanning tree;

**i****i****i)****(**Simpson's 1/3 and 3/8 rule

**i****v)**Earning: Approval pending. |