Misplaced Pages

Ajoy Bose

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.

Ajoy Bose (born 1952) is a Bengali-Indian author, political journalist and television commentator. His books include For Reasons of State: Delhi under Emergency (1977, written with John Dayal ) on the Emergency ; The Shah Commission Begins (1978, with Dayal); Behenji (2009), a biography of Indian politician and social reformer Mayawati ; and Across the Universe: The Beatles in India (2018).

#274725

42-586: His writing has appeared in the publications Scroll.in , Quartz , Outlook , Economic and Political Weekly and Firstpost . In 2021, he made his directorial debut with the documentary film The Beatles and India . He has worked as a resident commentator for CNN-News18 . Bose grew up in Calcutta. This article about an Indian writer or poet is a stub . You can help Misplaced Pages by expanding it . Scroll.in Scroll.in , simply referred to as Scroll ,

84-595: A binary search algorithm (with cost ⁠ O ( log ⁡ n ) {\displaystyle O(\log n)} ⁠ ) outperforms a sequential search (cost ⁠ O ( n ) {\displaystyle O(n)} ⁠ ) when used for table lookups on sorted lists or arrays. The analysis, and study of algorithms is a discipline of computer science . Algorithms are often studied abstractly, without referencing any specific programming language or implementation. Algorithm analysis resembles other mathematical disciplines as it focuses on

126-580: A computation . Algorithms are used as specifications for performing calculations and data processing . More advanced algorithms can use conditionals to divert the code execution through various routes (referred to as automated decision-making ) and deduce valid inferences (referred to as automated reasoning ). In contrast, a heuristic is an approach to solving problems that do not have well-defined correct or optimal results. For example, although social media recommender systems are commonly called "algorithms", they actually rely on heuristics as there

168-468: A flowchart offers a way to describe and document an algorithm (and a computer program corresponding to it). It has four primary symbols: arrows showing program flow, rectangles (SEQUENCE, GOTO), diamonds (IF-THEN-ELSE), and dots (OR-tie). Sub-structures can "nest" in rectangles, but only if a single exit occurs from the superstructure. It is often important to know how much time, storage, or other cost an algorithm may require. Methods have been developed for

210-496: A subscription business model providing ad free delivery of news service and access to archives for subscribers. Naresh Fernandes, the editor-in-chief however stated that the publication will not implement any paywalls . In December 2018, Deutsche Welle partnered with Scroll.in to launch its Indian weekly programme, Eco India as part of DW's venture into the South Asian media industry. Between May–June 2019, Scroll.in laid off

252-506: A computer, Babbage's analytical engine, which is the first device considered a real Turing-complete computer instead of just a calculator . Although a full implementation of Babbage's second device was not realized for decades after her lifetime, Lovelace has been called "history's first programmer". Bell and Newell (1971) write that the Jacquard loom , a precursor to Hollerith cards (punch cards), and "telephone switching technologies" led to

294-680: A computer-executable form, but are also used to define or document algorithms. There are many possible representations and Turing machine programs can be expressed as a sequence of machine tables (see finite-state machine , state-transition table , and control table for more), as flowcharts and drakon-charts (see state diagram for more), as a form of rudimentary machine code or assembly code called "sets of quadruples", and more. Algorithm representations can also be classified into three accepted levels of Turing machine description: high-level description, implementation description, and formal description. A high-level description describes qualities of

336-713: A computing machine or a human who could only carry out specific elementary operations on symbols . Most algorithms are intended to be implemented as computer programs . However, algorithms are also implemented by other means, such as in a biological neural network (for example, the human brain performing arithmetic or an insect looking for food), in an electrical circuit , or a mechanical device. Step-by-step procedures for solving mathematical problems have been recorded since antiquity. This includes in Babylonian mathematics (around 2500 BC), Egyptian mathematics (around 1550 BC), Indian mathematics (around 800 BC and later),

378-475: A final ending state. The transition from one state to the next is not necessarily deterministic ; some algorithms, known as randomized algorithms , incorporate random input. Around 825 AD, Persian scientist and polymath Muḥammad ibn Mūsā al-Khwārizmī wrote kitāb al-ḥisāb al-hindī ("Book of Indian computation") and kitab al-jam' wa'l-tafriq al-ḥisāb al-hindī ("Addition and subtraction in Indian arithmetic"). In

420-470: A number of editorial staff citing a restructure of their business model. Scroll's staff are segregated into two divisions; the editorial team and the distribution team. In an article of the Columbia Journalism Review , the segregation was explained as the result of caution associated with the "credibility of digital media " prevalent among the former print medium journalists who constituted

462-525: A programmer can write structured programs using only these instructions; on the other hand "it is also possible, and not too hard, to write badly structured programs in a structured language". Tausworthe augments the three Böhm-Jacopini canonical structures : SEQUENCE, IF-THEN-ELSE, and WHILE-DO, with two more: DO-WHILE and CASE. An additional benefit of a structured program is that it lends itself to proofs of correctness using mathematical induction . By themselves, algorithms are not usually patentable. In

SECTION 10

#1732886648275

504-477: A sequence of operations", which would include all computer programs (including programs that do not perform numeric calculations), and any prescribed bureaucratic procedure or cook-book recipe . In general, a program is an algorithm only if it stops eventually —even though infinite loops may sometimes prove desirable. Boolos, Jeffrey & 1974, 1999 define an algorithm to be an explicit set of instructions for determining an output, that can be followed by

546-416: Is a method or mathematical process for problem-solving and engineering algorithms. The design of algorithms is part of many solution theories, such as divide-and-conquer or dynamic programming within operation research . Techniques for designing and implementing algorithm designs are also called algorithm design patterns, with examples including the template method pattern and the decorator pattern. One of

588-576: Is a more specific classification of algorithms; an algorithm for such problems may fall into one or more of the general categories described above as well as into one of the following: One of the simplest algorithms finds the largest number in a list of numbers of random order. Finding the solution requires looking at every number in the list. From this follows a simple algorithm, which can be described in plain English as: High-level description: (Quasi-)formal description: Written in prose but much closer to

630-668: Is an Indian digital news publication. Founded in 2014, it is owned by SCSN Pvt Ltd. Samir Patil, a Massachusetts Institute of Technology alumnus and McKinsey & Company associate was the founder of ACK Media which published Amar Chitra Katha and Tinkle in India. In 2011, he sold the venture to the Future Group and founded the Scroll Media Inc in the following year. The company was incorporated in Delaware , United States. Scroll.in

672-460: Is no truly "correct" recommendation. As an effective method , an algorithm can be expressed within a finite amount of space and time and in a well-defined formal language for calculating a function . Starting from an initial state and initial input (perhaps empty ), the instructions describe a computation that, when executed , proceeds through a finite number of well-defined successive states, eventually producing "output" and terminating at

714-453: Is useful for uncovering unexpected interactions that affect performance. Benchmarks may be used to compare before/after potential improvements to an algorithm after program optimization. Empirical tests cannot replace formal analysis, though, and are non-trivial to perform fairly. To illustrate the potential improvements possible even in well-established algorithms, a recent significant innovation, relating to FFT algorithms (used heavily in

756-1094: The Entscheidungsproblem (decision problem) posed by David Hilbert . Later formalizations were framed as attempts to define " effective calculability " or "effective method". Those formalizations included the Gödel – Herbrand – Kleene recursive functions of 1930, 1934 and 1935, Alonzo Church 's lambda calculus of 1936, Emil Post 's Formulation 1 of 1936, and Alan Turing 's Turing machines of 1936–37 and 1939. Algorithms can be expressed in many kinds of notation, including natural languages , pseudocode , flowcharts , drakon-charts , programming languages or control tables (processed by interpreters ). Natural language expressions of algorithms tend to be verbose and ambiguous and are rarely used for complex or technical algorithms. Pseudocode, flowcharts, drakon-charts, and control tables are structured expressions of algorithms that avoid common ambiguities of natural language. Programming languages are primarily for expressing algorithms in

798-471: The Hammurabi dynasty c.  1800  – c.  1600 BC , Babylonian clay tablets described algorithms for computing formulas. Algorithms were also used in Babylonian astronomy . Babylonian clay tablets describe and employ algorithmic procedures to compute the time and place of significant astronomical events. Algorithms for arithmetic are also found in ancient Egyptian mathematics , dating back to

840-567: The Kerala School , and the Brāhmasphuṭasiddhānta . The first cryptographic algorithm for deciphering encrypted code was developed by Al-Kindi , a 9th-century Arab mathematician, in A Manuscript On Deciphering Cryptographic Messages . He gave the first description of cryptanalysis by frequency analysis , the earliest codebreaking algorithm. Bolter credits the invention of the weight-driven clock as "the key invention [of Europe in

882-740: The Rhind Mathematical Papyrus c.  1550 BC . Algorithms were later used in ancient Hellenistic mathematics . Two examples are the Sieve of Eratosthenes , which was described in the Introduction to Arithmetic by Nicomachus , and the Euclidean algorithm , which was first described in Euclid's Elements ( c.  300 BC ). Examples of ancient Indian mathematics included the Shulba Sutras ,

SECTION 20

#1732886648275

924-504: The Ifa Oracle (around 500 BC), Greek mathematics (around 240 BC), Chinese mathematics (around 200 BC and later) , and Arabic mathematics (around 800 AD). The earliest evidence of algorithms is found in ancient Mesopotamian mathematics. A Sumerian clay tablet found in Shuruppak near Baghdad and dated to c.  2500 BC describes the earliest division algorithm . During

966-470: The Middle Ages ]," specifically the verge escapement mechanism producing the tick and tock of a mechanical clock. "The accurate automatic machine" led immediately to "mechanical automata " in the 13th century and "computational machines"—the difference and analytical engines of Charles Babbage and Ada Lovelace in the mid-19th century. Lovelace designed the first algorithm intended for processing on

1008-578: The United States, a claim consisting solely of simple manipulations of abstract concepts, numbers, or signals does not constitute "processes" (USPTO 2006), so algorithms are not patentable (as in Gottschalk v. Benson ). However practical applications of algorithms are sometimes patentable. For example, in Diamond v. Diehr , the application of a simple feedback algorithm to aid in the curing of synthetic rubber

1050-450: The algorithm itself, ignoring how it is implemented on the Turing machine. An implementation description describes the general manner in which the machine moves its head and stores data in order to carry out the algorithm, but does not give exact states. In the most detail, a formal description gives the exact state table and list of transitions of the Turing machine. The graphical aid called

1092-588: The algorithm's properties, not implementation. Pseudocode is typical for analysis as it is a simple and general representation. Most algorithms are implemented on particular hardware/software platforms and their algorithmic efficiency is tested using real code. The efficiency of a particular algorithm may be insignificant for many "one-off" problems but it may be critical for algorithms designed for fast interactive, commercial or long life scientific usage. Scaling from small n to large n frequently exposes inefficient algorithms that are otherwise benign. Empirical testing

1134-403: The analysis of algorithms to obtain such quantitative answers (estimates); for example, an algorithm that adds up the elements of a list of n numbers would have a time requirement of ⁠ O ( n ) {\displaystyle O(n)} ⁠ , using big O notation . The algorithm only needs to remember two values: the sum of all the elements so far, and its current position in

1176-459: The development of the first computers. By the mid-19th century, the telegraph , the precursor of the telephone, was in use throughout the world. By the late 19th century, the ticker tape ( c.  1870s ) was in use, as were Hollerith cards (c. 1890). Then came the teleprinter ( c.  1910 ) with its punched-paper use of Baudot code on tape. Telephone-switching networks of electromechanical relays were invented in 1835. These led to

1218-784: The distribution assets of the publication. According to a report from the Reuters Institute for the Study of Journalism , the content delivery of the Scroll.in resembles "almost the pace of a newswire with the depth and sophistication of a quality news magazine," while the presentation of the site was described to be targeted toward an "up-market" audience and compared favorably with Quartz . The publication's business strategy aims to generate income through premium native advertising and sponsored content , resembling that of traditional magazine advertising rather than obtrusive ads that distract or annoy

1260-517: The early 12th century, Latin translations of said al-Khwarizmi texts involving the Hindu–Arabic numeral system and arithmetic appeared, for example Liber Alghoarismi de practica arismetrice , attributed to John of Seville , and Liber Algorismi de numero Indorum , attributed to Adelard of Bath . Hereby, alghoarismi or algorismi is the Latinization of Al-Khwarizmi's name; the text starts with

1302-551: The editor-in-chief of Scroll.in. The publication had received early stage investments from the IPS Media Foundation , the Media Development Investment Fund and the investment firm of Omidyar Network , following an endorsement from the law firm Khaitan & Co . In June 2014, Atlantic Media partnered with the Scroll Media Inc to launch the Indian edition of the business news brand Quartz . In

Ajoy Bose - Misplaced Pages Continue

1344-460: The editorial team of the new publication. The editorial team in addition consists of an appointed ombudsman for additional editorial oversight. Naresh Fernandes is the current editor-in-chief of the website. The Hindi edition of the publication, Satyagrah, has a separate editorial team with Sanjay Dubey as the editor-in-chief. The distribution team of the publication is staffed with analysts of social media and search result algorithm who manage

1386-400: The editorial team. According to Forbes India , the monthly unique readership of the website was four million as of August 2016. Algorithm In mathematics and computer science , an algorithm ( / ˈ æ l ɡ ə r ɪ ð əm / ) is a finite sequence of mathematically rigorous instructions, typically used to solve a class of specific problems or to perform

1428-427: The field of image processing), can decrease processing time up to 1,000 times for applications like medical imaging. In general, speed improvements depend on special properties of the problem, which are very common in practical applications. Speedups of this magnitude enable computing devices that make extensive use of image processing (like digital cameras and medical equipment) to consume less power. Algorithm design

1470-456: The following year, the Hindi media publishing company Satyagrah was merged with Scroll Media and became the Hindi edition of Scroll.in which continues to operate under the name of Satyagrah. Sanjay Dubey who was the founder and editor of Satyagrah and previously the editor of Tehelka ' s Hindi edition, remained as the editor of Satyagrah. In March 2018, the publication partially shifted towards

1512-450: The input list. If the space required to store the input numbers is not counted, it has a space requirement of ⁠ O ( 1 ) {\displaystyle O(1)} ⁠ , otherwise ⁠ O ( n ) {\displaystyle O(n)} ⁠ is required. Different algorithms may complete the same task with a different set of instructions in less or more time, space, or ' effort ' than others. For example,

1554-482: The invention of the digital adding device by George Stibitz in 1937. While working in Bell Laboratories, he observed the "burdensome" use of mechanical calculators with gears. "He went home one evening in 1937 intending to test his idea... When the tinkering was over, Stibitz had constructed a binary adding device". In 1928, a partial formalization of the modern concept of algorithms began with attempts to solve

1596-627: The most important aspects of algorithm design is resource (run-time, memory usage) efficiency; the big O notation is used to describe e.g., an algorithm's run-time growth as the size of its input increases. Per the Church–Turing thesis , any algorithm can be computed by any Turing complete model. Turing completeness only requires four instruction types—conditional GOTO, unconditional GOTO, assignment, HALT. However, Kemeny and Kurtz observe that, while "undisciplined" use of unconditional GOTOs and conditional IF-THEN GOTOs can result in " spaghetti code ",

1638-552: The phrase Dixit Algorismi , or "Thus spoke Al-Khwarizmi". Around 1230, the English word algorism is attested and then by Chaucer in 1391, English adopted the French term. In the 15th century, under the influence of the Greek word ἀριθμός ( arithmos , "number"; cf. "arithmetic"), the Latin word was altered to algorithmus . One informal definition is "a set of rules that precisely defines

1680-496: The reader. The report also described the publication to have developed a simple and responsive design for its website for the purpose of easy accessibility . In addition to the primary website, the distribution of Scroll's content is provided through an Android app , two email newsletters and an array of social media channels across Facebook , Twitter , Instagram , and YouTube . Scroll also operates an online shop for books and literary accessories based on recommendations from

1722-449: Was deemed patentable. The patenting of software is controversial, and there are criticized patents involving algorithms, especially data compression algorithms, such as Unisys 's LZW patent . Additionally, some cryptographic algorithms have export restrictions (see export of cryptography ). Another way of classifying algorithms is by their design methodology or paradigm . Some common paradigms are: For optimization problems there

Ajoy Bose - Misplaced Pages Continue

1764-513: Was launched in January 2014 as an Indian news website through the holding company of Scroll Media Incorporation. It was founded by Samir Patil and senior journalist Naresh Fernandes, along with Jennifer O'Brien, the former head of business development at the travel startup Trabblr. Naresh Fernandes who was previously the editor-in-chief of Time Out India and a journalist associated with The Times of India and The Wall Street Journal , became

#274725