0
Love and joy keep all New Zealanders.
Wiki User
∙ 12y ago
Add your answer:
Earn +20 pts
What word can you make from L A J K A N Z?
lajkanz
How would you arrange these letters into a name L A J K A N Z?
lajkanz
Dimag hai to is word ko tarteeb do L A J K A N Z?
Lajkanz
Implementation of data link layer such as character count in c?
#include <stdio.h> #include <string.h> void stuff(char str[40]); main() { char str[40]; int i; printf("\n enter the string:"); scanf("%s", &str); printf("\n the given string is:"); printf("\n %s", str); stuff(str); } void stuff(char str[40]) { int i, j, k = 0, l, n, z; printf("\n now we are stuffing the data::\n"); n = strlen(str); for (i = 0; i < n; i++) { if (str[i] == '1') { k = 1; for (l = i + 1; l <= i + 5; l++) { if (str[l] == '1') k++; else break; } if (k == 6) { i = i + 6; z = n + 1; for (j = z; j >= i; j--) { str[j] = str[j - 1]; } str[j] = '0'; } } } printf("\nThe resultant string after stuffing is..\n"); printf("%s\n", str); }
What could you spell using some or all of these letters L O K N N R Z?
l o k n n r z: lo no non nor kor or lorn zonk
Which letters in the alphabet have no lines of symmetry?
a b d e f F g G j J k L m n N p P q Q r R s S t u y z Z
What are some words that starts with J K L X and Z for Respiratory System?
L for larynx
How do you make a program to find out the saddle point in a matrix?
importjava.io.*; classsaddle { publicstaticvoidmain(Stringargs[])throwsIOException { inti,k,j,c1=0,t=0,c2=0,z=0; BufferedReader br=newBufferedReader(newInputStreamReader(System.in)); System.out.println("enter the number of rows in the matrix:"); intn=Integer.parseInt(br.readLine()); System.out.println("enter the number of columns in the matrix:"); intm=Integer.parseInt(br.readLine()); inta[][]=newint[n][m]; System.out.println("enter the elements of the matrix:"); for(i=0;i<n;i++)<span=""> { for(j=0;j<m;j++)<span=""> a[i][j]=Integer.parseInt(br.readLine()); } System.out.println("matrix is:"); for(i=0;i<n;i++)<span=""> { for(j=0;j<m;j++)<span=""> System.out.print(a[i][j]+" "); System.out.println(); } for(i=0;i<n;i++)<span=""> { for(j=0;j<m;j++)<span=""> { z=a[i][j]; c1=0; c2=0; for(k=0;k<m;k++)<span=""> { if(z<=a[i][k]) c1++; } for(k=0;k<n;k++)<span=""> { if(z>=a[k][j]) c2++; } if(c1==m&&c2==n) { t=1; System.out.println("saddle pt="+z); } } } if(t!=1) System.out.println("there is no saddle point"); } }
How many letters are between the letters M and G?
Going from A to Z, there are 5 letters (H, I, J, K, and L). Going forward to Z and back to A again, there are 19 (N through Z and A through F).
C language program to print Pascal Triangle?
#include <iostream.h> double fact(double n) { return (n > 1) ? n * fact(n - 1) : 1; } double ncr(int n, int r) { return fact(n) / (fact(r) * fact(n - r)); } int main() { for (int i = 0; i < 15; i++) { for (int j = 0; j <= i; j++) cout <<ncr(i, j) << ' '; cout << endl; } return 0; }
What is cleaning standard in four diamond hotel?
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z A B C D E F G H I J K L M N O P Q R S T U V W X Y Z A B C D E F G H I J K L M N O P Q R S T U V W X Y Z A B C D E F G H I J K L M N O P Q R S T U V W X Y Z A B C D E F G H I J K L M N O P Q R S T U V W X Y Z it is alot of work. good luck:)
Write a program to calculate follow in grammar in parsing?
#include<iostream.h> #include<conio.h> #include<string.h> int out(char,int n,char []); static char p[10][20]; char c[10]; int k=0; char final[10][20]; void main() { clrscr(); int n,i,j,flag,u,t=4,d=0,l,v; char a[10],first[10][20]; cout<<"\nEnter the no of productions: "; cin>>n; for(i=0;i<n;i++) { cin>>p[i]; } for(j=0;j<n;j++) { k=0; u=0; if(p[j][3]>='A'&&p[j][3]<='Z') { for(i=3;i<strlen(p[j]);i++) { flag=0; k=0; k=out(p[j][i],n,a); for(int l=0;l<k;l++) { if(a[l]=='^') flag=1; else first[j][u++]=a[l]; } if(flag==1) { if(i!=strlen(p[j])-1) { if(p[j][t]>='A'&&p[j][t]<='Z') { t++; continue; } else { first[j][u++]=p[j][t]; break; } } else { first[j][u++]='^'; } } else { break; } } } else { first[j][0]=p[j][3]; first[j][1]='\0'; } } t=0; for(int e=0;e<n;e++) { int flag=1; for(int i=0;i<t;i++) { if(c[i]==p[e][0]) { flag=0; break; } else { flag=1; } } if(flag==1) { c[t]=p[e][0]; d=0; for(int f=0;f<n;f++) { if(p[e][0]==p[f][0]) { for(int o=0;o<strlen(first[f]);o++) { final[t][d++]=first[f][o]; } final[t][d]='\0'; } } t++; } } for(i=0;i<t;i++) cout<<"First of "<<c[i]<<"is : "<<final[i]<<"\n"; //Code to find follow cout<<"\n\nFOLLOW\n"; for(i=0;i<strlen(c);i++) { cout<<"\nFollow of "<<c[i]<<"is :"; if(i==0) cout<<'$'<<" "; for(j=0;j<n;j++) { for(k=3;k<strlen(p[j]);k++) { if(c[i]==p[j][k]) { if(k!=strlen(p[j])-1) { for(l=k+1;l<strlen(p[j]);l++) { flag=0; if(p[j][l]>='A'&&p[j][l]<='Z') { for(u=0;u<strlen(c);u++) { if(c[u]==p[j][l]) break; } for(v=0;v<strlen(c);v++) { if(final[u][v]=='^') flag=1; else cout<<final[u][v]<<" "; } if(flag==1) { if(l==strlen(p[j])-1) cout<<"Follow of "<<p[j][0]<<" "; else continue; } else { break; } } else { cout<<p[j][l]; break; } } } else { cout<<"Follow of "<<p[j][0]<<" "; } } } } } getch(); } int out(char c,int n,char a[]) { for(int i=0;i<n;i++) { if(p[i][0]==c) { if(p[i][3]>='A'&&p[i][3]<='Z') { out(p[i][3],n,a); } else a[k++]=p[i][3]; } } return k; }
