Scribd
Upload
7 views2 pages

Dsa Am199

Signal and Systems

Uploaded by

bhushanseelan786
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
7 views2 pages

Dsa Am199

Signal and Systems

Uploaded by

bhushanseelan786
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
HT B.E/ B.Tech (FT) END SEMESTER EXAMINATIONS — APRIL / MAY 2019 Roll No. INFORMATION TECHNOLOGY Third Semester IT 8303 Programming and Data Structures Il (Regulation 2012) Time: 3 Hours Answer ALL Questions Max, Marks 100 eernanesene "1 12. 13, PART-A (10 x 2 = 20 Marks) Define the term: Data abstraction and Encapsulation What is the role of ‘this’ pointer. What is meant by polymorphism? What is a virtual function? Explain how exceptions are handled in C++? What is an iterator in C++? What is a binomial heap? List out the properties of Min-heap. How amortized analysis is carried out in potential method? Write the procedure for Depth First Search. What is @ spanning tree and minimum spanning tree? Part — B (5 x 16 = 80 marks) (Question No.14 is Compulsory) What is a function in C++? Explain the types of functions with illustrative examples. a) b) a) b) What is meant by function overloading? Illustrate the concept of function overloading with at least two examples. (OR) Explain how dynamic memory allocation is done in C++? Give at least two examples of dynamic memory allocation. How file handling is carried out in C++? Write a C++ program to read a text file and construct a histogram based on the frequency of words present in the file, (8+8 marks) (OR) Explain the STL libraries of C++. Explain the concept of containers and iterators with at least two examples. 44. a) What is an AVL Tree? Explain the algorithms for inserting and deleting an element in AVL tree with the appropriate rotations. (OR) b) What is a Disjoint set? Write the algorithms for insertion, deleting and finding an element in Disjoint sets with an example. 15. a) Explain Kruskal minimum spanning algorithm. Apply Kruskal algorithm for the following graph to obtain minimum spanning tree. (OR) b) Explain Dijkstra Shortest path algorithm. Apply the shortest path algorithm fo find the shortest path from ‘a’ to ‘e’ using Dijkstra approach

You might also like