My Profile
Active Members
TodayLast 7 Days
more...
Awards & Gifts
Online Exams
Fresher Jobs
Our fresher job section is exclusively for fresh graduates! Find jobs for freshers in major Indian
cities including Bangalore, Chennai, Hyderabad, Pune or Kochi
Resources
Find educational articles, blogs, discussion threads and other resources.
Colleges
Find details about any college in India or search for courses.
|
Download Model question papers & previous years question papers
|
Posted By: Saral Mariyaprakasam Member Level: Silver Posted Date: 29 Apr 2008
|
2007 Birla Institute of Technology-Mesra Software Engineering Data Structure & Algorithms University Question paper
|
|
|
Birla Institute of Technology and Science, Pilani
Distance Learning Programmes Division
MS Software Engineering in Collaboration with Wipro Technologies
Second Semester 2006 – 2007
Mid-semester examination
Regular
Course No. : SEWP ZC415
Course Name : Data Structure & Algorithms
Nature of Exam : Closed Book Bangalore
Weightage : 40 %
Duration : 2 Hours No of pages : 2
Date : March 11, 2007 (AN) No. of questions : 10
Note: Attempt all questions. Start each answer from a fresh page
1.Give a big-Oh characterization, in terms of n of the running time for each of LOOP1 and LOOP2 methods 1+1
a. Algorithm LOOP1(n) :
S=0;
For (i=1; i<=n; i++)
S=S+i;
b. Algorithm LOOP2(n) :
p=1;
for (i=1; i<=n2; i++)
p=p.i;
2.Arrange the following according to ascending order of complexity. 2
O(log n), O(n), O(n2 ), O(nlog n), O(1), O(2n ), O(n3 ),
O(log2n), O(Ön ).
3.Give the algorithm for implementing methods Push (element) & Pop (element) for a Stack 2+2
4. Construct an arithmetic expression tree for the expression ((a + b) * c) / (( d * e) + f). Perform in-order, pre-order and post-order traversal results for the above tree constructed. 2+2+2+2
5. Mention the applications of Stacks & Queues 2
6. Describe how collisions are caused in hash tables. Mention any one mechanism to resolve collision in Hash tables. 3
7. Illustrate the working of Radix Sort on the following set of Data.
(0,5,6) , (0,1,1), (0,7,8) , (1,1,2), (9,6,5), (5,6,8) , (5,5,4 )
4
8. Construct a heap-tree using Bottom-Up heap construction for the following keys. Perform removeMin operation. Show the Down-Heap bubbling after a removeMin operation.
2+3
5,6,7,16,10,8,21,17,26,15,13,12,9,24,28.
9. Give the algorithm for sorting numbers using Quick-Sort and mention the time complexity. 3+1+2
10. Explain the divide and conquer paradigm and illustrate Merge-Sort to sort elements in ascending order. 2+2
95,34,73,55,27,41,86,80
***********************
Return to question paper search
|
|
|
Submit Previous Years University Question Papers and make money from adsense revenue sharing program
Are you preparing for a university examination? Download model question papers
and practise before you write the exam.
|
Watch TV Channels
|