Algorithms can be defined as the set of instructions structured to solve a problem. It is a step-by-step procedure to solve the problem. These steps are generally written in English to understand them easily and later convert them into computer programs. These steps together are called algorithms. Let us consider an example, suppose you went … Read more
As we know that, algorithms provide us the procedure to solve any problem. Below are some characteristics that define a good algorithm: Every algorithm developed today is measured on the above-defined matrices and it should be considered while designing a new algorithm.
Algorithms can be defined as the set of instructions structuredto solve a problem. It is a step-by-step procedure to solve the problem. These steps are generally written in English to understand them easily and later convert them into computer programs. These steps together are called algorithms. Let us consider an example, suppose you went shopping … Read more
What is Data Structure? In simple term we can define data structure as, Data Structure is a way of organizing the data elements in memory so that we can efficiently retrieve it and perform any operation efficiently. Now, before moving forward on next topics lets have a eyes over the syllabus of data structure which … Read more
A B-tree is an extended version of m-way. There are some drawbacks with the m way tree is, in the worst case, it may behave like a linked list because it has no rule over the number of keys in node. To resolve this B-tree is introduced which is balanced. Here balanced means all leaf … Read more
Compaction Garbage collection is the process of collecting all unused nodes and returning them to available space. This process is carried out in essentially two phases. The first phase is marking phase where all node which is in use is marked. And Second Phase is compaction where all free partitions are made contiguous and merged … Read more
Consider the linear arrays AAA[5:50], BBB [-5:10] and CCC[1:8]. (a) Find the number of elements in each array (b) Suppose Base(AAA) = 300 and w=4 words per memory cell for AAA. Find the address of AAA[35] ,AAA[15], and AAA[55] (a) Length = Upper Bound – Lower Bound +1Length(AAA) = 50-5+1 = 46Length(BBB) = 10-(-5)+1 = … Read more
In this article we will learn how to calculate address of (i,j)th element of a matrix m*n in Column major order. Below is the explanation of it. Column Major Order Formula The Location/Address of element A[i, j] can be obtained by evaluating expression: LOC (A [i, j]) = base_address + w * [m * j … Read more
In this tutorial, we’re going to learn an algorithm for Matrix multiplication along with its Program. Matrix is basically a two-dimensional array that can have any number of rows and any number of columns. Matrix multiplication procedure is not the same as a simple multiplication of numbers but it follows certain distinct ruleswhich must be … Read more
To convert Infix to prefix using the stack, first reverse the infix expression and at last again reverse the output expression to get prefix expression. We have operator’s stack, output’s stack and one input string. Operator’s stack works as FILO(First In Last Out). Output’s stack works as FIFO (First In First Out). Infix to Prefix … Read more