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 …
Category: Assignments
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 …
