data structure with types and small definition .
TOKEN RING
Popular posts from this blog
2 MARKS FOR DS & OOPS
1. What is an Algorithm? An algorithm is clearly specified set of simple instructions to be followed to solve a problem. The algorithm forms a base for program. 2. What are the properties of an Algorithm? _ Takes zero or more inputs _ Results in one or more outputs _ All operations are carried out in a finite time _ Efficient and flexible _ Should be concise and compact to facilitate verification of their correctness. 3. Define Program? It is an instruction and it is written according to the instructions, which is given in the algorithm. 4. What is Complexity analysis? It is the analysis of the amount of memory and time an algorithm requires to completion. There are two types of Complexity 1. Space Complexity 2. Time Complexity 5. Explain the performance analysis of the algorithm? The analysis of the performance of an algorithm based on specification is called performance analysis. It is loosely divided into a. Priori estimates b. Posterior Testing 6. Expl...
DS &OOPS LAB MANUAL
DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING LAB LAB MANUAL LIST OF EXPERIMENTS 1. Basic Programs for C++ Concepts 1. Area of a Circle Using Class 2. Find even or odd number Using Class 3. Print Fibonacci series using Constructors 4. Implementation of unary operator overloading 5. Implementation of Multiple inheritance 6. Find the mean value of a given number using friend function. 7. Implementation of Virtual function 8. To implement String Operations 2. Array implementation of List Abstract Data Type (ADT) 3. Linked list implementation of List ADT 4. Cursor implementation of List ADT 5. Stack ADT - Array and linked list implementations The next two exercises are to be done by implementing the following source files (a) ...
Comments
Post a Comment