Anna University Chennai EEE Question Bank

I am a student of the BE EEE 7th semester course of Anna University Chennai . I want to get list of the important questions for exam . Will you please tell which question bank I have to purchase for BE EEE 7th semester course of Anna University Chennai examination .

Hi I would like to have the Data Structures and Objects Oriented Programming in C++ quest paper for previous year?

[sumit]

The Data Structures and Objects Oriented Programming in C++ quest paper for previous year is as given below:

1. How is a class declared in C++?

2. What is a scope resolution operator and how can it be used for global variable?

3. What is meant by binding?

4. How the pointer is implemented in C++?

5. Write any two data structures used in Operating System?

6. What are the representations of Big and small ‘O’ notations?

7. How many trees are possible with 3 nodes?

8. What is a spanning tree?

9. What is the feature of bucket sort algorithm?

10. Define dynamic programming.
PART B — (5 × 16 = 80 Marks)

11. (a) (i) Give the syntax and usage of the reserved word inline with two
examples. (8)
(ii) Explain the importance of constructors and destructors with
example. (8)
Or
(b) What is operator overloading? Overload the numerical operators ‘+’and ‘/’
for complex numbers “addition” and “division” respectively. (16)

12. (a) (i) Define friend class and specify its importance. Explain with
suitable example. (8)
(ii) Discuss Virtual function and polymorphism with example. (8)
Or
(b) (i) Explain the concept of inheritance by considering an example of
“vehicle”. (8)
(ii) Explain the operators used for dynamic memory allocation with
examples. (8)

13. (a) (i) Explain Priority Queues and how are binary heaps used in that. (8)
(ii) Explain the properties of heap. (8)
Or
(b) (i) Write a C ++ program to implement Stack and its operations PUSH
and POP. (10)
(ii) What is hashing? Classify hashing functions based on the various
methods. (6)

14. (a) (i) Traverse the tree given below using Inorder, Preorder and
Postorder traversals. (10)
(ii) Convert the expression ((A + B) * C - (D - E) ^ (F + G)) to equivalent
Prefix and postfix notations. (6)
Or

(b) (i) Convert the given graph with weighted edges to minimal spanning
tree. (10)
(ii) Write a short note on AVL trees. (6)

15. (a) Explain the algorithm of Quicksort by sorting the following set of
numbers as an example:
42 47 52 57 62 37 32 27 22
Or
(b) Describe divide and conquer technique with the help of mergesort.