IgnouGroup Social Campus
Problem Detail: I’m so bad at solving the problem of the type: “If $A$ is an NP-complete problem, $B$ is reducible to $A$, then $B$ is…” That I have to come here and ask these silly questions each and every time Read More …
Problem Detail: There are plenty of details about carry lookahead adders such as Kogge-Stone, Lander-Fischer, etc. in college CS courses. They are described as “common in the industry”. However, I can’t find any evidence (aside from maybe the Manchester carry chain) Read More …
Problem Detail: The 3SUM problem has two variants. In one variant, there is a single array $S$ of integers, and we have to find three different elements $a,b,c in S$ such that $a+b+c=0$. In another variant, there are are three arrays Read More …
Problem Detail: I’ve come across the CYK algorithm and was wondering, as it’s quite old, if it is still relevant today. Is it or an extension of it still being used in compilers (for example), or have other algorithms proven to Read More …
Download Solutions
Trace the algorithm for the following set of data :10 25, 0, 8, 78, 6, 34, 56, 90, 100 Download Solutions Ignou MCA Solved Question Paper
Sequential access file organization In computer science, sequential access means that a group of elements (such as data in a memory array or a disk file or on magnetic tape data storage) is accessed in a predetermined, ordered sequence. Sequential access is sometimes the only way of accessing the data, Read More …
A red–black tree is a binary search tree which has the following red–black properties: Every node is either red or black. Every leaf (NULL) is black. If a node is red, then both its children are black. Every simple path from a node to a descendant leaf contains the same number of black nodes. Read More …
Kruskal’s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight Read More …
B-trees are balanced trees that are optimized for situations when part or all of the tree must be maintained in secondary storage such as a magnetic disk. Download Solutions Ignou MCA Solved Question Paper
