#include<iostrema.h> class number { int x, y; public: number() { x = 0; y = 0; } number(int a, int b) { x = a; y = b; } void display() { cout<<“\n x: “<<x; cout<<“\n y: “<<y<<endl; } void operator = (number n1) { x = n1.x; y = n1.y; } }; int main() […]
#include<iostream.h> #include<math.h> class rect { private: float x, y, r, t; public: rect(); void polar(); void disp(); }; rect::rect() { cout<<“\n Enter x cordinate: “; cin>>x; cout<<“\n Enter the y cordinate: “; cin>>y; } void rect::polar() { r = sqrt(x*x+y*y); if(y<0) { if(x<0) { t = 180+tan(y/x)*180/3.14159265; } else t = tan(y/x)*180/3/14159265; } if(x>0 && […]
#include class matrix { private: int m, z[10][10]; public: int i, j, k; void getdata(); { cout<<“Enter the order of the square matrix: “; cin>m; cout<<“Enter the “<<m<<“*”<<m<<” elements: “<<endl; for(i=0;i<m;i++) for(j=0;j<m;j++) cin>>z[i][j]; } friend int check(matrix a, matrix b) { if(a.m == b.m) return 1; else return 0; } void display() { cout<<“Size is […]
#include<iostream.h> #include<stdlib.h> #include<math.h> class menu { private: long m, n; int i, rem; float ans; public: void reverse() { x: cout<<“Enter the number: “; cin>>m; if(m<1) { cout<<“Please enter the number greater than zero!!”<<endl; goto x; } n = m; ans = 0; while(m > 0) { rem = m%10; ans = ans*10+rem; m = […]
#include<iostream.h> class fib { int n; public: fib(int a) { n = a; } fib() { n = 0; } void display() { if(n == 0) { cout<“\n No fibonacci number\n”; retun; } else if(n == 1) { cout<<“Fibonacci numbers are\n”<<“0″<<endl; return; } else if(n>2) { cout<<“Fibonacci numbers are\n”<<“0\t1”; } if f1=0,f2=1,f3,cnt; for(cnt = 1;cnt […]
PROCEDURE: We make use of the following two functions in the process. look up() – it takes string as argument and checks its presence in the symbol table. If the string is found then returns the address else it returns NULL. insert() – it takes string as its argument and the same is inserted into […]
#include<iostream.h> #include<iomanip.h> class insertion { private: int n, m[100], ele, p; public: void getdata(); void insert(); void display(); }; void insertion::getdata() { cout<<“How many elements?”; cin>>n; cout<<“Enter the elements: “; for(int i=0; i<n; i++) cin>>m[i]; cout<<“Enter the element to be inserted:”; cin>>ele; cout<<“Enter the position (0 to “<<n<<“):”; cin>>p; } void insertion::insert() { if(p>n) { cout<<p<<“is an invalid position”; exit(0); } else { for(int i=n-1; i>=p; i–) m[i+1] = m[i]; m[p] = ele; n = n+1; cout<<ele<<” is successfully inserted”<<endl; } } void insertion::display() { cout<<“The array after the insertion is “; for(int i=0; i<n; i++) cout<<setw(4)<<m[i]; } void […]
➔ In an effort to reduce memory requirements in raster systems, methods have been devised for organizing the frame buffer as a linked list and encoding the color information. ➔ One organization scheme is to store each scan line as a set of number pairs. ➔ Encoding methods can be useful in the digital storage […]
Figure shows one way to organize the components of a raster system that contains a separate display processor, sometimes referred to as a graphics controller or a display coprocessor. Scan conversion: A major task of the display processor is digitizing a picture definition given in an application program into a set of pixel values for […]
✓ The basic refresh operations of the video controller are diagrammed ✓ Two registers are used to store the coordinate values for the screen pixels ✓ Initially, the x register is set to 0 and the y register is set to the value for the top scan line. ✓ The contents of the frame buffer […]
