## Monday, November 12, 2012

### EE2204/DATASTRUCTURES & ALGORITHMS ANNA UNIV NOV/DEC 2012 IMPOR. QUESTIONS

Anna University, Chennai Nov/Dec 2012 Examinations
Rejinpaul.com Important Questions
EE2204/DATASTRUCTURES & ALGORITHMS
III Sem EEE
Unit I-V

1.       What is a Linked List? Explain with suitable program segments to any four operation of a Linked list
2.      Write a C program to perform Insertion and deletion operations on a queue
3.       Write an algorithm for Insertion and Deletion of nodes in a stack.
4.      Write down the algorithm to convert infix to postfix(example)
5.      What are the tree traversal methods? Explain each of them with examples.
6.      Write down the procedure needed to delete the node from Binary Search tree with examples
7.       explain the algorithms of inorder and postorder traversal on a Binary Search Tree
8.      Explain with examples how a node is inserted into an AVL tree, explain the basic operations on AVL Tree
9.      Explain in detail about Hashing and binary heap
10.   Explain single source shortest path algorithm with an example
11.   Explain in detail about Minimum Spanning Tree
12.   Describe  BFS and DFS methods for graph with suitable algorithms
13.   Explain the following  (i).Prim’s Algorithm   (ii).Kruskal’s Algorithm.
14.   Discuss Dijikstra’s single  source shortest path algorithm
15.   What is divide and conquer method ? Explain with its applications
16.   Explain about the following  (i) Greedy algorithms (ii)Dynamic programming
17.   Explain in detail about Traveling Salesman problem use greedy algorithm to solve the problem

### IT2201/DATA STRUCTURES AND ALGORITHMS ANNA UNIV NOV/DEC 2012 IMPORTANT QUESTIONS

Anna University, Chennai Nov/Dec 2012 Examinations
Rejinpaul.com Important Questions
IT2201/DATA STRUCTURES AND ALGORITHMS
III Sem IT
Unit I-V

1.       What is singly linked list? Explain about various operations performed on a node from a Singly Linked list
2.      What is Stack? Give the implementations of stack
3.       Discuss the operation performed in ADT. Explain them in detail
4.      Explain operations of doubly linked list and cursor based implementation in detail
5.      Explain in detail about binary search tree with necessary operations
6.      Explain the rotations operations  done in AVL-Tree (with example)
7.       Explain the tree traversals in detail
9.      Explain in detail the collision resolution methods
10.   Discuss in detail open addressing and rehashing
11.   Explain in detail about DIjkstra’s Algorithm with an example
12.   Explain in detail about DFS and BFS Techniques with an example
13.   Explain  the Kruskal’s Algorithm with an example
14.   Explain Prim’s algorithm with example
15.   Explain in detail about Backtracking Algorithm with an example
16.   Explain in detail about Dynamic Programming with an example
17.   Explain in detail about Divide and conquer  Algorithm with an example
18.   Write Short Notes on  (i)   Asymptotic Notations  (ii) Big O Notation  (iii) Little Omega Notations (iv)Big Theta Notation

### EC 2202/DATA STRUCTURES AND OBJECT ORIENTEDPROGRAMMING IN C ++ Anna University, Chennai Nov/Dec 2012 Examinations important questions

Anna University, Chennai Nov/Dec 2012 Examinations
Rejinpaul.com Important Questions
EC 2202/DATA STRUCTURES AND OBJECT ORIENTEDPROGRAMMING IN C ++
III Sem ECE
Unit I-V
These are only important Questions it may or may not be asked for UE

2.      What is a constructor? Explain in detail about types of constructors with example?
3.       Explain the control structures of C++ with suitable examples
4.      Explain the concept of  static variable with example program
5.      Explain the concept of inheritance with examples
6.      What is an exception? How is an exception handled in C++?
7.       Discuss virtual function and polymorphism with example
8.      Define double linked list. Explain the various operations of double linked list with algorithm.
9.      What is hashing? Explain the various hash functions with example
10.   What is priority queue? Discuss the array implementation of priority queue.
11.   Discuss the different methods of traversing a binary tree with algorithm
12.   Discuss Prim’s and Kruskal’s algorithm for computing the minimal spanning tree weighted           undirected graph
13.   Explain in detail about AVL trees
14.   Convert the expression ((A + B) * C - (D - E) ^ (F + G)) to equivalent Prefix and postfix  notations
15.   Explain the all pairs shortest path algorithm with an example.
16.   Compare the worst case and best case time complexity of various sorting techniques
17.   Explain divide and conquer technique .

### ME2204/Fluid Mechanics and Machinery Nov/Dec 2012 Anna University Important Questions

Anna University, Chennai Nov/Dec 2012 Examinations
Rejinpaul.com Important Questions
ME2204/Fluid Mechanics and Machinery
III Sem MECH
Unit I-V

1.    State the law of conservation of energy and derive the Bernoulli’s equation for an incompressible fluid  and  Derive the Bernoulli’s energy equation and state the assumptions made while deriving the equation
2.   A pipe of 300 mm diameter inclined at 30o to the horizontal is carrying gasoline (specific gravity = 0.82). A venturimeter is fitted in the pipe to find out the flow rate whose throat diameter is 150mm. The throat is 1.2m from the entrance along its length. The pressure gauges fitted to the venturimeter read 140kN/m2 and 80kN/m2 respectively. Find out the coefficient of discharge of the venturimeter if the flow is 0.20 m2/s.
3.    Explain in detail the Newton’s law of viscosity and the types of viscosity. Briefly classify the fluids based on the density and viscosity. Give the limitations of applicability of Newton’s law of viscosity.
4.   Explain in detail the Newton’s law of viscosity and the types of viscosity. Briefly classify the fluids based on the density and viscosity. Give the limitations of applicability of Newton’s law of viscosity.
5.   Derive the equations for velocity distribution and shear stress distribution for laminar flow.
6.   Derive Darcy’s equation for head loss of head due friction in pipe
7.    For a town water supply, a main pipe line of diameter 0.4m is required. As pipes more than 0.35m diameter are not readily available, two parallel pipes of same diameter are used for water supply. If the total discharge in the parallel pipes is same as in the single main pipe, find the diameter of parallel pipe. Assume the coefficient of discharge to be the same for all the pipes
8.   Derive the expression for loss of head due to friction in pipes – Darcy Weisbach equation. What is its application?
9.   The power developed by hydraulic machines is found to depend on the head h, flow rate Q, density ? , speed N, runner diameter D, and acceleration due to gravity g. Obtain suitable dimensionless parameters to correlate experimental results.
10.               using Buckingham's ? theorem, show that the velocity through a circular orifice in a pipe is given by v = 2gH f {d/H,Âµ /? vH} where v is the velocity through orifice of diameter d and H is the head causing the flow and ? and Âµ are the density and dynamic viscosity of the fluid passing through the orifice and g is acceleration due to gravity.
11.Explain the Reynold’s model and Euler’s model with suitable examples
12.               using dimensional analysis, obtain a correlation for the frictional torque due to rotation of a disc in a viscous fluid. The parameters influencing the torque can be identified as the diameter, rotational speed, viscosity and density of the fluid.
13.Explain the working principle of Kaplan turbine
14.               Describe the working principle of vane pump,gear pump,reciprocating pump, positive displacement pumps in detail
15.               Compare the advantages and disadvantages of centrifugal submersible and jet pumps(see related problem)
16.               With a neat sketch explain the working of double acting reciprocating pump with its performance characteristics

### Happy Diwali Wishes From Rejinpaul.com Less Than Three Hours To Go

May This Diwali be brings you bright as ever.

May this Diwali bring joy, health and wealth to you.

May the festival of lights brighten up you and your near and dear ones lives.

May this Diwali bring in u the most brightest

and choicest happiness and love you have ever Wished for.

May this Diwali bring you the utmost in peace and prosperity.

May lights triumph over darkness.

May peace transcend the earth.

May the spirit of light illuminate the world.

May the light that we celebrate at Diwali show us the way and lead us

together on the path of peace and social harmony

"WISH U A VERY HAPPY DIWALI"

-->

### IT2301/Java programming NOV/DEC 2012 IMPORTANT QUESTIONS

Anna University, Chennai Nov/Dec 2012 Examinations
Rejinpaul.com Important Questions
IT2301/Java programming
V Sem IT
Unit I-V

1.      Explain briefly the following object oriented concepts.
2.      What is constructor? What is the use of constructors?
3.      Explain arrays in java.
4.      Explain in detail about static method and its initialization.
6.      What is a Package? What are the benefits of using packages? Write down the steps in creating a package and using it in a java program with an example.
7.      Explain about static and dynamic binding with example programs?
8.      Differentiate between interfaces and abstraction classes with example programs?
10.      What is the use of Reflection give one example program using all methods?
11.      Write a program to draw all shapes (line, rectangle, polygon ,circle and oval ) using AWT?
12.      what is object cloning ? why it is needed? Explain how objects are cloned
and    Explain the types of cloning with an example program?

13.      Explain the properties of  Proxy class and explain proxy class methods
14.      With a neat diagram explain the Model view controller design pattern and list out the advantages and disadvantages of using it in designing an application.
15.      Explain action event with an example?
16.      List out the components in swings and explain any 4  components?
17.      What is Generic programming and why is it needed? List the limitations
and restrictions of generic programming.

18.      Explain how to create threads. Write a java program that prints numbers
from 1 to 10 line by line after every 5 seconds.

19.      Write short notes on what threads are and the thread states and properties
20. Draw the exception hierarchy in java and explain with examples throwing and catching exceptions and the common exceptions