Madeley High School

Madeley High School, established 1957, is a coeducational secondary school with academy status, located in the village of Madeley, Staffordshire, England. The school was founded as a secondary modern school. It became a Comprehensive high school and then a Specialist Technology College with joint second specialisms in Arts and Cognition and Learning, before converting to academy status in September 2013.

Madeley High School
Address
Newcastle Road

Madeley
,
Staffordshire
,
CW3 9JJ

England
Information
TypeAcademy
Religious affiliation(s)Mixed
Established1957 (1957)
Department for Education URN140154 Tables
OfstedReports
Head teacherL. Nixon
GenderCoeducational
Age11 to 16
Enrolment647[1]
HousesEarth, Fire, Space, Air
Websitehttp://www.madeleyhigh.org/

Madeley High School caters to children in the 11-16 age group. It serves mainly the area lying to the west of Newcastle Under Lyme including the communities of Keele, Madeley, Betley, Baldwins Gate, Maer, Aston, Mucklestone, Ashley, Ashley Heath, Knighton, Whitmore, Wrinehill, Almington, Hanchurch, Onneley and Loggerheads and Westlands. Many students also apply from outside this area, due to the school's good reputation.

In 2013 the school roll was 647 pupils.[1]

Notable former pupils
gollark: The rest of the instruction consists of variable-width (for fun) target specifiers. The first N target specifiers in an operation are used as destinations and the remaining ones as sources. N varies per opcode. They can be of the form `000DDD` (pop/push from/to stack index DDD), `001EEE` (peek stack index EEE if source, if destination then push onto EEE if it is empty), `010FFFFFFFF` (8-bit immediate value FFFFFFFF; writes are discarded), `011GGGGGGGGGGGGGGGG` (16-bit immediate value GGGGGGGGGGGGGGGG; writes are also discarded), `100[H 31 times]` (31-bit immediate because bee you), `101IIIIIIIIIIIIIIII` (16 bits of memory location relative to the base memory address register of the stack the operation is conditional on), `110JJJJJJJJJJJJJJJJ` (16 bit memory location relative to the top value on that stack instead), `1111LLLMMM` (memory address equal to base memory address of stack LLL plus top of stack MMM), or `1110NNN` (base memory address register of stack MMM).Opcodes (numbered from 0 in order): MOV (1 source, as many destinations as can be parsed validly; the value is copied to all of them), ADD (1 destination, multiple sources), JMP (1 source), NOT (same as MOV), WR (write to output port; multiple sources, first is port number), RE (read from input port; one source for port number, multiple destinations), SUB, AND, OR, XOR, SHR, SHL (bitwise operations), MUL, ROR, ROL, NOP, MUL2 (multiplication with two outputs).
gollark: osmarksISA™️-2028 is a VLIW stack machine. Specifically, it executes a 384-bit instruction composed of 8 48-bit operations in parallel. There are 8 stacks, for safety. Each stack also has an associated base memory address register, which is used in some "addressing modes". Each stack holds 64-bit integers; popping/peeking an empty stack simply returns 0, and the stacks can hold at most 32 items. Exceeding a stack's capacity is runtime undefined behaviour. The operation encoding is: `AABBBCCCCCCCCC`:A = 2-bit conditional operation mode - 0 is "run unconditionally", 1 is "run if top value on stack is 0", 2 is "run if not 0", 3 is "run if first bit is ~~negative~~ 1".B = 3-bit index for the stack to use for the conditional.C = 9-bit opcode (for extensibility).
gollark: By "really fast", I mean "in a few decaminutes, probably".
gollark: I suppose I could just specify it really fast.
gollark: I could, but do I really want to?

References
  1. "Inspection report: Madeley High School" (pdf). Ofsted. 7 February 2013.
  2. "Former college student up for Oscar for work on Inception". This is Staffordshire. 4 February 2011. Archived from the original on 1 October 2012.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.