F-35 Lightning II. The partnership that defines innovation in aviation. Clear := False; desc = sqrt(b * b - 4 * a * c); scanf("%d", &n1); scanf("%d", &location); printf("\nEnter the element to be inserted :"); scanf("%d", &element); root1 = (-b + desc) / (2.0 * a); printf("\nEnter the location"); scanf("%d", &location); //Create space at the specified location protected type Runway is for (i = num; i >= location; i--) { entry Assign_Aircraft (ID: Aeroplane_ID); arr[i] = arr[i - 1]; entry Cleared_Runway (ID: Aeroplane_ID); } entry Wait_For_Clear; private Clear: Boolean := True; printf("\nEnter the element end Runway;to be inserted :"); task type Aeroplane (ID: Aeroplane_ID); type Runway_Access is access all Runway; scanf("%d", &element); #include float desc, root1, root2; #include return (0); #include #include if <= arr2[j]) { int (arr1[i] main() { float a, b, c; type Aeroplane_Access is access Aeroplane; float desc, root1, root2; printf("\nEnter the location"); printf("\nEnter int the Values i, j,ofk, a :n1, "); n2; scanf("%d", &location); = (-b + desc) / (2.0 a); root1 printf("\nEnter the Values of a : *"); //Enter the magnitude of the pressure coefficient (iscanf("%f", &a); desc sqrt(b * b - 4 * a * c); printf("\nEnter element to belocation; inserted :");= for = the num; i >= i--) { #include scanf("%d", &element); = arr[i - 1]; printf("\nEnter the Values of b : "); arr[i] with Ada.Text_IO; use Ada.Text_IO; printf("\nEnter theWait_For_Clear location"); entry } scanf("%f", &b); = (-b + desc) / (2.0 * a); scanf("%d", &location); root1 #include procedure Traffic //Create at the specified location space printf("\nEnter the Values of c : is "); int rad; for (i = num; i >= location; i--) { arr[i] = arr[i - 1]; float PI = 3.14, area, ci; scanf("%f", &c); type Aeroplane_ID is range 1..10; } Some elements task type (ID: /* in array Aeroplane 'arr1' are still remaining where as the printf("\nEnter array Aeroplane_ID); 'arr2' is exhaustedradius */ of circle: "); printf("\nEnter the Values if "); (arr1[i] : scanf("%d", &rad); <= arr2[j]) { (idesc = sqrt(b * b - 4of* aa * c); while < n1) { int main() int arr[30], element, num, i, location; int i, j, k, n1, n2; int main() { i < n2; Clear: Boolean := True; #include #include Clear := False; power int rad; return (0); iscanf("%d", < n2; &n1); arr[location - 1] //Displaying v2 = 0; printf(”:Enter the //Print out the result desc = sqrt(b * b - 4 * a * c); scanf("%d", &n1); delay 4.0; num++; root1 = (-b + desc) / (2.0 * a); protected type Runway is end loop; entry Assign_Aircraft (ID: Aeroplane_ID); } entry Cleared_Runway (ID: Aeroplane_ID); end Traffic; float desc, root1, root2; entry Wait_For_Clear; entry Wait_For_Clear private //Merging starts int when i, j,Clear k, n1, is n2; Clear: Boolean := True; return v5; (-b + desc) / //Displaying end Runway; begin v2access = 0; type Runway_Access is all Runway; float PI = 3.14, int i, j, k, n1, n2; { } else arr[i] { = arr2[j]; arr[i // scanf("%d", &n1); return (0); arr[i //Displaying { return (0); return (0); } delay 4.0; null; } end; scanf("%d", &n1); + end desc) Traffic; / (2.0 * a); end Runway; desc = sqrt(b * b 4 * aloop; * c); end root2 =if (arr1[i] int arr1[ #include arr2[j]; root1 = (-b + desc) / (2.0 * a); int main() printf("\nEnter the of a : "); #include root2 = (-b - desc) / (2.0 * Values a); printf("\nEnter the Values of a : "); return (0); arr[location 1] while (i < n1 && j < n2) { printf("\nEnter the Values of b : "); descRunway_Access) = sqrt(b *is b of- b4: *");a * c); printf("\nEnter the Values printf("\nFirst Root : %f", root1); task type Controller (My_Runway: root1 = (-b root2 = (-b - desc) / (2.0 * a); root2 *= b(-b / (2.0 * a); desc = sqrt(b - 4-:*desc) a * c); Clear: Boolean := True; printf("\nFirst Root %f", root1); printf("\nSecond Root : %f", root2);Clear := False; delay 4.0; root1 = (-b + desc) / (2.0 * a); res[k] = arr1[i]; end loop; return (0); protected type Runway is i++; use Ada.Text_IO; protected type Runway is entry Assign_Aircraft (ID: Aeroplane_ID); area = PI with * radAda.Text_IO; * rad; end Traffic; k++; entry Assign_Aircraft (ID: Aeroplane_ID); entry Cleared_Runway (ID: Aeroplane_ID); } entry Cleared_Runway (ID: Aeroplane_ID); printf("\nArea of circle : %f ", area); printf("\nEnter the element to be inserted :"); entry Wait_For_Clear; entry Wait_For_Clear; procedure Traffic is private/* Some elements in array 'arr2' are still remaining where as the array 'arr1' is exhausted */ scanf("%d", &element); private Clear: Boolean := True; Clear: Boolean := True; ci = 2 * PI * rad; end Runway; printf("\nEnter the location"); end Runway; task Aeroplane Aeroplane_ID); desc = type sqrt(b * b - 4 (ID: * a *is c); type Runway_Access is access all Runway; &location); printf("\nCircumference /*: Some %f elements ", ci); in array 'arr1' are still remaining as the array 'arr2'all exhausted */ typewhere Runway_Access isscanf("%d", access Runway; type Aeroplane_Access is access Aeroplane; Clear := False; //Create space at the specified location for (i = num; i >= location; i--) { return (0); arr[i] = arr[i - 1]; } } type Aeroplane_Access is access Aeroplane; #include Clear := False; (arr1[i] printf("\nEnter radius ofifcircle: ");<= arr2[j]) { scanf("%f", &b); float desc, root1, root2; scanf("%f", &b); printf("\nSecond Root : %f", root2); entry Request_Takeoff (ID: in Aeroplane_ID; Takeoff: out Runway_Access); printf("\nEnter the Values of c : printf("\nEnter "); task type Aeroplane Aeroplane_ID); printf("\nEnter the "); Values of (ID: c : "); radius of circle: float a, b, c; entry Request_Approach(ID: in Aeroplane_ID; Approach: out Runway_Access); res[k] = arr2[j]; res[k] = arr1[i]; is access Aeroplane; returnController (0); task type Runway_Access) is * b type desc = sqrt(b - 4 *Aeroplane_Access a * c); float desc, (My_Runway: root1, root2; end Controller; //Print out the result of insertion Runway1 Runway; printf("\nEnter element to :bealiased inserted } area = PI * rad * rad; num, i, location; the (ID: i++; entry Request_Takeoff in Aeroplane_ID; Takeoff: :"); out Runway_Access); int arr[30], element, Controller1: Controller (Runway1'Access); (arr1[i] <= arr2[j]) { desc = Controller sqrt(b * b - 4 *Runway_Access) a the * c); printf("\nEnter Values of a : "); task type (My_Runway: is int i, j, k, n1, n2; return entry Request_Approach(ID: in Aeroplane_ID; Approach: out Runway_Access); starts(0); #include k++; protected body Runway is scanf("%f", i//Merging < n2; int main() Request_Takeoff (ID: in &a); Aeroplane_ID; Takeoff: &rad); #include v2 = 0; printf("\nEnter the entry element to beprintf("\nEnter inserted the Values of a : "); int#include main() { (ID: Aeroplane_ID) thesqrt(b Values Approach: of b*: "); end Controller; desc =:"); bout -Runway_Access); a printf("\nEnter * scanf("%d", c); entry Request_Approach(ID: in Aeroplane_ID; out Runway_Access); location; i--)entry { Assign_Aircraft int main() New_aeroplane: Aeroplane_Access; scanf("%d", &n1); {4 *pressure =(My_Runway: (-b +Runway_Access) desc) / (2.0 scanf("%f", &a); when Clearintismain() { root1 scanf("%f", &b); * a); } else the task type Controller is #include scanf("%d", &n1); scanf("%d", &element); end Controller; printf("\Provide distribution :"); float a, b, c; //Merging starts i < n2; int arr1[30], arr2[30], res[60]; entry Request_Takeoff (ID: in Aeroplane_ID; Takeoff: out Runway_Access); printf("\nEnter the Values of b : "); begin (i arr[location 1] i#include < - n2; begini >= location; printf("\nEnter the Values of c : "); int rad; for =ci;num; i--) { floatentry desc,Request_Approach(ID: root1, root2; #include i < n2; num++; in Aeroplane_ID; Approach: out Runway_Access); res[k] = arr2[j]; I in Aeroplane_ID'Range loop } =for float PI 3.14, area, for (iis= num; i >= location; i--) { //Merging starts Clear := False; :"); scanf("%f", area printf("\nEnter the element to = num; be iinserted >= location; i--) for int i, j,{ scanf("%d", k, n1, end(i Controller; task&c); type n2; Controller &element); Runway_Access) := new* Aeroplane (I); #include =Aeroplane_ID'Range PI{New_aeroplane *4.0; rad rad; #include =Request_Takeoff (-b + (My_Runway: desc) / (i(2.0 *Takeoff: a); the location"); Values of a : (ID) "); printf("\nEnter the element to printf("\nEnter be inserted :"); printf("\nEnter Put_Line (Aeroplane_ID'Image & " root1 on runway ") delay return v5; the printf("\nEnter the Values of out a : "); for Iint in main() printf("\nEnter radius ofloop circle: "); for = num; i >= location; i--) { entry (ID: in Aeroplane_ID; arr2[j]) { k++; scanf("%f",Runway_Access) &a);Runway1 of */ &element); int Controller arr[30], element, num,(My_Runway: i, location; task type is :"); Runway; printf("\nEnter the element to be Runway_Access); inserted :"); scanf("%d", end&rad); loop; New_aeroplane := new Aeroplane (I); scanf("%d", scanf("%d",v2 &n1); aliased = sqrt(b * b Request_Approach(ID: - 4 * * c); * /* Some elements in 'arr1' are still remaining printf("\nEnter where the array 'arr2' the is exhausted as printf("\nEnter the Values Values of b : a ");:desc array entry Approach: outRunway_Access) Runway_Access); desc = asqrt(b bin- Aeroplane_ID; 4 task *&element); a c); type* Controller (My_Runway: protected body isRunway is end Traffic; }4.0; scanf("%d", &location); float a, b,= 0;c; delay scanf("%d", main() int scanf("%f", &b);Controller1: printf("\nEnter no of elements in 1st array :"); printf("\nEnter no of elements :"); #include entry Request_Takeoff (ID: in Aeroplane_ID; Takeoff: out Runway_Access); entry Request_Takeoff (ID: in Aeroplane_ID; Takeoff: out Runway_Access); Controller (Runway1'Access); scanf("%f", &a); printf("\nEnter the* location"); end loop; j++; area = PI rad * rad; end Controller; entry Assign_Aircraft (ID: Aeroplane_ID) while (i < n1)0; { scanf("%d", printf("\nEnter the Values of c : "); scanf("%d", &n1); v5int =rad; v4res[k] intof &num); main() entry Request_Approach(ID: in Aeroplane_ID; Approach: out Runway_Access); == scanf("%d", &location); = printf("\nEnter the location"); end Traffic; printf("\nArea circle : %f ", area); (-b&n1); + desc) (2.0 * a); float a,ZwClose(Handle); b, c; printf("\nEnter the Values scanf("%d", of b :root1 "); arr1[i]; when Clear is scanf("%f", &c); ci; float PI area, {=Runway_Access) v2 int = 0; main() entry Request_Approach(ID: in Aeroplane_ID; Approach: out /Runway_Access); end Controller; = 3.14, #include else { { i++; task type(arr1[i] Controller (My_Runway: is if (arr1[i] <= arr2[j]) space &b); root2 = (-b - desc) / (2.0 *}a); printf("\nEnter the location"); begin = for =* { 0; i < num; i++) { scanf("%f", } //Create space the specified location if <= arr2[j]) //Create at the specified location ci 2 at * (i PI rad; k++; in scanf("%d", &location); taskscanf("%d", type Controller &location); (My_Runway: Runway_Access) is entry Request_Takeoff (ID: Aeroplane_ID; Runway_Access); desc = sqrt(b * b - 4 * a * c); scanf("%d", &arr[i]); printf("\nEnter radius ofi circle: "); out float a, scanf("%d", &n1); end Controller; #include Clear := False; forb, (i num; >= Takeoff: location; i--) = c; printf("\nCircumference : {%f ", ci); printf("\nEnter the Values for of c :(i ");= 0; i < n1; i++) { - 1] protected type Runway is } n1, Clear := False; entry Request_Takeoff (ID: in Aeroplane_ID; Takeoff: out Runway_Access); int i, n2; entry j, Request_Approach(ID: in Aeroplane_ID; Approach: Runway_Access); num; the element to be inserted i :");>= location; i--) {arr[location } printf("\nEnter k, scanf("%d", &rad); return(ID: v5; Aeroplane_ID); arr[i] = arr[i 1]; outfor (i = entry Assign_Aircraft } i < n2; }Aeroplane else { root1, out Runway_Access); printf("\nFirst Root : %f", root1);entry Request_Approach(ID: in Aeroplane_ID; Approach: &c); root1 = (-b + desc) / (2.0 * a); scanf("%d", &element); scanf("%f", scanf("%d", &arr1[i]); Aeroplane_ID); task type float desc, root2; } }(ID: Put_Line (Aeroplane_ID'Image (ID) & " on runway "); //Displaying return (0); /* =Some in 'arr2' are the still remaining where as the =array is exhausted end //Create Controller; space at the specified location = root2 (-b -'arr1' desc) / (2.0 * a); */ array printf("\nEnter element to be area PI *elements rad *} rad; desc = sqrt(b * b} - 4 * a * c); #include printf("\nSecond Root : %f", root2); arr[i] arr[i - 1]; task type Aeroplane (ID: Aeroplane_ID); : printf("\nEnter the location"); int }c); scanf("%d", &element); type return Aeroplane_Access is access Aeroplane; printf("\nArea of circle %f ", area); v5; for (i = num; i >= location; i--)end; { i,* Controller k, n2; arr[location - 1] delaytask4.0; Runway_Access) desc = printf("\nFirst sqrt(b b j, - 4: *%f", a root1); * n1, type Aeroplane_Access is access //Enter the magnitude of the pressure coefficient type Aeroplane task type (My_Runway: is Root &location); scanf("%d", root1 (ID: = (-b + desc) / (2.0int * a); main() } Aeroplane; &arr[i]); #include res[k] = arr2[j]; int main() arr[i] = arr[i - 1]; { Aeroplane_ID); type Aeroplane_Access access entry Request_Takeoff in Aeroplane_ID; Takeoff: out Runway_Access); printf("\nSecond Root : %f", (ID: root2); the Values printf("\nEnter the location"); ci/Aeroplane; =(2.0 2 * * PIa); * rad; of a : "); } = task type Aeroplane (ID: Aeroplane_ID); return (0); printf("\nEnter the Values of a : "); root2 (-bis- printf("\nEnter desc) end loop; protected type Runway is return (0); printf("\nEnter the element to printf("\nCircumference be inserted :"); res[k] entry Wait_For_Clear entry Request_Approach(ID: in Aeroplane_ID; Approach: out Runway_Access); //Create space at the specified location arr2[j]; : %f ", = ci); type ci Aeroplane_Access = 2 * PI * rad;is access Aeroplane; printf("\nEnter the element to be inserted :"); float desc, root1, root2; for (i = num; i} >= location; {iis < n2; } Aeroplane_ID); scanf("%f", i--) &a); scanf("%d", &element); when Clear float desc, root1, root2; Assign_Aircraft end (0); {entry return for (i = num; i >= location; i--) (ID: Root scanf("%f", #include printf("\nFirst : %f", root1); &a); Traffic; printf("\nCircumference : %f ", ci); root1 = (-b + desc) / (2.0 * a); if (arr1[i] <= arr2[j]) {Controller; end scanf("%d", &element); } entry arr[i] = arr[itask - 1]; type Aeroplane (ID: Aeroplane_ID); Root return (0); printf("\nEnter thebegin Values of b : "); #include //Merging starts int i, j, k, n1, n2; desc, root1, root2; while (i < n1) { float printf("\nSecond : %f", root2); Cleared_Runway (ID: Aeroplane_ID); end Controller; printf("\nEnter the location"); null; } type Aeroplane_Access is access Aeroplane; printf("\nEnter no of elements in 2nd array :"); arr[i] = arr[i 1]; } printf("\nEnter the Values of b : "); desc = sqrt(b * b 4 * a * c); //Enter the //Print magnitude the result the insertion coefficient task type Controller (My_Runway: Runway_Access) is scanf("%d", &location); end; entry Wait_For_Clear; int rad; res[k] = arr2[j]; desc = sqrt(b *out b#include -of 4#include * a pressure *of c); int(ID: arr1[30] = arr2[j]; entry Request_Takeoff in Aeroplane_ID; Takeoff: out Runway_Access); res[k] = arr1[i]; res[k] arr[i]); end Runway; with Ada.Text_IO; use Ada.Text_IO; //Print out the result // Merging starts scanf("%d", &n2); scanf("%f", &b); root1 = (-b + desc) / (2.0 * a); #include private entry Request_Approach(ID: in Aeroplane_ID; out Runway_Access); Approach: //Merging starts printf("\nEnter the element inserted :"); //Merging starts printf("\nCircumference : %f ", ci);to=be arr2[j]; end Traffic Controller; Clear: Boolean := True; procedure is power #include #include } else { i++; //Create space at the specified location res[k] scanf("%d", &element); arr[location printf("\nEnter 1] the element to be inserted :"); float a, b, c; end Runway; Root %f", root1); protected Runway for (i Aeroplane_ID i#include >= location; i--) #include { printf("\nFirst scanf("%d", &element); type is range 1..10; arr[i]); printf("\nEnter the Values of a : body "); : (-b + is desc) / (2.0 * a); (i == num; num; type Runway_Access is access all Runway; entry Assign_Aircraft (ID: Aeroplane_ID) #include //Merging starts for (ik++; = num; i >= location; i--) { int main() printf("\nEnter the location"); < n2; protected type Runway isi #include {area = PI * rad when Clear is * rad; #include entry Assign_Aircraft (ID: Aeroplane_ID); scanf("%d", &location); #include } float desc, root1, root2; begin return (0); entry =Cleared_Runway (ID: /Aeroplane_ID); * root1 (-b + desc) (2.0 * a); root1 = (-b + desc) / :=(2.0 a); entry Wait_For_Clear; Clear False; root2 = (-b desc) / (2.0 * a); private Aeroplane //Create space(ID: at theAeroplane_ID); specified location task type Put_Line (Aeroplane_ID'Image (ID) Clear: Boolean := True; & " on runway "); float desc, root1, for (i root2; = num; i >= location; i--) {Aeroplane; end Runway; type Aeroplane_Access access end; is printf("\nFirst Root all : %f", type Runway_Access is access Runway;root1); desc = sqrt(b * b - 4 * a * c); root1 = (-b + desc) / (2.0 * a); desc = sqrt(b * b - 4 * a * c); root1 = (-b + desc) / (2.0 * a); root2 = (-b - desc) / (2.0 * a); desc = sqrt(b * b - 4 * a * c); root1 = (-b + desc) / (2.0 * a); printf("\nEnter thebegin element to be inserted :"); scanf("%d", &element);for I in Aeroplane_ID'Range loop New_aeroplane := new Aeroplane (I); delay 4.0; printf("\nEnter the location"); end loop; scanf("%d", &location); end Traffic; //Create space at the specified location for (i = num; i >= location; i--) { arr[i] = arr[i - 1]; } printf("\nEnter the element to be inserted :"); scanf("%d", &element); printf("\nEnter the location"); scanf("%d", &location); task type Aeroplane (ID: Aeroplane_ID); Aeroplane; type Aeroplane_Access is access //Create space at the specified location for (i = num; i >= location; i--) { arr[i] = arr[i - 1]; } protected type Runway is entry Assign_Aircraft (ID: Aeroplane_ID); entry Cleared_Runway (ID: Aeroplane_ID); entry Wait_For_Clear; private Clear: Boolean := True; end Runway; type Runway_Access is access all Runway; root1 = (-b + desc) / (2.0 * a); root2 = (-b - desc) / (2.0 * a); printf("\nFirst Root : %f", root1); printf("\nSecond Root : %f", root2); task type Controller (My_Runway: Runway_Access) is entry Request_Takeoff (ID: in Aeroplane_ID; Takeoff: out Runway_Access); entry Request_Approach(ID: in Aeroplane_ID; Approach: out Runway_Access); end Controller; desc = sqrt(b * b - 4 * a * c); root1 = (-b + desc) / (2.0 * a); task type Aeroplane (ID: Aeroplane_ID); type Aeroplane_Access is access Aeroplane; desc = sqrt(b * b - 4 * a * c); root1 = (-b + desc) / (2.0 * a); arr[i] = arr[i - 1]; int arr1[30], arr2[30], res[60]; num++; printf("\nEnter the element to be inserted :"); int arr[30], element, num, i, location; printf("\nSecond Root : %f", root2); scanf("%d", &element); } printf("\nEnter the element to be inserted :"); printf("\nEnter the location"); scanf("%d", &element); scanf("%d", &location); desc = sqrt(b * b - 4 * a * c); //Create space at the specified location #include for location"); I in Aeroplane_ID'Range loop for (i = num; i >= location; i--) { printf("\nEnter the arr[i] = arr[i - 1]; New_aeroplane := new Aeroplane (I); &location); a scanf("%d", * c); } desc = sqrt(b * b - 4 * int main() { delay 4.0; area = PI * rad * rad; desc = sqrt(b *int b arr1[30], - 4 space * aarr2[30], * the c); res[60]; location v2 = 0; loop; atend specified task type Aeroplane//Create (ID: Aeroplane_ID); #include k, n1, n2; end Traffic; int fori, (ij, = num; i >= location; i--) { type Aeroplane_Access is access Aeroplane; ZwClose(Handle); arr[i] = arr[i - 1]; for I in Aeroplane_ID'Range loop no of elements in 1st array :"); printf("\nEnter } New_aeroplane } := new Aeroplane (I); scanf("%d", &n1); delay 4.0; for (i = 0; i < n1; i++) { end loop; begin return v5; scanf("%d", &arr1[i]); for I in Aeroplane_ID'Range loop end Traffic; New_aeroplane := new Aeroplane (I); } printf("\nEnter the } Values of a : "); desc = sqrt(b * b - 4 * a * c); scanf("%d", &rad); for (i = num; i >= location; i--) { BAE Systems is a tier one partner to the global F-35 programme if (arr1[i] <= arr2[j]) { desc = sqrt(b * b - 4 * a * c); root1 = (-b + desc) / (2.0 * a); area = PI * rad * rad; printf("\nEnter the Values of a : "); float desc, root1, root2; scanf("%f", &a); scanf("%f", &a); printf("\nEnter the Values of b : "); Clear := False; Merging starts printf("\nEnter// the Values of b : "); while (i < n1 && j < n2) { int main() { if (arr1[i] <= arr[location 1]{ arr2[j]) num++; else//Merging { arr2[j]) int main() New_aeroplane: Aeroplane_Access; starts baesystems.com BAEBAEGEN16024K011_BAE_RAF_News_Print_F-v2.indd 1 24/06/2016 11:01