## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

(a) What is rotation in an AVL-tree,

demonstrate with examples. 5

(b) Describe with algorithm for deletion in a

binary search tree. 5

8. Write short notes on any two: (a) Circular queue

(b) Topological sorting (c) Merge sort.

5x2

BE 2106 (N)fBCSE 3102 (0) 10

-c

Total number of printedpages-10 B.Tech

BE 2106 (New)! BCSE 3102 (Old)

Second Semester Examination - 2010 DATA STRUCTURE U,SING IN 'C'

Full Marks - 70

Time: 3 Hours

(NEW COURSE)

Answer Question No. 1 which is compulsory and any five from the rest.

The figures in the right-hand margin

indicate marks.

Answer the following questions: 2 x1 0 (a) Explain the term ADT with suitable example. (b) Consider the following stack: # 4, 5, 6*. Here

# represents bottom & * represents top of stack, what will be the contents of the stack after the following sequence of operations? push(1 0), popt), push(20), popr), push(30) Consider the stack has a size 3.

P.T.D.

represent a polynomial in memory ?

(g) Given below are 2 sequences of data •

obtained from. 2 differ.ent binary trees. 1 nt1\e) a~ These data are Inserted Into 2 different one J a dimensional arrays sequentially respectively. Out of these 2 sequences, which can bea heap?

42,35,37,20, 14, 18,7,~0

(cVWhat is a dequeue? Explain its two variants.

(d) For the following code segment: int f(int k)

{

If(k==1) return 1; else

return k+f(k-1);

}

What will be the time complexity in Big-Oh notation?

(e) What will be the minimum and maximum height of a binary tree having 16 numbers of key values?

What is a polynomial list? How can we

(f)

42,35,18,20,14,30,10

BE2106(N)/BCSE3102(0) 2 Contd.

(h) Find the incidence matrix of the following graph:

c

(i) (j)

6 d

What is a height balanced tree?

What is the maximum and minimum number of entries for a leaf node of a B-tree of order 6 ?

2.

(a) ~rite down the steps required to convert the following arithmetic expression into its equivalent postfix expression using a stack. Also provide the steps to find out the result

of the above postfix expression by using a 5

stack.

1 0 + 5 * 3 - 25 / 5

(b)/ Given below the in order and preorder traversals of a binary tree respectively. 5

in order:

EACKFHDBG

Pre order: F A E K C 0 H G

BE 2106 (N)/BCSE 3102 (0) 3 P.T.O.

e

d

Arrange them in ascending order using Heap Sort.

(b) Develop a complete C program to insert into and delete from an integer queue. The queue is supposed to be implemented with the help of a single linked list. 5

!). /(~Create an AVL tree usi 9 the following data entered as a sequential set. Show the balance factors in each step while creating the tree. 5

100,50,75,120;150,80,70

(b) Write a C program to implement the following operations in a Two-way linked list: 5

(i) Insertion

3.

Now, state out of· the following two sequences given below, which can't be the post order traversal of the above mentioned tree? Give proper explanation.

ECKAHGBDF ECKAHBGDF

(~ Consider the following graph: . b

1 2

\5 7

\

5

6

Find its (i) adjacency list ~e\'(),~

(ii) adjacency matrix representation. ) ~~

(ii)' Traversal.

(b)/ Write a complete C program that contains a user defined function to push an integer into a stack and also displays the top element of the stack. The stack should be implemented with the help of an integer

array. 5

4. . ~ For the following set of elements: 5

10,4,6,19,3,8,11,18,5

6. (a) Find breadth-first search and depth-first

./

search traversal for the following graph: 5

a

e

b

BE2106(N)/BCSE3102(0) 4

Contd.

BE 2106 (N)/BCSE 3102 (0) 5

P.T.O.

(b) An array contains the elements shown below. What would be the snapshot of the array after 5th pass, if selection sort is used to sort the elements in ascending order? .

5

7,8,26,44,13,23,98,57

7.· Explain Warshall's algorithm to find out the shortest path matrix for a Directed graph and find out the shortest path matrix for the graph given in the Figure below: 10

4 ~,

•

8.

. 2

Wnte short notes on any two:

(a) Topological sorting

(b) Circular queue

(c) Merge Sort.

5x2

BE2106(N)/BCSE3102(0) 6

Contd.

(OLD COURSE)

Answer Question No. 1 which is compulsory and any five from the rest.

The figures in the right-hand margin mdiceie marks.

1.· Answer the following questions: 2 xi 0

(a) What is the advantage of tree over graph? (b) Consider the following stack: # 4, 5, 6* Here # represents bottom & * represents top of stack, What will be the contents of the stack after the following sequence of operations: push(10),popO,push(20),popO,push(30) Consider the stack has a size 3.

(c) What is the number of leaves for a full binary tree containing mnumber of internal nodes excluding root?

(d) For-the following code segment:

int f(int k) {

If(k==1) return 1 ; Else

Return k+f(k-1); }

What will be the time complexity in Big-Oh notation?

BE 2106 (N)I BCSE 31 02 (0) 7

ar;o.

(e) What.is a priority queue? Give an example. (f) What is a DEQUEUE? Explain its types. (g) What is an AVL tree?

(h) What is a polynomial list? How can we represent a polynomial in memory ?

(i) If f (n) = (n -1)(n -34)(n - 6) then find bigOh notation of f (n).

(j) Find the incidence matrix of the following graph:

e 6 d

Write the program segments for implementing all operations on a queue. 10

.(a) Consider the following graph:

. b

2.

3.

c

Find its (i) adjacency list

(ii) adjacency matrix representation.

BE 2106 (N)/BCSE 3102(0) 8 Contd.

(b) Find breadth-first search & depth-first search traversal for the following graph:

5

a

e

b

4. Write a C program to implement

!

(a) Insertion

(b) Deletion

( c ) Traversal

In a one-way linked list.

For the following set of elements: 10,4,6,19,3,8,11,18,5

Arrange them in ascending order using insertion Sort.

10

10

6. For the following set of elements: 10

~0,4,6, 19,3,8, 11, 18,5,7,2, 16 Arrange them in ascending order using Merge sort.

BE 2106 (N)I BCSE 3102 (0) .

P.T.O.

Skip carousel

- The Incarnations
- You Too Can Have a Body Like Mine
- Leaving Berlin
- The Silver Linings Playbook
- The Sympathizer
- Extremely Loud and Incredibly Close
- The Light Between Oceans
- The First Bad Man
- We Are Not Ourselves
- The Blazing World
- The Rosie Project
- The Flamethrowers
- Brooklyn
- A Man Called Ove
- The Master
- Bel Canto
- Life of Pi
- The Love Affairs of Nathaniel P.

- btech_4th_nt_2008.ppt
- Engineering Economics and Costing Mod 3
- btech_3rd_eec_2008.ppt
- Engg Eco & Costing 2009
- btech_4th_eec_2008.ppt
- btech_3rd_math3_2004.ppt
- btech_3rd_nt_2007.
- btech_4th_eec_2007.ppt
- btech_3rd_nt_2004.ppt
- btech_3rd_math3_2005.ppt
- Btech 3rd Math3 2007.Ppt [PDF
- btech_3rd_nt_2005.ppt
- btech_4th_eec_2005
- btech_3rd_math3_2008
- btech_3rd_nt_2008
- Programming in C
- btech_3rd_eec_2007
- Mechanics
- btech_3rd_eec_2004
- btech_3rd_aec_2005
- btech_3rd_aec_2008
- btech_3rd_aec_2004.ppt
- Thermodynamics
- btech_3rd_aec_2007.ppt
- Engineering Economics and Costing piet class notes
- Physics I
- Communicative English
- btech_3rd_eec_2005
- Math II

Sign up to vote on this title

UsefulNot usefulClose Dialog## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Close Dialog## This title now requires a credit

Use one of your book credits to continue reading from where you left off, or restart the preview.

Loading