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 Date: 30 Aug 2009 Posted By: aravind Member Level: Gold

2009 Jawaharlal Nehru Technological University Information Technology Jntu Hyderabad Code No: 43052 II B.Tech I Semester Supplimentary Examinations, May/Jun 2009 ADVANCED DATA STRUCTURES AND ALGORITHMS Question paper

Course: B.Tech Information Technology

University: Jawaharlal Nehru Technological University

Code No: 43070 Set No. 4
II B.Tech I Semester Supplimentary Examinations, May/Jun 2009
ADVANCED DATA STRUCTURES AND ALGORITHMS
( Common to Information Technology and Computer Science & Systems
Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
? ? ? ? ?
1. Create two classes DM and DF which store the value of distances. DM stores
distances in metres and centimeters and DF in feet and inches. Write a program
that can read the values for the class objects and add one object of DM with another
object of DF. Use a friend function to carry out the addition operation. The object
that stores the results may be a DM or DF object. The display should be in the
format of feet and inches or metres and centimeters depending on the object on
display. [16]
2. (a) Distinguish between overloaded functions and function templates.
(b) Distinguish between class templates and templates class. [8+8]
3. (a) Discuss the number or multiplications done by function called Multiplication
which multiplies an M × N and an N × P matrix.
(b) Compare the worst case number of elements moves made by functions in
Selection sort and Insertion sort. Compare the relative performance. [8+8]
4. (a) What is hashing? Why de we need hashing?
(b) Explain the importance of hashing with an example. [8+8]
5. We can use a tree sort, such as the minimum Heap sort to improve the efficiency
of sort phase in external sorting. Explain. [16]
6. Explain in detail about Insertion operation on a Binary search tree. [16]
7. (a) What is the recurrence relation for computing time of Merge Sort? Solve it.
(b) What is the space complexity of Merge Sort. Justify your answer. [8+8]
8. What is Greedy method? Consider any problem for which Greedy method can be
used to solve it. Explain how the problem can be solved using Greedy method.
What are the limitations of it?

Return to question paper search

Next Question Paper: Jntu Hyderabad Code No: 43052 II B.Tech I Semester Supplimentary Examinations, May/Jun 2009 ADVANCED DATA STRUCTURES AND ALGORITHMS

Previous Question Paper: Jntu Hyderabad Code No: 43030 II B.Tech I Semester Supplimentary Examinations, May/Jun 2009 MANAGERIAL ECONOMICS AND FINANCIAL ANALYSIS