Google Search

Friday, August 19, 2011

141353 OBJECT ORIENTED PROGRAMMING LAB Anna University Of Technology manual download


141353 OBJECT ORIENTED PROGRAMMING LAB  
141353 OBJECT ORIENTED PROGRAMMING LAB    
141353 OBJECT ORIENTED PROGRAMMING LAB                                             

1.    Design C++ classes with static members, methods with default arguments, friend functions.  (For example, design matrix and vector classes with static allocation, and a friend function to do matrix-vector multiplication)
2.    Implement complex number class with necessary operator overloadings and type conversions such as integer to complex, double to complex, complex to double etc.
3.    Implement Matrix class with dynamic memory allocation and necessary methods.  Give proper constructor, destructor, copy constructor, and overloading of assignment operator.
4.    Overload the new and delete operators to provide custom dynamic allocation of memory.
5.    Develop a template of linked-list class and its methods.
6.    Develop templates of standard sorting algorithms such as bubble sort, insertion sort, merge sort, and quick sort.
7.    Design stack and queue classes with necessary exception handling.
8.    Define Point class and an Arc class.  Define a Graph class which represents graph as a collection of Point objects and Arc objects.  Write a method to find a minimum cost spanning tree in a graph.
9.    Develop with suitable hierarchy, classes for Point, Shape, Rectangle, Square, Circle, Ellipse, Triangle, Polygon, etc.  Design a simple test application to demonstrate dynamic polymorphism and RTTI.
10.  Write a C++ program that randomly generates complex numbers (use previously designed Complex class) and writes them two per line in a file along with an operator (+, -, *, or /).  The numbers are written to file in the format (a + ib).  Write another program to read one line at a time from this file, perform the corresponding operation on the two complex numbers read, and write the result to another file (one per line).

Thursday, August 18, 2011

141352 DATA STRUCTURES LAB Anna University Of Technology Lab Manual


141352 DATA STRUCTURES LAB                               

1.            Implement singly and doubly linked lists.
2.            Represent a polynomial as a linked list and write functions for polynomial addition.
1.            Implement stack and use it to convert infix to postfix expression
2.            Implement a double-ended queue (dequeue) where insertion and deletion
            operations are possible at both the ends.
3.            Implement an expression tree.  Produce its pre-order, in-order, and post-
            order traversals.
4.            Implement binary search tree.
5.            Implement insertion in AVL trees.
6.            Implement priority queue using binary heaps
7.            Implement hashing with open addressing.
8.            Implement Prim's algorithm using priority queues to find MST of an
            undirected graph.

Click Here To Download The Manual

141351 DIGITAL LABORATORY 141351 DIGITAL SYSTEM LABORATORY Anna University Lab Manual Download


141351 DIGITAL LABORATORY 
141351 DIGITAL SYSTEM LABORATORY      
141351 DIGITAL SYSTEM LABORATORY                  
141351 DIGITAL SYSTEM LABORATORY 
                                                  
LIST OF EXPERIMENTS
    1. Verification of Boolean theorems using digital logic gates
    2. Design and implementation of combinational circuits using basic gates for arbitrary functions, code converters, etc.
    3. Design and implementation of 4-bit binary adder / subtractor using basic gates and MSI devices
    4. Design and implementation of parity generator / checker using basic gates and MSI devices
    5. Design and implementation of magnitude comparator
    6. Design and implementation of application using multiplexers/ Demultiplexers
    7. Design and implementation of Shift registers
    8. Design and implementation of Synchronous and Asynchronous counters
    9. Simulation of combinational circuits using Hardware Description Language (VHDL/ Verilog HDL software required)
    10. Simulation of sequential circuits using HDL (VHDL/ Verilog HDL software required)

Friday, August 5, 2011

Anna University Of Technology Results May-June 2011 Results Announced

Anna University Of Technology Results May-June 2011 Results Announced


Anna University Of Technology Results May-June 2011 Results Announced


Anna University Of technology ResultsR for II semester second semester May -June 2011 Results has been announced


Click The Below Links To See Your Results


LINK:1CLICK HERE FOR RESULTS


LINK2:CLICK HERE FOR RESULTS


LINK3:CLICK HERE FOR RESULTS