SOME COMPUTER STUFF ON C,JAVA,TALLY,BCA,SOLVED PAPERS

RULES OF DOUBLE ENTRY SYSTEM PERSONAL A/C - DR. THE DEBTOR                                           CR. THE CREDITOR REAL A/C - DR. WHAT COMES IN                                 CR. WHAT GOES OUT  NOMINAL A/C -  DR. ALL EXPENSES AND LOSSES                                           CR. ALL INCOMES AND GAINS  PRACTICAL QUESTIONS CASH BORROWED FROM KAPIL RS. 10,000 CASH A/c  TO KAPIL  MONEY LENT TO SACHIN RS. 2,000 SACHIN A/c TO CASH A/c FURNITURE PURCHASED RS. 1,000 FURNITURE A/c TO CASH A/c GOODS PURCHASED RS. 3,000 PURCHASES A/c TO CASH A/c SALARY PAID TO VERU RS. 500 SALARY A/c TO CASH A/c ...

a<- -1 b<- -1 c<- -0 fib(a,b) { c=a+b if(c<=n) {print c fib(b.c) } }

Towers Of  Hanoi // to move all disks from peg 1 to peg 3 // you just have to move n-1 disks to peg2 // and then nth disk to peg 3 // and then n-1 disks to peg 3 towers(ndisks,source,temp,destination,) if(ndisks <>0) { towers(ndisks-1,source, destination,temp) move  disk from source to destination towers(ndisks-1,temp,source, destination) }

CLASSIFICATION OF ASSETS ON THE BASIS OF CONVERTIBILITY TO CASH  FIXED ASSETS: THE ASSETS WHICH ARE PURCHASED OR ACQUIRED FOR LONG TERM USES. EX: BUILDING,PLANT,MACHINERY,FURNITURE ETC. CURRENT ASSETS; THE ASSETS WHICH ARE ALREADY IN THE FORM OF CASH OR WHICH CAN BE CONVERTED INTO CASH WITHIN A YEAR. EX: CASH,DEBTORS,BANK BALANCE,CLOSING STOCK ETC.. ON THE BASIS OF PHYSICAL EXISTENCE TANGIBLE : EX: BUILDING,PLANT,MACHINERY,CASH INTANGIBLE: EX: GOODWILL,PATENT,COPYRIGHT

OBJECTIVES OF ACCOUNTING To keep the systematic record To settle down the disputes For the proper classification of various heads To ascertain the profit and loss of the year  For the decision making To communicate the necessary information to various users To know the financial position of the year For the comparative study of : Intra firm comparision Inter firm comparision RECEIPTS INFLOW OF CASH REVENUE NATURED CAPITAL NATURED ACCOUNTING CONCEPTS MONEY MEASUREMENT CONCEPT  GOING CONCERN CONCEPT  SEPARATE ENTITY  ACCOUNTING PERIOD CONCEPT  DUAL ASPECT CONCEPT/ACCOUNTING EQUATION CONCEPT OF CONSERVATISM/CONCEPT OF PRUDENCE MATCHING CONCEPT/ACCRUAL CONCEPT MATERIALITY CONCEPT  CONCEPT OF FULL DISCLOSURE  COST CONCEPT/HISTORICAL COST CONCEPT CONCEPT OF TIMELINESS CONCEPT OF REVENUE RECOGNITION  CONCEPT OF SUBSTANCE OVERFORM CONCEPT OF CONSISTENCY

ACCOUNTING It is an art of recording,classifying and summarising the financial natured transactions and events in such a way. So as to get the meaningful information in future. VARIOUS TERMS COMMONLY USED IN ACCOUNTING  CAPITAL: It refers to the amount invested by the proprietor into the business DRAWINGS :  Amount kept by the proprietor for the personal purpose or any amount withdrawn by the proprietor from the business for personal use  GOODS : The commodity in which we deal on regular basis. The types are : Purchase A/c Sales A/c Purchase return A/c Sales return A/c

LIST OF PROGRAMS #include<stdio.h> #include<conio.h> int binary(int ,int ); int a[10],md,s,c=0; void main() { int n,i; clrscr(); printf("ENTER LIMIT \n"); scanf("%d",&n); printf("ENTER ARRAY\n"); for(i=0;i<n;i++) { fflush(stdin); scanf("%d",&a[i]); } printf("ENTER NUMBER TO BE SEARCHED"); scanf("%d",&s); c=binary(0,n-1); if(c==-1) printf("NOT FOUND"); getch(); } int binary(int f,int l) {  md=(f+l)/2; if(f>l) { return(-1); } else if (a[md]<s) return(binary(md+1,l)); else if(a[md]==s) {printf("Found AT LOCATION %d IN WHICH 0 IS THE STARTING ADDRESS",md); return (1); } else return(binary(f,md-1)); } LIST OF PROGRAMS

LIST OF PROGRAMS #include<stdio.h> #include<conio.h> void main() { int i,j; int a[100][100],sum=0,sum2=0,no2,no3,no; clrscr(); printf("enter rows and columns of 1st array:- \n "); scanf("%d",&no); scanf("%d",&no2); no3=no-1; if(no==no2) { printf("ENTER NUMBERS IN ARRAY \n"); for(i=0;i<no;i++) for(j=0;j<no2;j++)  { fflush(stdin); scanf("%d",&a[i][j]);  } printf("ENTERED ARRAY \n"); for(i=0;i<no;i++)    { for(j=0;j<no2;j++) printf("\t %d",a[i][j]); printf("\n");     } for(i=0;i<no;i++) sum+=a[i][i]; for(i=0;i<no;i++) sum2+=a[i][no3-1]; printf("\nSUM OF LEFT DIAGONAL %d",sum); printf("\nSUM OF RIGHT DIAGONAL %d",sum2); } else printf("WRONG INPUT"); getch(); } LIST OF PROGRAMS