Beam search: is a heuristic search algorithm that is an optimization of best-first search that reduces its memory requirement. Beam stack search: integrates backtracking with beam search. Best-first search: traverses a graph in the order of likely importance using a priority queue. Bidirectional search: find the shortest path from an initial vertex to a goal vertex in a directed graph. Bloom filter: a constant time and memory check to see whether a given element exists in a set.
Estimates vary as to how long it took to build the Taj Mahal. Some historians state that it took only 14 years to build it, from 1631-1645, but a more realistic figure is probably 22 years, being completed in 1653.
Blending Islamic and Hindu elements, the emperor Akbar constructed the royal city of Fatehpur Sikri, located 26 miles (42 km) west of Agra, in the late 1500s and his grandson Shah Jahan had constructed the mausoleum of Taj Mahal forMumtaz Mahal in the 1650s, though this time period is well after the Islamic Golden Age.