How To Exam?

a knowledge trading engine...


Punjab Technical University 2007-3rd Sem B.E Computer Science Data Structures and Programming Methodology (B.Tech ester, 1202) - Question Paper

Tuesday, 09 April 2013 03:35Web

Time : three Hours Maximum Marks : 60
NOTE:- This paper consist of 3 parts. part A is compulsory. Do any 4 ques. from
part B and any 2 ques. from part C

Section-A Marks : 20
1(a) What is sparse about a sparse matrix ?
(b) Is a 2 dimensional M X M array more or less efficient than a 1 dimensional array of extent M X M ?
(c) Under what circumstances would you not use a quick sort.
(d) Sort the provided set of elements s = (1,7,3,2,0,5,0,8) using selection sort.
(e) provided the subsequent expression, represent the generalized list L
L = (a,(d,(f,g),e),b,c)
(f) Write the prefix form of
(i) A ** -B + C
(ii) -A + B - C + D
(g) Running time of merge sort algrothim is............
(h) Draw the binary tree with threads to indicate the post order traversal for the expression A - B + C * E/F
(i) From the followinf B tree of order three delete4 the key 30. Assuming that the tree is kept an a disk and 1 node may
be fetched at a time how many disk accesses are neede ?
(j) Differentiate ranging from the internal sorting and external sorting.
Section-B Marks:5 every
2. How 1 would implement a queue if the elements that are to be placed on the queue are arbitary length strings ? How
long does it takes to enqueue a string ?
3. provided an Array A(20.. 50,20..40). The elements are stored in Column Major Order. What is the starting location of
A (32,23) ?
4. Write an algrothim (non-recursive) to implement quick sort.
5. Write a C function to insert an element into an AVL tree.
6. describe Threaded Binary tree. Write an algrothim for preorder trrnversal of threaded binary tree without a stack.
Section-C Marks : 10 every
7. Develop a C function (T,X, Y) which returns one if X is the ancestor of Y in the binary tree T and 0 otherwise.
8. Implement transposition of a sparse matrix in C-language.
9. Write an algrothim to obtain a longest simlpe path from a provided vertex of a diagram


( 0 Votes )

Add comment


Security code
Refresh

Earning:   Approval pending.
You are here: PAPER Punjab Technical University 2007-3rd Sem B.E Computer Science Data Structures and Programming Methodology (B.Tech ester, 1202) - Question Paper