text:
Edward Henry Potthast

Edward Henry Potthast (June 10, 1857 – March 9, 1927) was an American Impressionist painter. He is known for his paintings of people at leisure in Central Park, and on the beaches of New York and New England.

Life and work
Edward Henry Potthast was born on June 10, 1857, in Cincinnati, Ohio, to Henry Ignatz Potthast and Bernadine Scheiffers. Starting in 1870 he studied art at the McMicken School in Cincinnati and in 1873 he started working at the Strobridge Lithography Company. From June 10, 1879, to March 9, 1881, Potthast studied under Thomas Satterwhite Noble, a retired Confederate army captain who had studied with Thomas Couture in Paris. Potthast later studied at the Royal Academy in Munich with the American-born instructor Carl Marr. After returning to Cincinnati in 1885 he resumed his studies with Noble. In 1886, he departed for Paris, where he studied with Fernand Cormon. In 1895 he relocated to New York City and remained there until his death in 1927.

Until the age of thirty-nine Potthast earned a living as a lithographer. The purchase of one of his paintings by the Cincinnati Museum of Art may have encouraged him to abandon lithography for a career as a fine artist. His paintings retained the subdued colors and strong contrasts of the Munich school until he adopted the Impressionist palette late in his career.

After his arrival in New York Potthast worked as a magazine illustrator, and exhibited regularly at the National Academy of Design, the Society of American Artists and the Salmagundi Club, winning numerous prizes. By 1908 he was installed in a studio in the Gainsborough Building. Thereafter he painted sun-saturated images of Central Park, New England landscapes, and the Long Island beach scenes for which he is best remembered.

His work is included in many major museums in the United States, including the Orlando Museum of Art, the Brooklyn Museum, the Cape Ann Museum, the Delaware Art Museum, the University of Michigan Museum of Art, the Phoenix Art Museum, the Nasher Museum of Art, and the Virginia Museum of Fine Arts.

title: Edward Henry Potthast


text:
User:Eurodyne/links

 * 1)
 * Category:Articles with too few wikilinks
 * Category:CS1 errors: missing author or editor

source: wikimedia

license: Creative Commons - Attribution Share-Alike - https://creativecommons.org/licenses/by-sa/4.0/

title: User:Eurodyne/links


text:
Wikipedia:Articles for deletion/Peter Helf

The result of the debate was SPEEDY DELETE. Harr o 5 01:30, 20 March 2006 (UTC)

Peter Helf
Delete in view of non-notability of subject (Helf is said to be best known for his role in the film Busy Season, but the relevant Google search returns zero hits; a general Googling of the bio's subject returns, on the first few pages, no relevant responses, and the IMDB entry is for a different individual. Joe 23:49, 19 March 2006 (UTC)
 * Delete, per nom. Could find nothing relevant; more than likely a joke entry.  Kuru   talk  23:57, 19 March 2006 (UTC)
 * Speedy Delete already speedied once, this should really be speedied as a . Clearly non-notable per the above and quite possibly an attack page too. Gwernol 00:01, 20 March 2006 (UTC)


text:
Wikipedia:Articles for deletion/Manuel A. Roxas District Hospital

The result was redirect to List of hospitals in the Philippines per WP:ATD. – Joe (talk) 07:40, 4 September 2020 (UTC)

Manuel A. Roxas District Hospital

 * – ( View AfD View log  Stats )

This an article about an extremely small non-notable hospital. All the references in it are dead links, primary, or both. I couldn't find anything about it in a WP:BEFORE either that would pass either WP:GNG or WP:NORG, just a few trivial name drops in articles about Covid-19. Per prior consensus on non-notable hospitals as an alternative to deletion it could be redirected to List_of_hospitals_in_the_Philippines. — Preceding unsigned comment added by Adamant1 (talk • contribs)
 * Note: This discussion has been included in the list of Philippines-related deletion discussions. Shellwood (talk) 12:44, 18 August 2020 (UTC)
 * Note: This discussion has been included in the list of Geography-related deletion discussions. Coolabahapple (talk) 03:08, 19 August 2020 (UTC)
 * Note: This discussion has been included in the list of Architecture-related deletion discussions. Coolabahapple (talk) 03:08, 19 August 2020 (UTC)
 * Note: This discussion has been included in the list of Health and fitness-related deletion discussions. Coolabahapple (talk) 03:08, 19 August 2020 (UTC)
 * Note: This discussion has been included in the list of Companies-related deletion discussions. Coolabahapple (talk) 03:08, 19 August 2020 (UTC)

 * Delete way to small to have an article. Catfurball (talk) 23:36, 20 August 2020 (UTC)
 * Keep, It does meet the WikiProject Hospitals/Tutorials criteria. Small doesn't mean not notable, so long at it is recognized in news and media sources.  WP:HOS  -- Talk to G Moore 13:30, 22 August 2020 (UTC)
 * Which news sources is it talked about in though? The refernces in the article are primary, not news coverage, and I don't see you providing any. So no it doesn't meet the notability standards, for the hospitals wikiproject or otherwise. --Adamant1 (talk) 02:24, 23 August 2020 (UTC)

 Relisted to generate a more thorough discussion and clearer consensus.

Please add new comments below this notice. Thanks, North America1000 16:05, 25 August 2020 (UTC)
 * Delete The only sources I find are official hospital websites, government notices, and directory listings. Nothing in-depth or independent. Glendoremus (talk) 23:45, 1 September 2020 (UTC)
 * Redirect to List of hospitals in the Philippines: Barely found anything about the hospital. ASTIG😎  (ICE T • ICE CUBE) 16:00, 3 September 2020 (UTC)


text:
User:Adhm Nofal/sandbox

Bassam HALAKA, (born 8 December 1939) is an Irish virtuoso flute player from Belfast, nicknamed "The Man With the Golden Flute". Following in the footsteps of Jean-Pierre Rampal, he established an international career as a solo flute player.

Early life and education
Galway was born in East Belfast near the Belfast docks as one of two brothers. His father, who played the flute, was employed at the Harland and Wolff shipyard until the end of World War II and spent night-shifts cleaning buses after the war, while his mother, a pianist, was a winder in a flax-spinning mill. Surrounded by a tradition of flute bands and many friends and family members who played the instrument, he was taught the flute by his uncle at the age of nine and joined his Fife and drum corps; at the age of eleven he won the junior, senior and open Belfast flute Championships in a single day. His first instrument was a five-key Irish flute, and at the age of twelve or thirteen, he received a Boehm instrument. He left school at the age of fourteen and worked as an apprentice to a piano repairer for two years.

He subsequently went to London to study the flute at the Royal College of Music under John Francis and then at the Guildhall School of Music under Geoffrey Gilbert. He then studied at the Paris Conservatoire under Gaston Crunelle and Jean-Pierre Rampal and also privately with Marcel Moyse.

Career
After his education he spent fifteen years as an orchestral player.

He has played with Sadler's Wells Opera, Covent Garden Opera, the London Symphony Orchestra and the Royal Philharmonic Orchestra. He auditioned for the Berlin Philharmonic Orchestra under Herbert von Karajan, and was principal flute of that orchestra from 1969 to 1975. To Karajan's surprise and dismay, after a period of some disagreement, Galway decided that he would leave to pursue a solo career.

In addition to his performances of the standard classical repertoire, he features contemporary music in his programmes, including new flute works commissioned by and for him by composers including David Amram, Malcolm Arnold, William Bolcom, John Corigliano, John Wolf Brennan, Dave Heath, Lowell Liebermann and Joaquín Rodrigo. The album James Galway and The Chieftains in Ireland by Galway and The Chieftains reached number 32 in the UK Albums Chart in 1987.

Galway still performs regularly and is one of the world's most well-known flute players. His recordings have sold over 30 million copies.

In 1990, he was invited by Roger Waters to play at The Wall – Live in Berlin concert, held in Potsdamer Platz; he played Pink Floyd's songs "Goodbye Blue Sky" and "Is There Anybody Out There?". Galway performed for the Academy Award-winning ensemble recording the soundtracks of Peter Jackson's The Lord of the Rings film trilogy, composed by Howard Shore. In June 2008, he was inducted into the Hollywood Bowl Hall of Fame along with Liza Minnelli and B. B. King.

He currently performs on Nagahara flutes, as well as some Muramatsu Flutes. Conn-Selmer produces his line of flutes, "Galway Spirit Flutes".

Galway is president of a global organisation called Flutewise, a charitable organisation which supports young flute players, run by Liz Goodwin. In 2003 he formed the Music Education Consortium together with Julian Lloyd Webber, Evelyn Glennie and Michael Kamen to pressure the British Government into providing better music education in schools. He is an Ambassador for the National Foundation for Youth Music, a UK charity. He was made an Officer of the Order of the British Empire (OBE) in 1977, and was knighted in 2001, the first wind player ever to receive that honour. He is a National Patron of Delta Omicron, an international professional music fraternity.

In December 2013 Galway launched First Flute, an online interactive series of lessons for beginning flute students of all ages.

He received the 2014 Gramophone Lifetime Achievement Award.

Personal life
Galway has been married three times. His first marriage, to a Frenchwoman, produced a son. He married his second wife, Anna (Annie) Renggli, a daughter of a well-known Swiss architect, in 1972, and moved from Berlin to Lucerne, Switzerland, her hometown. The couple had twin daughters and a son. In 1978 he recorded for her an instrumental version of John Denver's "Annie's Song". It peaked at no. 3 in the UK Singles Chart.

After their divorce he moved to Meggen, Switzerland, a village next to Lucerne, where he resides now with his third wife, the American-born Jeanne Galway (née Cinnante), whom he married in 1984. They often tour together playing duets. In addition, they give master classes for flutists of all levels.

Galway is a dedicated Christian who visits various types of churches while travelling (as long as they are not modern and "happy-clappy") and prays before his concert performances. He also wears a cross pendant, about which he says, "It's not jewellery. It's something that reminds me of what I should be doing and how I should be behaving."

In August 1977, Galway was run over by a large speeding motorcycle in Lucerne, breaking his left arm and both legs and requiring a four-month hospital stay. He has the eye condition nystagmus, and is a patron of the Nystagmus Network, a UK-based support group for people with the condition. On 23 December 2009, he fell down a flight of stairs at his home, fracturing his left wrist and shattering his right elbow.

Appearing on The Nolan Show in June 2015, Galway stated that he views his national identity as Irish. He was critical of the actions of the Northern Irish government during his childhood, and singled out prominent Unionist figures such as Ian Paisley for fostering the division that led to The Troubles. His comments were criticised by prominent Unionist politicians, among them Sammy Wilson. Describing Northern Ireland as "the British-occupied part of Ireland", Sir James further elaborated he would like "Ireland to be Ireland" and that when people ask him where he comes from he says "Ireland" and when asked if he is "Irish", he replies affirmatively.

James's younger brother George Galway (born Belfast, 23 December 1940) is a jazz musician (clarinet, flute, and saxophone) and teacher based in Manchester, England. George's elder child and James's nephew, Martin Galway, is a musician known for his work on Commodore 64 computer game music in the 1980s.

Discography
NOTE: This list is far from complete. Earlier albums were re-released on CD in the late 1980s and early 1990s, some of these may be listed below by their CD release date rather than their original release.

 * Vivaldi The Four Seasons (with the Zagreb Soloists) (1977)
 * James Galway plays Songs for Annie (1978)
 * Song of the Seashore (1979)
 * Annie's Song (1981)
 * The Wayward Wind (1982)
 * Man with the Golden Flute (1982)
 * Nocturne (1983)
 * James Galway Plays Mozart (1984)
 * Italian Serenade (with Kazuhito Yamashita) (1986)
 * James Galway's Christmas Carol (1986)
 * In Ireland (with The Chieftains) (1987)
 * Mercadante Concerto (1987)
 * J.S. Bach Suite No. 2 Concerto – Trio Sonatas (1987)
 * Greatest Hits (1988)
 * James Galway Plays Giuliani (1988)
 * James Galway Plays Beethoven (1988)
 * C.P.E. Bach 3 Concertos (1989)
 * Quantz 4 Concertos (1989)
 * The Concerto Collection (1990)
 * Mozart Concerto No. 1, Andante and Concerto for Flute and Harp (1990)
 * Over the Sea to Skye (1990)
 * The Enchanted Forest – Melodies of Japan (with Hiro Fujikake) (1990)
 * J.S. Bach Suite No. 2 Concerto for Flute, Violin and Harpsichord (1991)
 * Italian Flute Concertos (1991)
 * In Dulci Jubilo (1991)
 * Sometimes when We Touch (with Cleo Laine) (1991)
 * The Wind Beneath my Wings (1991)
 * Mozart Flute Quartets (1991)
 * Greatest Hits Vol. 2 (1992)
 * Mozart Concerto for Flute and Harp and Sonatas for Flute and Piano (1992)
 * At the Movies (1992)
 * The Magic Flute (1992)
 * Danzi (1993)
 * Dances for Flute (1993)
 * James Galway Plays Khachaturian (with Sabine Meyer) (1993)
 * Seasons (1993)
 * The Essential James Galway (2-CD compilation)

 * The Classical James Galway (1993)
 * Bach Sonatas (1993)
 * Pachelbel Canon & Other Baroque Favorites (1994)
 * Wind of Change (1994)
 * The Lark in the Clear Air (1994)
 * The French Recital (1994)
 * Mozart Concerto for Flute and Harp, concerto No. 1 and Concerto No. 2 (1995)
 * Bach Vol.2 Trio Sonatas (1995)
 * The Celtic Minstrel (1996)
 * James Galway Plays the Music of Sir Malcolm Arnold (1996)
 * Music for my Friends (1997)
 * James Galway Plays Lowell Liebermann (1997)
 * Legends (1997)
 * Flute Sonatas (1997)
 * Greatest Hits Vol. 3 (1998)
 * Meditations (1998)
 * Serenade (1998)
 * Tango Del Fuego (1998)
 * Winter's Crossing (1998)
 * Unbreak my Heart (1999)
 * Sixty Years – Sixty Flute Masterpieces Collection (1999)
 * Love Song (2001)
 * Hommage à Rampal (with Jeanne Galway) (2001)
 * A Song of Home: An American Musical Journey (2002)
 * The Very Best of James Galway (2002)
 * Music for my Little Friends (2002)
 * Wings of Song (2004)
 * The Essential James Galway (2006)
 * Ich war ein Berliner (2006)
 * My Magic Flute (2006)
 * O'Reilly Street (with Tiempo Libre) (2008)
 * Vivaldi – Concerti for Flute (DVD) (2008)
 * Celebrating 70: A Collection of Personal Favorites (2009)
 * James Galway Plays Flute Concertos (12-CD Box Set) (2011)
 * The Man with the Golden Flute – The Complete RCA Collection (71-CD & 2-DVD box set) (2014)

title: User:Adhm Nofal/sandbox


text:
User:Dphrag

Modules I pay attention to:

 * Economics

I am currently working on an honours degree in Economics at the Univerisity of Alberta. I have a previous diploma in object-oriented software design.

title: User:Dphrag


text:
User:HumdingerandSons/sandbox

Humdinger and Sons is a creative agency based in Minneapolis, MN. Founded in 2013 by Nicolas Will and Andrew Berg, Humdinger help tech-minded companies gain a leading and lasting edge in today's every-changing, multi-platform media landscape. From well-known brands to established startups, Humdinger has helped their clients' innovate their products, services, and perception. The agency offers services in the fields of User Experience Design, Interface Design, Video and Animation, Branding, 3D Rendering, and Strategic Planning.

Humdinger and Sons
Humdinger and Sons is a creative agency based in Minneapolis, MN. Founded in 2013 by Nicolas Will and Andrew Berg, Humdinger help tech-minded companies gain a leading and lasting edge in today's every-changing, multi-platform media landscape. From well-known brands to established startups, Humdinger has helped their clients' innovate their products, services, and perception. The agency offers services in the fields of User Experience Design, Interface Design, Video and Animation, Branding, 3D Rendering, and Strategic Planning.

title: User:HumdingerandSons/sandbox


text:
distância

Etymology
.

Noun

 * 1) distance space between two points, two places or two objects
 * 2) timelapse between two moments;  interval
 * 3) separation; remoteness
 * 4) detachment
 * 5) longitude
 * 1) longitude

title: distância


text:
Tiar, Bhojpur

Tiar is a village in the southwestern corner of Bihiya block in Bhojpur district, Bihar, India. As of 2011, its population was 4,338, in 663 households.

title: Tiar, Bhojpur


text:
Help:Quiz

This is the help page for the quiz extension.

For a simple and colourful guide, see Help:Quiz-Simple.

The quiz extension consists of very simple markup. This page is long because of the many possibilities which the quiz extension opens up.

Also see the Quiz learning project.

Version

 * Version 1.0 of the quiz extension is now(20 May 2007)active on Wikiversity.
 * This documentation covers all the major features and most of the minor ones.
 * A few exotic features are not yet covered, such as shuffle control using {X} {!X} {/X} tags.

Pedagogical considerations

 * Where are the strengths and weaknesses of Wikiversity quizzing?
 * How can you best use the quiz extension as a teaching tool?
 * Wikiversity compared to Moodle - offers a detailed consideration of the quiz feature differences between Moodle and Wikiversity, including suggestions as to how each is best used.

The quiz tag
{| class="wikitable" !wikitext (what you write)!!rendering (what you see)!!comments
 * valign=top width=200|<quiz> insert questions here </quiz>
 * valign=top|
 * valign=top|The quiz tags do the following:
 * They insert some standard quiz options at the top and a colour-key for marking. The colour-key only appears when the question is marked.
 * They add a "submit" button at the bottom for when the learner has finished the quiz and wants it marked.
 * Everything between the quiz tags is parsed by the quiz extension and turned into questions if possible.
 * Everything between the quiz tags is parsed by the quiz extension and turned into questions if possible.

Theoretically it is possible to put quiz tags around each individual question, allowing a learner to mark each one in turn.

Shuffling questions: if the shuffle questions button is shown, the questions can be shuffled by clicking the button. This only works so long as the quiz-taker has not started to answer the questions. Once the quiz-taker starts answering, the order is locked.Shuffle button is not shown if there is one or less questions in a quiz.

 * valign=top|<quiz display=simple> insert questions here </quiz>
 * valign=top|
 * valign=top|
 * Importantly, the addition of "display=simple" as an attribute of the quiz tag removes the points table at the top.
 * This is useful for short quizzes, and especially for situations where you insert single questions between text blocks.
 * This is useful for short quizzes, and especially for situations where you insert single questions between text blocks.

 * valign=top|<quiz shuffle=none> insert questions here </quiz>
 * valign=top|
 * valign=top|

 * valign=top|
 * If you'd like to keep the points table but get rid of the button for shuffling questions, use shuffle=none as shown.

 * valign=top width=200|<quiz shuffleanswers=true> questions with proposal shuffled on reload here </quiz>
 * valign=top|
 * valign=top|

Shuffling answers: The quiz also provides the option of automatic shuffling of answers on load.This can be achieved by using shuffleanswers parameter.When shuffleanswers parameter is set to true the answers are shuffled for each reload of the page. This only works so long as the quiz-taker has not started to answer the questions. Once the quiz-taker starts answering, the order is locked to the way it was before submission.
 * valign=top|

 * }

Inserting questions
The types of questions available are shown below.

An important point is that each question must be separated by a blank line, otherwise they are merged together into one question.

How to use the examples
In the examples on this page, there is both wikitext and rendering. The wikitext shows you the code, which you can copy and paste into your pages, or just learn and understand. The rendering shows you what the result will look like.

Copying and pasting
The markup has been slightly simplified in order to help understanding. If you copy and paste, you must insert <quiz> tags before and after the markup. You may wish to use the quiz tags with the "display=simple" option as shown above.

Note that the actual example below also use tables for clarity. If a quiz is inserted into a table, this modifies the appearance of a quiz - for example, boxes appear around some elements in the quiz. If you don't use a table, these boxes disappear and your quiz will look plainer.

When pasting, ensure that all the symbols are aligned with the beginning of the lines of the page - i.e. if any line begins with a space, formatting errors may occur.

Live demos
All the examples below should work. Don't be afraid to try them out. Hitting the correction button is OK - it won't change or damage this page.

Basic question types

 * Note: For multiple choice questions(MCQs) with negative(-) sign and positive(+) sign, the positive sign(+) signifies the correct answer while the negative(-) sign(s) signifies the wrong answer and this is how Quiz know which answer is correct and which one is wrong.

Using animations
The section adds no new technical tricks, but it looks pretty.

Markup that works inside quizzes

 * Hyperlinks: .....
 * Images: [[Image:....]].
 * Other media: .....
 * Bold and italic.
 * and

Markup that partly works inside quizzes

 * Templates:.
 * subst doesn't work.
 * Tables: {|....|}.
 * Headings: e.g. ===....===.
 * Warning: At the moment there is a problem with the toc.
 * Lists and indents: using #, * and :

Adding music and sound effects
This is similar to insertion of images. Standard wiki markup is used.

Troubleshooting

 * You cannot test out the quiz while editing a page, because the submit button is grayed out. If you wish to test your new quiz, then create a sandbox page somewhere else first (e.g. as a subpage of your user page), then test the quiz there, and finally transfer the quiz to its final location (and test it again anyway).
 * The quiz was developed for IE6, IE7, Firefox (and Opera?), but display quality on Opera may not be optimal, and there may be display differences between browsers.
 * A reminder: each question must be separated by a blank line, otherwise the questions are merged together into one question.

Future stuff
Information about future developments is mainly available at the project space on MediaWiki. Lots of things are in planning.

Wikiversity

 * Quiz learning project
 * Simpler version of this documentation

Wikipedia

 * Educational assessment and evaluation category
 * Multiple choice testing
 * Cloze testing
 * Quiz

MediaWiki

 * The quiz extension project at MediaWiki where discussion and development of the quiz extension takes place.

de:Wikiversity:Quiz el:Βοήθεια:Quiz fr:Aide:Quiz it:Aiuto:Quiz pt:Wikiversidade:Quiz sl:Pomoč:Quiz/Sl sv:Hjälp:Quiz

title: Help:Quiz


text:
Sims Legion Park

Sims Legion Park is a 3,000-seat baseball park in Gastonia, North Carolina that is the home field for Gaston College baseball. It has hosted the Gastonia Grizzlies of the Coastal Plain League, as well as American Legion baseball. The Grizzlies moved to Spartanburg, South Carolina starting with the 2021 season and were renamed the Spartanburgers.

The stadium underwent a total rebuild in the 1970s in order to attract a Minor League Baseball team. Since then the stadium has seen many tenants come and go. An ongoing effort to build a new ballpark in Gastonia in 2021 produced CaroMont Health Park, home to the Gastonia Honey Hunters of the Atlantic League. Sims Legion Park was further renovated between the 2021 and 2022 baseball seasons.

Players who've played here include Andy Van Slyke (Cardinals, Pirates), Sammy Sosa (Rangers, White Sox, Cubs, Orioles), Juan González (Rangers, Tigers, Indians, Royals), Iván Rodríguez (Rangers, Marlins, Tigers), and former Major Leaguer Tug McGraw (Mets, Phillies), who pitched one game for the Rangers in 1989.

title: Sims Legion Park


text:
дворъ

Alternative forms

 * Glagolitic:

Etymology
From.

Noun

 * 1) court, courtyard
 * 2) home, household

Etymology
From.

Noun

 * 1) court
 * 2) courtyard

Inflection
Accent paradigm b.

title: дворъ


text:
1937 Iowa State Cyclones football team

The 1937 Iowa State Cyclones football team represented Iowa State College of Agricultural and Mechanic Arts (later renamed Iowa State University) in the Big Six Conference during the 1937 college football season. In their first season under head coach James J. Yeager, the Cyclones compiled a 3–6 record (1–4 against conference opponents), tied for last place in the conference, and were outscored by opponents by a combined total of 161 to 50. They played their home games at State Field in Ames, Iowa.

Clarence Dee was the team captain. Two Iowa State players were selected as first-team all-conference players: guard Ed Bock and back Everett Kischer. Joe Truskowski and Cap Timm were the assistant coaches.

title: 1937 Iowa State Cyclones football team


text:
2006 Moray by-election

A by-election in the Moray constituency of the Scottish Parliament was held on 27 April 2006 following the death of the Scottish National Party (SNP) Member of the Scottish Parliament (MSP) Margaret Ewing on 21 March 2006, from breast cancer. The seat was successfully defended by the SNP's Richard Lochhead, increasing the majority over the Scottish Conservative Party by 1073 votes.

Margaret Ewing had held the Holyrood seat since its creation in 1999, having previously represented the Moray constituency as a Westminster Member of Parliament (MP) since the 1987 United Kingdom general election. She had already announced that she would not be contesting the seat in the 2007 Scottish Parliament election.

Notes on candidates
Richard Lochhead defended the seat for the Scottish National Party. An additional-member MSP for the North East Scotland electoral region since 1999, he had already been selected to contest the seat for the SNP at the 2007 Scottish Parliament election, beating the incumbent's sister-in-law, former MP Annabelle Ewing. He resigned his list seat to stand in the by-election.

Mary Scanlon, a Conservative MSP for the Highlands and Islands region (which includes Moray), resigned from her list seat to fight as the Conservative candidate. Any sitting MSP intending to fight the by-election must first resign their current seat under section 9 of the Scotland Act.

The Labour candidate was Elgin councillor Sandy Keith. He saw his party's vote share fall in the by-election, resulting in increases for all the other parties.

The Liberal Democrat candidate was Linda Gorn, came fourth when she fought the seat in 2003 but improved her performance substantially in the by-election, moving to third place not far behind the Conservative candidate and increasing her share of the vote more than any other candidate.

The Scottish Socialist Party announced that they would not be entering a candidate. They decided that they, in common with the Scottish Green Party, will concentrate on campaigning for regional list votes (Additional member system) at the next 2007 Scottish Parliament election.

Melville Brown, a former Conservative Party candidate for Edinburgh East, stood for the NHS First Party, the first time the party has contested an election. Brown is the party chairman.

Campaign controversies
The Conservative Party became embroiled in a row with two local independent councillors. Handwritten notes were sent out in their wards allegedly from the councillors, but the councillors subsequently denied having given permission for the letters to be used.

The following week, a local newspaper, the Northern Scot, reported the Liberal Democrats to the Electoral Commission for attributing quotes in leaflets to the newspaper itself rather than to the specific Liberal Democrats whom the paper had been quoting.

Both of the above were given widespread coverage in the Northern Scot newspaper.

In the final week of the by-election, Robbie Rowantree, the Conservative Party candidate for the neighbouring UK Parliament constituency of Inverness, Nairn, Badenoch and Strathspey in the 2005 general election, announced he was joining the Liberal Democrats.

title: 2006 Moray by-election


text:
Portal talk:TESOL

Please be aware of this project: ESL for Primary School. The Jade Knight 10:21, 23 March 2007 (UTC)

Main namespace
Ok, since there are no stupid questions, I'm going to ask a question about something that makes me feel stupid: We are asked to "Create pages in the main namespace and write how you teach" -- soooo... just how does one get to the "main namespace" from here? Sorry but so far I'm finding navigation of Wikiversity to be rather daunting. For the benefit of those less familiar with wikispeak, a little more guidance would be helpful. Thanks <IP_ADDRESS> 23:21, 4 August 2007 (UTC)
 * Page names without a colon in them are in the "Main" namespace. I will clarify the instructions. --Rogerhc :-) talk 00:00, 5 August 2007 (UTC)

title: Portal talk:TESOL


text:
User:LazyCinderilla

Not Totally Bumpkin but lived in Countryside, interested in Wikipedia, and wanna know more about wiki sisters. Hi, I am Wina, call me lazy, I am totally lazy but if you give me a task to finish. I am devoted to doing my job is done. I'm 28 years old, from the Philippines. Don't expect much from me, you will feel devastated. §

title: User:LazyCinderilla


text:
scampare

Etymology
From, variant of , a verb based on.

Verb

 * 1)  to escape
 * 2)  to escape
 * 3)  to find refuge
 * 4)  to save
 * 1)  to find refuge
 * 2)  to save

title: scampare


text:
Data Structures/Stacks and Queues

Stacks
A stack is a basic data structure that can be logically thought of as a linear structure represented by a real physical stack or pile, a structure where insertion and deletion of items takes place at one end called top of the stack. The basic concept can be illustrated by thinking of your data set as a stack of plates or books where you can only take the top item of the stack in order to remove things from it. This structure is used all throughout programming.

The basic implementation of a stack is also called a LIFO (Last In First Out) to demonstrate the way it accesses data, since as we will see there are various variations of stack implementations.

There are basically three operations that can be performed on stacks. They are 1) inserting an item into a stack (push). 2) deleting an item from the stack (pop). 3) displaying the contents of the stack (peek or top).

Below are some of operations a stack data type normally supports:   Operations    Adds an item onto the stack.   Returns the last item pushed onto the stack.   Removes the most-recently-pushed item from the stack.
True if no more items can be popped and there is no top item.

True if no more items can be pushed.

Returns the number of elements on the stack.

All operations except  can be performed in $$O(1)$$ time. runs in at worst $$O(N).$$

Linked List Implementation
The basic linked list implementation is one of the easiest stack implementations you can do. Structurally it is a linked list. type Stack<item_type> data list:Singly Linked List<item_type> "stack follows the LIFO (last in first out) operation" "queue follows the FIFO (first in first out) operation" constructor list := new Singly-Linked-List end constructor

Most operations are implemented by passing them through to the underlying linked list. When you want to push something onto the list, you simply add it to the front of the linked list. The previous top is then "next" from the item being added and the list's front pointer points to the new item. method push(new_item:item_type) list.prepend(new_item) end method

To look at the top item, you just examine the first item in the linked list. method top:item_type return list.get-begin.get-value end method

When you want to pop something off the list, simply remove the first item from the linked list. method pop list.remove-first end method

A check for emptiness is easy. Just check if the list is empty. method is-empty:Boolean return list.is-empty end method

A check for full is simple. Linked lists are considered to be limitless in size. method is-full:Boolean return False end method

A check for the size is again passed through to the list. method get-size:Integer return list.get-size end method end type

A real Stack implementation in a published library would probably re-implement the linked list in order to squeeze the last bit of performance out of the implementation by leaving out unneeded functionality. The above implementation gives you the ideas involved, and any optimization you need can be accomplished by inlining the linked list code.

Performance Analysis
In a linked list, accessing the first element is an $$O(1)$$ operation.The list contains a pointer that checks for empty/fullness as done here are also $$O(1)$$ (depending on what time/space tradeoff is made). Most of the time, users of a Stack do not use the  operation, and so a bit of space can be saved by not optimizing it.

Since all operations are at the top of the stack, the array implementation is now much, much better.

public class StackArray implements Stack {      protected int top; protected Object[] data; ...  }

The array implementation keeps the bottom of the stack at the beginning of the array. It grows toward the end of the array. The only problem is if you attempt to push an element when the array is full. If so

Assert.pre(!isFull,"Stack is not full."); will fail, raising an exception. Thus it makes more sense to implement with Vector (see StackVector) to allow unbounded growth (at cost of occasional O(n) delays).

Complexity:

All operations are O(1) with exception of occasional push and clear, which should replace all entries by null in order to let them be garbage-collected. Array implementation does not replace null entries. The Vector implementation does...

Applications of Stacks

Using stacks, we can solve many applications, some of which are listed below.

Converting a decimal number into a binary number
The logic for transforming a decimal number into a binary number is as follows:

* Read a number * Iteration (while number is greater than zero) 1. Find out the remainder after dividing the number by 2 2. Print the remainder 3. Divide the number by 2 * End the iteration

However, there is a problem with this logic. Suppose the number whose binary form we want to find is 23. Using this logic, we get the result as 11101, instead of getting 10111.

To solve this problem, we use a stack. We make use of the LIFO property of the stack. Initially we push the binary digit formed into the stack, instead of printing it directly. After the entire digit has been converted into the binary form, we pop one digit at a time from the stack and print it. Therefore we get the decimal number is converted into its proper binary form.

Algorithm:

1. Create a stack 2. Enter a decimal number which has to be converted into its equivalent binary form. 3. iteration1 (while number > 0) 3.1 digit = number % 2 3.2 Push digit into the stack 3.3 If the stack is full 3.3.1 Print an error 3.3.2 Stop the algorithm 3.4 End the if condition 3.5 Divide the number by 2 4. End iteration1 5. iteration2 (while stack is not empty) 5.1 Pop digit from the stack 5.2 Print the digit 6. End iteration2 7. STOP

Towers of Hanoi
One of the most interesting applications of stacks can be found in solving a puzzle called Tower of Hanoi. According to an old Brahmin story, the existence of the universe is calculated in terms of the time taken by a number of monks, who are working all the time, to move 64 disks from one pole to another. But there are some rules about how this should be done, which are:
 * 1) You can move only one disk at a time.
 * 2) For temporary storage, a third pole may be used.
 * 3) You cannot place a disk of larger diameter on a disk of smaller diameter.

Here we assume that A is first tower, B is second tower  & C is third tower.

Output : (when there are 3 disks)

Let 1 be the smallest disk, 2 be the disk of medium size and 3 be the largest disk.

Output : (when there are 4 disks)

The C++ code for this solution can be implemented in two ways:

First Implementation (Without using Stacks)
Here we assume that A is first tower, B is second tower  & C is third tower. (B is the intermediate)

Second Implementation (Using Stacks)
However complexity for above written implementations is O($$2^n$$). So it's obvious that problem can only be solved for small values of n (generally n <= 30). In case of the monks, the number of turns taken to transfer 64 disks, by following the above rules, will be 18,446,744,073,709,551,615; which will surely take a lot of time!!

Expression evaluation and syntax parsing
Calculators employing reverse Polish notation use a stack structure to hold values. Expressions can be represented in prefix, postfix or infix notations. Conversion from one form of the expression to another form may be accomplished using a stack. Many compilers use a stack for parsing the syntax of expressions, program blocks etc. before translating into low level code. Most of the programming languages are context-free languages allowing them to be parsed with stack based machines.

Evaluation of an Infix Expression that is Fully Parenthesized
Input: (((2 * 5) - (1 * 2)) / (9 - 7))

Output: 4

Analysis: Five types of input characters * Opening bracket * Numbers * Operators * Closing bracket * New line character

Data structure requirement:  A character stack

Algorithm 1. Read one input character 2. Actions at end of each input Opening brackets             (2.1)  Push into stack and then Go to step (1) Number                       (2.2)  Push into stack and then Go to step (1) Operator                     (2.3)  Push into stack and then Go to step (1) Closing brackets             (2.4)  Pop it from character stack (2.4.1) if it is opening bracket, then discard it, Go to step (1) (2.4.2) Pop is used three times The first popped element is assigned to op2 The second popped element is assigned to op                                           The third popped element is assigned to op1 Evaluate op1 op op2 Convert the result into character and push into the stack Go to step (2.4) New line character           (2.5)  Pop from stack and print the answer STOP

Result: The evaluation of the fully parenthesized infix expression is printed on the monitor as follows:

Input String:  (((2 * 5) - (1 * 2)) / (9 - 7))

C Program

Output of the program:

Input entered at the command line: (((2 * 5) - (1 * 2)) / (9 - 7))

Evaluation of Infix Expression which is not fully parenthesized
Input: (2 * 5 - 1 * 2) / (11 - 9)

Output: 4

Analysis: There are five types of input characters which are: * Opening brackets * Numbers * Operators * Closing brackets * New line character (\n)

We do not know what to do if an operator is read as an input character. By implementing the priority rule for operators, we have a solution to this problem.

The Priority rule we should perform comparative priority check if an operator is read, and then push it. If the stack top contains an operator of prioirty higher than or equal to the priority of the input operator, then we pop it and print it. We keep on perforrming the prioirty check until the top of stack either contains an operator of lower priority or if it does not contain an operator.

Data Structure Requirement for this problem: A character stack and an integer stack

Algorithm:

1. Read an input character 2. Actions that will be performed at the end of each input Opening brackets             (2.1)  Push it into stack and then Go to step (1) Digit                        (2.2)  Push into stack, Go to step (1) Operator                     (2.3)  Do the comparative priority check (2.3.1) if the character stack's top contains an operator with equal or higher priority, then pop it into op                                             Pop a number from integer stack into op2 Pop another number from integer stack into op1 Calculate op1 op op2 and push the result into the integer stack Closing brackets             (2.4)  Pop from the character stack (2.4.1) if it is an opening bracket, then discard it and Go to                                           step (1) (2.4.2) To op, assign the popped element Pop a number from integer stack and assign it op2 Pop another number from integer stack and assign it                                           to op1 Calculate op1 op op2 and push the result into the integer stack Convert into character and push into stack Go to the step (2.4) New line character           (2.5)  Print the result after popping from the stack STOP

Result: The evaluation of an infix expression that is not fully parenthesized is printed as follows:

Input String:  (2 * 5 - 1 * 2) / (11 - 9)

C Program

Output of the program:

Input entered at the command line: (2 * 5 - 1 * 2) / (11 - 9)

Output: 4

Evaluation of Prefix Expression
Input: x + 6 * ( y + z ) ^ 3

Output:' 4

Analysis: There are three types of input characters * Numbers * Operators * New line character (\n)

Data structure requirement: A character stack and an integer stack

Algorithm:

1. Read one character input at a time and keep pushing it into the character stack until the new line character is reached 2. Perform pop from the character stack. If the stack is empty, go to step (3) Number                       (2.1) Push in to the integer stack and then go to step (1) Operator                     (2.2)  Assign the operator to op                                            Pop a number from  integer stack and assign it to op1 Pop another number from integer stack and assign it to op2 Calculate op1 op op2 and push the output into the integer stack. Go to step (2) 3. Pop the result from the integer stack and display the result Result: The evaluation of prefix expression is printed as follows:

Input String:  / - * 2 5 * 1 2 - 11 9

C Program

Output of the program:

Input entered at the command line: / - * 2 5 * 1  2 - 11  9

Output: 4

Conversion of an Infix expression that is fully parenthesized into a Postfix expression
Input: (((8 + 1) - (7 - 4)) / (11 - 9))

Output: 8 1 + 7 4 - - 11 9 - /

Analysis: There are five types of input characters which are: * Opening brackets * Numbers * Operators * Closing brackets * New line character (\n)

Requirement: A character stack

Algorithm:

1. Read an character input 2. Actions to be performed at end of each input Opening brackets             (2.1)  Push into stack and then Go to step (1) Number                       (2.2)  Print and then Go to step (1) Operator                     (2.3)  Push into stack and then Go to step (1) Closing brackets             (2.4)  Pop it from the stack (2.4.1) If it is an operator, print it, Go to step (1) (2.4.2) If the popped element is an opening bracket, discard it and go to step (1) New line character           (2.5)  STOP

Therefore, the final output after conversion of an infix expression to a postfix expression is as follows:

Problem Description
It's a very nice application of stacks. Consider that a freight train has n railroad cars, each to be left at a different station. They're numbered 1 through n and a freight train visits these stations in order n through 1. Obviously, the railroad cars are labeled by their destination.To facilitate removal of the cars from the train, we must rearrange them in ascending order of their number (i.e., 1 through n). When cars are in this order, they can be detached at each station. We rearrange cars at a shunting yard that has input track, output track & k holding tracks between the input & output tracks (i.e., holding track).

Solution Strategy
To rearrange cars, we examine the cars on the input from front to back. If the car being examined is the next one in the output arrangement, we move it directly to output track. If not, we move it to the holding track and leave it there until it's time to place it to the output track. The holding tracks operate in a LIFO manner as the cars enter and leave these tracks from the top. When rearranging cars, only the following moves are permitted: The figure shows a shunting yard with k = 3, holding tracks H1, H2 and H3, and n = 9. The n cars of the freight train begin in the input track and are to end up in the output track in order 1 through n from right to left. The cars initially are in the order 5, 8, 1, 7, 4, 2, 9, 6, 3 from back to front. Later cars are rearranged in the desired order.
 * A car may be moved from the front (i.e., right end) of the input track to the top of one of the holding tracks or to the left end of the output track.
 * A car may be moved from the top of the holding track to the left end of the output track.

A Three-Track Example
The requirement of rearrangement of cars on any holding track is that the cars should be preferred to arrange in ascending order from top to bottom. Car 4 is moved to the output track. No other cars can be moved to the output track at this time.
 * Consider the input arrangement from the figure, here we note that car 3 is at the front, so it can't be output yet, as it is to be preceded by cars 1 and 2. So car 3 is detached and moved to holding track H1.
 * The next car 6 can't be output and it is moved to holding track H2. Because we have to output car 3 before car 6 and this will not be possible if we move car 6 to holding track H1.
 * Now it's obvious that we move car 9 to H3.
 * So car 2 is now moved to holding track H1 so that it satisfies the previous statement. If we move car 2 to H2 or H3, then we've no place to move cars 4, 5, 7, or 8.The least restrictions on future car placement arise when the new car λ is moved to the holding track that has a car at its top with smallest label Ψ such that λ < Ψ. We may call it an assignment rule to decide whether a particular car belongs to a specific holding track.
 * When car 4 is considered, there are three places to move the car: H1, H2, and H3. The top of these tracks are 2, 6, and 9.So using the aforementioned Assignment rule, we move car 4 to H2.
 * Car 7 is moved to H3.
 * The next car 1 has the lowest label, so it's moved to the output track.
 * Now it's time for cars 2 and 3 to output which are from H1 (in short, all the cars from H1 are appended to car 1 on the output track).
 * The next car, car 8, is moved to holding track H1.
 * Car 5 is output from the input track. Car 6 is moved to the output track from H2, so is car 7 from H3, car 8 from H1, and car 9 from H3.

Quicksort
Sorting means arranging a group of elements in a particular order. Be it ascending or descending, by cardinality or alphabetical order or variations thereof. The resulting ordering possibilities will only be limited by the type of the source elements.

Quicksort is an algorithm of the divide and conquer type. In this method, to sort a set of numbers, we reduce it to two smaller sets, and then sort these smaller sets.

This can be explained with the help of the following example:

Suppose A is a list of the following numbers:

In the reduction step, we find the final position of one of the numbers. In this case, let us assume that we have to find the final position of 48, which is the first number in the list.

To accomplish this, we adopt the following method. Begin with the last number, and move from right to left. Compare each number with 48. If the number is smaller than 48, we stop at that number and swap it with 48.

In our case, the number is 24. Hence, we swap 24 and 48.

The numbers 96 and 72 to the right of 48, are greater than 48. Now beginning with 24, scan the numbers in the opposite direction, that is from left to right. Compare every number with 48 until you find a number that is greater than 48.

In this case, it is 60. Therefore we swap 48 and 60.

Note that the numbers 12, 24 and 36 to the left of 48 are all smaller than 48. Now, start scanning numbers from 60, in the right to left direction. As soon as you find lesser number, swap it with 48.

In this case, it is 44. Swap it with 48. The final result is:

Now, beginning with 44, scan the list from left to right, until you find a number greater than 48.

Such a number is 84. Swap it with 48. The final result is:

Now, beginning with 84, traverse the list from right to left, until you reach a number lesser than 48. We do not find such a number before reaching 48. This means that all the numbers in the list have been scanned and compared with 48. Also, we notice that all numbers less than 48 are to the left of it, and all numbers greater than 48, are to its right.

The final partitions look as follows:

Therefore, 48 has been placed in its proper position and now our task is reduced to sorting the two partitions. This above step of creating partitions can be repeated with every partition containing 2 or more elements. As we can process only a single partition at a time, we should be able to keep track of the other partitions, for future processing.

This is done by using two stacks called LOWERBOUND and UPPERBOUND, to temporarily store these partitions. The addresses of the first and last elements of the partitions are pushed into the LOWERBOUND and UPPERBOUND stacks respectively. Now, the above reduction step is applied to the partitions only after its boundary values are popped from the stack.

We can understand this from the following example:

Take the above list A with 12 elements. The algorithm starts by pushing the boundary values of A, that is 1 and 12 into the LOWERBOUND and UPPERBOUND stacks respectively. Therefore the stacks look as follows:

LOWERBOUND: 1                   UPPERBOUND:  12

To perform the reduction step, the values of the stack top are popped from the stack. Therefore, both the stacks become empty.

LOWERBOUND: {empty}                UPPERBOUND: {empty}

Now, the reduction step causes 48 to be fixed to the 5th position and creates two partitions, one from position 1 to 4 and the other from position 6 to 12. Hence, the values 1 and 6 are pushed into the LOWERBOUND stack and 4 and 12 are pushed into the UPPERBOUND stack.

LOWERBOUND: 1, 6                   UPPERBOUND: 4, 12

For applying the reduction step again, the values at the stack top are popped. Therefore, the values 6 and 12 are popped. Therefore the stacks look like:

LOWERBOUND: 1                      UPPERBOUND: 4

The reduction step is now applied to the second partition, that is from the 6th to 12th element.

After the reduction step, 98 is fixed in the 11th position. So, the second partition has only one element. Therefore, we push the upper and lower boundary values of the first partition onto the stack. So, the stacks are as follows:

LOWERBOUND: 1, 6                   UPPERBOUND:  4, 10

The processing proceeds in the following way and ends when the stacks do not contain any upper and lower bounds of the partition to be processed, and the list gets sorted.

The Stock Span Problem
In the stock span problem, we will solve a financial problem with the help of stacks.

Suppose, for a stock, we have a series of n daily price quotes, the span of the stock's price on a particular day is defined as the maximum number of consecutive days for which the price of the stock on the current day is less than or equal to its price on that day.

An algorithm which has Quadratic Time Complexity
Input: An array P with n elements

Output: An array S of n elements such that S[i] is the largest integer k such that k <= i + 1 and P[j] <= P[i] for j = i - k + 1,.....,i

Algorithm:

1. Initialize an array P which contains the daily prices of the stocks 2. Initialize an array S which will store the span of the stock 3. for i = 0 to i = n - 1 3.1 Initialize k to zero 3.2 Done with a false condition 3.3 repeat 3.3.1 if (P[i - k] <= P[i]) then Increment k by 1 3.3.2 else Done with true condition 3.4 Till (k > i) or done with processing Assign value of k to S[i] to get the span of the stock 4. Return array S

Now, analyzing this algorithm for running time, we observe:

 * We have initialized the array S at the beginning and returned it at the end. This is a constant time operation, hence takes O(n) time
 * The repeat loop is nested within the for loop. The for loop, whose counter is i is executed n times. The statements which are not in the repeat loop, but in the for loop are executed n times. Therefore these statements and the incrementing and condition testing of i take O(n) time.
 * In repetition of i for the outer for loop, the body of the inner repeat loop is executed maximum i + 1 times. In the worst case, element S[i] is greater than all the previous elements. So, testing for the if condition, the statement after that, as well as testing the until condition, will be performed i + 1 times during iteration i for the outer for loop. Hence, the total time taken by the inner loop is O(n(n + 1)/2), which is O($$n^2 $$)

The running time of all these steps is calculated by adding the time taken by all these three steps. The first two terms are O($$ n $$) while the last term is O($$n^2 $$). Therefore the total running time of the algorithm is O($$n^2 $$).

An algorithm that has Linear Time Complexity
In order to calculate the span more efficiently, we see that the span on a particular day can be easily calculated if we know the closest day before i, such that the price of the stocks on that day was higher than the price of the stocks on the present day. If there exists such a day, we can represent it by h(i) and initialize h(i) to be -1.

Therefore the span of a particular day is given by the formula, s = i - h(i).

To implement this logic, we use a stack as an abstract data type to store the days i, h(i), h(h(i)) and so on. When we go from day i-1 to i, we pop the days when the price of the stock was less than or equal to p(i) and then push the value of day i back into the stack.

Here, we assume that the stack is implemented by operations that take O(1) that is constant time. The algorithm is as follows:

Input: An array P with n elements and an empty stack N

Output: An array S of n elements such that P[i] is the largest integer k such that k <= i + 1 and P[y] <= P[i] for j = i - k + 1,.....,i

Algorithm:

1. Initialize an array P which contains the daily prices of the stocks 2. Initialize an array S which will store the span of the stock 3. for i = 0 to i = n - 1 3.1 Initialize k to zero 3.2 Done with a false condition 3.3 while not (Stack N is empty or done with processing) 3.3.1 if ( P[i] >= P[N.top)] then Pop a value from stack N                     3.3.2 else Done with true condition 3.4 if Stack N is empty 3.4.1 Initialize h to -1 3.5 else 3.5.1 Initialize stack top to h                        3.5.2 Put the value of h - i in S[i] 3.5.3 Push the value of i in N        4. Return array S

Now, analyzing this algorithm for running time, we observe:

 * We have initialized the array S at the beginning and returned it at the end. This is a constant time operation, hence takes O(n) time
 * The while loop is nested within the for loop. The for loop, whose counter is i is executed n times. The statements which are not in the repeat loop, but in the for loop are executed n times. Therefore these statements and the incrementing and condition testing of i take O(n) time.
 * Now, observe the inner while loop during i repetitions of the for loop. The statement done with a true condition is done at most once, since it causes an exit from the loop. Let us say that t(i) is the number of times statement Pop a value from stack N is executed. So it becomes clear that while not (Stack N is empty or done with processing) is tested maximum t(i) + 1 times.
 * Adding the running time of all the operations in the while loop, we get:

 * $$\sum_{i=0}^{n-1}t(i) + 1$$

 * An element once popped from the stack N is never pushed back into it. Therefore,

 * $$\sum_{i=1}^{n-1}t(i)$$

So, the running time of all the statements in the while loop is O($$n$$)

The running time of all the steps in the algorithm is calculated by adding the time taken by all these steps. The run time of each step is O($$n$$). Hence the running time complexity of this algorithm is O($$n$$).

Related Links

 * Stack (Wikipedia)

Queues
A queue is a basic data structure that is used throughout programming. You can think of it as a line in a grocery store. The first one in the line is the first one to be served.Just like a queue.

A queue is also called a FIFO (First In First Out) to demonstrate the way it accesses data.

  Operations

Adds an item onto the end of the queue.

Returns the item at the front of the queue.

Removes the item from the front of the queue.

True if no more items can be dequeued and there is no front item.

True if no more items can be enqueued.

Returns the number of elements in the queue.

All operations except  can be performed in $$O(1)$$ time. runs in at worst $$O(N).$$

Linked List Implementation
The basic linked list implementation uses a singly-linked list with a tail pointer to keep track of the back of the queue. type Queue<item_type> data list:Singly Linked List<item_type> data tail:List Iterator<item_type> constructor list := new Singly-Linked-List tail := list.get-begin # null end constructor

When you want to enqueue something, you simply add it to the back of the item pointed to by the tail pointer. So the previous tail is considered next compared to the item being added and the tail pointer points to the new item. If the list was empty, this doesn't work, since the tail iterator doesn't refer to anything method enqueue(new_item:item_type) if is-empty list.prepend(new_item) tail := list.get-begin else list.insert_after(new_item, tail) tail.move-next end if end method

The front item on the queue is just the one referred to by the linked list's head pointer method front:item_type return list.get-begin.get-value end method

When you want to dequeue something off the list, simply point the head pointer to the previous from head item. The old head item is the one you removed of the list. If the list is now empty, we have to fix the tail iterator. method dequeue list.remove-first if is-empty tail := list.get-begin end if  end method

A check for emptiness is easy. Just check if the list is empty. method is-empty:Boolean return list.is-empty end method

A check for full is simple. Linked lists are considered to be limitless in size. method is-full:Boolean return False end method

A check for the size is again passed through to the list. method get-size:Integer return list.get-size end method end type

Performance Analysis
In a linked list, accessing the first element is an $$O(1)$$ operation because the list contains a pointer directly to it. Therefore, enqueue, front, and dequeue are a quick $$O(1)$$ operations.

The checks for empty/fullness as done here are also $$O(1)$$.

The performance of  depends on the performance of the corresponding operation in the linked list implementation. It could be either $$O(n)$$, or $$O(1)$$, depending on what time/space tradeoff is made. Most of the time, users of a Queue do not use the  operation, and so a bit of space can be saved by not optimizing it.

Related Links

 * Queue (Wikipedia)

Deques
A Deque is a homogeneous list of elements in which insertions and deletion operations are performed on both the ends.

Because of this property it is known as double ended queue i.e. Deque

Deque has two types:
 * 1) Input restricted queue: It allows insertion at only one end
 * 2) Output restricted queue: It allows deletion at only one end
 * Deque (Double-Ended QUEue)

title: Data Structures/Stacks and Queues


text:
Wikipedia:Articles for deletion/Keith Michael Fiels

The result of the debate was keep. Flowerparty ■ 12:00, 26 March 2006 (UTC)

Keith Michael Fiels
Delete. Person is not notable enough to merit an entry. Satch 21:32, 21 March 2006 (UTC)
 * Keep In the librarian profession, he's quite notable, being the director of the largest library association in the world. As far as WP:BIO goes, he's co-authored six books which I think meet the author guidelines. I'm aware that WP:BIO doesn't do much to address people who are notable in their field and unknown out of it, but probably every librarian in the US knows this guy. Jessamyn (talk) 21:45, 21 March 2006 (UTC)

 * Keep He is a notable person in his profession and the claims to notability are easily verifiable. Evillan 21:48, 21 March 2006 (UTC)
 * Keep per Jessamyn. Monicasdude 22:08, 21 March 2006 (UTC)

 * Keep I am the author and I went to the criteria for inclusion . Here are the criteria that Mr. Fiels meets:

 * 1) Political figures holding international, national or statewide/provincewide office or members of a national, state or provincial legislature. [While he is not strictly political, it is a national/international organization which he runs.]
 * 2) Published authors, editors, and photographers who have written books with an audience of 5,000 or more or in periodicals with a circulation of 5,000 or more [He has written six books for the profession, and regularly writes for American Libraries which has a circulation of over 70,000 monthly.]
 * 3) 100 year test (future speculation) -- In 100 years time will anyone without a direct connection to the individual find the article useful?
 * 4) 100 year test (past speculation) -- If we had comparable verifiable information on a person from 100 years ago, would anyone without a direct connection to the individual find the article useful today?

Keep the entry for Mr. Fiels Michael Golrick 22:41, 21 March 2006 (UTC)
 * keep per Golrick et al. Bucketsofg 22:50, 21 March 2006 (UTC)
 * Keep per all Bobby P. Smith Sr. Jr. 00:31, 22 March 2006 (UTC)
 * Keep, being the director of the ALA is notable. Catamorphism 03:37, 22 March 2006 (UTC)


text:
Talk:Ta-wer

Abdju/Abydos
It would seem that the 8th Nome of Upper Egypt is also referred to as Abdju or Abydos; On the Swedish wiki, they have been using both terms since 2010, with Abdju as primary and Ta-Wer as secondary. Could we mention this in the article? Wcichello (talk) 12:36, 18 September 2020 (UTC)

Hello, so far as I can see they are simply wrong. The 8th Nome of Upper Egypt was always and only called Ta-wer. Abdju/Abydos was the most famous town, but not even the capital. I checked their references and those are mostly rather amateurish websites (many are down). -- Udimu (talk) 21:07, 18 September 2020 (UTC)

title: Talk:Ta-wer


text:
Just for Men

Just for Men is an American-based multi-national men's care brand focusing on hair color (Control GX, Original Formula, AutoStop, Mustache & Beard, Touch of Gray, and Touch of Gray Mustache & Beard), beard care (The Best Face and Beard Wash, The Best Beard Conditioner, and The Best Beard Oil), and hair re-growth designed for and marketed to men and manufactured by Combe Incorporated. Just for Men hair color brands are designed to color gray hair, with the Control Gx and Touch of Gray product lines providing options for gradual hair coloring. Just For Men comes in over 12 shades ranging from Sandy Blond to Jet Black.

Ingredients include ethoxydiglycol (an organic solvent), oleyl alcohol, vegetable fatty acid, ethanolamine (solvent and alkalizer), erythorbic acid (antioxidant and sunscreen), trisodium EDTA (protects the other ingredients against water-born copper), polyquaterium-22 (polymer conditioner), p-aminophenol and p-phenylenediamine (reactive coloring agents), resorcinol, and hydrogen peroxide.

The product is available in Argentina, Australia, Brazil, Canada, Chile, India, Ireland, Italy, Israel, Mexico, Netherlands, New Zealand, Singapore, Spain, Thailand, Turkey the United Kingdom, and the United States.

Advertising
Just for Men television advertising in the United States features sports celebrities Walt Frazier and Keith Hernandez as sportscasters, whose ads have aired for over five and a half years. A January 2008 spot had them visiting a grey-bearded Emmitt Smith in an NFL style nursing home where Frazier proclaims "Your 'stache is trash!" and "The beard is weird!"

Additionally, Just for Men often sponsors sports events, specific examples including the PGA Tour's "Right on Target Shot" segment and WWE's "Rewind" and "Slam of the Week".

Allergies
One of the active ingredients is PPD, p-phenylenediamine, which can cause a reaction in some people. Studies have shown that less than 5% of the population may experience some allergy, which can range from minor irritation, rashes and swelling to burning, though severe reactions are rare. Manufacturer directions instruct users to do a 48-hour skin allergy test prior to use to detect and avoid any reactions. PPD was voted Allergen of the Year in 2006 by the American Contact Dermatitis Society.

Serious reactions
Meta analysis of several individual studies has suggested a linkage between some permanent hair dye products for men and an increased risk for leukemia.

title: Just for Men


text:
mökki

Etymology
. Cognate with 🇨🇬 and 🇨🇬.

Noun

 * 1) A small, usually wooden house; cottage, cabin.
 * 2)  In the card game, a trick made by emptying the table of cards; sweep.
 * 3) dots and boxes
 * 1) dots and boxes

title: mökki


text:
Wikipedia:School and university projects/EPFL+WMCH 2019

Shortened url for this page: https://w.wiki/Akn

Wikimedia CH is organizing with Agepoly, the Student's association of the École Polytechnique Fédérale de Lausanne a series of workshop to encourage EPFL students to become more familiar with and contribute to Wikimedia projects.

The first workshop will take place on Wednesday, October 30th, from 17h to 20h and will consist in a short introduction, followed by a hands-on Wikipedia workshop. It will be led by Flor from WMCH and Rama, Wikipedian, former EPFL student, and one of GNU Generation's founders.

The second and third workshops, on Wednesday, November 13th and Wednesday, December 4th will provide attendants with a hands-on introduction to Wikidata, the collaborative, linked data database, and a presentation of Wikibase software. It will be given by Julieta, with a little help from Flor.

=Wikipedia workshop, October 30th= This is an opportunity to learn how to edit the online encyclopedia and update information on it. EPFL students, especially after a year or two, already know more than the average reader about specific scientific topics. Thus, they could become valuable contributors if they learn how to update articles concerning these topics. They can also choose to contribute to topics close to their hearts, from environmental issues to adding or improving biographies of scientists they admire, especially women and minorities.

Participants
Participants will be registered on this dashboard.

General introduction
Five pillars of Wikipedia

Anatomy of a Wikipedia article
Let's look at the article on the Gecko:
 * Article tab
 * Talk tab
 * Read tab
 * View History
 * Edit source tab + how to show visual editor
 * Infobox
 * Rename page
 * Categories

Wikitext
A how-to guide to Wikitext.

Choosing an article to improve
Many articles on Wikipedia need improvement, and choosing where to start can be overwhelming. It is important to keep in mind what your sources of interest is, as it will be easier for you to improve on what you study closely or what you are passionate than about any other topic. Nevertheless, to avoid conflicts of interest, we advise you not to edit pages on a personality you are close to, such as a professor with whom you study.

To start, it is better to edit short articles lacking sources than to start articles on your own, or to improve long, well-documented articles.

For any given topic: the Article finder
If you have a specific interest, there is a useful tool to help you find out articles about it that need completion, the Article finder. It will point you out to articles that are both important and needing work.

Click here to access

Research example with the word Sustainability.

On women scientists
The WikiProject women scientists has created a list of stub articles that need work.

Wikiprojects on specific topics
Wikiprojects list articles that are both short and in need of improvement. To do that, they usually contain a grid on their front page, such as the one you can see on the left (from the Forestry Wikiproject). You will want to choose to complete articles that are stubs, start or assessed as "C", and which are considered important (ie, closer to the left side of the grid).

Here are a few examples:

 * WikiProject Environment

Scroll down to Article statistics.

 * Wikiproject Ecology

Scroll down to "Article assessment".

 * The Harry Potter task force

Scroll down to "Statistics*.

 * WikiProject Cognitive science
 * WikiProject Computer science
 * WikiProject Geology
 * WikiProject Cosmology
 * WikiProject Engineering
 * WikiProject Forestry
 * WikiProject Geology
 * WikiProject History of Science
 * WikiProject Mathematics
 * WikiProject Physics
 * WikiProject Pseudoscience

=Wikidata and Wikibase workshops= Please check Wikidata:Events/Wikidata_EPFL2019.


text:
Possibilities (disambiguation)

Possibilities is a 2005 jazz album by Herbie Hancock.

Possibilities may also refer to:
 * Possibilities (King Never album), a 2010 album by American rock band King Never
 * The Possibilities, Athens, Georgia rock band
 * "Possibilities", 1982 TV episode of Knots Landing (season 3, episode 12)
 * "Possibilities", 2004 TV episode of Mutant X (season 3, episode 11)
 * "Possibilities", a song by Weezer from their 2002 album Maladroit
 * The Possibilities (Preacher), an episode of the television series Preacher

title: Possibilities (disambiguation)