Huffman's Algorithm
Huffman's Algorithm
Showing posts with label c program. Show all posts
I know u most aware with turbo c
language.This compiler is easily full screened with XP.
But we can not use it in full
screen in win 7 and win vista.
so we need software having name
dosbox for that.but in this trick i will just give instruction how to make
Turbo C in Full screen without any software
|
Steps :
|
|
Step 1 : go to
c:/tc/bin and find tc.exe
|
|
Step 2 : Right
click on tc.exe and go to properties
|
|
Step 3 : in the
properties go to Screen Tab
|
|
Step 4 : in
Screen tab u got option about Usage in that properties click on windows
instead of Full screen.
|
|
Step 5 :after
that run tc.exe, click ignore if ask (if not then do nothing) it will open it
in normal small window.
|
|
Step 6 :right
click on the border and go to properties.then move to fonts tab.
|
|
Step 7 : select
lucida console and size 28
|
Enjoy
I know u most aware with turbo c
language.This compiler is easily full screened with XP.
But we can not use it in full
screen in win 7 and win vista.
so we need software having name
dosbox for that.but in this trick i will just give instruction how to make
Turbo C in Full screen without any software
|
Steps :
|
|
Step 1 : go to
c:/tc/bin and find tc.exe
|
|
Step 2 : Right
click on tc.exe and go to properties
|
|
Step 3 : in the
properties go to Screen Tab
|
|
Step 4 : in
Screen tab u got option about Usage in that properties click on windows
instead of Full screen.
|
|
Step 5 :after
that run tc.exe, click ignore if ask (if not then do nothing) it will open it
in normal small window.
|
|
Step 6 :right
click on the border and go to properties.then move to fonts tab.
|
|
Step 7 : select
lucida console and size 28
|
Enjoy
/* Program for showing various operations on a queue represented
using circular linked list. */.
output :>
1. Insert
2. Delete
3. Print
4. Front element
5. Rear Element
6. Quit
6. Quit
Enter your option: 1
Enter queue data : 23
1. Insert
2. Delete
3. Print
4. Front element
5. Rear Element
6. Quit
6. Quit
Enter your option: 1
Enter queue data : 34
1. Insert
2. Delete
3. Print
4. Front element
5. Rear Element
6. Quit
Enter your option: 1
Enter queue data : 45
1. Insert
2. Delete
3. Print
4. Front element
5. Rear Element
6. Quit
Enter your option: 3
23 34 45
1. Insert
2. Delete
3. Print
4. Front element
5. Rear Element
6. Quit
Enter your option: 4
Front Element = 23
1. Insert
2. Delete
3. Print
4. Front element
5. Rear Element
6. Quit
Enter your option: 5
Rear Element = 45
1. Insert
2. Delete
3. Print
4. Front element
5. Rear Element
6. Quit
Enter your option: 6
/* Program for showing various operations on a queue represented
using circular linked list. */.
output :>
1. Insert
2. Delete
3. Print
4. Front element
5. Rear Element
6. Quit
6. Quit
Enter your option: 1
Enter queue data : 23
1. Insert
2. Delete
3. Print
4. Front element
5. Rear Element
6. Quit
6. Quit
Enter your option: 1
Enter queue data : 34
1. Insert
2. Delete
3. Print
4. Front element
5. Rear Element
6. Quit
Enter your option: 1
Enter queue data : 45
1. Insert
2. Delete
3. Print
4. Front element
5. Rear Element
6. Quit
Enter your option: 3
23 34 45
1. Insert
2. Delete
3. Print
4. Front element
5. Rear Element
6. Quit
Enter your option: 4
Front Element = 23
1. Insert
2. Delete
3. Print
4. Front element
5. Rear Element
6. Quit
Enter your option: 5
Rear Element = 45
1. Insert
2. Delete
3. Print
4. Front element
5. Rear Element
6. Quit
Enter your option: 6
/*Conversion of an expression from prefix into infix
Conversion of an expression from prefix into postfix
*/
output :>
Enter a prefix expression :+a*bc Postfix : abc*+ Infix : (a+(b*c))
/*Conversion of an expression from prefix into infix
Conversion of an expression from prefix into postfix
*/
output :>
Enter a prefix expression :+a*bc Postfix : abc*+ Infix : (a+(b*c))
/*Conversion of an expression from postfix into infix
Conversion of an expression from postfix into prefix
*/
output :>
Enter a postfix expression :abc*+ Prefix : +a*bc Infix : (a+(b*c))/*Conversion of an expression from postfix into infix
Conversion of an expression from postfix into prefix
*/
output :>
Enter a postfix expression :abc*+ Prefix : +a*bc Infix : (a+(b*c))1. infix into its postfix form
2. infix into its prefix form
3. Evaluation of postfix expression
4. Evaluation of prefix expression
operators supported '+,-,*,/,%,^,(,)
operands supported -- all single character operands
*/
output :>
Enter an infix expression : a+b*c
Postfix : abc*+
prefix: +a*bc
Prefix Evaluation :
Enter the value of c : 12
Enter the value of b : 24
Enter the value of a : 10
value of expression = 298
Postfix evaluation :
Enter the value of a : 2
Enter the value of b : 3
Enter the value of c : 4
value of expression = 14
1. infix into its postfix form
2. infix into its prefix form
3. Evaluation of postfix expression
4. Evaluation of prefix expression
operators supported '+,-,*,/,%,^,(,)
operands supported -- all single character operands
*/
output :>
Enter an infix expression : a+b*c
Postfix : abc*+
prefix: +a*bc
Prefix Evaluation :
Enter the value of c : 12
Enter the value of b : 24
Enter the value of a : 10
value of expression = 298
Postfix evaluation :
Enter the value of a : 2
Enter the value of b : 3
Enter the value of c : 4
value of expression = 14
/*
Represent a Polynomal using a circular linked list and write
menu driven program to perform addition,multiplication and
evaluation.
*/
output :>
1)Create first polynomial
2)Create second polynomial
3)Print first polynomial
4)Print second polynomial
5)Add
6)Multiply
7)Evaluate First Polynomial
8)Quit
Enter Your Choice: 1
Enter No. of Terms:2
enter a term as a tuple of (power,coefficient) : 1 3 2 1
1)Create first polynomial
2)Create second polynomial
3)Print first polynomial
4)Print second polynomial
5)Add
6)Multiply
7)Evaluate First Polynomial
8)Quit
Enter Your Choice: 3
3.00x^1 1.00x^2
1)Create first polynomial
2)Create second polynomial
3)Print first polynomial
4)Print second polynomial
5)Add
6)Multiply
7)Evaluate First Polynomial
8)Quit
Enter Your Choice: 2
Enter No. of Terms:2
enter a term as a tuple of (power,coefficient) : 5 1 6 2
1)Create first polynomial
2)Create second polynomial
3)Print first polynomial
4)Print second polynomial
5)Add
6)Multiply
7)Evaluate First Polynomial
8)Quit
Enter Your Choice: 5
3.00x^1 1.00x^2 1.00x^5 2.00x^6
1)Create first polynomial
2)Create second polynomial
3)Print first polynomial
4)Print second polynomial
5)Add
6)Multiply
7)Evaluate First Polynomial
8)Quit
Enter Your Choice: 6
3.00x^6 7.00x^7 2.00x^8
1)Create first polynomial
2)Create second polynomial
3)Print first polynomial
4)Print second polynomial
5)Add
6)Multiply
7)Evaluate First Polynomial
8)Quit
Enter Your Choice: 7
Enter the value of X:2
Evaluated value = 10.00
1)Create first polynomial
2)Create second polynomial
3)Print first polynomial
4)Print second polynomial
5)Add
6)Multiply
7)Evaluate First Polynomial
8)Quit
Enter Your Choice: 8
/*
Represent a Polynomal using a circular linked list and write
menu driven program to perform addition,multiplication and
evaluation.
*/
output :>
1)Create first polynomial
2)Create second polynomial
3)Print first polynomial
4)Print second polynomial
5)Add
6)Multiply
7)Evaluate First Polynomial
8)Quit
Enter Your Choice: 1
Enter No. of Terms:2
enter a term as a tuple of (power,coefficient) : 1 3 2 1
1)Create first polynomial
2)Create second polynomial
3)Print first polynomial
4)Print second polynomial
5)Add
6)Multiply
7)Evaluate First Polynomial
8)Quit
Enter Your Choice: 3
3.00x^1 1.00x^2
1)Create first polynomial
2)Create second polynomial
3)Print first polynomial
4)Print second polynomial
5)Add
6)Multiply
7)Evaluate First Polynomial
8)Quit
Enter Your Choice: 2
Enter No. of Terms:2
enter a term as a tuple of (power,coefficient) : 5 1 6 2
1)Create first polynomial
2)Create second polynomial
3)Print first polynomial
4)Print second polynomial
5)Add
6)Multiply
7)Evaluate First Polynomial
8)Quit
Enter Your Choice: 5
3.00x^1 1.00x^2 1.00x^5 2.00x^6
1)Create first polynomial
2)Create second polynomial
3)Print first polynomial
4)Print second polynomial
5)Add
6)Multiply
7)Evaluate First Polynomial
8)Quit
Enter Your Choice: 6
3.00x^6 7.00x^7 2.00x^8
1)Create first polynomial
2)Create second polynomial
3)Print first polynomial
4)Print second polynomial
5)Add
6)Multiply
7)Evaluate First Polynomial
8)Quit
Enter Your Choice: 7
Enter the value of X:2
Evaluated value = 10.00
1)Create first polynomial
2)Create second polynomial
3)Print first polynomial
4)Print second polynomial
5)Add
6)Multiply
7)Evaluate First Polynomial
8)Quit
Enter Your Choice: 8
/*Merging of linked lists with sorted data */
/* prgram :
Create two singly linked lists sort one after creation & one while
creation.Merge these two lists into one list without creating a
new node*/
output :>
Creating Normal(unsorted) linked list
Number of nodes:2
Enter data:12
23
Creating sorted linked list
Number of nodes:3
Enter data:12 23
34
First LInked list(Before Sorting):
12 23
First Linked list(After Sorting):
12 23
Second Linked list:
12 23 34
Final List:
12 12 23 23 34
/*Merging of linked lists with sorted data */
/* prgram :
Create two singly linked lists sort one after creation & one while
creation.Merge these two lists into one list without creating a
new node*/
output :>
Creating Normal(unsorted) linked list
Number of nodes:2
Enter data:12
23
Creating sorted linked list
Number of nodes:3
Enter data:12 23
34
First LInked list(Before Sorting):
12 23
First Linked list(After Sorting):
12 23
Second Linked list:
12 23 34
Final List:
12 12 23 23 34
/*Operations on SLL(singly linked list) */
- 1)create
- 2)Insert
- 3)Delete
- 4)Search
- 5)Reverse
- 6)Print
- 7)Quit
- Enter your Choice:1
- Enter no of data:2
- Enter the data:12 34
- 1)create
- 2)Insert
- 3)Delete
- 4)Search
- 5)Reverse
- 6)Print
- 7)Quit
- Enter your Choice:2
- 1)Beginning
- 2)End
- 3)In between
- Enter your choice : 3
- Enter the data to be inserted : 22
- Insert after which number ? : 12
- 1)create
- 2)Insert
- 3)Delete
- 4)Search
- 5)Reverse
- 6)Print
- 7)Quit
- Enter your Choice:3
- 1)Beginning
- 2)End
- 3)In between
- Enter your choice : 1
- 1)create
- 2)Insert
- 3)Delete
- 4)Search
- 5)Reverse
- 6)Print
- 7)Quit
- Enter your Choice:4
- Enter the data to be searched: 12
- Not found:
- 1)create
- 2)Insert
- 3)Delete
- 4)Search
- 5)Reverse
- 6)Print
- 7)Quit
- Enter your Choice:5
- 34 22
- 1)create
- 2)Insert
- 3)Delete
- 4)Search
- 5)Reverse
- 6)Print
- 7)Quit
- Enter your Choice:6
- 34 22
- 2)Insert
- 3)Delete
- 4)Search
- 5)Reverse
- 6)Print
- 7)Quit
- Enter your Choice:7
/*Operations on SLL(singly linked list) */
- 1)create
- 2)Insert
- 3)Delete
- 4)Search
- 5)Reverse
- 6)Print
- 7)Quit
- Enter your Choice:1
- Enter no of data:2
- Enter the data:12 34
- 1)create
- 2)Insert
- 3)Delete
- 4)Search
- 5)Reverse
- 6)Print
- 7)Quit
- Enter your Choice:2
- 1)Beginning
- 2)End
- 3)In between
- Enter your choice : 3
- Enter the data to be inserted : 22
- Insert after which number ? : 12
- 1)create
- 2)Insert
- 3)Delete
- 4)Search
- 5)Reverse
- 6)Print
- 7)Quit
- Enter your Choice:3
- 1)Beginning
- 2)End
- 3)In between
- Enter your choice : 1
- 1)create
- 2)Insert
- 3)Delete
- 4)Search
- 5)Reverse
- 6)Print
- 7)Quit
- Enter your Choice:4
- Enter the data to be searched: 12
- Not found:
- 1)create
- 2)Insert
- 3)Delete
- 4)Search
- 5)Reverse
- 6)Print
- 7)Quit
- Enter your Choice:5
- 34 22
- 1)create
- 2)Insert
- 3)Delete
- 4)Search
- 5)Reverse
- 6)Print
- 7)Quit
- Enter your Choice:6
- 34 22
- 2)Insert
- 3)Delete
- 4)Search
- 5)Reverse
- 6)Print
- 7)Quit
- Enter your Choice:7
download :>
1)create 2)Insert 3)Delete 4)Search 5)Print 6)Quit Enter your Choice:1 Enter no of data:2 Enter the data:23 34 1)create 2)Insert 3)Delete 4)Search 5)Print 6)Quit Enter your Choice:2 1)Beginning 2)End 3)In between Enter your choice : 2 Enter the data to be inserted : 12 1)create 2)Insert 3)Delete 4)Search 5)Print 6)Quit Enter your Choice:5 23 34 12 1)create 2)Insert 3)Delete 4)Search 5)Print 6)Quit Enter your Choice:3 1)Beginning 2)End 3)In between Enter your choice : 3 Enter the data to be deleted : 23 1)create 2)Insert 3)Delete 4)Search 5)Print 6)Quit Enter your Choice:5 34 12 1)create 2)Insert 3)Delete 4)Search 5)Print 6)Quit Enter your Choice:4 Enter the data to be searched: 12 Found at location=2 1)create 2)Insert 3)Delete 4)Search 5)Print 6)Quit Enter your Choice:6download :>
1)create 2)Insert 3)Delete 4)Search 5)Print 6)Quit Enter your Choice:1 Enter no of data:2 Enter the data:23 34 1)create 2)Insert 3)Delete 4)Search 5)Print 6)Quit Enter your Choice:2 1)Beginning 2)End 3)In between Enter your choice : 2 Enter the data to be inserted : 12 1)create 2)Insert 3)Delete 4)Search 5)Print 6)Quit Enter your Choice:5 23 34 12 1)create 2)Insert 3)Delete 4)Search 5)Print 6)Quit Enter your Choice:3 1)Beginning 2)End 3)In between Enter your choice : 3 Enter the data to be deleted : 23 1)create 2)Insert 3)Delete 4)Search 5)Print 6)Quit Enter your Choice:5 34 12 1)create 2)Insert 3)Delete 4)Search 5)Print 6)Quit Enter your Choice:4 Enter the data to be searched: 12 Found at location=2 1)create 2)Insert 3)Delete 4)Search 5)Print 6)Quit Enter your Choice:6
Subscribe to:
Posts (Atom)
