Anna University Question Papers

I have provided question bank for departments like Computer Science, Electronics and Communication, Electrical and Electronics, Civil, Information Technology, Mechanical, Electronics and Instrumentation and few other departments.. 

question bank contains previous year question papers  of regulation 2007,2008 and 2009 paper of all semester..with  2 mark question of all subjects...

Question bank for Computer Science (CSE) Department:-

  For CSE all semester question papers click here 

• Theory of Computation - Click here
• System Software - Click here
• Object Oriented Programming - Click here
• Object Oriented Analysis and Design - Click here
• Microprocessor - Click here
• Internet Programming - Click here
• Data structure and Algorithm - Click here
• DBMS - Click here
• Cryptography and Network Security - Click here
• Computer Networks - Click here
• Data structure - Click here
• Operating System - Click here
• Software Engineering - Click here
• Analog and Digital Communication - Click here  

Question Bank for Electronic and Electrical Engineering 
(EEE) department:-

For EEE all semester question papers click here 

• Electronic Circuits - CLICK HERE
• Inter networking Technology - CLICK HERE
• Power System Analysis - CLICK HERE
• Neural Networks and Fuzzy Logic Control - CLICK HERE
• Transmission and Distribution - CLICK HERE
• Control Engineering - CLICK HERE
• Solid State Drives - CLICK HERE 

Question Bank for Electronics and Communication (ECE)department:-

For ECE all semester question papers click here 

• Transmission Lines and Wave Guides - CLICK HERE
• Microwave Engineering - CLICK HERE
• Principles of Communication - CLICK HERE
• Professional Ethics and Human Values - CLICK HERE
• Environmental Science and Engineering - CLICK HERE
• Electronic Circuits - CLICK HERE
• Signals and Systems - CLICK HERE
• Digital Image Processing - CLICK HERE
• VLSI Design - CLICK HERE
• Communication Engineering - CLICK HERE
• Digital Signal Processing - CLICK HERE
• Digital Electronics - CLICK HERE
• Communication Theory - CLICK HERE
• Computer Networks - CLICK HERE
• Satellite Communication - CLICK HERE
• Radar and Navigational Aids - CLICK HERE
• Electromagnetic Theory - CLICK HERE
• Linear Integrated Circuits - CLICK HERE
• Antenna Wave Propagation - CLICK HERE
• Mobile Communication - CLICK HERE
• Electronics Circuits II - CLICK HERE
• Principles of Management - CLICK HERE
• Optical Communication - CLICK HERE
• Digital Communication - CLICK HERE

Question Bank for Mechanical Engineering (MECH) department.

For MECH all semester question papers click here 

Question Bank for Information Technology (IT) department.

For IT all semester question papers click here 

• Date Warehousing and Mining - CLICK HERE
• Visual Programming - CLICK HERE
• Digital Principle and System Design - CLICK HERE
• Operating System - CLICK HERE
• Database Management System - CLICK HERE
• Data Communication - CLICK HERE
• Digital Image Processing - CLICK HERE
• E-Commerce - CLICK HERE
• Information Coding Techniques - CLICK HERE
• Digital Signal Processing - CLICK HERE
• Cryptography and Network Security - CLICK HERE
• Web Technology - CLICK HERE
• Principles of Management - CLICK HERE

Cryptography & network Security 16 marks questions

Important 16 Marks Questions In IT2352 & Cryptography & network Security  

Important 16 Marks Questions In IT2352 & Cryptography & network Security

1. Explain in detail about  any four substitution techniques                                         
2. Explain in detail about OSI Security Architecture?                                                  
3. Explain playfair cipher & vernam cipher in detail ?                                                   
4. Explain briefly about data encryption standard & types of attacks on double &TripleDES                                                                                                                                  
5. Discuss in detail RSA algorithm , highlighting its computational aspect and security.
    Perform decryption and encryption using RSA algorithm with p=3 q=11 e=7 and M=5.
6. How discrete logarithm is evaluated for a number? What is the role of discrete logarithms in  the Diffie-Hellman key exchange in exchanging the secret key among two users?            
7. Describe the MD5 message digest algorithm with necessary block diagram                     
8. Explain the operational description of S/MIME                                                                 
9. Explain in detail operation of Transport layer security in detail                                      
10. Explain in detail about IP Security with neat diagram                                                    
11. Explain in detail about Malicious Software                                                                      
12. Write short notes on Intrusion detection                                                                        
13. Explain in detail about Password Management               

DATA STRUCTURES QUESTION BANK FOR CSE

DATA STRUCTURES QUESTION BANK 

Important Questions in Data Structures NOV/DEC 2011 ANNA UNIVERSITY OF TECHNOLOGY EXAMINATIONS FOR SECOND YEAR THIRD SEMESTER CSE Students

141301 - Data Structures

UNIT I

1.   Explain the addition  and deletion operation performed on a circular queue with necessary algorithm

2.   Write an algorithm for push and pop operation on stack using linked list

3.   Explain the complete set of stack operation

4.   Write the insertion and deletion operations singly and doubly linked list

UNIT II

1.   Write an algorirhm for pre-order and postorder traversal of a binary tree.

2.   Describe the algorithm used to perform single and double rotation on AVL tree

3.   Write an ADT binary search tree

4.   Explain heap structures. How are binary heaps implemented? Give its algorithm with example

    

UNIT III

1.      Discuss in detail the B-tree.What are its advantage.

2.      Define Tree. Explain the tree traversals with algorithms and examples

3.      Describe circular queue implementation in detail giving all the relevant features

4.      Explain the concept of insertion and deletion of elements from a Max Heap. Illustrate with suitable algorithms

UNIT IV

1.       Explain separate chaining and extensible hashing.

2.       Formulate an ADT to perform for the union and find operation of disjoint set

3.       Show the result of inserting keys 2,3,5,7,11,13,15,6,4 into an empty extendible hashing data structure with M=3

4.       What is union by height?Write an algorithm to implement it

5.       Explain path compression with an example

UNIT V

1.   What is minimum spanning tree?Explain the algorithm using prim’s and kruskals  with an example.

2.   Write an dijkstra’s algorithm with an example.

3.   Explain DFS and BFS with an example.    

4.   Explain topological sort with an example

Data Structures & Algorithms For IT

Data Structures & Algorithms 

Important Questions in Data Structures & Algorithms 142301

ANNA UNIVERSITY OF TECHNOLOGY EXAMINATIONS FOR SECOND YEAR THIRD SEMESTER IT Students

UNIT I

1.    What is Stack? Give the implementations of stack and explain clearly the data structure and

     routines used.

2.    What is singly linked list? Explain the algorithm in detail about various operations performed on a  node from a Singly Linked list

3.    Illustrate with a neat example the implementation of a circular queue

UNIT II

1.   With an example explain the algorithms of inorder and postorder traversals on a binary search

2.   Explain the binary heap in detail.        

3.   Explain the rotations operations which are done in AVL-Tree. Construct the AVL Tree for the

        following      18,26,9,47,54,32,12,58,30,60,44,74,33,55

4.   Explain the tree traversals in detail

UNIT III

Discuss in detail open addressing and rehashing

2.   Explain in detail the collision resolution methods.

3.   What is meant by collision in hashing? Explain the separate chaining collision resolution strategy.         

4.   Explain in detail about Extensible hashing

UNIT IV

1.   Explain in detail about DIjkstra’s Algorithm with an example  

2.   Explain in detail about DFS and BFS Techniques with an example

3.   Explain  the prim’s and Kruskal’s Algorithm with an example

UNIT V

1.   Explain in detail about Divide and conquer  Algorithm with an example.

2.   Explain in detail about Dynamic Programming with an example 

3.   Explain in detail about Greedy Algorithm with an example

4.   Explain in detail about Backtracking Algorithm with an example