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 …
Category: Solved Question paper
What are red-black trees ? Explain the properties of a red-black tree.
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 …
Explain Kruskal’s algorithm with an example.
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 …
Define B-tree. Give an example of a B-tree
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
Write a non-recursive algorithm for in-order traversal of a binary tree.
We extend the concept of linked data structures to structure containing nodes with more than one self-referenced field. A binary tree is made of nodes, where each node contains a “left” reference, a “right” reference, and a data element. The topmost node Read More …
Write an algorithm for the implementation of a stack
See this Question Download Notes Ignou MCA Solved Question Paper
Write an algorithm for the implementation of a doubly linked list.
In computer science, a doubly linked list is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains two fields, called links, that are references to the previous and to the next node in the sequence of nodes. Read More …
What is splay Tree? How does it differ from a Tree ?
A splay tree is a self-adjusting binary search tree with the additional property that recently accessed elements are quick to access again. It performs basic operations such as insertion, look-up and removal in O(log n) amortized time. Read more: https://en.wikipedia.org/wiki/Splay_tree Download Notes Ignou MCA Solved Read More …
Write an algorithm for Breadth first search
Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a ‘search key’) and explores the neighbor nodes first, before moving to the next level neighbors. Read Read More …
Write an algorithm for Depth first search
Depth–first search (DFS) is an algorithm for traversing or searching tree or graph data structures. One starts at the root (selecting some arbitrary node as the root in the case of a graph) and explores as far as possible along each Read More …
