text:
Talk:Data Structures

General
This textbook aims to cover what CS majors learn in an introductory data structures and algorithms programming course.

Do we want to do everything for this subject on one page, or make this just a page of links? I like the second idea better.

''I prefer dropping new information here until a section gets "too big". Then split off that section onto its own page. See http://CommunityWiki.org/BigBucketsFirst --DavidCary 05:41, 12 Jul 2004 (UTC) ''

I agree with that article's logic. I'll copy the material from my linked list page back to this page, and work on it here. Later on, maybe we'll span off to other pages aka buckets. --Waxmop

 * I think the buckets right now are too small. I think it would be easier (because this is a textbook) to divide the book into chapters, and have each chapter be a subpage (if necessary). Anything finer grained than chapters would mean a lot of clicking and it would be easy to miss having a coherent voice in the book (both for contributing authors and for readers). But that's just my own feelings on the matter: I want these to seem like real books instead of just indexes to entries in the wikipedia. Mshonle 09:31, 1 Aug 2004 (UTC)

Format
I'd like to join the project if I may. I'm ready to tackle a couple of these topics. Is there a particular format to use?--Wcrowe 21:34, 1 Jul 2004 (UTC)

I would like to suggest a change in the order of the chapters. I would like to have Graphs moved before Trees, as a tree is simply a special case of a graph. Pesto 04:11, 28 August 2005 (UTC)
 * I see what you are getting at, but the question is What's the best didactic ordering? After all, linked-lists are just another form of graph, further, they are another form of tree, so why not discuss linked-lists last? But to be serious, I think tree traversal algorithms are easier to understand than graph traversal algorithms. And by also being more limited, trees provide a good introduction to the concept of graphs. MShonle 05:37, 28 August 2005 (UTC)

jump in!
If you write an article, you get to choose the format. Later on, people might improve the format, but at the beginning, we should just get out something and let people work on refining later. --Waxmop 17:15, 4 Jul 2004 (UTC)

We should use header markup (with the equal signs) rather than bullet markup. The header markup builds the table of contents. Also, we should put articles into the Programming:Data_Structures namespace for now. I'm starting a linked list article. --Waxmop 17:22, 4 Jul 2004 (UTC)

 * I agree: looking at a table of contents gives a better idea of what the book is like, and encourages more modifications and additions. I'm going to change the format to that. Mshonle 09:48, 1 Aug 2004 (UTC)

I dropped the variables and types section.
It links to a javascript page right now that I don't think is relevant. Everyone: remember to use the namespace Programming:Data Structures:your topic for your articles.--Waxmop 22:55, 5 Jul 2004 (UTC)

Wikipedia links are good, but...
This is a textbook, therefore, IMO, sections should use a how-to approach. You will immediately see that this differs quite a bit from an encyclopedic approach. I hope it is everyone's intent to teach these subjects, step by step, rather than just create a collection of Wikipedia links.

Page Structure
I'd rather not make a large change without some discussion, but it seems to me that the sorting portion should be moved to the bottom. I kind of visualize this page as three sections:

I wasn't planning on laying out the whole menu. I just meant to put in some examples, but I went further than I intended. I think that this breakdown gives us better control over presenting pros & cons of collection selections (Since the list selections are together and the stack selections are together), and is more consistant.

Primary Storage Types Single object allocation (used to implements linked lists, most trees, ...) Array (used to implement array list, most stacks, circular queues, ...) Secondary Storage Types Lists Common list operations & example Set(pos, val), Get(pos), remove(pos), append(val) Implemented as a Linked List Single linked list Double linked list Implemented as an Array List Stacks Common stack operations & example Push(val), Pop (, peek?) Implemented on a Linked List Implemented on an array Queues Common queue operations & example enqueue, dequeue Implemented as LinkedList Implemented as an array (circular, fixed size queue) Special cases Dequeues (What is this used for, by the way?) Trees & Graphs (isn't a tree just a special case of a graph?) Common tree operations & example add, get, remove Implemented as links (like linked list) Implemented in an array (Heap) Special cases Binary tree Balanced Quad tree Graphs Hash Tables ... How do I choose a data structure for a given situation? Sorts Big O notation Combinations ArrayList and Hashtable ...

--BillKress 23:06, 5 Nov 2004 (UTC)

 * Big O Notation should be discussed in front because it is used throughout the rest of the material. You should also include the discussion of Abstract Data Types and information hiding in fron too. -- Gdarwin 06:42, 7 Nov 2004 (UTC)

 * Hi Bill, sorry for the late reply. That structure looks much better, though I would put trees in a section before graphs, because the traversal concepts like inorder, preorder, and post-order (for binary trees) is really something separate enough. After queues should be heaps, aka priority queues, and then the heap sort. For graphs, depth-first and breadth-first should be covered. Below is what I suggest: MShonle 01:00, 21 Dec 2004 (UTC)

Introduction What is Data Abstraction? The Node The most elementary data structure Arrays Matricies: two dimensional arrays Insertion sort on an array Binary search on a sorted array List Structures Common list operations & example set(pos, val), get(pos), remove(pos), append(val) [not sure about these operations: what about next? or iterators?] [Perhaps discuss operations on Nodes, versus operations on the List itself: example, Nodes have a next operation, but the List itself has a pointer to the head and tail node, and an integer for the number of      elements. This view would work well in both the Lisp and OO worlds.] Doubley linked list Vectors (resizeable arrays) Iterators Operating on sequences without knowledge of the sequence itself Stacks and Queues Common stack operations & example push(val), pop, and peek Implemented on a Linked List Implemented on an array Common queue operations & example enqueue, dequeue Implemented as LinkedList Implemented as an array (circular, fixed size queue) Dequeues Trees Common tree operations & example add, get, remove Binary trees in order, pre order, post order traversals Balanced binary trees Iterators for trees Min and Max Heaps A tree implemented as an array! (not to be confused with the heap in memory) Percolation Heap sort Treaps: heaps where elements can be deleted by name Graphs Directed and Undirected graphs matrix and list representations Depth-First Search Breadth-First Search Topological sort Hash Tables Iteration order for hash tables by augmenting the structure - iterating over items in the order in which they were inserted - iterating over the items based on most-recently-used Sets Different implementations - lists, binary search trees, bit arrays, hashtables Disjoint Sets (operations: union, find) Tradeoffs between Data Structures Use asymptotic behaviour to decide, most importantly seeing how the structure will be used: an infrequent operation does not need to be  fast if it means everything else will be much faster

The content is designed to compliment the Algorithms text book (the idea is that the reader would cover the DS book first, then the Algo book, and then the Advanced Data Structures and Algorithms book that would pick up the more random and advanced ideas). Most importantly, I'd like to see each book be small enough that it can be read completely in one or two semesters. The more reference-based or encyclopedic content could be saved for either the Advanced book or the wikipedia. MShonle 01:00, 21 Dec 2004 (UTC)

Incoherent Structure
I agree. I find it odd that a lot of list based structures are currently placed under linked lists, when these structures can obviously be impleneted as an array.

Your layout looks good, but I was wondering if we can add a disccusion about big O notation. I see it used here, but where is it formally defined?

Gdarwin 16:13, 29 Oct 2004 (UTC)

Proposed structure has been modified. I'd still like to hear one or two more people say that they prefer this structure before I refactor.

--BillKress 23:04, 5 Nov 2004 (UTC)

Duplication for Array
Currently we have some 2 articles on arrays one here and one in Programming:Arrays. We should merge realy leavin only a short into here and move the rest off.

 * Programming:Arrays is only a redirect to Data Structures/Arrays. --Krischik 06:47, 23 August 2005 (UTC)

 * I think the DS book should only talk about the most basic form of arrays, that is, integer-indexed arrays. Many of the other topics currently mentioned, like associative arrays, won't make sense to the reader because they haven't read about hash tables (which use simple arrays and linked-lists) or binary search trees yet. The purpose of our story should be abstraction, abstraction, abstraction, and show how the complex gets built up from the very simple; not how the complex gets built up from things just as complex. MShonle 14:50, 22 August 2005 (UTC)

 * Speaking of integer based array: even that leaved the question of "which integer"? (See: Ada Programming/Types/array) . Before the almost assembler like C came out (and predended to be a higher language) it was almost part of the definition of a (real) higher language that you did not need to choose a register sized mashine word as array index. As such I belive that restricting an array index to "integer" is actualy a loss of abstraction. Abstraction for me means: away from computer implementation - closer to the live of humans. Example: Humans use arrays of (Jan, Feb, ... Dec) or (Mon, Thu, ... Sun) while computers would internaly use (0, 1 ... 12) or (0, 1, .. 6). Even if a human would choose a number to represent a month or day he would choose a 1 for Jan or Mon and not 0 as a computer would do. A higher programming language with better abstraction allow a more human like representation (i.E. using an enumeration type as as index) . The Psydo language used in Computer Science should allow for the highest abstraction - and an  should not be out of the question. --Krischik 06:47, 23 August 2005 (UTC)
 * I completely agree with you that allowing different index types allows for better abstraction. But we need to be careful about which abstractions we're talking about. The purpose of this book is to describe how one would get from embarrassingly simple, low-level abstractions into very precise, semantic-rich, high-level abstractions. To me, it would kind of be like arguing that the Hashtables chapter should use Perl, because Perl already has hash tables built-in. But the point is not to write the most elegant code examples; the point is to demonstrate computer science concepts. I find the idea very beautiful that in a language like Lisp, all you need is cons, car and cdr, and from there you can make lists, trees and graphs. Add in a very simple array, and you can make hashtables and matrices, et cetera... This is a very compelling story, and it can't be told as well if unnecessary elements are constantly added as side-notes. MShonle 14:24, 23 August 2005 (UTC)
 * (BTW, a deeper discussion of rich programming languages might be better suited for the Programming Languages book, or also possibly the Advanced Data Structures and Algorithms book. MShonle 21:09, 23 August 2005 (UTC))

Quicksort misconceptions

 * Since superceeded by the Introsort algorithm, the Quicksort algorithm can exact excellent performance on purely random data. It's worst performance, however, occurs on nearly-sorted or on sorted data, at which point Quicksort becomes completely impractical.

The above quote is incorrect. The original quicksort introduced by Hoare used random, not deterministic, methods to select the pivot. Thus, the kind of data input (random or ordered) wasn't important. It would only perform poorly on the very slight chance that the random selections were suboptimal. Some bad textbooks present some pretty poor ways of picking the pivots, but that is not the true quicksort.

I think it would probably be best not to present quicksort in the data-structures book at all because it's already half-way covered in the Algorithms book (currently the partition portion of quicksort is covered). I think Bubble sort probably shouldn't even be mentioned, as selection sort performs better and is easier to understand. For a data-structures book, Heap sort makes the most sense. Part of my hope is that we can keep both the data-structures and algorithms books simple (by covering only the most fundamental tools), and get into the more advanced material (e.g. introsort) in an Advanced Data-Structures and Algorithms book. MShonle 19:34, 20 Dec 2004 (UTC)

Moving forward
It looks like we've resolved many of the issues on this page. How would one go about archiving this talk page? MShonle 19:18, 30 Dec 2004 (UTC)

 * Create an /Archive 1 page and move the stuff there. Now that sub-pages are active /Archive 1 allways works ;-). --Krischik 15:31, 23 August 2005 (UTC)

Template Tricks
Here's the page structure I have for the Introduction, and I'd like to repeat it for the other chapters:

Computer Science:Data Structures:Introduction -- simple page that includes: a header , - i.e. a template ,       - another template a horizontal line a footer , - the same template as the header where the template is: Template:Computer Science:Data Structures:Introduction -- a simple page that REDIRECTS to     the page Computer Science:Data Structures:Introduction_content Computer Science:Data Structures:Introduction_content -- the article that includes the chapter's *real* content.

The idea of these template tricks is two fold:
 * 1) The navigation templates simply allow you to browse the book easier; and
 * 2) The _content templates allow the book to be viewed in two different ways: by-chapter, or all-chapters

The by-chapter view is the one shown above. The all-chapters view would be a page that would look like this:

... and so on, including all of the _content pages (indirectly, because the templates will redirect)

The indirection is neccessary in order to avoid the chapter navigation getting shown in the all-chapters view.

The idea behind the all chapters view is that people could print out the book easily. Anyway, if you see some weird things, like the above, that's the reason why. MShonle 19:47, 30 Dec 2004 (UTC)

Pseudocode
I've implemented the Stack ADT in a pseudocode that I'm proposing for the rest of the book. I used a literate programming approach in which the implementation is interspersed with prose describing it. The pseudocode for a somewhat more complicated ADT should probably be copied here and used for an example. The details of the pseudocode follow.

All blocks begin with a keyword (so far type and method) and end with a line containing end and the keyword. The pseudocode is sensitive to line endings, although a python-like use of ; to put two commands on the same line would not be unreasonable. Make sure you indent the contents of all blocks.

I use  to introduce a new type. I use the word "type" rather than an alternative like "class" or "structure" because this is a book on abstract data types, rather than object oriented classes, and the word "structure" is too long. I drew the angle brackets from C++ template or Java generic syntax. I think it is important to point out that abstract types are parametrized on other types. The type ends with  on its own line.

The data keyword declares a private data member. It is of the form. I am using the Pascal style of data typing (: to introduce the type of a variable) because there's already a keyword in front of the variable and this allows us to use type names with spaces in them. Data members (so far) can be accessed by their name alone in any member function. Possibly, we should follow python's lead and require a "self." in front of an access to clearly distinguish them from local variables.

method introduces a public member function/method. These are of the form. A method ends with  on its own line. If a return type is present, a return statement with the right type must terminate all calls of the function. Probably we should find a way to indicate that a method does not modify its object or an argument. You call a member function using the standard  syntax.

I'd like a for loop that allows iteration over either a numeric range with a possible stride, or over all members of a given set or sequence. Perhaps the following syntax: for i in 1..11 [step 2] # Does this loop for i=11 or not? for i in some_set Pattern matching should probably be allowed too: for (first,second) in pair_sequence

Discussion

 * A defense of explicit typing in our pseudocode: In a couple places, MShonle has suggested that this book's pseudocode should not use generics, instead leaving certain variables untyped. I respectfully disagree. While certain languages (Perl, Python, Lisp) allow programmers to omit the types, this makes the programmer have a firmer understanding of what type a given variable has at any time since the compiler won't catch mistakes. Since we're trying to teach new programmers, who probably don't understand types as well, the type of any variable in our pseudo code should be specified. Without generics, if a variable declaration has no type, the reader has to guess the type. A mapping ADT will have two types that can vary, and a Graph may have even more. Using templates/generics adds a little syntax but allows us to type every variable we use. MShonle, if I'm wrong about your position, feel free to delete this paragraph. --jyasskin 07:01, 24 Jan 2005 (UTC)

Old discussion from above:
 * We should include code snippets in as many different languages as possible along with pseudocode.
 * I'm not sure "as many" languages as possible is desirable. Certainly the current fad language could be used, or a language like it. I'm a fan of pseudocode that absorbs the benefits from several languages. But data-structures in Scheme versus Python versus Java/C# are going to be very different. At some point decisions will have to be made. I believe for the topic of data structures that something closer to C should be used, but organized such that it could "obviously" be turned into an object-oriented program. At heart, Data Structures is about making linked-list and hash-tables and ballanced binary search trees: it would seem silly to implement a linked list in a language that already includes full, built-in support of them. (However, these high level-languages could offer a lot: as they can help in the design of the interface of the structures; for example by using iterators.) The Algorithms book uses a more pure pseudocode language that offers excellent looping constructs and array slices: the reason being that showing low-level details detracts from the "hard part" of what the algorithm is (i.e., introducing implementation complexity on top of the inherent complex makes the story telling harder)Mshonle 09:45, 1 Aug 2004 (UTC)

 * From a teaching perspective i think that pseudocode for data structures is much much clearer than any implementation. I would suggest that code snippets be first done in pseudocode, and then possibly in actual language code (is there a way perhaps this could be on a different page, like an appendix or something?)  The pseudocode is the clearest way to learn the concept, which is pretty indepedent of language.  I think both functional and procedural data structures should be shown, as functional programming is becoming more mainstream, and this book is not simply a programming text, but a CS text, and they are theoretically very important. JustinWick 15:19, 12 Nov 2004 (UTC)

 * I have a suggestion from the Computer Programming Book: Just read the following 3 pages: Computer Programming, Computer Programming/Control, Ada Programming/Control. It's almost what JustinWick suggested.

On the history page, Krischik said: "(Discussion - pseudocode vs real language - why not both?)". Answer: We are taking that approach. If people want to supply implementations in C, Scheme, Python or Java they may do so, as an appendix (the sister Algorithms book has one appendix already set up, but with little work done on it). The pseudo-language is closest to Python, so it would be a good idea to test all of the samples by actually running them against a full test-suite (which should also be part of the appendix; see the Algorithms book). MShonle 14:35, 23 August 2005 (UTC)

Jyasskin said: "In a couple places, MShonle has suggested that this book's pseudocode should not use generics, instead leaving certain variables untyped. I respectfully disagree."
 * Thinking about this more, I think we probably should go with a light-weight kind of generics notation. Basically in the yellow "Some-structure Operations" boxes we could put the conventional  or  notations, just to say "when you see Key here, it could actually be anything". That probably would make things easier to read. This notation would only be used for the ADT descriptions. The methods themselves will just say "Key k" or "Element value", and when converting to a language, the reader will either: (1) delete the types, because it's a dynamically typed language; (2) enter in the generic notation, because it's a language that allows type parameterization; or (3) substitute for a concrete type, like string or integer, because the language doesn't allow for generics, but is also statically typed. MShonle 20:24, 29 August 2005 (UTC)

hi there! i just started reading this book, like it so far, but one thing conufses me: every chapter uses a diferent pseudocode; this realy makes it hard to follow...

TODO note
The references section should have its own _content page, so that it could be seen on the All Chapters view version of the book too. Possibily we'll want to do this for the preamble too. MShonle 20:59, 7 September 2005 (UTC)

reviews, quizzes?
Will this wikibook have reviews for each chapter, or perhaps quizzes, or even a test/project? I didn't really see any mention of this in the intro. Just wondering. I may be able to help with these. Gflores 02:24, 31 October 2005 (UTC)
 * Err... nevermind. I guess that's up to Data Structures on Wikiversity . It sure does seem like a lot of duplicate work... Gflores 00:41, 1 November 2005 (UTC)

still active?
I was just looking at the history of some of the modules and some date back to February. Is this book still active?

adding implementations
I noticed the part saying that implementations in various languages would be welcome as an Appendix. I agree that this is a good idea, and would be willing to add some of them. I'm not sure what a good structure would be. Have a page as the appendix with everything on it? A page as the appendix with links to pages for individual structures, featuring an implementation in each language, and/or links to pages for each language, featuring an implementation of each structure mentioned in the book. Any thoughts? Cat Parade 06:39, 8 March 2006 (UTC)
 * I agree completely. It would be great to have an appendix for code and pseudocode. I've noticed several sections that contain mostly code. The implementations are great but too much in the text will make a section unreadable. Christopher.Reilly (discuss • contribs) 12:05, 16 June 2015 (UTC)

Pages to merge
-- Adrignola talk contribs 13:39, 17 May 2010 (UTC)
 * Data Structures/merge Sort
 * Data Structures/bubble sort

 * I've merged the above striked out orphan to the relevant Algorithm Implementation page. The orphans don't fit on the scope of this book as they don't relate to data-structures per se. --Panic (talk) 02:12, 20 May 2010 (UTC)

Hash Trees
I would like to see the book cover Hash Trees regarding structures, traversal and uses. --Panic (talk) 02:31, 20 May 2010 (UTC)

Category template
Just a note for editors (and anyone doing administrative work) on the project's namespace. There is no need to add BookCat at all on subpages that already use the template (it is already included there). This also means you don't want the direct category addition below the template, which will upset the sorting that BookCat provides (would sort on D rather than H). This should probably be listed in a specific book convention page that explains what and how to use the navegation templates. --Panic (discuss • contribs) 09:42, 28 October 2011 (UTC)

title: Talk:Data Structures


text:
Talk:Dian Bachar

Jewish?
Bachar is a common jewish last name - is he jewish?

The Coon
Matt Stone did the voice of Mysterion —Preceding unsigned comment added by Guinea pig warrior (talk • contribs) 15:23, 20 March 2009 (UTC)

South Park And Team America
It was informed to Dian, since he's in the Screen Actors Guild, he is not allowed to do voice overs on South Park because it is a non-union show. According to Dian, Trey promised him a voice spot on his film, Team America, but in his own words he said, "When Parmount was ready to pull the plug on Team America, Trey decided to give himself a few extra paychecks and do most of the male voices in the film." Their last film together was BASEketball, 1998. —Preceding unsigned comment added by <IP_ADDRESS> (talk) 04:17, 3 July 2009 (UTC)

It was informed to Dian, since he's in the Screen Actors Guild, he is not allowed to do voice overs on South Park because it is a non-union show. According to Dian, Trey promised him a voice spot on his film, Team America, but in his own words he said, "Trey promised me voicework on Team America, but when Paramount was about to pull the plug on the production because it was going over budget, Trey decided to give himself some extra paychecks and do nearly all of the male voices at the last minute." Their last film together was BASEketball, 1998. —Preceding unsigned comment added by Kraft666x (talk • contribs) 04:23, 3 July 2009 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 2 external links on Dian Bachar. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20140104044333/http://www.beauxartssociety.org/20756.html to http://beauxartssociety.org/20756.html
 * Added archive https://web.archive.org/web/20150722153334/http://roommatestheseries.com/ to http://www.roommatestheseries.com/

Cheers.— InternetArchiveBot  (Report bug) 05:39, 31 December 2017 (UTC)

source: wikimedia

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

title: Talk:Dian Bachar


text:
Magnetism

Faraday's Law
The magnitude induced EMF through a loop of conducting material is equal to the magnitude of the time derivative rate of change of the magnetic flux through that loop.

 * $$\left|\frac{d\Phi_{B}}{dt}\right| = \left|e.m.f\right|$$

Lenz's Law
The polarity of the induced EMF is such that oppose the changes/current that causes it.

 * $$e.m.f = -N\frac{d\Phi_B}{dt}$$

Magnetic Field Strength
Magnetic Field Strength is defined as the force on one metre of wire carrying a current of one amp at right angles to the magnetic field. Magnetic Field Strength is also called flux density and is measured in teslas, T.

title: Magnetism


text:
Khamagib

Khamagib (Хамагиб; Хамагъиб) is a rural locality (a selo) in Tlogobsky Selsoviet, Gunibsky District, Republic of Dagestan, Russia. The population was 72 as of 2010.

Geography
Khamagib is located 45 km northwest of Gunib (the district's administrative centre) by road, on the Kudiyabor River. Enseruda and Amuarib are the nearest rural localities.

Nationalities
Avars live there.

title: Khamagib


text:
User:AdamSeattle/sandbox

= User:Utl jung/sandbox/LD40817 =

Going in
Welcome to your scratchpad for today's exercises!

We will use the contents of this page and Wikipedia's sandbox (scratchpad) feature to learn about infoboxes and practise editing them.

We will focus on Wikipedia infoboxes today, although variations of the infobox are found on multiple Wikimedia projects (Wikipedia, Wikidata, Commons, etc.). Wikipedia is a well-used general reference source, and allows us to experiment with edits in the sandbox.

Slides from May 2020 presentation providing an overview of Wikipedia infoboxes and how they work.

Setup
To begin, click "Edit source" and copy and paste the contents of this entire page into your own sandbox.

 * ⇧ Shift + click Sandbox in the user toolbar in the top right corner. This opens your sandbox in a new window.
 * If your sandbox already has stuff on it, make a new subpage directly from the sandbox URL. The URL is in the address bar in your browser: https://en.wikipedia.org/wiki/User:____/sandbox . After /sandbox, write /something.
 * For example: https://en.wikipedia.org/wiki/User:Utl_jung/sandbox/workinghour1 takes me to a page which does not yet exist but can be started.
 * Once you are on the new subpage, click Start the... page or Create source (to the left of the search bar)
 * Copy and paste the contents of this page into your new subpage.
 * Tip: press ⌃ Ctrl + a to select all.
 * Finally, publish the page. You now have a copy of this page which you can freely edit.

How to use
Under each section, you will see instructions on what infobox to use and how. If you click Edit source on each section, you will see an editing area marked out with comments. These comments look like this:, I would search Template:Infobox film which gives me this page

Remember, templates are wrapped in squigglies and transclude some pre-written function.

In other words, our goal today is to:

 * Get comfortable using transclusion via Wiki markup
 * Get comfortable looking up a template and reading its documentation
 * Practise editing various parameters on infobox templates

Use an infobox
Think of the most recent movie you watched. Then, insert an below.

Use a Wikidata-powered infobox
Let's try using a WD-powered infobox with.

Generally, the template page documents everything you need to know about using that infobox.

Since we're in a sandbox, we will need to manually assign a qid and a name.

For example, the code below returns:

You can also organise this more nicely:

Do this exercise for one figure of your choice with a Wikidata item, and for Ludwig van Beethoven. Once you succeed, try different variations using the following parameters: suppressfields

dateformat

noicon

onlysourced

Fully automatic infobox
uses its own module customised to pull and display Wikidata without local manipulation.

Since we're in a sandbox and not the article (which contains the interwiki link), we will need to manually provide some input. Reference the template page and reproduce the infobox in Beta-2 microglobulin below.

↵

↵

Archives at (P485) workaround
Use as a workaround for the block on archives at (P485) on English Wikipedia infoboxes. Thi

Location (institution where archives are held), Inventory number, and Description URL parameters pull from Wikidata if left blank.

It is recommended that you also specify the following parameters: title For example, the code below produces: I can also insert any field manually: Produce the template for a figure with an archives at (P485) property in their Wikidata entry. If you don't have anyone in mind, try Ella Maillart.

↵

Navigation menu

 * UWashPrincipalCataloger
 * Alerts (0)
 * Notices (0)
 * Talk
 * Sandbox
 * Preferences
 * Beta
 * Watchlist
 * Contributions
 * Log out

 * User page
 * Talk

 * Read
 * Edit
 * View history
 * Watch
 * WikiLove

More

 * Main page
 * Contents
 * Current events
 * Random article
 * About Wikipedia
 * Contact us
 * Donate

Contribute

 * Help
 * Community portal
 * Recent changes
 * Upload file

Tools

 * What links here
 * Related changes
 * User contributions
 * User logs
 * Email this user
 * Mute this user
 * View user groups
 * Special pages
 * Page information

Languages

 * This page was last edited on 17 August 2020, at 15:00.
 * Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.

 * Privacy policy
 * About Wikipedia
 * Disclaimers
 * Contact Wikipedia
 * Mobile view
 * Developers
 * Statistics
 * Cookie statement

title: User:AdamSeattle/sandbox


text:
binomial distribution

Noun

 * 1)  The discrete probability distribution of the number of successes in a sequence of n independent trials, each of which yields success with probability p.

Usage notes
The special case n = 1 (a single trial) is called the.

Translations

 * Czech: binomické rozdělení
 * Finnish: binomijakauma
 * German: Binomialverteilung
 * Hungarian: binomiális eloszlás
 * Icelandic: tvíliðudreifing, tvíkostadreifing
 * Romanian: distribuție binomială, distribuție binomică
 * Tagalog: duhakaying pamamahagi
 * Ukrainian: біноміа́льний розпо́діл

title: binomial distribution


text:
Motherless (disambiguation)

Motherless means having only a father.

Motherless may also refer to:
 * Motherless (film), 2022 Iranian film
 * Motherless (sculpture), an 1889 sculpture by George Anderson Lawson
 * Motherless (painting), an 1895 painting by Walter Langley

title: Motherless (disambiguation)


text:
Wikipedia:WikiProject Spam/LinkReports/technowanted.com

Links

 * technowanted.com resolves to [//<IP_ADDRESS> <IP_ADDRESS>]
 * Link is not on the blacklist.
 * COIBot domainredlist search for link technowanted.com gives:
 * technowanted.com (Automonitor: reported to en:MediaWiki talk:Spam-blacklist (diff))
 * technowanted.com (Automonitor: reported to en:MediaWiki talk:Spam-blacklist (diff))
 * Link is not on the Monitorlist.
 * None of the mentioned users is on the blacklist.
 * Link is not on the whitelist.
 * Link would be caught by rule \btechnowanted\.com\b on the monitor list (Automonitor: reported to en:MediaWiki:Spam-blacklist (diff - )).
 * Link is blacklisted by \btechnowanted\.com\b on [//en.wikipedia.org/wiki/Mediawiki:Spam-blacklist en.wikipedia.org]
 * Link is not on the whitelist.
 * Link would be caught by rule \btechnowanted\.com\b on the monitor list (Automonitor: reported to en:MediaWiki:Spam-blacklist (diff - )).
 * Link is blacklisted by \btechnowanted\.com\b on [//en.wikipedia.org/wiki/Mediawiki:Spam-blacklist en.wikipedia.org]

Additions

 * Displayed all 2 additions.


text:
Talk:Towns and villages in the Jervis Bay Territory

Disputed
Hyams Beach, Wrights Beach, Berrara Beach, Cabbage Tree Point, Sussex Inlet and Bream Beach are all outside the Jervis Bay Territory, according to Geoscience Australia and the Geographical Names Board of NSW. I presume 2540 and 2541 are intended as postcodes, however according to Australia Post, all these areas have postcode 2540. JPD (talk) 11:19, 11 August 2006 (UTC)


text:
Tagus-Segura Water Transfer

The Tagus-Segura Water Transfer (Spanish: Trasvase Tajo-Segura) is one of the largest works of hydraulic engineering ever produced in Spain. Water from the Tagus River is channeled through this transfer system from the reservoirs of Entrepeñas (Province of Guadalajara) and Buendía (Province of Cuenca) into the Talave Reservoir on the Segura River.

History
Although it was mentioned as early as 1902, the origin of the transfer system dates back to 1932, when the Minister of Public Works Indalecio Prieto entrusted engineer Manuel Lorenzo Pardo with the formulation of a plan for the management of national water resources. A year later, he presented the Plan Nacional de Obras Hidráulicas (National Plan of Hydraulic Works), which included the Tagus-Segura Water Transfer; however, for various reasons, the plan was never realized.

The transfer system project was resumed through the Ministerial Order of July 30, 1966, which commissioned the drafting of the Anteproyecto General del Aprovechamiento Conjunto de los Recursos Hidráulicos del Centro y Sureste de España, Complejo Tajo-Segura (General Proposal for the Joint Management of Hydraulic Resources in Central and Southeastern Spain, Tagus-Segura System). The construction of the Tagus-Segura Water Transfer formed an integral part of this proposal. In 1979, the Segura Basin received the first waters originating from the Tagus River.

Course
The Tagus-Segura Water Transfer links the Bolarque Reservoir on the Tagus River (40.3613°N, -2.8205°W) with the Talave Reservoir on the Segura (38.5195°N, -1.9001°W). It is 292 km in length and has a flow rate of 33 m3/s. The transfer's structure comprises four sections:

Section I includes the ascent at Altomira, a key piece in explaining the energy efficiency of the transfer system. It permits water from the Bolarque Reservoir at 636 m to be pumped through two metallic pipes up to the Bujeda Reservoir in the Sierra de Altomira, a 245 m rise in elevation. This task is accomplished by the reversible pumped-storage plant Bolarque II, which relies on four vertical generator assemblies with their corresponding Francis pump-turbines, capable of pumping 66 m3/s. The Bolarque-Bujeda system was designed to pump an anticipated<PHONE_NUMBER> m3 per year.

Section II connects the Bujeda Reservoir to the Alarcón Reservoir on the Júcar River, an intermediate resting place where the transfer's flow can be regulated and compensation can be made in case of system disruption.

Section III joins the Alarcón Reservoir to the Talave Tunnel.

Section IV is for the most part formed by the Talave Tunnel's length of 32 km, which runs at varying depths between 150 m and 320 m. The course then emerges into the Talave Canal, which leads at last to the Talave Reservoir on the Mundo River, a tributary of the Segura.

Regulation
Law 21/2013 introduced major changes to the Tagus-Segura Water Transfer's regulation policy. These changes, while maintaining the source basin's precedence and respecting the specifications of its resource planning, are meant to improve system management by establishing a set of impartial technical standards to eliminate previous insecurities and to provide objective, straightforward criteria for operation.

Water is dispensed into the transfer system on a monthly basis, depending on the total water supply available in the reservoirs of Entrepeñas and Buendía at the beginning of every month. Four levels are used to specify the distribution volume for each transfer, with a maximum annual total of 650000000 m3 per water year (600000000 m3 for the Segura and 50000000 m3 for the Guadiana).

'''Level 1. ''' When the total water supply in Entrepeñas and Buendía is equal to or greater than<PHONE_NUMBER> m3, or when the total inflow of these reservoirs in the previous twelve months is equal to or greater than<PHONE_NUMBER> m3, the relevant agency shall authorize a transfer of 60000000 m3, not exceeding the yearly maximum.

'''Level 2. ''' When the total water supply in Entrepeñas and Buendía is less than<PHONE_NUMBER> m3 without reaching the volumes given in Level 3, and the total inflow recorded in the previous twelve months is less than<PHONE_NUMBER> m3, the relevant agency shall authorize a transfer of 38000000 m3, not exceeding the yearly maximum.

'''Level 3. ''' Assigned when the total water supply in Entrepeñas and Buendía does not exceed, at the beginning of the month, the values shown in the following table:

At this level, which constitutes an irregular hydrological situation, the relevant agency shall authorize at its discretion and with valid justification a transference of up to 20000000 m3.

'''Level 4. ''' When the total water supply in Entrepeñas and Buendía is less than 400000000 m3, no transference is permitted. In order for the reservoir supply to reach this new minimum figure from the one previously fixed at 240000000 m3, a five-year transitional program will be implemented.

To promote the development of riverside communities, priority will be given to the headwater reservoirs for the holding of authorized transfers pending distribution, before the intermediate and terminal basins, as long as this practice conforms to a reasonable and cohesive use of the whole system.

Except in duly confirmed cases of catastrophe or extreme need that disrupt the transfer of water, if the approved volumes outlined in Levels 1 and 2 have not been transferred within the authorized time period, they may still be sent within the three months following the deadline, unless a level change occurs.

Resources authorized for transfer may be used throughout the water year. If any transferred water remains in the receiving basin after the end of the water year, it will be redistributed as an available resource for use in the transfer system during the following water year.

Authorized transfers will be divided between water supply and irrigation, in a 25% to 75% proportion respectively, always assuring at least 7500000 m3 per month for urban water supply.

The Central Commission for Exploitation of the Tajo-Segura will be responsible for authorizing transfers when the conditions for Levels 1 and 2 are met, while the ministry with authority concerning water resources, having received the commission's report, will authorize transfers at Level 3.

In regard to Levels 1 and 2, transfer authorization should be granted over six-month terms, while three-month terms are preferred for Level 3 unless the relevant agency should justify the use of different intervals at any level.

Post-transfer system
The Talave Reservoir marks the beginning of the post-transfer system. This is a complex of structures enabling the regulation, transport, and final distribution of water to the various recipient zones. Its principal component is the Ojós Diversion Dam, from which proceed the following: the Blanca elevation, the main canal of the right riverbank, and the Almería Canal; the main canal of the left riverbank and the Crevillente Canal; and La Pedrera Reservoir and the Campo de Cartagena Canal.

The volume of water assigned for agricultural irrigation from the Tagus-Segura Water Transfer is 400000000 m3, approximately 53% for new irrigation plots and the rest for replenishing previously irrigated land. According to mid-2009 concession proceedings, the irrigable zones of the post-transfer system comprise a nominal surface area of 132724 ha, of which 82257 ha, or 62%, are located in the Region of Murcia.

The average yearly water volume transferred into the Segura Basin from 1979-2014 was 328000000 m3 per year (55% of the allowed maximum). Volumes transferred for public use have not varied greatly over time, unlike irrigation transfers, whose average yearly sum was 204000000 m3, almost half of the allocated quantity.

According to estimations made by PwC in 2013, the food and agriculture industry linked with the Tagus-Segura Water Transfer brings in a GDP of 2,364 million euros and more than 100,000 jobs, if commercialization and processing activities are included. Despite these figures, the Tagus-Segura Water Transfer has always been the subject of heated debate, having been used from the beginning as a means to criticize the previous Francoist government, under whose authority construction of the transfer began. However, the transfer cannot be considered the work of any one political regime: it was planned during the Second Spanish Republic, built under Franco's dictatorship, and put into service during the Spanish transition to democracy. It still receives much criticism today, mainly for territorial and environmental reasons. With respect to this controversy, Melgarejo et al. observe: "Thirty years after the commission of the Tagus-Segura Aqueduct, it's hard to understand why its use still hasn't been normalized, and why the distribution of water is still in question."

The official launching of the Tagus-Segura Water Transfer made intensive farming possible in the Spanish southeast, consequently placing the region among the largest European outdoor producers of out-of-season crops. For this reason, it is widely known as the "vegetable garden of Europe."

title: Tagus-Segura Water Transfer


text:
ASD Fersina Perginese

A.S.D. Fersina Perginese is an Italian association football, and the major football club in Pergine Valsugana, Trentino-Alto Adige/Südtirol. Currently it plays in Italy's Serie D.

Foundation
The club was founded in 2009 after the merger with the teams of A.S. Fersina and A.C. Perginese.

Serie D
In the season 2011–12 the team was promoted from Eccellenza Trentino-Alto Adige/Südtirol to Serie D.

Colors and badge
The team's colors are yellow and black.

Honours

 * Eccellenza Trentino-Alto Adige/Südtirol:
 * Winner (1): 2011–12
 * Regional Coppa Italia Trentino-Alto Adige/Südtirol:
 * Winner (2): 2010–11, 2011–12

title: ASD Fersina Perginese


text:
Talk:Deborah Batts

Wiki Education Foundation-supported course assignment
This article was the subject of a Wiki Education Foundation-supported course assignment, between 3 February 2021 and 13 May 2021. Further details are available on the course page. Student editor(s): BluesClues2719.

Above undated message substituted from Template:Dashboard.wikiedu.org assignment by PrimeBOT (talk) 19:09, 16 January 2022 (UTC)

Bot-created subpage
A subpage at Deborah A. Batts/fjc was automatically created by a perl script, based on this article at the Biographical Directory of Federal Judges. The subpage should either be merged into this article, or moved and disambiguated. Polbot (talk) 13:23, 4 March 2009 (UTC)

title: Talk:Deborah Batts


text:
User:SANY xD

SANY (Sanel Ćatić) is a young YouTuber. His channel name is SV Gaming. On that channel are gameplays and tutorials. He record Outlast, Minecraft, etc.

title: User:SANY xD


text:
Talk:Guide to Social Activity/Appearance

Body Language
Perhaps the body language part should be moved to a section about strategies when on dates? It just seems to me that it is out of place.

A question...
Why is this article supposed not to be gender specific?
 * very good question. Especially since the title notes that it's for guys. Jordanmills 15:21, 19 September 2006 (UTC)
 * I disagree that it needs to be gender neutral at all. Necromonger Wekeepwhatwekill 22:44, 29 August 2018 (UTC)


text:
Wikipedia:WikiProject Spam/LinkReports/dbohm.com

Links

 * dbohm.com resolves to [//<IP_ADDRESS> <IP_ADDRESS>]
 * Link is not on the blacklist.
 * Link is not on the domainredlist.
 * Link is not on the Monitorlist.
 * None of the mentioned users is on the blacklist.
 * Link is not on the whitelist.
 * Link is not on the monitor list.
 * Link is not on the whitelist.
 * Link is not on the monitor list.

Additions

 * Displayed all 5 additions.


text:
Committee of Seventy (New York City)

The Committee of Seventy was a committee of 70 citizens of New York City, formed in 1871 and under the lead of Samuel J. Tilden, which conducted an investigation and prosecution of misuse of government office by William M. Tweed.

Foundation
In the summer of 1871, proofs were furnished that enormous frauds had been perpetrated by the existing officials upon the New York City treasury, raising the city debt in 2½ years from $50,000,000 to $113,000,000. One of the chief instruments of peculation was the court house, large sums appropriated for its construction finding their way into the pockets of the “ring.” The amount ostensibly expended in its erection exceeded $12,000,000.

People were immediately aroused, and assembled in mass meeting in the Cooper Union on September 4, 1871, when a committee of 70 members was appointed, to take the necessary measures to ascertain the true state of the treasury, to recover any abstracted moneys, and to secure good government and honest officers.

In the November 1871 city election, the candidates favored by the people accused in the frauds were defeated by large majorities. The accused were subsequently prosecuted. Some of them were convicted and sentenced, while others fled the country. Several of the judges were impeached and resigned, or were removed from office.

Later Committee of Seventy
Another Committee of Seventy was formed in the aftermath of the Lexow Committee of 1894, where Richard Croker's operation of Tammany Hall and the police force were under investigation.

Members

 * Henry G. Stebbins - Chairman
 * William Frederick Havemeyer - Vice-Chairman
 * Roswell D. Hatch - Secretary
 * Emil Sauer - Treasurer
 * George C. Barrett
 * Jackson S. Schultz
 * James Emott
 * W. H. Neilson
 * Isaac H. Bailey
 * D. Willis James
 * James M. Brown
 * Henry Clews
 * H. F. Spaulding
 * Geo. W. Lane
 * W. R. Vermilye
 * E. Townsend
 * Lewis Ballard
 * Severn D. Moulton
 * James M. Halsted
 * J. B. Varnum
 * Robert Hoe
 * John Wheeler (New York politician)
 * H. N. Beers
 * Samuel Christie
 * Thomas A. Ledwith
 * Joseph Blumenthal
 * John Adams Dix
 * Geo. W. Varian
 * J. J. O'Donohue
 * Ed. Cooper
 * Eugene Ballin
 * William M. Evarts
 * Julius W. Tieman
 * Reuben W. Howes
 * W. C. Barrett
 * Albert Klamroth
 * Frederick Schack
 * John A. Stewart
 * James B. Hodgskin
 * B. B. Sherman
 * C. E. Detmold
 * Charles Crary
 * Sam. D. Babcock
 * Edwards Pierrepont
 * Joseph Hodges Choate
 * John Foley
 * John Straiton
 * Thomas McLelland
 * J. M. Budny
 * Henry Nicoll (politician)
 * E. Krackouitzer
 * Adrian Iselin
 * Johnathan Sturges
 * Theo. Steinway
 * John Ewen
 * John Cleve Green
 * William H. Wickham
 * Charles Watrous
 * Simon Stern
 * Robert Roosevelt
 * Geo. W. Van Slyck
 * William. C. Molloy
 * N. G. Dunn
 * T. C. Cunningham
 * S. B. Ruggles
 * Robert B. Nooney
 * Francis C. Barlow
 * Thomas W. Piersall
 * William M. Fliess
 * Joseph Seligman
 * William Radde
 * Edmund R. Robinson

title: Committee of Seventy (New York City)


text:
Talk:2020 QG

Do we have any info on how the orbit changed?
Do we have enough observational data to know how the orbit of 2020 QG changed from it's close encounter with Earth?

The article just shows standard orbital ephemeris for a single Apollo asteroid orbit. But it would seem that, at 2900 km, the asteroid may have gotten a gravity assist / perturbation in the close encounter, and the new orbital parameters would have changed, perhaps markedly.

Would improve the article to reflect on this, if we have verifiable information. N2e (talk) 21:55, 17 August 2020 (UTC)

 * The change in orbit is fairly small given how close the approach was. The orbital period was reduced from 990 days to 964 days. Both 2011 CQ1 and 2019 UN13 had more notable changes in perihelion/aphelion/period. -- Kheider (talk) 23:25, 17 August 2020 (UTC)

title: Talk:2020 QG


text:
Oulton Academy

Oulton Academy (formerly Royds Academy, Royds School), founded in 1956, is a co-educational secondary school located in Leeds, West Yorkshire, England. The school serves approximately 1,300 pupils. Royds School was originally a secondary modern and is now a non-selective school serving Rothwell, south Leeds and the surrounding areas. This school was given an outstanding rating in 2024, a remarkable achievement.

The school originally gained Specialist Language College status in 2003. This was removed in 2014.

Previously a foundation school administered by Leeds City Council, in April 2021 Royds School converted to academy status and was renamed Royds Academy. The school is now sponsored by the Falcon Education Academies Trust.

In Summer 2021, consultation took place with staff and parents, and it was agreed that Royds Academy would change its name to Oulton Academy in 2022.

 Alumnus

Former Alumni from The Oulton Academy include as follows:

- Ryan Hall (rugby league player)

- Alicia Blagg (Diver)

- David Ellis (International Rugby Coach)

- Thomas Marshall (Football Player and Fitness Influencer)

title: Oulton Academy


text:
Dzhambolat Tedeyev

Dzhambolat Ilyich Tedeyev (Тедеты Ильяйы фырт Дзамболат; Дзамбола́т Ильи́ч Теде́ев) born 23 August 1968) is a Russian -Ukrainian former wrestler who competed in the 1996 Summer Olympics. He is the brother of Elbrus Tedeyev.

He came in first at the 1990 Soviet Union nationals. European Champion 1993 in Istanbul (90 kg). Tedeyev was a head coach of Russian freestyle wrestling national team (2001–2011, 2017–2021). Tedeyev is the youngest Russian coach ever.

Championships and achievements

 * As wrestler:
 * 1993 European Championships – 1st (90 kg)
 * As coach:
 * UWW Russian national team world rankings – 1st (2001, 2005, 2006, 2007, 2009, 2010, 2011, 2018, 2019, 2021)

title: Dzhambolat Tedeyev


text:
Talk:Richie Spice

Untitled
To Richie Spice there is no End. I'm a new fan his hit song Blood Again got my ears pricked !! Very impressed. I couldn't wait to see him perfomr at this years Sumfest in Montego Bay jamaica (July 2006) and he didn't let us down.

Keep it comign Richie - Rachael Charles UK

This article reads like an ad for Richie and needs to be more neutral, SqueakBox 16:03, 6 January 2007 (UTC)

Yeah, I love Richie but this looks like someone took the bio from his website or something and pasted it. Needs to be redone.Braves27 05:19, 9 September 2007 (UTC)

This article is a mess. I started by adding a discog. —Preceding unsigned comment added by <IP_ADDRESS> (talk) 22:48, 13 April 2009 (UTC)

Mess
In spite of User:UTH music being indef blocked, having only edited this article 3 days ago, nobody saw fit to revert his appalling edits which destroyed the article. Big fail. Now fixed, and restored to before he or she touched the article. Thanks, ♫ SqueakBox talk contribs 18:55, 12 August 2013 (UTC)

title: Talk:Richie Spice


text:
Template:IPA affricates/doc

Customized usage
 * – shows audio samples
 * – floats to the right
 * – appears centered
 * – hides the main frame (or enter a preferred caption after )
 * – hides the ejectives
 * – hides the footnotes
 * – appears collapsible
 * – appears collapsed

When editing this template, make sure it works not just by itself but also with the options above.

Audio version
The audio version is optimized for use as a floating box and has fewer symbols:

title: Template:IPA affricates/doc


text:
Wikipedia:Reference desk/Archives/Entertainment/2019 September 15

= September 15 =

Scott Summers seeing yellow
What is the comic issue where Scott Summers says he sees yellow? Apparently it's somewhere in New X-Men (2001 series). Thanks in advance. --Daniel Carrero (talk) 22:14, 15 September 2019 (UTC)

 * New X-Men (1st series) #131 (issue date October 2002) according to uncannyxmen.net. (And here you can look at the panel). ---Sluzzelin  talk  20:23, 16 September 2019 (UTC)


text:
C Programming/Before You Start

Objective

 * Get an overview of C and its benefits.
 * Learn about the creation of C.
 * Learn the uses of C.
 * Learn and acquire the tools you'll need for this course.
 * Understand the need to complete the assignments.
 * Understand the need to pace yourself.
 * Have fun!

Overview
If you have never programmed before or you want a refresher on C, then this course is for you! The C language provides a basis for understanding core programming concepts and a general feel of how the computer works. If you know how to program in C, you'll be able to transition to other C-like languages like C++, Java, and C# with relative ease. You aren't just limited to learning programming languages either, because a lot of the concepts taught in this course are associated with the field of computer science.

The Birth of C

The C language didn't just happen over night. Time, people, and events were needed in order for this language to become a reality. So, how exactly did C come to its existence? In the early 1960's the idea of time-sharing became powerful. Large amounts of money and manpower were spent on programs that allowed a large number of people to access one computer from a terminal and use some of its resource, all at the same time! One computer was able to act like 100, allowing places like Universities to efficiently give its students access to a computer at a reasonable cost. Eventually, a time-sharing operating system called Multics became prominent in the time-sharing industry. Although Multics was revolutionary in some ways, it had many problems. It's code was large and complex, which meant it wasn't very efficient to modify the operating system. In the early 1970's, the people at Bell Labs got frustrated and fed up with Multics, so they decided to create their own operating system. Today, this operating system is known as Unix. It was originally written in assembly, which led to some problems, since it isn't very portable. The solution to their problem was going to be a programming language called B, but it had some problems and inefficiencies. Dennis Ritchie created a newer and better version of B that was called C; C being a lot more powerful than B. C was so powerful, that it was able to do the job and Unix was mostly rewritten in C. This allowed Unix to be ported to many different computers with relative ease. Soon C was used for other jobs, slowly becoming one of the most influential languages ever.

C's Uses
C is widely used in education, in application programs like text editors, windows based applications, in games like Quake III, in calculations like finding interest, and for sorting, maintaining and organizing large amounts of data. C programs are used in engineering applications like plotting of curves, integration, game development and many more. C has been used in very complex things also, e.g. Operating systems like GNU/Linux, Unix. Microsoft/Windows and other Unices (SunOS, FreeBSD, et al) were also written partly in C.

Tools You'll Need
A compiler is a program that takes source code and turns it into an executable file. To learn C, you'll need a computer and operating system that has a C compiler. Generally, these can be platform specific, so they will vary in usage and performance. A list of C compilers can be found here. Each compiler has its advantages and disadvantages, for example some compilers may cost money, but you should be able to find free ones. The most popular C compiler is GCC (GNU Compiler Collection), it is usually pre-installed in GNU/Linux. If not, you can install it using your respective package manager. An IDE (Integrated Development Environment) is a software package that includes all the basic programming tools a developer may need. While not strictly necessary, all but the most proficient programmers may find it an invaluable resource. When downloading and installing the compiler or IDE, you'll need to strictly follow its manual on how to setup and use the compiler or IDE. If it has a poor manual, it is advised to beware of it. Many Windows IDE's uses GCC as their standard compiler.

If you choose not to install an IDE (which comes equipped with its own source code editor), you'll need a program to write source code. Generally, any plain-text editor, such as Windows Notepad, will do. (The key here is plain-text; you do not want to use a program that inserts 'invisible' formatting symbols, as they will cause compilation errors.)

As time passed and C became more widely used, it started to diverge from K&R C (often refereed as original version of C, which was invented by Ken Thompson and Dennis Ritchie), and branched into different standards. The first widely recognized standard was ANSI C (aka C89, C90, ISO C), declared by the American National Standards Institute (ANSI) in 1989, which was approved by the International Organization for Standards (ISO) in 1990. More recent standards are the C11 and C17 standards, which were approved in 2011 and 2018 (prepared in 2017), respectively. Many C programs were written following the ANSI C standard.

Now you have all the tools you need to start using C.

Assignments Are Good For You
This course provides many questions and exercises that test to see if you've understand the lesson. They are all contained with a section of the lesson called "Assignments" and are found at the end of the lesson. Although you're not required to do them, it's recommended that you complete the given assignments.

Have Fun!
Finally, I would like to tell you that programming can be a lot of fun. If you have that constant urge to learn, to know more, if you are inquisitive, then learning C is not only a good experience, it is also fun. Some words of wisdom, try to pace yourself when using this course. Going too fast or too slow can reduce the will to complete this course.

Assignments

 * Name a benefit gained when learning C?
 * Give a short summary on the creation of C.
 * Why was C famous irrespective of availability of other languages?
 * Where is C used? What applications use C?
 * Did you install a C compiler? If so, what's its name? Do you know how to use it?
 * Did you faithfully complete this assignment?
 * Give your suggestions that C is useful in today's world or not?

title: C Programming/Before You Start


text:
Talk:Negative Zone

Logic Problem
Quoting from the article: "The Negative Zone is often visited by the Fantastic Four, and Reed Richards has mapped portions of it extensively. The Age of Apocalypse version of Blink also visited it once, which proved that there's only one Negative Zone, as Annihilus remembered the Fantastic Four even though they never existed in the Age of Apocalypse."

Well, that proves no such thing. All it proves is that these two visits were to the same Negative Zone. As a matter of fact, we know there's more than one Negative Zone, since the Ultimate Universe has a different version (called the N-Zone). Since this article discusses the N-Zone as well, it contradicts itself.

I'll fix things as soon as I can come up with something better, unless someone else beats me to it. RobertAustin 15:23, 21 October 2006 (UTC)

General Desc
Sorry, but I had to delete this: "Read on, then, with the salt shaker handy, true believers ..." at the end of the desc. It's a funny line, but, unfortunately, not suitable for wikipedia :\.

First appearance
Well, Annihilus first appeared in Fantastic Four Annual #6 (1968), and Blastaar first appeared in Fantastic Four #62 (May 1967). So when did the actual Negative Zone first appear? <IP_ADDRESS> 15:06, 4 December 2007 (UTC)

title: Talk:Negative Zone


text:
Wikipedia:Articles for deletion/Quentin Thomas

The result of the debate was delete. Shanel 02:09, 25 March 2006 (UTC)

Quentin Thomas
Non-notable university sports palayer, see WP:BIO. BrownHairedGirl 04:07, 20 March 2006 (UTC) I'm relatively new to wikipedia, so I'm unsure what to do and am seeking advice. Is the right step to delete this page and lose the history before creating a new redirect page, or should I just go ahead and delete the contents and replace with a redirect? Maybe a more experienced wikipedian can advise. --BrownHairedGirl 23:15, 23 March 2006 (UTC)
 * Delete, maybe in two years or so. -- Jjjsixsix (t)/(c) @ 04:11, 20 March 2006 (UTC)
 * Delete per nom. -- Vary | Talk 04:33, 20 March 2006 (UTC)
 * Delete as non-notable -- T B C [[Image:Confused-tpvgames.gif|18px|]] ???  ???   ??? 04:44, 20 March 2006 (UTC)
 * Delete as above.Blnguyen | Have your say!!! 04:46, 20 March 2006 (UTC)
 * Delete per nom. ¡Dustimagic!  ( T / C ) 04:55, 20 March 2006 (UTC)
 * Delete per above. --Khoikhoi 05:21, 20 March 2006 (UTC)
 * Strong keep WP:BIO guidelines actually seem to indicate notability. Besides, he's on the damn Tar Heels; clear notability.  Bobby P. Smith Sr. Jr. 05:22, 20 March 2006 (UTC)
 * Comment I don't know where you draw the line on a college player. This guy's not a starter. In their two games before being eliminated from the NCAA tournament, he played a total of 21 minutes. Is that notable? Fan1967 05:30, 20 March 2006 (UTC)
 * The relevant provision of WP:BIO would seem to read, in pertinent part, that notability for "sportspeople [is demonstrated where one has] played...at the highest level in mainly amateur sports, including college sports in the United States. Articles about first team squad members who have not made a first team appearance may also be appropriate, but only if the individual is at a club of sufficient stature that most members of its squad already have articles."  I readily concede that the latter phrasing isn't directed at college teams, but I think the principles nevertheless translate; best as I can tell, the only UNC player for whom a bio exists is Tyler Hansbrough, who surely merits an article.  Seven other Tar Heels played more minutes per game than Thomas this year  and none has an article.  Were there another distinguishing characteristic (e.g., likelihood that Thomas will be drafted into the NBA), I would be inclined to vote keep, but of course there is no such characteristic; therefore, delete.  Joe 06:11, 20 March 2006 (UTC)
 * Weak Delete, maybe once he plays more than a quarter hour at high-level, he'll be notable enough. Lankiveil 11:24, 20 March 2006 (UTC).
 * Delete. As per the majority of the above comments. Jud e (talk,contribs,email) 12:07, 20 March 2006 (UTC)
 * Delete I can't see why US College players are notable, I tend to think that they're only notable if they're standouts or when they start playing pro MLA 13:20, 20 March 2006 (UTC)
 * Delete, nn-bio. --Ter e nce Ong 15:19, 20 March 2006 (UTC)
 * Delete, being the backup backup, even on an exteremely notable Division I program, does not seem to be in line with the athletes clause of WP:BIO combined with a little common sense. Players like Rudy Gay, J.J. Redick or Gerry McNamara are (per the accolades mentioned in their articles), but not Thomas. -- Kinu  t /c  19:22, 20 March 2006 (UTC)
 * Ooops! can I (and if so, should I) withdraw a nomination? I'm now unsure if deletion is the right step, because maybe the page should exist as a redirect to Sir Quentin Thomas, an article I created and which prompted me to find this one.
 * Comment: If this is closed with a consensus to delete, we won't need the page history of this article anyway, so I'd actually recommend that Sir Quentin Thomas be moved here afterwards to fit naming conventions better (and have that page redirect to here). -- Kinu t /c  18:57, 24 March 2006 (UTC)


text:
Hao Wu (director)

Hao Wu is a Chinese film director, producer and writer living in the US. Wu was also a blogger known as Tian Yi. He is otherwise best known for his feature-length documentary, People's Republic of Desire, winner of the Grand Jury Award for Best Documentary Feature at the 2018 South by Southwest, All in My Family, a Netflix Original Documentary, and 76 Days, about the early days of the COVID-19 outbreak in Wuhan, China. In 2021, Wu won a Peabody Award and a Primetime Emmy Award for Exceptional Merit in Documentary Filmmaking for 76 Days.

Education

 * Bachelor of Science in Biology from the University of Science and Technology of China in 1992.
 * M.S. in Molecular Biology from Brandeis University in 1995.
 * MBA from the Ross School of Business, University of Michigan, in 2000.

Career
Wu worked as a molecular biologist before attending business school. After receiving his MBA degree, he worked in management positions at technology companies including Excite@Home, EarthLink, Alibaba Group and TripAdvisor. In 2011, he left TripAdvisor to become a full-time filmmaker.

In 2005, Wu's film career started with his first film, Beijing or Bust, a documentary about the trials and tribulations of six American born Chinese who chose to return to Beijing and the cultural adaptation they faced. The film was shown in the 6th Annual San Diego Asian Film Festival in 2005. Wu's second film, The Road to Fame, follows students at China's top drama academy, as they prepare to stage a Chinese version of the musical Fame. A co-production with BBC Storyville, VPRO, DR and CNEX, the film premiered at Sheffield Doc/Fest in June 2013. His third film, People's Republic of Desire, about China's live streaming crazed, premiered at the 2018 South by Southwest and won the Grand Jury Award for Best Documentary Feature. Wu then released All in My Family, a Netflix Original Documentary short, in 2019.

In 2020, Wu worked with two collaborators remotely on 76 Days, about the 76 days of lockdown of Wuhan at the start of the COVID-19 pandemic. The film premiered at Toronto International Film Festival in September 2020. Distributed by MTV Documentary Films and Dogwoof, it was named a Critic’s Pick by The New York Times. In 2021, the film was shortlisted for the Academy Award for Best Documentary Feature, nominated for the Gotham Awards, and won a Peabody Award and a Primetime Emmy Award for Exceptional Merit in Documentary Filmmaking

From 2014-2016, Wu was a fellow at New America, a D.C.-based think tank.

Detention
Wu was detained by the Chinese government on February 22, 2006, when he was making a documentary on "underground" Chinese house churches. After almost five months, he was released on July 11, 2006.

Filmography

 * 2005 Beijing or Bust - Director, Producer, Cinematographer, Editor.
 * 2013 The Road to Fame - Director, Producer, Cinematographer, Editor.
 * 2014 Nowhere to Call Home: A Tibetan in Beijing - Producer.
 * 2018 People's Republic of Desire - Director, Producer, Cinematographer, Editor.
 * 2019 All In My Family - Director, Producer, Cinematographer, Editor.
 * 2020 76 Days - Director, Producer, Editor.
 * 2021 Convergence: Courage in a Crisis - Executive Producer, Co-producer.

title: Hao Wu (director)


text:
JavaScript/Introduction

JS is a programming language that implements the international standard ECMAScript. It is based on the following concepts.

Dynamic data types
JS knows some primitive data types (Number, String, Boolean, BigInt, Symbol, Undefined, Null) and diverse derivates of the data type object (Array, Date, Error, Function, RegExp). If a variable exists, its type is clearly defined. But the type can be changed at any time by assigning a value of a different type to the variable, e.g.: the code fragment  is perfectly correct. It will not create a compile-time or run-time error. Only the type of the variable  changes from Undefined to String to Number and lastly to Object/Array.

(Note: JSON is a text-based data format, not a data type. As such, it’s language-independent. It uses the JavaSript object syntax.)

Functional programming
Functions are first-class citizens similar to variables. They can be assigned to variables, passed as arguments to other functions, or returned from functions. The code fragment  creates a function sayHello, assigns it to the variable x, and executes it by calling x.

Object-orientated programming
JS supports object-oriented programming and inheritance through prototypes. A prototype is an object which can be cloned and extended. Doing so, a prototype chain arises. This differs from other OO-languages, e.g. Java, which uses classes for object-oriented features like inheritance. Nevertheless, at the syntactical level, classes are available in JS. But this is only 'syntactical sugar'. Under the hood, JS uses the prototype mechanism.

C-like syntax
The JS syntax is very similar to that of C, Java, or other members of the C-family. But we must always consider that the concepts and runtime behavior are distinctly different.

Relation to Java
JS has no relation to Java aside from having a C-like syntax. To avoid possible confusion, we would like to highlight some distinctions between JS and Java clearly.

In the beginning, Netscape developed JavaScript, and Sun Microsystems developed Java. Java includes classes and object instances, whereas JavaScript uses prototypes. In Java, variables must be declared before usage, which is unnecessary (but not recommended) in JS.

In Java, variables have an immutable static type ( or , for example) that remains the same during the complete lifespan of a running program. In JS they also have a type ( or , for example), but this type can change during the lifespan of a running program. The type is detected from the environment. Therefore it's not necessary and not possible to define the type explicitly.

JS engines
JS can run on the client-side as well as on the server-side. First versions of JS have run in Browsers that acted as mere interpreters. Today, the language is handled by just-in-time compilers (JIT). They parse the script, create an Abstract Syntax Tree (AST), optimize the tree, generate a JIT-specific bytecode out of the AST, generate hardware-specific machine code out of the bytecode, and bring the machine code to execution. Such just-in-time compilers exist not only in Browsers. They can also be part of other applications, e.g.: node.js  which is written mainly in C++.

Widely used JS engines are:
 * V8 from Google: Google Chrome, Electron, Chromium, node.js
 * SpiderMonkey from Mozilla, Firefox
 * JavaScriptCore from Apple, Safari
 * ActionScript from Adobe, Flash

title: JavaScript/Introduction


text:
北宮

Etymology
Literally: the northern palace

Proper noun

 * 1)  one of the palace buildings in Luoyang during the Eastern Han Dynasty

title: 北宮


text:
Arvo Tuominen

Arvo "Poika" Tuominen (5 September 1894 – 27 May 1981) was a Finnish communist revolutionary and later a social democratic journalist, politician and author. He was given his nickname in 1920 because of his boyish look.

Tuominen was born in 1894 in Kuotila (part of Hämeenkyrö) to the family of a rural carpenter. In 1912 he moved to Tampere to become a carpenter's apprentice and soon joined the Social Democratic Party of Finland. During the Finnish Civil War in early 1918, Tuominen sided with the Finnish Red Guards and edited Kansan Lehti, a radical social democratic newspaper in Tampere. He was shortly arrested when the White Guards took the city in April, but he was soon released. After the Red Guards were defeated in May 1918 several Finnish radical social democratic leaders fled to Russia, where they split from the mainstream of Finnish Social Democratic Party and founded the Communist Party of Finland in Petrograd in August–September 1918.

Tuominen became a supporter of Otto Wille Kuusinen's faction within the party. In 1921 he traveled to Petrograd, where Kuusinen's adherents, supported by the Comintern leadership, successfully challenged Kullervo Manner's supporters at the next party congress. Tuominen was elected to the party's Central Committee and was put in charge of its Finnish bureau. He returned to Finland, where he was arrested on 26 January 1922, and subsequently imprisoned for publishing a proclamation urging Finnish workers to fight on the Soviet side during the Soviet-Finnish conflict over Karelia. He was released from the Tammisaari prison camp in the spring of 1926 and was elected secretary of the Finnish Federation of Trade Unions. He was again arrested in April 1928 for maintaining contacts with the Soviet Union and the banned Communist Party.

In late 1932 Tuominen was paroled and received a letter from Kuusinen, who was then one of the Comintern's secretaries, urging him to move to the Soviet Union. Tuominen secretly went to Sweden and then, in April 1933, to the Soviet Union, where he moved into Kuusinen's apartment. He was given a crash course at the International Lenin School and was appointed General Secretary of the Finnish Communist Party, also becoming a member of the Comintern Executive Committee Presidium.

Tuominen witnessed the Great Purge firsthand until he was able to leave Moscow for Stockholm in early 1938. On 23 November 1939 he was ordered to return to Moscow. Tuominen later claimed that he was being recalled to become the head of the communist government of the Finnish Democratic Republic, which Stalin planned to install in Finland. However, according to Tuominen, he refused to obey the order, broke with the Soviet Union and ordered the Communist Party of Finland not to assist the Red Army during the Winter War and to fight for Finland instead.

Research by the Finnish historian Kimmo Rentola has exposed a somewhat different story. When the Winter War started, Tuominen was initially enthusiastic of the war in expectation of a quick Soviet victory. However, as the Soviet advance halted and international opinion rallied to Finland's support, Tuominen's doubts started. He began to avoid contacting Moscow and sent feelers to Finnish Social Democrats. It was only after the end of the Winter War that Tuominen took the step of severing his ties with the Soviet Union and started writing anticommunist pamphlets, which were given widespread publicity in Finland. Tuominen had gone underground in Sweden, and it took some time for Moscow to find out what had happened. Within the Finnish communist movement, Tuominen became later known as the ultimate traitor.

Tuominen remained in Sweden until 1956, when he returned to Finland and published three volumes of bestselling memoirs in 1956–1958. Especially the second volume, Kremlin kellot ("The Bells of Kremlin") had a great impact in Finland, being a critical description and an inside view of the Soviet Union under Stalin, written by a former leading Finnish communist who had met both Lenin and Stalin. Tuominen joined the Social Democratic Party, edited its newspaper Kansan Lehti in Tampere for five years and became a member of parliament for one term (1958–1962).

Tuominen died in Tampere in 1981. He was the last surviving former member of the Comintern Presidium.

title: Arvo Tuominen


text:
Rio Minho

The Rio Minho is the longest river in Jamaica at 92.8 km. It rises close to the island's geographic centre, flows generally south-southwest and reaches the Caribbean Sea at Carlisle Bay in the central south coast, to the west of the island's southernmost point, Portland Point.

The town of May Pen, Clarendon lies on the banks of the river.

IUGS geological heritage site
In respect of it being the 'most diverse and thickest limestone succession with abundant rudist bivalves within the Caribbean faunal province', the International Union of Geological Sciences (IUGS) included the 'Late Cretaceous rudist bivalves of the Caribbean Province' around the Rio Minho in its assemblage of 100 'geological heritage sites' around the world in a listing published in October 2022. The organisation defines an IUGS Geological Heritage Site as 'a key place with geological elements and/or processes of international scientific relevance, used as a reference, and/or with a substantial contribution to the development of geological sciences through history.'

title: Rio Minho


text:
Wasserski

Etymology
From, after.

Noun

 * 1) water ski type of ski used for skiing on water

Noun

 * 1) water skiing the sport of skiing on water

title: Wasserski


text:
Bertil Berthelsson

Vice Admiral Alfred Erik Bertil Berthelsson (11 April 1902 – 11 February 1977) was a senior naval officer in the Swedish Navy. Berthelsson served as flag captain (1951–1953), as Chief of the Naval Staff (1953–1957), as Commander-in-Chief of the Coastal Fleet (1957–1961) and as commanding officer of the Naval Command South (1961–1966).

Early life
Berthelsson was born on 11 April 1902 in Njurunda Parish, Västernorrland County, Sweden, the son of Alfred Berthelsson, a merchant, and his wife Anna Backman. He passed studentexamen in Örebro in 1920, after which in 1921 he enlisted as a telegraphist in the Swedish Navy, where he reached the rank of Corporal. After two years of service, mostly on the torpedo cruiser HSwMS Claes Horn, Berthelsson was accepted in the summer of 1923 as a naval cadet and underwent regular training at the Royal Swedish Naval Academy.

Career
Berthelsson was commissioned as a naval officer in 1926 with the rank of acting sub-lieutenant. After service as an acting sub-lieutenant on the coastal defence ship HSWMS Sverige with Göran Wahlström as executive officer and long voyage with the cruiser HSWMS Fylgia to South America, Berthelsson began his training as an air scout. During the 1930s, he came during a number of different tours of duty to deal with the air operational issues in the navy, during which he served for a year 1933-34 in the Air Staff. During the same period, he underwent training as a torpedo officer with tours of duty on the destroyers HSWMS Ehrensköld (11) and HSWMS Klas Horn (3). These tours were a good preparation for Berthelsson's passing of the Royal Swedish Naval Staff College's General Course in the winter of 1932-33, which was followed by a Staff Course in the winter of 1934-35. This laid the foundation for decades of work in staff service - on board and ashore - as well as in various investigations. In 1936-37 he served on the coastal defence ship Sverige as an adjutant in the Winter Squadron (Vintereskadern) and in 1937 on the cruiser HSWMS Gotland (1933) as an adjutant of the School Department. This was followed by service in the Naval Staff, among other things as a press officer until the spring of 1939. The contact with the press that he thereby received, he maintained throughout his subsequent service, which benefited him during work in various investigations.

In the spring of 1939, Berthelsson took over as flag lieutenant (flaggadjutant) in the Coastal Fleet with Rear Admiral Gösta Ehrensvärd as commander and Captain Helge Strömbäck as flag captain. During the mobilization in the autumn of 1939 and the subsequent years of emergency preparedness, Berthelsson performed one of his superiors' highly esteemed work. It was above all the development of the ships' tactics and the torpedo's effort, both with ships and aircraft, that he had to devote his strength to, but at the same time he had to convey to daily press and radio events and developments to keep in touch with the public. Among other things, he also participated in the publication of various defense magazines and books, which were published by various main authors. After three years in this position, Berthelsson got a long-awaited position as ship captain on the destroyer HSWMS Karlskrona (J8) during the summer of 1942, followed by a similar command on the destroyer HSWMS Stockholm (J6) in 1943. He was largely allowed to conduct escort service in the Baltic Sea for shipping protection against German sea and air forces and Russian submarines, in which he was involved in several incidents. However, in the autumn of 1942, Berthelsson had already taken up the position of teacher in tactics at the Royal Swedish Naval Staff College and in 1943 was appointed lieutenant commander. During his three years as a tactics teacher, the reorganization of ship tactics began, which was conditioned by new weapons and on-board radars, which came to strongly influence the ships' way of behaving both at sea and in the bases. His pioneering work also came to fruition in the 1943 naval inquiry into naval warfare, where he served as secretary with Rear Admiral Gunnar Bjurner as leader. The type of ship, the armored destroyer, which was launched at the time, can be said to have served as a model for the Halland-class destroyers who began to be planned and built in the late 1940s and the Östergötland-class destroyers during the 1950s. His diligent efforts to keep the navy with destroyers at sufficient numbers were a marked feature of his business. Berthelsson's good handling of investigative issues led him to be appointed as an expert in the 1945 Defense Committee as an assistant to the then Rear Admiral Stig H:son Ericson, who was the navy's representative. The inquiry's work led to the Defence Act of 1948.

Berthelsson's longing for a tour of sea duty was satisfied in the autumn of 1947, when he took over as destroyer division commander with base aboard HSWMS Visby (J11). This annual command was followed by a year as captain of the cruiser HSWMS Tre Kronor. It was important to design the complex tactics of this newly built ship, which was conditioned by the many weapon systems on board. Tre Kronor was therefore allowed to act fairly independently under the command of the captain, during which Berthelsson was free to develop his thoughts on tactics and personnel care. Berthelsson's theoretical and practical knowledge of naval tactics was then used by placing him in the autumn of 1949 as head of the Weapons Control Office (Stridsledningskontoret) of the Royal Swedish Naval Materiel Administration, where he served for two years, during which time he was appointed Captain in 1951. It was a time when Swedish naval ships was fully equipped with radar, both for reconnaissance, combat command and navigation as well as for weapons deployment in many different forms. Berthelsson's great interest in modern development led him to play a leading role in the introduction of the Decca Navigator System for hyperbole navigation in the southern Baltic Sea. The facilities were later transferred to the Swedish Maritime Administration. In the autumn of 1951, Berthelsson was appointed flag captain of the Coastal Fleet, whose commander was Rear Admiral Stig H:son Ericson. This marked the beginning of what was called the "cruiser era" in the Swedish Navy, which came to be about a decade old. During this time, the "squadron tactic" was created, which involved a concentrated attack with at least two squadrons, composed of cruisers, destroyers and torpedo boats.

In the spring of 1953, Berthelsson took over as Chief of the Naval Staff. The emphasis in his work was shifted from the tactical and operational to the organizational and defense policy. Sweden's cooling defense will and the declining appropriations made it necessary to reduce the ship's armaments, while maintaining the high level of preparedness, leaving the ships to be "mothballed". At the organizational reductions, Berthelsson preferred to reduce the land organization in order to keep the crews on board, which led to some contradictions. The increasing number of investigations with which the navy was charged during Berthelsson's time as chief meant that his agility, acquired through dealings with publicists and politicians, came in handy. He had the ability, even when there were major differences from the beginning, to negotiate a compromise that was acceptable to all, which, thanks to his determination and willpower, did not become completely unfavorable to the navy. In 1954 he was promoted to rear admiral. In the spring of 1957, he achieved the goal he had set himself since his youth, namely to take over as Commander-in-Chief of the Coastal Fleet. There he had to continue the same line of development, which he helped to draw up during his time as Captain of the Fleet. He was eager to not only lead the exercises from the flagship but also to embark on the smaller ships in difficult conditions at sea to get to know the conditions of the crews. At the same time, he worked for information about the navy during the ships' visits to ports and he never forgot the requirement for contact with the public. However, in 1958 - due to drastically cut defense spending - the destroyers Lappland and Värmland had to be canceled to get funds available for the acquisition of the ship types that would be part of the new light fleet, which would succeed the cruiser era. Berthelsson took so much offense to this that he suffered both mentally and physically and his health was forever weakened.

In the autumn of 1961, he took over as commanding officer of the Naval Command South, based in Kungshuset in Karlskrona, which was his wife, Marianne's home town. However, it did not take long in his new position before he contracted ill health, which meant that from 1963 until his retirement in 1967 he had to devote himself to special assignments. Berthelsson retired and was promoted to vice admiral in 1967.

Personal life
In 1931, Berthelsson married Marianne Quiding (1905–1989), the daughter of Uno Quiding, a harbor master, and Thyra Uhrström. He was the father of Ulla (born 1933), Ulf (born 1937) and Kang (born 1945).

Death
Berthelsson died on 11 February 1977 in Västerhaninge, Stockholm County. He was interred at Västerhaninge Cemetery on 12 March 1977.

Dates of rank

 * 1926 – Acting sub-lieutenant
 * 1928 – Underlöjtnant
 * 1929 – Sub-lieutenant
 * 1938 – Lieutenant
 * 1943 – Lieutenant commander
 * 1946 – Commander
 * 1951 – Captain
 * 1954 – Rear admiral
 * 1967 – Vice admiral

Awards and decorations
Berthelsson's awards:

Swedish

 * Seraphimerorden ribbon.svg 🇸🇪 King Gustaf V's Jubilee Commemorative Medal (1948)
 * Royal_Order_of_the_Sword_-_Commander_Grand_Cross_BAR.svg 🇸🇪 Commander Grand Cross of the Order of the Sword (6 June 1964)
 * SWE Order of Vasa - Knight 2nd Class BAR.png 🇸🇪 Knight of the Order of Vasa
 * 🇸🇪 Swedish Women's Voluntary Defence Organization's Gold Medal (Riksförbundet Sveriges lottakårers guldmedalj)
 * 🇸🇪 Stockholms fkGM
 * 🇸🇪 Swedish Shipping and Navy League's Silver Medal (Föreningen Sveriges Flottas förtjänstmedalj i silver)

Foreign

 * Order of the Dannebrog K.svg 🇩🇰 Commander of the Order of the Dannebrog
 * FIN Order of the White Rose Commander BAR.png 🇫🇮 Commander of the Order of the White Rose of Finland
 * Legion Honneur Officier ribbon.svg 🇫🇷 Officer of the Legion of Honour
 * 🇱🇻 Latvian Air Force Aviation Badge

Honours

 * Member of the Royal Swedish Society of Naval Sciences (1942)
 * Member of the Royal Swedish Academy of War Sciences (1953)
 * Honorary member of the Royal Swedish Society of Naval Sciences (1954)

title: Bertil Berthelsson


text:
Global Environment Centre

Global Environment Centre (abbreviated: GEC) is a non-profit, non-governmental organization which was established in 1998 to address key environmental issues of global importance such as climate change, biodiversity and water resources. GEC is based in Malaysia but supports activities worldwide. It has field programmes in more than 10 countries and coordinates a number of regional and global networks.

The Organisation's mission is "to support the protection of the environment and sustainable use of natural resources to meet local, regional and global needs through strategic partnerships with communities and like-minded organisations". The Organisation organizes activities related to the forest and biodiversity conservation such as reforestation as well as other outreach and partnership programmes.

title: Global Environment Centre


text:
Healthmark Regional Medical Center

Healthmark Regional Medical Center was a hospital in DeFuniak Springs, Florida. It is now closed.

HRMC specialized in short-term acute care.

It had 44 routine services beds and 6 special care beds.

title: Healthmark Regional Medical Center


text:
User:Nicole459

Hello guys i am very smart and i will make some of the best articles and i will also help improve some of the recent articles :D

title: User:Nicole459


text:
C Programming/Arrays

Objective

 * Learn about arrays and how to use them.
 * Declaring arrays.
 * Initializing arrays.
 * Passing arrays to functions.

Introduction
An array is a series of contiguously allocated variables of the same type. Let us start with an analogy. Suppose that you have a cupboard in your house. You would like to keep books on each shelf of the cupboard. It would be nice to keep books related to one subject on one rack, books of another subject on another rack. A rack is an array. A rack is used to store books of the same subject. Similarly, an array can store data of the same type. When you declare an array, you must specify the type of data this array will hold. Every element of the array must be of that data type.

The syntax for declaring an array is:

For example: Is an array of integers, with size 5, called x. Similarly, is an array of floating point numbers, with size 6, called y.

To access the elements of an array, you must use array notation. The first element of an array is at position 0, the second at position 1, etc. The last element of an array is at position size - 1.

As you can see, once you have selected an element using array notation, you can manipulate that element as you would any variable. Here is a more complex example:

Array Initialization I
When an array is declared, it is initially 'empty'; it does not contain any values. We can initialise an array as follows:

is called an array-initialization block. When we use an array initialization block, we do not need to specify the size of the array. The following is equivalent:

When have created an array with 5 elements. The first element is 5, the second is 7, etc.

Array Initialization II
Let us look at a small code snippet that prints the number of days per month. OUTPUT Month 1 has 31 days. Month 2 has 28 days. Month 3 has 31 days. Month 4 has 30 days. Month 5 has 31 days. Month 6 has 30 days. Month 7 has 31 days. Month 8 has 31 days. Month 9 has 30 days. Month 10 has 31 days. Month 11 has 30 days. Month 12 has 31 days.

(You may not have seen  before. It is a preprocessor instruction that defines a constant called   and assigns it the value  .)

If you lack faith in your ability to count, we can let the computer give us the size of an array, by using. Just replace with

Variable-length array
A variable-length array, also called variable-sized or runtime-sized, is an array data structure whose length is determined at run time (instead of at compile time). In C99, VLAs (Variable-Length Arrays, as they are called) are a mandatory feature, that then became optional in later standards. Note that the major compilers all allow VLAs.

Assigning Array Values
We can assign values to array members by using array index.

Thus the array  will contain the elements 1, 2, 3, 4, and 5.

Passing Arrays to a Function
Arrays cannot be passed to functions. If an array name is used as an argument in a function call, the address of the first element of the array is passed. The function can access the array through that address.

Suppose we want to write a function that returns the sum of elements of the array.

Note that the array name  is used as an argument to the function. The function is expecting an array because its parameter is defined as. What is actually passed is the address of. The function then can access the array using array notation.

How are arrays stored in memory?
When we declare an array, space is reserved in the memory of the computer for the array. The elements of the array are stored in these memory locations. The important thing about arrays is that array elements are always stored in consecutive memory locations. We can verify this fact by printing the memory addresses of the elements. (Just like every person has a street address, every location in the memory has a memory address, usually a number, by which it can be uniquely identified.) OUTPUT Address of a[0] : ffe2 Address of a[1] : ffe4 Address of a[2] : ffe6 Address of a[3] : ffe8 Address of a[4] : ffea Address of a[5] : ffec Address of a[6] : ffee Address of a[7] : fff0 Address of a[8] : fff2 Address of a[9] : fff4

As we can see from the output, the elements are stored at ffe2, ffe4, ffe6, etc. You might be wondering why the numbers are not consecutive. The reason is very simple. The size of the  data type in C is at least 2 bytes (depending on the implementation). In this example it is 2 bytes wide, so  will be stored at ffe2, ffe3,   will be stored at ffe4, ffe5,   will be stored at ffe6, ffe7 and so on.

If instead we declared an array of s (which usually take around 4 bytes each), we will find   will be stored at ffe2, ffe3, ffe4, ffe5,   will be stored at ffe6, ffe7, ffe8, ffe9 and so on. Note that you may see entirely different numbers that represent the address locations.

As you can see, the elements are consecutive. This concludes the lesson on arrays.

The way arrays are placed in memory is so that the name of the array is actually the address of the lowest element in memory, so that higher elements are accessed by doing addition, as may be intuitive. However, a confusing part of this is that the stack grows downwards. What is meant by this is that the stack pointer (sp/esp/rsp - for accessing 16/32/64 its repectively) points to the top of the stack (often the top of the memory) allocated to the program, unless you use special settings (which you shouldn't), or you are on a special system. When you allocate to the stack, variables are allocated going downwards - so when you push (add) a value (or variable) onto the stack, sp/esp/rsp decreases to be pointing to available unused memory, and when you pop (remove) a value (or variable), esp increases to be pointing to the memory above the variable you popped. When you allocate an array, sp/esp/rsp is decreased by that array's size, and the name for the array is saved as it's offset from the frame of course. This means that, while allocated backwards, because it is allocated all at once, the array is accessed upwards. Note that the reason for the direction of stack growth is dynamic memory: dynamic memory, or heap memory, must grow upwards, as otherwise increases/decreases would have to apply to the start of the chunks of memory. Noting this, having both segments grow towards each other is the only safe way to properly allocate memory to actually maximise availability, otherwise there would be a split, making programs that utilise one more than the average suffer due to lack of available memory.

Note: In terms of actual, physical addresses, things get more complicated due to paging, segments and something called a GDT. However, there are literally 2 things that require knowledge about these things: writing an OS and writing drivers, which is part of writing an OS.

Assignments

 * Previous Lesson: Functions
 * Next Lesson: Pointers
 * Course Home Page

title: C Programming/Arrays


text:
Portal:Game design

Content development
Development of learning resources related to Game Design is taking place at the School of Game Design.

Разработка компьютерных игр

title: Portal:Game design


text:
User:Msh210/English nouns with spaces

These are copies of the pages at User: Connel MacKenzie/English nouns with spaces (or formerly there) but with hyphens instead, generated easily using ed.
 * /Words 1-5000
 * /Words 5001-10000
 * /Words 10001-15000
 * /Words 15001-20000

{{ subst:new en adj attr bot|2= {{subst:PAGENAME}}

See also User:Msh210/hyphenate.js

Connel MacKenzie's page had the following info, which I'm copying here so he can delete it: w # r z s x=0 f s x=$o(^wiki2(x)),n=^(x,"name") i n[" ",n'[":",n'["/",n'["-",n'["'",n?1.l1" ".l." ".l,'$d(^wikix($tr(n," ","-"))),'$d(^wikir($tr(n," ","-"))) s t=^wiki2(x,"text") i t["==English==",t["===Noun===" w:($x+$l(n)>75) ! s z=z+1 w "",n," " i '(z#5000) w # r zz

16,968

title: User:Msh210/English nouns with spaces


text:
Diego Tamayo

Diego Alejandro Tamayo Martínez (born 19 September 1983) is a Colombian former road cyclist.

Major results

 * 2007
 * 6th Clásica Memorial Txuma
 * 7th Overall Vuelta a Navarra

 * 2008
 * 1st Jersey yellow.svg Overall Vuelta a Navarra
 * 1st Stage 5

 * 2009
 * 8th Grand Prix de Plumelec-Morbihan
 * 10th Memorial Marco Pantani

 * 2011
 * 1st Circuit de Wallonie

 * 2012
 * 1st Jersey yellow.svg Overall Vuelta a Toledo

 * 2015
 * 1st Jersey yellow.svg Overall Titan Desert

title: Diego Tamayo