Notes for Cache coherence
Download
Tuesday, 29 March 2011
Saturday, 26 March 2011
DBMS & OOPS Record
Tuesday, 22 March 2011
DBMS Notes (Unit 7- Recovery Systems)
Hi Guys,
Attached complete notes for the 7th Unit (Recovery System)
Prepare well for the Exam.
All the best
Regards
Nagasri
Saturday, 19 March 2011
source code for netbeans IDE
Have ever seen source code for a software..???
As we are CSE students, we are curious about how the programs will be for a software..
If you want to look at the source code for a software,
make it possible by downloading source provided by netbeans.org
Tuesday, 15 March 2011
Can you write your own code
Dear Friends
Please read this article. It talks about how the average student in an engineering college in India are unable to write their own code and how FOSS (free and open source) movement can change this.
http://www.thehindu.com/sci-tech/technology/article1536900.ece
Please read this article. It talks about how the average student in an engineering college in India are unable to write their own code and how FOSS (free and open source) movement can change this.
http://www.thehindu.com/sci-tech/technology/article1536900.ece
Sunday, 13 March 2011
A start-up called Posterous
Dear friends
Check this out. A company called "Posterous" has created a new way to post blogs. Here is the link to the article.
Preposterous means something so absurd or insanely impossible that it cannot be imagined. "Kenya winning the World Cup is preposterous". So the name of this company is taken from this word.
http://www.thehindu.com/sci-tech/technology/article1532325.ece?homepage=true
Check this out. A company called "Posterous" has created a new way to post blogs. Here is the link to the article.
Preposterous means something so absurd or insanely impossible that it cannot be imagined. "Kenya winning the World Cup is preposterous". So the name of this company is taken from this word.
http://www.thehindu.com/sci-tech/technology/article1532325.ece?homepage=true
Wednesday, 9 March 2011
algorithm to change a Postfix expression (P) to infix expression (I)
Dear Friends
Here is the algorithm to change a Postfix Expression to Infix Expression -
You want a program to convert something like
( 3 ( 4 2 + ) 5 * )
to
( ( 3 * ( 4 + 2 ) ) * 5 )
Suppose you have a list of tokens ('(', numbers, operators, ')')
as the programs input. The algorithm is:
1.scan the postfix expression and for each character do the following
if [token is '('] then
push '(' on the stack
else if [token is number] then
push number on the stack
else if [token is operator] then
while
pop off two elements a,b
if top element on stack is '(' then
pop off the '('
push back on "(a operator b)"
break while
else
push back on "(a operator b)"
end while
else if [token is ')'] then
discard
2. After you reach the end of the postfix expressionb read the stack and append to the infix expression
For example click here
Here is the algorithm to change a Postfix Expression to Infix Expression -
You want a program to convert something like
( 3 ( 4 2 + ) 5 * )
to
( ( 3 * ( 4 + 2 ) ) * 5 )
Suppose you have a list of tokens ('(', numbers, operators, ')')
as the programs input. The algorithm is:
1.scan the postfix expression and for each character do the following
if [token is '('] then
push '(' on the stack
else if [token is number] then
push number on the stack
else if [token is operator] then
while
pop off two elements a,b
if top element on stack is '(' then
pop off the '('
push back on "(a operator b)"
break while
else
push back on "(a operator b)"
end while
else if [token is ')'] then
discard
2. After you reach the end of the postfix expressionb read the stack and append to the infix expression
For example click here
algorithm to evaluate a Postfix expression
Dear Friends
Here is the algorithm to evaluate a Postfix expression
1. Add a right parenthesis “)” at the end of P. [This acts as a sentinel.]
2. Scan P from left to right and repeat Steps 3 and 4 for each element of P until the sentinel “)” is encountered.
3. If an operand is encountered, put it on STACK.
4. If an operator x is encountered, then:
a. Remove the two top elements of STACK, where A is the top element and B is the next-top element.
b. Evaluate B⊗A.
c. Place the result of (b) back on STACK.
[End of If structure.]
[End of Step 2 loop.]
5. Set VALUE equal to the top element to STACK
6. Exit
Here is the algorithm to evaluate a Postfix expression
1. Add a right parenthesis “)” at the end of P. [This acts as a sentinel.]
2. Scan P from left to right and repeat Steps 3 and 4 for each element of P until the sentinel “)” is encountered.
3. If an operand is encountered, put it on STACK.
4. If an operator x is encountered, then:
a. Remove the two top elements of STACK, where A is the top element and B is the next-top element.
b. Evaluate B⊗A.
c. Place the result of (b) back on STACK.
[End of If structure.]
[End of Step 2 loop.]
5. Set VALUE equal to the top element to STACK
6. Exit
Monday, 7 March 2011
Thursday, 3 March 2011
Subscribe to:
Posts (Atom)