Data Structures
Develop a program to compute the roots of a quadratic...
ALGORITHM Purpose : To find roots of a given quadratic equation. Input: Coefficients of quadratic equation a, b, c Output:...
Data Structures
Develop a program to solve simple computational problems using arithmetic...
ALGORITHM: PURPOSE : To simulate a calculator using arithmetic expressions INPUT: Enter num1 and num2 OUTPUT: Print the result of...
Data Structures
Explain Problem Solving Techniques
The process of working through details of a problem to reach a solution. There are three approaches to problem solving:...
Data Structures
Explain Pseudo code
It is a form of structured English that describes algorithms. It facilitates the designers to focus on the logic of...
Data Structures
Recursion
Recursion is the name given for expressing anything in terms of itself. A function which contains a call to itself...
Data Structures
Evaluation of Postfix Expression
1.read only one input symbol at a time from postfix expression. 2.if input symbol is operand ,push operand in to...
Data Structures
Convert infix expression into postfix Expression
Infix notation: In most common arithmetic opeartions,the opeartor is placed b/w the two operands. 1) A+B 2)C-D 3) E*F 4)...
Data Structures
Implement Stack by using dynamic arrays
When a stack is implemented by using static arrays the size of the stack is bound to MAXSTK(i.e maximum elements...
Data Structures
Explain Stack
It is a linear data structure or ordered collection of elements where the elements are processed in last in first...
C and C++
Data Structures
Find shortest paths to other vertices using Dijkra’s algorithm
What is Dijkstra’s Algorithm? Dijkstra’s Algorithm is a popular graph traversal technique used to find the shortest path between nodes...