Exam Details

Subject data structures and problem solving
Paper
Exam / Course m.tech
Department
Organization Institute Of Aeronautical Engineering
Position
Exam Date July, 2017
City, State telangana, hyderabad


Question Paper

Hall Ticket No Question Paper Code: BCS002
INSTITUTE OF AERONAUTICAL ENGINEERING
(Autonomous)
M.Tech I Semester End Examinations (supplementary) July, 2018
Regulation: IARE-R16
DATA STRUCTURES AND PROBLEM SOLVING

Time: 3 Hours Max Marks: 70
Answer ONE Question from each Unit
All Questions Carry Equal Marks
All parts of the question must be answered in one place only
UNIT I
1. Explain how insertions and deletions are done in a circular linked list.
Explain the concept of ADT with the example of the priority queue ADT.
2. Describe the Big Oh, Omega and Theta notations with an example.
Explain the operations of insertion and deletion into a max heap with an example.
UNIT II
3. What is double hashing? Insert the keys 76,93,40,47,10,55 into a hash table of seven elements
using double hashing, using the second hash function Hash2(key) 5 key 5 and show the
contents of the hash table at each stage.
Explain with an example how hash table collisions are resolved using linear probing.
4. What is rehashing? When is rehashing done?
Explain the linear list representation of dictionaries. Also explain how insertion and search
operations are done in such dictionaries.
UNIT III
5. How is non-recursive traversal of a binary tree done? Explain with an example
With an example, trace the working of the Djikstra's algorithm for single source shortest path
problem.
6. What are threaded binary trees? Give an example.
Write the algorithm for finding the minimum cost spanning tree proposed by Kruskal.
UNIT IV
7. Write an algorithm for insertion of an element into a binary search tree.
Create a binary search tree by repeated insertion of the following elements 50, 70, 20, 10, 30,
67, 89, 12, 14. Now, delete element 20 and draw the resultant tree.
Page 1 of 2
8. How do you find the smallest and largest numbers in a binary search tree?
What is an AVL tree? Describe when and how an RR rotation is performed in an AVL tree.

UNIT V
9. Illustrate Huffman coding for compression with an example.
What is a red-black tree? Explain the insertion operation into a red-black tree with an example.

10. What are the B trees and write any three applications of B trees?
Explain the working of the nearest neighbor query in an R tree.


Other Question Papers

Subjects

  • ac to dc converters
  • advanced cad
  • advanced concrete technology
  • advanced data structures
  • advanced database management system
  • advanced mechanics of solids
  • advanced reinforced concrete design
  • advanced solid mechanics
  • advanced steel design
  • advanced structural analysis
  • advanced web technologies
  • big data analytics
  • computer aided manufacturing
  • computer aided process planning
  • computer architecture
  • computer oriented numerical methods
  • cyber security
  • data science
  • data structures and problem solving
  • dc to ac converters
  • design for manufacturing and assembly
  • design for manufacturing mems and micro systems
  • design of hydraulic and pneumatic system
  • distributed operated system
  • earthquake resistant design of buildings
  • embedded c
  • embedded networking
  • embedded real time operating systems
  • embedded system architecture
  • embedded system design
  • embedded wireless sensor networks
  • english for research paper writing
  • finite element method
  • flexible ac transmission systems
  • flexible manufacturing system
  • foundations of data science
  • foundations of data sciences
  • fpga architecture and applications
  • hardware and software co-design
  • high performance architecture
  • intelligent controllers
  • internet of things
  • introduction to aerospace engineering
  • mathematical foundation of computer
  • mathematical methods in engineering
  • matrix methods of structural analysis
  • micro controllers and programmable digital signal processing
  • multilevel inverters
  • numerical method for partial differential equations
  • power electronic control of ac drives
  • power electronic control of dc drives
  • power quality
  • precision engineering
  • principles of distributed embedded systems
  • programmable logic controllers and their applications
  • rapid prototype technologies
  • rehabilitation and retrofitting of structures
  • renewable energy systems
  • research methodology
  • soft computing
  • special machines and their controllers
  • stress analysis and vibration
  • structural dynamics
  • structural health monitoring
  • theory of elasticity and plasticity
  • theory of thin plates and shells
  • web intelligent and algorithm
  • wireless lan’s and pan’s
  • wireless lans and pans
  • wireless sensor networks