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 …
Category: Solved
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 …
What is a stack ? Explain the various operations of stack with an example for each operation.
Stack Stack is an abstract data type with a bounded(predefined) capacity. It is a simple data structure that allows adding and removing elements in a particular order. Every time an element is added, it goes on the top of the Read More …
SRS for Library Management System
SRS for Library Management System This page contains Library management system project SRS document. A development process consist of various phases, each phase ending with a defined output. The main reason for having a phased process is that it breaks the Read More …
Algorithm to match numbers with minimum number of moves
Problem Detail: This is a sort of edit-distance question, and is very easy. I am just quite brain dead on this subject and can’t figure it out so far. Given a series of numbers, e.g. [3, 1, 1, 1] How Read More …
