{"id":88,"date":"2020-04-01T13:34:03","date_gmt":"2020-04-01T13:34:03","guid":{"rendered":"https:\/\/temp.ashkerala.com\/?p=88"},"modified":"2020-04-01T13:34:03","modified_gmt":"2020-04-01T13:34:03","slug":"pseudocode-standard","status":"publish","type":"post","link":"https:\/\/temp.ashkerala.com\/?p=88","title":{"rendered":"Pseudocode Standard"},"content":{"rendered":"

Pseudocode is a kind of structured english for describing algorithms. It allows the designer to focus on the logic of the algorithm without being distracted by details of language syntax.\u00a0 At the same time, the pseudocode needs to be complete.\u00a0 It describe the entire logic of the algorithm so that implementation becomes a rote mechanical task of translating line by line into source code.<\/p>\n

In general the vocabulary used in the pseudocode should be the vocabulary of the problem domain, not of the implementation domain.\u00a0 The pseudocode is a narrative for someone who knows the requirements (problem domain) and is trying to learn how the solution is organized.\u00a0 E.g.,<\/p>\n

\u00a0\u00a0\u00a0 Extract the next word from the line (good)
\u00a0\u00a0\u00a0 set word to get next token (poor)<\/p>\n

\u00a0\u00a0\u00a0 Append the file extension to the name (good)
\u00a0\u00a0\u00a0 name = name + extension (poor)<\/p>\n

\u00a0\u00a0\u00a0 FOR all the characters in the name (good)
\u00a0\u00a0\u00a0 FOR character = first to last (ok)<\/p>\n

Note that the logic must be decomposed to the level of a single loop or decision. Thus “Search the list and find the customer with highest balance” is too vague because it takes a loop AND a nested decision to implement it. It’s okay to use “Find” or “Lookup” if there’s a predefined function for it such as String.indexOf().<\/p>\n

Each textbook and each individual designer may have their own personal style of pseudocode. Pseudocode is not a rigorous notation, since it is read by other people, not by the computer. There is no universal “standard” for the industry, but for instructional purposes it is helpful if we all follow a similar style. The format below is recommended for expressing your solutions in our class.<\/p>\n

The “structured” part of pseudocode is a notation for representing six specific structured programming constructs: SEQUENCE, WHILE, IF-THEN-ELSE, REPEAT-UNTIL, FOR, and CASE.<\/strong> Each of these constructs can be embedded inside any other construct. These constructs represent the logic, or flow of control in an algorithm.<\/p>\n

It has been proven that three basic constructs for flow of control are sufficient to implement any “proper” algorithm.<\/p>\n

\u00a0\u00a0\u00a0 SEQUENCE<\/strong> is a linear progression where one task is performed sequentially after another.
\u00a0\u00a0\u00a0 WHILE<\/strong> is a loop (repetition) with a simple conditional test at its beginning.
\u00a0\u00a0\u00a0 IF-THEN-ELSE<\/strong> is a decision (selection) in which a choice is made between two alternative courses of action.<\/p>\n

Although these constructs are sufficient, it is often useful to include three more constructs:
\u00a0
\u00a0\u00a0\u00a0 REPEAT-UNTIL<\/strong> is a loop with a simple conditional test at the bottom.
\u00a0\u00a0\u00a0 CASE<\/strong> is a multiway branch (decision) based on the value of an expression. CASE is a generalization of IF-THEN-ELSE.
\u00a0\u00a0\u00a0 FOR is a “counting” loop.<\/p>\n

SEQUENCE<\/strong><\/p>\n

Sequential control is indicated by writing one action after another, each action on a line by itself, and all actions aligned with the same indent. The actions are performed in the sequence (top to bottom) that they are written.<\/p>\n

Example (non-computer)<\/strong>
\u00a0\u00a0\u00a0 Brush teeth
\u00a0\u00a0\u00a0 Wash face
\u00a0\u00a0\u00a0 Comb hair
\u00a0\u00a0\u00a0 Smile in mirror<\/p>\n

Example<\/strong>
\u00a0\u00a0\u00a0 READ height of rectangle
\u00a0\u00a0\u00a0 READ width of rectangle
\u00a0\u00a0\u00a0 COMPUTE area as height times width<\/p>\n

Common Action Keywords<\/strong>
\u00a0\u00a0\u00a0 Several keywords are often used to indicate common input, output, and processing operations.<\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Input: READ, OBTAIN, GET
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Output: PRINT, DISPLAY, SHOW
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Compute: COMPUTE, CALCULATE, DETERMINE
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Initialize: SET, INIT
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Add one: INCREMENT, BUMP<\/em><\/p>\n

IF-THEN-ELSE<\/strong><\/p>\n

Binary choice on a given Boolean condition is indicated by the use of four keywords: IF, THEN, ELSE, and ENDIF. The general form is:<\/p>\n

\u00a0\u00a0\u00a0 IF condition THEN
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 sequence 1
\u00a0\u00a0\u00a0 ELSE
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 sequence 2
\u00a0\u00a0\u00a0 ENDIF<\/p>\n

The ELSE keyword and “sequence 2” are optional. If the condition is true, sequence 1 is performed, otherwise sequence 2 is performed.<\/p>\n

Example<\/strong>
\u00a0\u00a0\u00a0 IF HoursWorked > NormalMax THEN
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Display overtime message
\u00a0\u00a0\u00a0 ELSE
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Display regular time message
\u00a0\u00a0\u00a0 ENDIF<\/p>\n

WHILE<\/strong>
The WHILE construct is used to specify a loop with a test at the top. The beginning and ending of the loop are indicated by two keywords WHILE and ENDWHILE. The general form is:<\/p>\n

\u00a0\u00a0\u00a0 WHILE condition
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 sequence
\u00a0\u00a0\u00a0 ENDWHILE<\/p>\n

The loop is entered only if the condition is true. The “sequence” is performed for each iteration. At the conclusion of each iteration, the condition is evaluated and the loop continues as long as the condition is true.<\/p>\n

Example<\/strong>
\u00a0\u00a0\u00a0 WHILE Population < Limit
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Compute Population as Population + Births – Deaths
\u00a0\u00a0\u00a0 ENDWHILE<\/p>\n

Example<\/strong><\/p>\n

\u00a0\u00a0\u00a0 WHILE employee.type NOT EQUAL manager AND personCount < numEmployees
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 INCREMENT personCount
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 CALL employeeList.getPerson with personCount RETURNING employee
\u00a0\u00a0\u00a0 ENDWHILE<\/p>\n

CASE<\/strong><\/p>\n

A CASE construct indicates a multiway branch based on conditions that are mutually exclusive. Four keywords, CASE, OF, OTHERS, and ENDCASE, and conditions are used to indicate the various alternatives. The general form is:<\/p>\n

\u00a0\u00a0\u00a0 CASE expression OF<\/strong><\/p>\n

\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 condition 1 : sequence 1
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 condition 2 : sequence 2
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 …
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 condition n : sequence n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 OTHERS:
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 default sequence
\u00a0\u00a0\u00a0 ENDCASE<\/p>\n

\u00a0\u00a0\u00a0 The OTHERS clause with its default sequence is optional. Conditions are normally numbers or characters<\/p>\n

indicating the value of “expression”, but they can be English statements or some other notation that specifies the condition under which the given sequence is to be performed. A certain sequence may be associated with more than one condition.<\/p>\n

Example<\/strong>
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 CASE\u00a0 Title\u00a0 OF
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Mr\u00a0\u00a0\u00a0\u00a0\u00a0 : Print “Mister”
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Mrs\u00a0\u00a0\u00a0\u00a0 : Print “Missus”
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Miss\u00a0\u00a0\u00a0 : Print “Miss”
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Ms\u00a0\u00a0\u00a0\u00a0\u00a0 : Print “Mizz”
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Dr\u00a0\u00a0\u00a0\u00a0\u00a0 : Print “Doctor”
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 ENDCASE<\/p>\n

Example<\/strong>
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 CASE\u00a0 grade\u00a0 OF
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 A\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 : points = 4
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 B\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 : points = 3
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 C\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 : points = 2
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 D\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 : points = 1
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 F\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 : points = 0
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 ENDCASE<\/p>\n

REPEAT-UNTIL<\/strong><\/p>\n

This loop is similar to the WHILE loop except that the test is performed at the bottom of the loop instead of at the top. Two keywords, REPEAT and UNTIL are used. The general form is:<\/p>\n

\u00a0\u00a0\u00a0 REPEAT
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 sequence
\u00a0\u00a0\u00a0 UNTIL condition<\/p>\n

The “sequence” in this type of loop is always performed at least once, because the test is peformed after the sequence is executed. At the conclusion of each iteration, the condition is evaluated, and the loop repeats if the condition is false. The loop terminates when the condition becomes true.<\/p>\n

FOR<\/strong><\/p>\n

This loop is a specialized construct for iterating a specific number of times, often called a “counting” loop.\u00a0 Two keywords, FOR and ENDFOR are used. The general form is:<\/p>\n

\u00a0\u00a0\u00a0 FOR iteration bounds
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 sequence
\u00a0\u00a0\u00a0 ENDFOR<\/p>\n

In cases where the loop constraints can be obviously inferred it is best to describe the loop using problem domain vocabulary.<\/p>\n

Example<\/strong>
\u00a0\u00a0\u00a0 FOR each month of the year (good)
\u00a0\u00a0\u00a0 FOR month = 1 to 12 (ok)
\u00a0\u00a0\u00a0 FOR each employee in the list (good)
\u00a0\u00a0\u00a0 FOR empno = 1 to listsize (ok)<\/p>\n

NESTED CONSTRUCTS<\/strong><\/p>\n

The constructs can be embedded within each other, and this is made clear by use of indenting. Nested constructs should be clearly indented from their surrounding constructs.<\/p>\n

Example<\/strong>
\u00a0\u00a0\u00a0 SET total to zero
\u00a0\u00a0\u00a0 REPEAT
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 READ Temperature
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 IF Temperature > Freezing THEN
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 INCREMENT total
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 END IF
\u00a0\u00a0\u00a0 UNTIL Temperature < zero
\u00a0\u00a0\u00a0 Print total<\/p>\n

In the above example, the IF construct is nested within the REPEAT construct, and therefore is indented.<\/p>\n

INVOKING SUBPROCEDURES<\/strong><\/p>\n

Use the CALL keyword. For example:
\u00a0\u00a0\u00a0 CALL AvgAge with StudentAges
\u00a0\u00a0\u00a0 CALL Swap with CurrentItem and TargetItem
\u00a0\u00a0\u00a0 CALL Account.debit with CheckAmount
\u00a0\u00a0\u00a0 CALL getBalance RETURNING aBalance
\u00a0\u00a0\u00a0 CALL SquareRoot with orbitHeight RETURNING nominalOrbit<\/p>\n

EXCEPTION HANDLING<\/strong>
\u00a0\u00a0\u00a0 BEGIN
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 statements
\u00a0\u00a0\u00a0 EXCEPTION
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 WHEN exception type
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 statements to handle exception
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 WHEN another exception type
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 statements to handle exception
\u00a0\u00a0\u00a0 END<\/p>\n

Sample Pseudocode<\/strong>
“Adequate”<\/strong><\/em><\/p>\n

FOR X = 1 to 10
\u00a0\u00a0\u00a0 FOR Y = 1 to 10
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 IF gameBoard[X][Y] = 0
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 Do nothing
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 ELSE
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 CALL theCall(X, Y) (recursive method)
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 increment counter\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 END IF
\u00a0\u00a0\u00a0 END FOR
END FOR<\/p>\n

“Better”<\/strong><\/em>
Set moveCount to 1
FOR each row on the board
\u00a0\u00a0\u00a0 FOR each column on the board
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 IF gameBoard position (row, column) is occupied THEN
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 CALL findAdjacentTiles with row, column
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 INCREMENT moveCount
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 END IF
\u00a0\u00a0\u00a0 END FOR
END FOR<\/p>\n

(Note: the logic is restructured to omit the “do nothing” clause)<\/p>\n

“Not So Good”<\/strong><\/em><\/p>\n

FOR all the number at the back of the array
\u00a0\u00a0\u00a0 SET Temp equal the addition of each number
\u00a0\u00a0\u00a0 IF > 9 THEN
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 get the remainder of the number divided by 10 to that index
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 and carry the “1”
\u00a0\u00a0\u00a0 Decrement one
Do it again for numbers before the decimal<\/p>\n

“Good Enough (not perfect)”<\/strong><\/em><\/p>\n

SET Carry to 0
FOR each DigitPosition in Number from least significant to most significant<\/p>\n

\u00a0\u00a0\u00a0 COMPUTE Total as sum of FirstNum[DigitPosition] and SecondNum[DigitPosition] and Carry \u00a0<\/p>\n

\u00a0\u00a0\u00a0 IF Total > 10 THEN
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 SET Carry to 1
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 SUBTRACT 10 from Total
\u00a0\u00a0\u00a0 ELSE
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 SET Carry to 0
\u00a0\u00a0\u00a0 END IF
\u00a0\u00a0\u00a0 STORE Total in Result[DigitPosition]
END LOOP \u00a0
IF Carry = 1 THEN
\u00a0\u00a0\u00a0 RAISE Overflow exception
END IF<\/p>\n

“Pretty Good”\u00a0 This example shows how pseudocode is written as comments in the source file. Note that the double slashes are indented.<\/p>\n

public boolean moveRobot (Robot aRobot)
{
\u00a0\u00a0\u00a0 \/\/IF robot has no obstacle in front THEN
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \/\/ Call Move robot
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \/\/ Add the move command to the command history
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \/\/ RETURN true
\u00a0\u00a0\u00a0 \/\/ELSE
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \/\/ RETURN false without moving the robot
\u00a0\u00a0\u00a0 \/\/END IF
}<\/p>\n

Example Java Implementation<\/strong><\/p>\n

\u00a0\u00a0\u00a0 source code statements are interleaved with pseudocode.
\u00a0\u00a0\u00a0 comments that correspond exactly to source code are removed during coding.<\/p>\n

public boolean moveRobot (Robot aRobot)
{
\u00a0\u00a0\u00a0 \/\/IF robot has no obstacle in front THEN
\u00a0\u00a0\u00a0 if (aRobot.isFrontClear())
\u00a0\u00a0\u00a0 {
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \/\/ Call Move robot
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 aRobot.move();
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \/\/ Add the move command to the command history
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 cmdHistory.add(RobotAction.MOVE);
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 return true;
\u00a0\u00a0\u00a0 }
\u00a0\u00a0\u00a0 else \/\/ don’t move the robot
\u00a0\u00a0\u00a0 {
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 return false;
\u00a0\u00a0\u00a0 }\/\/END IF
}
\u00a0
\u00a0 Examples of vague pseudocode<\/strong><\/p>\n

Document History
Date \u00a0\u00a0 \u00a0Author \u00a0\u00a0 \u00a0Change
12\/2\/03
\u00a0\u00a0 \u00a0JD
\u00a0\u00a0 \u00a0Added Exception Handling and more examples
2\/21\/03 \u00a0\u00a0 \u00a0JD \u00a0\u00a0 \u00a0Added “problem domain vocabulary” paragraph.
Modified FOR loop explanation.<\/p>\n","protected":false},"excerpt":{"rendered":"

Pseudocode is a kind of structured english for describing algorithms. It allows the designer to focus on the logic of the algorithm without being distracted by details of language syntax.\u00a0 At the same time, the pseudocode needs to be complete.\u00a0 It describe the entire logic of the algorithm so that implementation becomes a rote mechanical…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"footnotes":""},"categories":[8],"tags":[],"class_list":["post-88","post","type-post","status-publish","format-standard","hentry","category-ugc-research"],"_links":{"self":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts\/88","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=88"}],"version-history":[{"count":0,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=\/wp\/v2\/posts\/88\/revisions"}],"wp:attachment":[{"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=88"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=88"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/temp.ashkerala.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=88"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}