quescol

Circular Queue is a linear data structure that follows FIFO (First In First Out) principle. FIFO means item that inserted first in queue will be taken out first. Why Circular queue? There was a limitation in normal Queue that if rear reaches at the end of size of queue and there are some space left … Read more

What is Queue ? The process of inserting an element in the queue is called enqueue, and the process of deleting an element from the queue is called dequeue. For example: At Bus Stop, People is in queue and waiting for a bus. The person who is standing in the line at the first position … Read more

Recursion is a process in which a function calls itself again and again. We use recursion to solve bigger problem by dividing it into smaller similar sub-problems and then call them recursively. Types of Recursion Recursive functions can be classified on the basis of a) Based on functions call itself – Direct / Indirectb) Based … Read more

Recursion is a process in which a function calls itself again and again. We use recursion to solve the bigger problem by dividing it into smaller similar sub-problems and then call them recursively. In other words, we can also explain it as a problem is broken down into smaller subproblems. And a function applies the … Read more

Prefix notation is a notation in which operators are written before their operands. For example, the expressions given are in prefix notation / * A + B C D. Point to consider Permitted operands: A,B,C,D means any real number is permitted. Permitted operators: +,-, *, /, ^(exponentiation) Blanks are permitted in the expression Parenthesis are … Read more

In Postfix expression operators are written after their operands. For example, the expressions given are in postfix notation A B C + * D /. Point to consider Prefix and Postfix expressions can be evaluated faster in comparison to an infix expression because we don’t need to process any brackets or follow the operator precedence … Read more

Generally arithmetic expressions are written in infix expression where the operator is written between the operands. Point to consider Suppose given infix expression is A+B*C-D where A,B,C,D are operands and +,*,- are operators. To solve the above infix expression we will use two stack Operand Stack : This stack will hold operands. Operator Stack : … Read more

Infix, Postfix and Prefix notations are the ways of writing and evaluating Arithmetic & Algebraic expressions. Infix, prefix, and postfix are ways to write math expressions. Infix is what we use every day, like 2 + 3. Prefix, also called Polish notation, puts the operator before the numbers, like + 2 3. Postfix, or Reverse … Read more

A stack is a Linear Abstract Data Type (ADT) that follows the LIFO(Last in first out) property. There are two operation which can be performed on stack 1). PUSH 2). POP 1). PUSH operation of Stack PUSH operation of the stack is used to add an item to a stack at the top. We can … Read more

A stack is a fundamental data structure that follows the Last In, First Out (LIFO) principle, meaning the last element added to the stack will be the first one to be removed. It’s like a stack of plates, you add to the top and take from the top. This post will explore how to implement … Read more