Question

Translate the following C++ code to Pseudocode:

int main()
{
stack<char> stk,stk2;
int length =0,ele;
while(cin>>ele)
{
stk.push(ele);
length++;
}
if(length%2)
stk.pop();
for (int i=0;i<length/2;i++)
{
ele=stk.top();
stk.pop();
stk2.push(ele);
}
int flag=1;
for(int i=0;i<length/2;i++)
{
if(stk.top()==stk2.top())
{
stk.pop();stk2.pop();
}
else
{
flag=1; break;
}
}
if(flag==1) cout<<"NOT palindrome";
else
cout<<"palindrome";
}

Answer 1

Palindrome program in C++

A palindrome number is a number that is same after reverse. For example 121, 34543, 343, 131, 48984 are the palindrome numbers.

Palindrome number algorithm

• Get the number from user
• Hold the number in temporary variable
• Reverse the number
• Compare the temporary number with reversed number
• If both numbers are same, print palindrome number
• Else print not palindrome number

Pseudo code is a term which is often used in programming and algorithm based fields. It is a methodology that allows the programmer to represent the implementation of an algorithm. Simply, we can say that it’s the cooked up representation of an algorithm. Often at times, algorithms are represented with the help of pseudo codes as they can be interpreted by programmers no matter what their programming background or knowledge is. Pseudo code, as the name suggests, is a false code or a representation of code which can be understood by even a layman with some school level programming knowledge.

Algorithm: It’s an organized logical sequence of the actions or the approach towards a particular problem. A programmer implements an algorithm to solve a problem. Algorithms are expressed using natural verbal but somewhat technical annotations.

Pseudo code: It’s simply an implementation of an algorithm in the form of annotations and informative text written in plain English. It has no syntax like any of the programming language and thus can’t be compiled or interpreted by the computer.

pseudo code for palindrome algorithm :

1. //beginning =start of sequence  and end=end of sequence
2. start the program
3. read the input from user where length is initally 0
4. int length =0,ele;
5. // create a stack that reads characters
6. stack<char> stk,stk2;
7. // compare the length  with stack characters
8. while(cin>>ele)
9. //loop(data not EOF ans stack not full)
10. push(data)
11. stk.push(ele);
12. //increment the count of length of palindrome
13. length++;
14. //whlie loop ends
15. //if condition length divides with 2
16. if(length%2)
17. //loop while stack is not empty
18. pop(data)
19. stk.pop();
20. //add each character to string
21. //for(current=beginning;current/2<end;current++)
22. for (int i=0;i<length/2;i++)
23. //data is inserted into top of stack
24. ele=stk.top();
25. //last element is deleted using pop operation
26. stk.pop();
27. //another stack data is inserted using push opeartion
28. stk2.push(ele);
29. //in if condition stack 1element is compared with stack 2
30. if(stk.top()==stk2.top())
31. {
32. //from both stacks pop is performed
33. stk.pop();stk2.pop();
34. }
35. //end of loop
36. if(flag=1)
37. //if palindrome ends in mismatch remove and decrement the size of palindrome
38. //characters are not equal
39. cout<<"NOT palindrome";
40. //if both stack (data) are same print
41. else
42. //characters are equal
43. cout<<"palindrome";
44. }