Questions Search

This website covers previous years question papers of various universities and colleges in India. Moreover, the information on admission to various courses from various universities/institutes/colleges are also available. Research paper questions are also updated from time to time. Also the latest teaching faculty plus teachers jobs, Government jobs, Banking Jobs, and other jobs are regularly updated to help jobless candidates. Admit cards of various recruitment of Govt organisation are updated. Search your terms using the sejavascript:void(0)arch box provided.
Are you student / faculty of Vikram University Ujjain? We are collecting old question papers. If you have latest question papers 2016 / 2015 / 2014 years, then contact us through email [email protected] / [email protected] . We will give you money for your question papers you send to us.

TNPSC Group IV 2016 Model Questions AnswersTNPSC Group IV

Anna Univ B.E Civil Engineering Previous Years Question PapersBE Civil Anna Univ

Anna Univ B.E EEE Previous Years Question PapersB.E EEE Anna Univ Questions

Anna Univ B.E Mechanical Engineering Previous Years Question PapersMechanical B.E Questions

Anna Univ B.E CSE Previous Years Question PapersMechanical B.E Questions

Anna Univ B.E ECE Previous Years Question PapersMechanical B.E Questions

VTU Question PapersLatest News

Dharmsinh Desai University Previous Years Question PapersLatest News

NEW: Last 05+ Years Question Papers of CE6451 Fluid Mechanics and Machinery

NEW: ME6502 Heat and Mass Transfer AU Chennai Last 10 Set of Question Papers

NEW: CE2027 Housing Planning and Management 2014 Question Paper

Himachal Pradesh University (HPU) Previous Years Question Papers

ME2027 PPCE All Previous Years Question Papers [NEW]

GNDU Previous Years Question Papers [NEW]

Teachers TGT, PGT, PRT jobs in New Delhi Schools


Follow by Email

Wednesday, September 21, 2016

EC2202 Data Structures and Object Oriented Programming in C++ Nov Dec 2010 Question Paper

Anna University Chennai
Third Semester
Electronics and Communication Engineering
(Regulation 2008)
Time : Three hours Maximum : 100 Marks

Note: New Subject Code in R-2013 is EC6301

Answer ALL questions
PART A — (10 × 2 = 20 Marks)
1. What effects do the visibility labels private, protected and public have on the members of a class?
2. What are the advantages of operator overloading?
3. What is inheritance? What are its advantages?
4. Define virtual function.
5. Define stack. Mention the operations on stack.
6. What is binary heap? What are its types?
7. What is meant by an adjacency matrix?
8. State the properties of binary search tree.
9. What is sorting? How is sorting essential for data base applications?
10. What is meant by dynamic programming?
PART B — (5 × 16 = 80 Marks)
11. (a) (i) Compare and contrast Structured Programming and ObjectbOriented Programming. (8)
(ii) Distinguish between Data Encapsulation and Data Abstraction. (4)
(iii) Mention the purpose of Constructor and Destructor functions. (4)
(b) (i) Explain the control structures of C++ with suitable examples.
 (ii) Define function overloading with a simple example. (4)
12. (a) (i) Differentiate inheritance from polymorphism. (6)
(ii) Write a C++ program to illustrate the concept of hierarchical inheritance.(10)
(b) (i) What is the use of template? Write an overloaded function template called max( ), which will find the maximum of any two given integers. (8)
(ii) Explain the exception handling mechanism of C++ in detail. (8)
13. (a) (i) Explain the operations performed on queue in detail. Write a C++ program to implement these queue operations. (10)
(ii) Explain insertion, deletion and replacement of nodes in a heap. (6)
(b) (i) What are the advantages of linked list over array? (4)
(ii) Define Hashing. (2)
(iii) Write a C++ program to implement stack through linked list. (10)
14. (a) (i) Write an algorithm to traverse binary tree level by level, with each level of the tree being traversed from left to right. (10)
(ii) Explain spanning tree and minimal spanning tree with examples.(6)
(b) (i) Define AVL tree. Explain the operations on AVL tree with illustrations. (6)
(ii) Explain breadth first search algorithm for the traversal of any graph with suitable examples. Define time complexity of the algorithm. (10)
15. (a) (i) Explain heap sort with an illustration. (8)
(ii) Explain the greedy algorithm to find minimum spanning tree. (8)
(b) (i) Explain the insertion sort with its time complexity. (8)
(ii) Explain as to how divide and conquer technique can be applied for merge sort. (8)


No comments:

Post a Comment

Pen down your valuable important comments below