Thursday, 22 October 2015
Sunday, 4 October 2015
Algorithm Paradigm: Backtracking
Time Complexity: O(n*n!)
[ Read More ]
The string that is returned will have the following format:
[ Read More ]
Write a C program to print all permutations of a given string
A permutation, also called an “arrangement number” or “order,” is a
rearrangement of the elements of an ordered list S into a one-to-one
correspondence with S itself. A string of length n has n! permutation.
Below are the permutations of string ABC.
ABC, ACB, BAC, BCA, CAB, CBA
Here is a solution using backtracking.
Output:
Below are the permutations of string ABC.
ABC, ACB, BAC, BCA, CAB, CBA
Here is a solution using backtracking.
// C program to print all permutations with duplicates allowed #include <stdio.h> #include <string.h> /* Function to swap values at two pointers */ void swap( char *x, char *y) { char temp; temp = *x; *x = *y; *y = temp; } /* Function to print permutations of string This function takes three parameters: 1. String 2. Starting index of the string 3. Ending index of the string. */ void permute( char *a, int l, int r) { int i; if (l == r) printf ( "%s\n" , a); else { for (i = l; i <= r; i++) { swap((a+l), (a+i)); permute(a, l+1, r); swap((a+l), (a+i)); //backtrack } } } /* Driver program to test above functions */ int main() { char str[] = "ABC" ; int n = strlen (str); permute(str, 0, n-1); return 0; } |
ABC ACB BAC BCA CBA CAB
Algorithm Paradigm: Backtracking
Time Complexity: O(n*n!)
programe to find date and time of system
#include <time.h>
#include <stdio.h>
int main(void) { time_t mytime; mytime = time(NULL); printf(ctime(&mytime)); return 0; }
Www Mmm dd hh:mm:ss yyyy
Www = which day of the week.
Mmm = month in letters.
dd = the day of the month.
hh:mm:ss = the time in hour, minutes, seconds.
yyyy = the year.
Output example:
Tue Feb 26 09:01:47 2009
Thursday, 1 October 2015
[ Read More ]
c programe to count no of set bit in an integer
#anki
#include<stdio.h>
void main()
{
int i,count=0;
printf("enter the value");
scanf("%d",&i);
while(i)
{
if((i & 1)==1) count++;
i=i>>1;
}
printf("count =%d",count);
getch();
}
#include<stdio.h>
void main()
{
int i,count=0;
printf("enter the value");
scanf("%d",&i);
while(i)
{
if((i & 1)==1) count++;
i=i>>1;
}
printf("count =%d",count);
getch();
}
Thursday, 24 September 2015
[ Read More ]
[ Read More ]
C Program to display current date
#include <dos.h>
#include <stdio.h>
int main(void)
{
struct date d;
getdate(&d);
printf(“The current year is: %d\n”, d.da_year);
printf(“The current day is: %d\n”, d.da_day);
printf(“The current month is: %d\n”, d.da_mon);
return 0;
}
#include <stdio.h>
int main(void)
{
struct date d;
getdate(&d);
printf(“The current year is: %d\n”, d.da_year);
printf(“The current day is: %d\n”, d.da_day);
printf(“The current month is: %d\n”, d.da_mon);
return 0;
}
C Program to Set / Change current system date
#include <stdio.h>
#include <dos.h>
int main(void)
{
struct time t;
gettime(&t);
printf(“The current hour is: %d\n”, t.ti_hour);
printf(“The current min is: %d\n”, t.ti_min);
printf(“The current second is: %d\n”, t.ti_sec);
/* Add one to the hour,minute & sec struct element and then call settime */
t.ti_hour++;
t.ti_min++;
t.ti_sec++;
settime(&t);
printf(“The current hour is: %d\n”, t.ti_hour);
printf(“The current min is: %d\n”, t.ti_min);
printf(“The current second is: %d\n”, t.ti_sec);
return 0;
}
#include <dos.h>
int main(void)
{
struct time t;
gettime(&t);
printf(“The current hour is: %d\n”, t.ti_hour);
printf(“The current min is: %d\n”, t.ti_min);
printf(“The current second is: %d\n”, t.ti_sec);
/* Add one to the hour,minute & sec struct element and then call settime */
t.ti_hour++;
t.ti_min++;
t.ti_sec++;
settime(&t);
printf(“The current hour is: %d\n”, t.ti_hour);
printf(“The current min is: %d\n”, t.ti_min);
printf(“The current second is: %d\n”, t.ti_sec);
return 0;
}
Wednesday, 23 September 2015
[ Read More ]
And here is the code.
[ Read More ]
Enter and print details of n employees using structures and dynamic memory allocation
Enter and print details of n employees using structures and dynamic memory allocation
This program is used to show the most basic use of structures. The structure is made of a character array name[], integer age and float salary. We’ll make an array of the structure for the employees. We’ll also use dynamic memory allocation using malloc. You can also use a linked list to the same which is a better option. Let’s check the code.#include #include typedef struct { //structure of emp char name[30]; int age; float salary; }emp; int main(){ int n,i; emp *employee; printf ( "Enter no of employees: " ); scanf ( "%d" ,&n); employee=(emp*) malloc (n* sizeof (emp)); //dynamic memory allocation using malloc() for (i=0;i<n;i++){ printf ( "\n\nEnter details of employee %d\n" ,i+1); printf ( "Enter name: " ); scanf ( "%s" ,employee[i].name); printf ( "Enter age: " ); scanf ( "%d" ,&employee[i].age); printf ( "Enter salary: " ); scanf ( "%f" ,&employee[i].salary); } printf ( "\nPrinting details of all the employees:\n" ); for (i=0;i<n;i++){ printf ( "\n\nDetails of employee %d\n" ,i+1); printf ( "\nName: %s" ,employee[i].name); printf ( "\nAge: %d" ,employee[i].age); printf ( "\nSalary: %.2f" ,employee[i].salary); } getch(); return 0; } |
Patterns (one of their favorites)
Patterns (one of their favorites)
If the interviewer asks you a pattern and you don’t know how to do that you are screwed big time. Often you might make a very simple mistake which the interviewer was actually looking for. Here we’ll find out how to print this pattern
1
2
3
4
5
| A B C D E D C B A A B C D C B A A B C B A A B A A |
01
02
03
04
05
06
07
08
09
10
11
12
13
14
15
16
17
18
19
20
21
| //Printing pattern #include #include int main(){ int n,i,j; printf ( "Enter no of lines: " ); scanf ( "%d" ,&n); for (i=0;i<n;i++){ for (j=0;j<i;j++){ //for printing spaces printf ( " " ); } for (j=0;j<n-i;j++){ //for printing the left side printf ( "%c " , 'A' +j); //the value of j is added to 'A'(ascii value=65) } for (j=n-i-2;j>=0;j--){ //for printing the right side printf ( "%c " , 'A' +j); } printf ( "\n" ); } getch(); } |
Tuesday, 15 September 2015
[ Read More ]
easiest way to sort
#include <stdio.h> #include <stdlib.h> int values[] = { 88, 56, 100, 2, 25 }; int cmpfunc (const void * a, const void * b) { return ( *(int*)a - *(int*)b ); } int main() { int n; printf("Before sorting the list is: \n"); for( n = 0 ; n < 5; n++ ) { printf("%d ", values[n]); } qsort(values, 5, sizeof(int), cmpfunc); printf("\nAfter sorting the list is: \n"); for( n = 0 ; n < 5; n++ ) { printf("%d ", values[n]); } return(0); }
output
Before sorting the list is:
88 56 100 2 25
After sorting the list is:
2 25 56 88 100
Friday, 11 September 2015
[ Read More ]
number of ways a particular no can formed..
#include<stdio.h>
// Returns the count of ways we can sum S[0...m-1] coins to get sum n
int count( int S[], int m, int n )
{
// If n is 0 then there is 1 solution (do not include any coin)
if (n == 0)
return 1;
// If n is less than 0 then no solution exists
if (n < 0)
return 0;
// If there are no coins and n is greater than 0, then no solution exist
if (m <=0 && n >= 1)
return 0;
// count is sum of solutions (i) including S[m-1] (ii) excluding S[m-1]
return count( S, m - 1, n ) + count( S, m, n-S[m-1] );
}
// Driver program to test above function
int main()
{
int i, j;
int arr[] = {1, 3, 5};
int m = sizeof(arr)/sizeof(arr[0]);
printf("%d ", count(arr, m, 5));
getchar();
return 0;
}
It should be noted that the above function computes the same subproblems again and again. See the following recursion tree for S = {1, 2, 3} and n = 5.
The function C({1}, 3) is called two times. If we draw the complete tree, then we can see that there are many subproblems being called more than once.
// Returns the count of ways we can sum S[0...m-1] coins to get sum n
int count( int S[], int m, int n )
{
// If n is 0 then there is 1 solution (do not include any coin)
if (n == 0)
return 1;
// If n is less than 0 then no solution exists
if (n < 0)
return 0;
// If there are no coins and n is greater than 0, then no solution exist
if (m <=0 && n >= 1)
return 0;
// count is sum of solutions (i) including S[m-1] (ii) excluding S[m-1]
return count( S, m - 1, n ) + count( S, m, n-S[m-1] );
}
// Driver program to test above function
int main()
{
int i, j;
int arr[] = {1, 3, 5};
int m = sizeof(arr)/sizeof(arr[0]);
printf("%d ", count(arr, m, 5));
getchar();
return 0;
}
It should be noted that the above function computes the same subproblems again and again. See the following recursion tree for S = {1, 2, 3} and n = 5.
The function C({1}, 3) is called two times. If we draw the complete tree, then we can see that there are many subproblems being called more than once.
C() --> count() C({1,2,3}, 5) / \ / \ C({1,2,3}, 2) C({1,2}, 5) / \ / \ / \ / \ C({1,2,3}, -1) C({1,2}, 2) C({1,2}, 3) C({1}, 5) / \ / \ / \ / \ / \ / \ C({1,2},0) C({1},2) C({1,2},1) C({1},3) C({1}, 4) C({}, 5) / \ / \ / \ / \ / \ / \ / \ / \ . . . . . . C({1}, 3) C({}, 4) / \ / \
Monday, 31 August 2015
[ Read More ]
[ Read More ]
[ Read More ]
C Program to delete a file.
#include<stdio.h> #include<conio.h> #include<stdlib.h> void main() { int status; char name[25]; clrscr(); printf("Enter the name of file you want to delete\n"); gets(name); status=remove(name); if(status==0) { printf("%s file deleted successfully.\n",name); } else { printf("Unable to delete the file\n"); } getch(); }
C Program to merge 2 files
#include<stdio.h> #include<conio.h> #include<stdlib.h> void main() { FILE *fs1,*fs2,*ft; char ch,file1[20],file2[20],file3[20]; clrscr(); printf("Enter name of first file\n"); gets(file1); printf("Enter name of second file\n"); gets(file2); printf("Enter name of file which'll store contents:\n"); gets(file3); fs1=fopen(file1,"r"); fs2 = fopen(file2,"r"); if(fs1==NULL || fs2==NULL ) { printf("Error opening file\n"); getch(); exit(1); } ft=fopen(file3,"w"); if(ft==NULL ) { printf("Error opening file\n"); exit(1); } while((ch=fgetc(fs1))!=EOF) fputc(ch,ft); while((ch=fgetc(fs2))!=EOF) fputc(ch,ft); printf("Two files were merged into %s file \n",file3); fclose(fs1); fclose(fs2); fclose(ft); getch(); }
C Program to count characters, lines, spaces & tabs in a file
#include<stdio.h> #include<conio.h> #include<stdlib.h> void main() { FILE *fp; char a[20]; int nol=0,not=0,nob=0,noc=0; char c; clrscr(); printf("Enter the name of File:\n"); gets(a); if((fp=fopen(a,"r"))==NULL) { printf("File dosen't exist."); } else { while(1) { c=fgetc(fp); if(c==EOF) break; noc++; if(c==' ') nob++; if(c=='\n') nol++; if(c=='\t') not++; } } fclose(fp); printf("Number of characters = %d\n",noc); printf("Number of blanks = %d\n",nob); printf("Number of tabs = %d\n",not); printf("Number of lines = %d\n",nol); getch(); }
Saturday, 29 August 2015
How to find size of integer data type without using sizeof operator in c programming language
[ Read More ]
[ Read More ]
[ Read More ]
[ Read More ]
[ Read More ]
[ Read More ]
[ Read More ]
[ Read More ]
How to find size of integer data type without using sizeof operator in c programming language
How to find size of integer data type without using sizeof operator in c programming language
#include<stdio.h>
int main(){
int *ptr = 0;
ptr++;
printf("Size of int data type:
%d",ptr);
return 0;
}
How to read STRING FROM text file by c program
#include<stdio.h>
int main(){
char str[70];
FILE *p;
if((p=fopen("string.txt","r"))==NULL){
printf("\nUnable t open file
string.txt");
exit(1);
}
while(fgets(str,70,p)!=NULL)
puts(str);
fclose(p);
return 0;
}
COPY DATA FROM ONE FILE TO ANOTHER FILE USING C PROGRAM
#include<stdio.h>
int main(){
FILE *p,*q;
char file1[20],file2[20];
char ch;
printf("\nEnter the source file name to be copied:");
gets(file1);
p=fopen(file1,"r");
if(p==NULL){
printf("cannot open %s",file1);
exit(0);
}
printf("\nEnter the destination file name:");
gets(file2);
q=fopen(file2,"w");
if(q==NULL){
printf("cannot open %s",file2);
exit(0);
}
while((ch=getc(p))!=EOF)
putc(ch,q);
printf("\nCOMPLETED");
fclose(p);
fclose(q);
return 0;
}
C code which prints initial of any name
C code which prints initial of any name
#include<stdio.h>
int main(){
char str[20];
int i=0;
printf("Enter a string: ");
gets(str);
printf("%c",*str);
while(str[i]!='\0'){
if(str[i]==' '){
i++;
printf("%c",*(str+i));
}
i++;
}
return 0;
}
Sample output:
Enter a string: ANKITHA GOWDA
AG
Program for sorting of string in c language
Program
for sorting of string in c language
#include<stdio.h>
int main(){
int i,j,n;
char str[20],temp[20];
puts("Enter the no. of string to be sorted");
scanf("%d",&n);
for(i=0;i<=n;i++)
gets(str[i]);
for(i=0;i<=n;i++)
for(j=i+1;j<=n;j++){
if(strcmp(str[i],str[j])>0){
strcpy(temp,str[i]);
strcpy(str[i],str[j]);
strcpy(str[j],temp);
}
}
printf("The sorted string\n");
for(i=0;i<=n;i++)
puts(str[i]);
return 0;
}
Write a c program to find largest among three numbers using conditional operator
Write
a c program to find largest among three numbers using conditional operator
#include<stdio.h>
int main(){
int a,b,c,big;
printf("\nEnter 3 numbers:");
scanf("%d %d %d",&a,&b,&c);
big=(a>b&&a>c?a:b>c?b:c);
printf("\nThe biggest number is: %d",big);
return 0;
}
Write a c program to find largest among three numbers using binary minus operator
Write a c program to find largest among three numbers using binary minus operator.
#include<stdio.h>
int main(){
int a,b,c;
printf("\nEnter
3 numbers: ");
scanf("%d %d
%d",&a,&b,&c);
if(a-b>0
&& a-c>0)
printf("\nGreatest
is a :%d",a);
else
if(b-c>0)
printf("\nGreatest
is b :%d",b);
else
printf("\nGreatest
is c :%d",c);
return 0;
}
C program to display ASCII values
Printing
ascii value using c program
C code for
ASCII table
C program to display ASCII values
#include<stdio.h>
int main(){
int i;
for(i=0;i<=255;i++)
printf("ASCII value of character
%c: %d\n",i,i);
return 0;
}
Output:
ASCII value of character : 0
ASCII value of character ☺: 1
ASCII value of character ☻: 2
ASCII value of character ♥: 3
ASCII value of character ♦: 4
ASCII value of character ♣: 5
ASCII value of character ♠: 6
ASCII value of character : 7
ASCII value of character: 8
ASCII value of character :
ASCII value of character
: 10
ASCII value of character ♂: 11
ASCII value of character ♀: 12
: 13I value of character
ASCII value of character ♫: 14
ASCII value of character ☼: 15
ASCII value of character ►: 16
ASCII value of character ◄: 17
ASCII value of character ↕: 18
ASCII value of character ‼: 19
ASCII value of character ¶: 20
ASCII value of character §: 21
ASCII value of character ▬: 22
ASCII value of character ↨: 23
ASCII value of character ↑: 24
ASCII value of character ↓: 25
ASCII value of character →: 26
ASCII value of character ←: 27
ASCII value of character ∟: 28
ASCII value of character ↔: 29
ASCII value of character ▲: 30
ASCII value of character ▼: 31
ASCII value of character : 32
ASCII value of character !: 33
ASCII value of character ": 34
ASCII value of character #: 35
ASCII value of character $: 36
ASCII value of character %: 37
ASCII value of character &: 38
ASCII value of character ': 39
ASCII value of character (: 40
ASCII value of character ): 41
ASCII value of character *: 42
ASCII value of character +: 43
ASCII value of character ,: 44
ASCII value of character -: 45
ASCII value of character .: 46
ASCII value of character /: 47
ASCII value of character 0: 48
ASCII value of character 1: 49
ASCII value of character 2: 50
ASCII value of character 3: 51
ASCII value of character 4: 52
ASCII value of character 5: 53
ASCII value of character 6: 54
ASCII value of character 7: 55
ASCII value of character 8: 56
ASCII value of character 9: 57
ASCII value of character :: 58
ASCII value of character ;: 59
ASCII value of character <: 60
ASCII value of character =: 61
ASCII value of character >: 62
ASCII value of character ?: 63
ASCII value of character @: 64
ASCII value of character A: 65
ASCII value of character B: 66
ASCII value of character C: 67
ASCII value of character D: 68
ASCII value of character E: 69
ASCII value of character F: 70
ASCII value of character G: 71
ASCII value of character H: 72
ASCII value of character I: 73
ASCII value of character J: 74
ASCII value of character K: 75
ASCII value of character L: 76
ASCII value of character M: 77
ASCII value of character N: 78
ASCII value of character O: 79
ASCII value of character P: 80
ASCII value of character Q: 81
ASCII value of character R: 82
ASCII value of character S: 83
ASCII value of character T: 84
ASCII value of character U: 85
ASCII value of character V: 86
ASCII value of character W: 87
ASCII value of character X: 88
ASCII value of character Y: 89
ASCII value of character Z: 90
ASCII value of character [: 91
ASCII value of character \: 92
ASCII value of character ]: 93
ASCII value of character ^: 94
ASCII value of character _: 95
ASCII value of character `: 96
ASCII value of character a: 97
ASCII value of character b: 98
ASCII value of character c: 99
ASCII value of character d: 100
ASCII value of character e: 101
ASCII value of character f: 102
ASCII value of character g: 103
ASCII value of character h: 104
ASCII value of character i: 105
ASCII value of character j: 106
ASCII value of character k: 107
ASCII value of character l: 108
ASCII value of character m: 109
ASCII value of character n: 110
ASCII value of character o: 111
ASCII value of character p: 112
ASCII value of character q: 113
ASCII value of character r: 114
ASCII value of character s: 115
ASCII value of character t: 116
ASCII value of character u: 117
ASCII value of character v: 118
ASCII value of character w: 119
ASCII value of character x: 120
ASCII value of character y: 121
ASCII value of character z: 122
ASCII value of character {: 123
ASCII value of character |: 124
ASCII value of character }: 125
ASCII value of character ~: 126
ASCII value of character ⌂: 127
ASCII value of character Ç: 128
ASCII value of character ü: 129
ASCII value of character é: 130
ASCII value of character â: 131
ASCII value of character ä: 132
ASCII value of character à: 133
ASCII value of character å: 134
ASCII value of character ç: 135
ASCII value of character ê: 136
ASCII value of character ë: 137
ASCII value of character è: 138
ASCII value of character ï: 139
ASCII value of character î: 140
ASCII value of character ì: 141
ASCII value of character Ä: 142
ASCII value of character Å: 143
ASCII value of character É: 144
ASCII value of character æ: 145
ASCII value of character Æ: 146
ASCII value of character ô: 147
ASCII value of character ö: 148
ASCII value of character ò: 149
ASCII value of character û: 150
ASCII value of character ù: 151
ASCII value of character ÿ: 152
ASCII value of character Ö: 153
ASCII value of character Ü: 154
ASCII value of character ¢: 155
ASCII value of character £: 156
ASCII value of character ¥: 157
ASCII value of character ₧: 158
ASCII value of character ƒ: 159
ASCII value of character á: 160
ASCII value of character í: 161
ASCII value of character ó: 162
ASCII value of character ú: 163
ASCII value of character ñ: 164
ASCII value of character Ñ: 165
ASCII value of character ª: 166
ASCII value of character º: 167
ASCII value of character ¿: 168
ASCII value of character ⌐: 169
ASCII value of character ¬: 170
ASCII value of character ½: 171
ASCII value of character ¼: 172
ASCII value of character ¡: 173
ASCII value of character «: 174
ASCII value of character »: 175
ASCII value of character ░: 176
ASCII value of character ▒: 177
ASCII value of character ▓: 178
ASCII value of character │: 179
ASCII value of character ┤: 180
ASCII value of character ╡: 181
ASCII value of character ╢: 182
ASCII value of character ╖: 183
ASCII value of character ╕: 184
ASCII value of character ╣: 185
ASCII value of character ║: 186
ASCII value of character ╗: 187
ASCII value of character ╝: 188
ASCII value of character ╜: 189
ASCII value of character ╛: 190
ASCII value of character ┐: 191
ASCII value of character └: 192
ASCII value of character ┴: 193
ASCII value of character ┬: 194
ASCII value of character ├: 195
ASCII value of character ─: 196
ASCII value of character ┼: 197
ASCII value of character ╞: 198
ASCII value of character ╟: 199
ASCII value of character ╚: 200
ASCII value of character ╔: 201
ASCII value of character ╩: 202
ASCII value of character ╦: 203
ASCII value of character ╠: 204
ASCII value of character ═: 205
ASCII value of character ╬: 206
ASCII value of character ╧: 207
ASCII value of character ╨: 208
ASCII value of character ╤: 209
ASCII value of character ╥: 210
ASCII value of character ╙: 211
ASCII value of character ╘: 212
ASCII value of character ╒: 213
ASCII value of character ╓: 214
ASCII value of character ╫: 215
ASCII value of character ╪: 216
ASCII value of character ┘: 217
ASCII value of character ┌: 218
ASCII value of character █: 219
ASCII value of character ▄: 220
ASCII value of character ▌: 221
ASCII value of character ▐: 222
ASCII value of character ▀: 223
ASCII value of character α: 224
ASCII value of character ß: 225
ASCII value of character Γ: 226
ASCII value of character π: 227
ASCII value of character Σ: 228
ASCII value of character σ: 229
ASCII value of character µ: 230
ASCII value of character τ: 231
ASCII value of character Φ: 232
ASCII value of character Θ: 233
ASCII value of character Ω: 234
ASCII value of character δ: 235
ASCII value of character ∞: 236
ASCII value of character φ: 237
ASCII value of character ε: 238
ASCII value of character ∩: 239
ASCII value of character ≡: 240
ASCII value of character ±: 241
ASCII value of character ≥: 242
ASCII value of character ≤: 243
ASCII value of character ⌠: 244
ASCII value of character ⌡: 245
ASCII value of character ÷: 246
ASCII value of character ≈: 247
ASCII value of character °: 248
ASCII value of character ∙: 249
ASCII value of character ·: 250
ASCII value of character √: 251
ASCII value of character ⁿ: 252
ASCII value of character ²: 253
ASCII value of character ■: 254
ASCII value of character : 255
Subscribe to:
Posts (Atom)