feasible with your plan and portray the situation(s) in which this proportion would be accomplished. [2 marks] Calculate the absolute worst pressure proportion attainable with your plan and depict the situation(s) in which this proportion would be accomplished. [2 marks] 2 CST.2000.12.3 5 Business Studies What are the distinctions among benefit and misfortune and income articulations? [5 marks] What are the distinctions among obligation and value finance? [5 marks] What is a choice and how should it be esteemed? [5 marks] Comment on the ongoing costs of cutting edge stocks. [5 marks] 6 Comparative Programming Languages Outline how you would execute complex numbers in C++. Your execution ought to endeavor to make complex numbers look as though they were incorporated into the language by permitting new complex numbers to be pronounced, initialised, alloted and worked on by the typical number-crunching administrators. [13 marks] Discuss how much a decent

C++ compiler could execute your form of perplexing numbers as effectively as though they had been a crude sort in the language. [7 marks] 7 Compiler Construction Give a concise portrayal of the principle elements of either Lex and Yacc or the relating Java instruments JLex and Cup. [5 + 5 marks] Illustrate their utilization by framing how you would develop a parser for articulations made out of identifiers, numbers, unary short and paired administrators +, ?, ? and/. Your parser is supposed to make a parse tree in an organization of your decision addressing the articulation that is introduced to it. On the off chance that it helps, you might expect that articulations will be ended by composing a semicolon after them. [10 marks] 3 [TURN OVER CST.2000.12.4 8 Prolog for Artificial Intelligence Consider the accompanying issue to be tackled utilizing a Prolog program: Given a shut planar polygon chain addressed as a rundown of n vertices [v(x1,y1), v(x2,y2), . . . , v(xn,yn)] register the region of the encased polygon, and the direction of the chain. The region is registered by the line fundamental 1/2 R x dy?y dx where the indispensable is over the polygon chain. A na?ve arrangement is given by the accompanying system, which

Auto-complete ready! Save C (9 Arithmetic Expression Queue 86 int isEmptyQueue(Queue q){ Given a character string of an integer arithmetic expression, write a function expressionQ() to split 87 if(q.size==0) return 1; the operands (any non-negative integer numbers) , operators ('+', '-', ", /" and %') and parentheses 88 else return 0; 89 into a queue. We assumed that the character string only contains digits, operators and parentheses. 91 void printExpQ(Queue *qPtr}{ 3 The function prototype is given as follows: 92 if(qPtr-=NULL) return; 93 void expressionQ(char* , Queue* ); 94 QueueNode* temp - NULL; 95 temp = getFront(*qPtr); where infix is the character string and inExpo is the output queue 96 97 while (temp!=NULL) { For example 98 if(temp->type == OPERAND) 99 printf(" *d ", temp->item); Input: 108 else 101 printf(" %c ", (char) (temp->item)); 1+11*111/(1111-88) 102 dequeue (qPtr); 103 temp = getFront(*'qPtr); 104 Output: 105 printf("\\"); 1 + 11 * 111 / ( 1111 - 88 ) 106 107 108 Sample input + Sample output 109 110 1+15*121/(1311-84) Output: 111 void expressionQ(char *infix, Queue* qPtr) 1 + 15 * 121 / ( 1311 - 84 ) 112 113 // Write your code here 114 Test against custom input @ Custom Input populated type == OPERAND) 99 printf(" *d ", temp->item); Input: 108 else 101 printf(" %c ", (char) (temp->item)); 1+11*111/(1111-88) 102 dequeue (qPtr); 103 temp = getFront(*'qPtr); 104 Output: 105 printf("\\"); 1 + 11 * 111 / ( 1111 - 88 ) 106 107 108 Sample input + Sample output 109 110 1+15*121/(1311-84) Output: 111 void expressionQ(char *infix, Queue* qPtr) 1 + 15 * 121 / ( 1311 - 84 ) 112 113 // Write your code here 114 Test against custom input @ Custom Input populated