62 views

- Data Structure
- Advanced Data Structure and C++ programming
- xplan
- C++ questions
- Data structure using C++ -Elective III
- Lec04
- Mca Project Sample on Student Information System
- Computer Science Lecture 10 Continuations
- Heap and Hashtable
- UCF Computer Science Foundation Exam Study Plan
- cuckoo_hi
- ds
- dlubal-tutorial
- Data Structure Algorithm What to Read
- DBMS Cheatsheet
- 081-2008 Many-To-Many Merges in the DATA Step
- Dev's
- C++
- c Q&A
- A Synopsis on the Topic

You are on page 1of 6

1

II B.Tech I Semester Supplementary Examinations, February 2007

ADVANCED DATA STRUCTURES & 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. (a) What do you mean by Data abstraction?
**

(b) Difference between “C structure” and “C++ structure”.

(c) Diffrence between a “assignment operator” and a “copy constructor”.

(d) What is the difference between overloading and “overridding”? [4+4+4+4]

2. (a) What is multilevel inheritance? Write a program to illustrate the concept of

Multilevel Inheritance.

(b) What is Hybrid inheritance? Write a program to illustrate the concept of

Hybrid Inheritance. [8+8]

3. What is an Error and Exception? Explain the exception handling mechanism in

C++ ? [16]

4. (a) What are the applications of stack explain with an example.

(b) Explain the list representation of a tree by means of an example.

(c) Mention some common computing times for algorithms in order of increasing

difficulty? [5+5+6]

5. Develop a class for hash table using linear probing and neverUsed concept to handle

an erase operation. Write complete C++ code for all the methods. Include a

method to reorganize the table when (say) 60% of the empty buckets have never

used equal to false. The reorganization should move pairs around as necessary and

leave a properly configured hash table in which neverUsed is true for every empty

bucket. [16]

6. (a) Write a method to delete the pair with the largest key from a Binary Search

Tree.

(b) Write a method to find the height of a Binary Search Tree? [8+8]

7. Write and explain an algorithm to determine if the AND/OR tree T is solvable.

[16]

8. (a) Write a linear time algorithm that generates the OBST from the root table.

(b) Prove that the greedy method always obtains an optimal solution to the job-

sequencing problem. [8+8]

⋆⋆⋆⋆⋆

1 of 1

(b) Explain divide and conquer strategy by means of its control abstraction. (b) Explain the list representation of a tree by means of an example.Tech I Semester Supplementary Examinations. (a) Prove that the insertion of a new node in a red-black tree with n nodes in θ (logn) time in the worst case. (b) Derive the amortized complexity of a find. insert or delete operation performed on a splay tree with n elements. What do you mean by run time polymorphism and how to implement run time polymorphism using virtual functions in C++? [16] 3. (c) What is the difference between Greedy method and Divide and conquer. (c) Mention some common computing times for algorithms in order of increasing difficulty? [5+5+6] 5. (a) What are the applications of stack explain with an example. [6+6+4] 1 of 2 . (a) Explain the Binary tree in order traversal in o(n) and 0(1) space. [8+8] 7. (b) Why is it best to use inline functions instead of plain old # define macros? (c) How to tell the compiler to make a non-member function inline? (d) How to tell the compiler to make a member function inline? [4+4+4+4] 2. February 2007 ADVANCED DATA STRUCTURES & 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.Code No: R059211201 Set No. (a) Explain the linear probing method in Hashing? Explain its performance analy- sis? (b) What is hashing with Chains? Explain? Compare this with Linear Probing? [8+8] 6. 2 II B. (a) How do I use exceptions? (b) Can I throw an exception from a constructor? From a destructor? (c) Why doesn’t C++ provide a “finally” construct? (d) What is an auto ptr and why isn’t there an auto array? (e) Why can’t I resume after catching an exception? [3+3+3+3+4] 4. (a) Explain about the friend function with a suitable example.

2 8. [8+8] ⋆⋆⋆⋆⋆ 2 of 2 . Also derive its dynamic recurrence relation. (a) What are the general characteristics of greedy algorithms and the problems solved by these algorithms. (b) What is 0/1 Knapsack problem? Explain how principle of optimality applies to it.Code No: R059211201 Set No.

(c) Mention some common computing times for algorithms in order of increasing difficulty? [5+5+6] 5.Tech I Semester Supplementary Examinations. [16] 6. Write and explain an algorithm to determine if the AND/OR tree T is solvable. [16] 8. [8+8] 2.Code No: R059211201 Set No. 3 II B. Define Inheritance? How many types of inheritances are there? Explain each with suitable examples. (b) Write a method to find the height of a Binary Search Tree? [8+8] 7. Write complete C++ code for all the methods. (a) Write a linear time algorithm that generates the OBST from the root table. (a) How does that funky while (std :: cin >> foo) syntax work? (b) Why does input seem to process past the end of file? (c) Should we end output lines with std::endl or ‘\n′ ? [5+5+6] 4. Develop a class for hash table using linear probing and neverUsed concept to handle an erase operation. [16] 3. (a) Write a method to delete the pair with the largest key from a Binary Search Tree. (a) Explain about Object Oriented Programming principles? (b) Comapare C++ with C. The reorganization should move pairs around as necessary and leave a properly configured hash table in which neverUsed is true for every empty bucket. (b) Explain the list representation of a tree by means of an example. (b) Prove that the greedy method always obtains an optimal solution to the job- sequencing problem. (a) What are the applications of stack explain with an example. Include a method to reorganize the table when (say) 60% of the empty buckets have never used equal to false. [8+8] ⋆⋆⋆⋆⋆ 1 of 1 . February 2007 ADVANCED DATA STRUCTURES & 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.

Write and explain a non recursive algorithm for post order traversal of a Binary tree with an example. [16] 7. (b) Explain the list representation of a tree by means of an example. [8+8] 6. (a) Explain the Job sequencing with deadlines with an example using the greedy approach. Write a program to insert a pair into a binary search tree. Define a C++ abstract class that corresponds to this ADT.Tech I Semester Supplementary Examinations. 1 of 2 . (a) What is a dictionary? Define the abstract data type for it? Write the abstract class for the dictionary? (b) Give the applications of dictionary or dictionary with duplicates in which sequential access is desired. [16] 8. (a) How can we provide printing for an entire hierarchy of classes? (b) How can we open a stream in binary mode? (c) How can we “reopen” std::cin and std::cout in binary mode? [5+5+6] 4. (c) Mention some common computing times for algorithms in order of increasing difficulty? [5+5+6] 5. 4 II B. (a) What is diff between malloc()/free() and new/delete? (b) What are the access privileges in C++? What is the default access level? (c) What is destructor? (d) What is passing by reference? [4+4+4+4] 2. (a) What’s the deal with operator overloading? (b) What are the benefits of operator overloading? (c) What are some examples of operator overloading? (d) What operators can/cannot be overloaded? [4+4+4+4] 3. What is a Binary search tree? Provide a specification for the abstract data type BSTree(binary search tree with duplicates).Code No: R059211201 Set No. (a) What are the applications of stack explain with an example. February 2007 ADVANCED DATA STRUCTURES & 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.

if all keys are equally likely to be searched for. 4 (b) Describe the dynamic programming approach for the construction of OBST for a set of n keys. [8+8] ⋆⋆⋆⋆⋆ 2 of 2 .Code No: R059211201 Set No.

- Data StructureUploaded byTigabu Yaya
- Advanced Data Structure and C++ programmingUploaded byDr. Amresh Nikam
- xplanUploaded bynarsaiah
- C++ questionsUploaded byneo4895651
- Data structure using C++ -Elective IIIUploaded bysneha_ece
- Lec04Uploaded bypintumcet06
- Mca Project Sample on Student Information SystemUploaded byStudy Stuff
- Computer Science Lecture 10 ContinuationsUploaded byAshley Anderson
- Heap and HashtableUploaded byAnonymous IhmXvCHj3c
- UCF Computer Science Foundation Exam Study PlanUploaded bymagicmindman
- cuckoo_hiUploaded byAbdul K Pathan
- dsUploaded byMohammed Jeelan
- dlubal-tutorialUploaded byjilavaboy
- Data Structure Algorithm What to ReadUploaded byArka Prava Paul
- DBMS CheatsheetUploaded bydevendraiiit1
- 081-2008 Many-To-Many Merges in the DATA StepUploaded bymohaha_true
- Dev'sUploaded byvinu_kb89
- C++Uploaded bychicknourol
- c Q&AUploaded bySasiKumar Petchiappan
- A Synopsis on the TopicUploaded byAnonymous TLVwfva
- 101108327-Raway-Reservation-System-c.pdfUploaded byHimanshu Chaudhary
- gradcpp_lec3Uploaded byapi-3698788
- 30_04__RESULT__MJ2010Uploaded byRishi Kataria
- ResumeUploaded byzakhennahr2437
- 01-Physical Data Organization(5)Uploaded byjozika12
- MC0066-OOPS using C++ Model Question PaperUploaded byashish544170
- bca_oct2011Uploaded byKiran Tambe
- CBasics-Week2Uploaded byAhmad Ikhwan
- 100-top-c-programming-multiple-choice-questions-and-answers.pdfUploaded bymspereira
- wong_fp-FP4Uploaded byYermakov Vadim Ivanovich

- Microprocessors and Its Applications March06 Nr312001Uploaded byNizam Institute of Engineering and Technology Library
- Microprocessors May2006 Rr420303Uploaded byNizam Institute of Engineering and Technology Library
- Microprocessors and Interfacing March06 Rr312001Uploaded byNizam Institute of Engineering and Technology Library
- JNTU old question papers 2007Uploaded bySrinivasa Rao G
- rr320202-microprocessors-and-interfacingUploaded bySRINIVASA RAO GANTA
- Microprocessors Applications March06 Nr410310Uploaded byNizam Institute of Engineering and Technology Library
- JNTU old question papers 2007Uploaded bySrinivasa Rao G
- Microprocessors and Micro Controllers Nr311902 November AmUploaded byNizam Institute of Engineering and Technology Library
- Microprocessors and Interfacing r05220504Uploaded byNizam Institute of Engineering and Technology Library
- Microprocessors and Interfacing Rr320202Uploaded byNizam Institute of Engineering and Technology Library
- nr320202-microprocessors-and-microcontrollersUploaded bySRINIVASA RAO GANTA
- nr320202-microprocessors-and-microcontrollersUploaded bySRINIVASA RAO GANTA
- nr320202-microprocessors-and-microcontrollersUploaded bySRINIVASA RAO GANTA
- rr321402-microprocessorsUploaded bySRINIVASA RAO GANTA
- Microprocessors Applications Nr410310 18november2005pmUploaded byNizam Institute of Engineering and Technology Library
- Microwave Engineering Nr320403Uploaded byNizam Institute of Engineering and Technology Library
- Microwave Engineering Rr320404Uploaded byNizam Institute of Engineering and Technology Library
- Microwave Engineering November Am Rr311701Uploaded byNizam Institute of Engineering and Technology Library
- JNTU old question papers 2007Uploaded bySrinivasa Rao G
- JNTU old question papers 2007Uploaded bySrinivasa Rao G
- Microwave Engineering Nr320403 30november2005pmUploaded byNizam Institute of Engineering and Technology Library
- Molecular Biology RrUploaded byNizam Institute of Engineering and Technology Library
- Molecular BiologyUploaded byNizam Institute of Engineering and Technology Library
- JNTU old question papers 2007Uploaded bySrinivasa Rao G
- Multimedia and Web Design Rr321201Uploaded byNizam Institute of Engineering and Technology Library
- Microwave Engineering Nr311701 November AmUploaded byNizam Institute of Engineering and Technology Library
- Microwawe Engineering April2003 or 320455Uploaded byNizam Institute of Engineering and Technology Library
- Microwave Engineering Nov2004 NR 311701Uploaded byNizam Institute of Engineering and Technology Library
- Microwave Engineering Nov2004 Rr 311701Uploaded byNizam Institute of Engineering and Technology Library
- Natural Language Processing Rr420503Uploaded byNizam Institute of Engineering and Technology Library

- Communicating in ScienceUploaded byDina Aguiar
- hana.docxUploaded byGangarani Galla
- Malaysia as Outsourcing DestinationUploaded byRahul Pearce
- STATA Training Session 1Uploaded byRajesh Kumar
- Lote French Teacher NotesUploaded bydharmendra-kohli-9072
- Course Books: friend or foe?Uploaded byWilly
- English File 3rd - Pre-Inter Tb 102Uploaded byLiliana Lardone
- Basic CryptanalysisUploaded byAlpha_Hacka
- Sobotta's Tables of Muscles, Joints and NervesUploaded byColito
- Hui Neng SutraUploaded byapi-26083110
- TeachUploaded byzippettino
- Isolation vs ContextUploaded byPraveenNaidu
- Skolar_PEUploaded bychechazzo
- oral historyUploaded byRolf Campos
- 4 Stage Guide to Communicating With the Unconscious MindUploaded byosher26
- tws 4 assessment planUploaded byapi-201921230
- Pf v14 SoftwareUploaded byCesar Brito
- UG_PG Prospectus Eng 2010Uploaded byskmc002
- ielts online class syllabusUploaded byapi-248237460
- GIAO AN TIENG ANH LOP 10 TRON BO.docUploaded bybinh
- ImageJ_Manual.pdfUploaded bycatalina bello
- Chieru CatalogUploaded byathenaartemis
- Phronesis Volume 17 Issue 3 1972 [Doi 10.2307%2F4181894] David Konstan -- Epicurus on Up and Down (Letter to Herodotus § 60)Uploaded byNițceVali
- Afu Darguzar Ke Fazail Mei Ek Ehm Madni WasiyatUploaded bySehra E Madina
- Deb or AhUploaded byJolanta Czarzasta
- Regex_Reference.pdfUploaded bylinkspirit
- 700 Classroom activities OCR.pdfUploaded bynonhocapito
- Ellipsis and SubstitutionUploaded byManuel Garcia Grandy
- Course_design_poster.pdfUploaded byMiguel Angel Ponze
- Pre-Evaluation Control EnggUploaded byAnna Levine