Answer:
Just two outputs \n a line break so:
Hello
Girls
Suppose now there are 80 pairs of flows, with ten flows between the first and ninth rack, ten flows between the second and tenth rack, and so on. Further suppose that all links in the network are 10 Gbps, except for the links between hosts and TOR switches, which are 1 Gbps.
Required:
a. Each flow has the same data rate; determine the maximum rate of a flow.
b. For the same traffic pattern, determine the maximum rate of a flow for the highly interconnected topology.
c. Now suppose there is a similar traffic pattern, but involving 20 hosts on each rack and 160 pairs of flows. Determine the maximum flow rates for the two topologies.
Answer:
Explanation:
Given that:
The no of flow pairs = 80
Each link's capacity = 10 Gbps
Link capacity amongst TOR switches and hosts = 1 Gbps
Because each connection is distributed among all flows, each flow crossing the same link distributes the link's capacity with the other flows. The connection capacity needed by each flow in the network is determined by the highest flow rate.
Maximum rate flow = [tex]\dfrac{link's \ capacity}{no \ of \ flow \ pairs}[/tex]
[tex]= \dfrac{10 \ Gbps}{80}[/tex]
Since 1 Gbps = 1000 Mbps
[tex]= \dfrac{10000}{80}[/tex]
= 125 Mbps
Hence, maximum rate flow = 125 Mbps
b.
Each switch at Tier-1 is connected to each and every switch at Tier-2 in the highly integrated structural topology. As a result, there are n-disjoint routes between tier-2 and tier-1 switches.
Number of paths between tier-1 and tier-2 is 4, thus, there exist four paths from tier-1 switch to tier 2.
The capacity whereby all data routes convey is determined by the maximum rate of flow.
number of available paths = 4
Each link's capacity = 10 Gbps
Maximum flow rate = 4 × 10 Gbps
Maximum flow rate = 40 Gbps
c.
Because each connection is distributed between all flows, each flow crossing a similar link distributes the link's capacity with other flows.
number of flow pairs = 160
Each link's capacity = 10 Gbps
maximum rate of flow = 10000 Mbps / 160
= 62.5 Mbps
For 160 flow pairs, maximum flow rate = 62.5 Mbps
Each switch in Tier-1 communicates with each switch in Tier-2 in the highly linked topology network. As a result, n-disjoint routes between tier-2 and tier-1 switches are possible. As there exist 20 hosts engaged in the network around each host, the number of routes from either a tier-1 switch or tier-2 switches is 20.
here;
no of paths = 20
each link's capacity = 10 Gbps
Maximum flow rate = 20 × 10
= 200 Gbps
As such, with 160 pairs of flow, maximum flow rate = 200 Gbps
In this project you will write a set of instructions (algorithm). The two grids below have colored boxes in different
locations. You will create instructions to move the colored boxes in grid one to their final location in grid two. Use the
example to help you. The algorithm that you will write should be in everyday language
(no pseudocode or programming language). Write your instructions at the bottom of the
page.
Example: 1. Move
the orange box 2
spaces to the right.
2. Move the green
box one space
down. 3. Move the
green box two
spaces to the left.
Write your instructions. Review the rubric to check your final work.
Rules: All 6 colors (red, green, yellow, pink, blue, purple) must be move to their new location on the grid. Block spaces are
barriers. You cannot move through them or on them – you must move around them
Answer:
Explanation:
Pink: Down 5 then left 2.
Yellow: Left 3 and down 2.
Green: Right 7, down 4 and left 1.
Purple: Up 6 and left 9.
Red: Left 7, down 5 and left 1.
You can do the last one, blue :)
Answer:
Explanation:
u=up, d=down, r=right, l=left
yellow: l3d2
pink: d5l2
green: r7d4l1
purple: u6l9
red: l7d5l1
blue: r2u7l5
Use ordinary pipes to implement an inter-process communication scheme for message passing between processes. Assume that there are two directories, d1 and d2, and there are different files in each one of them. Also, each file contains a short-length string of characters. You have to use a parent process that forks two children processes, and have each child process check one of the directories.
Answer:
Yup
Explanation:
Unchecked exceptions require you surround the code that might throw such an exception with a try block or you must use a throws statement at the end of the method signature. Failure to do one of these two things will result in a compile error.
a. True
b. False
Answer:
b. False
Explanation:
False, unchecked exceptions do not cause compilation errors and do not require try/catch blocks or throws statements. However, although they are not required it is good programming to include them in order to handle any exceptions that may arise. If you do not include a proper way to handle such an exception the program will still run but may run into an exception during runtime. If this occurs then the entire program will crash because it does not know how to handle the exception since you did not provide instructions for such a scenario.
this can provide illusion of fast movement it is often used in videos to censor information for security or density
Answer:
Blurring can provide the optical illusion of a fast movement. It is often used in videos to hide sensitive or age-inappropriate information, the protection of identities (hence security) or just to provide decency.
Explanation:
Mostly used during animated videos where unlike (real videos) the blur does not occur naturally, the blur is used to make speed believable. Speed invigorates, and highlights intensity. Blurring still images can help to make more realistics motions of speed. An example where lots of blurring is used as prostproduction effects is in Flash.
Cheers
Develop an algorithm and write a C++ program that finds the number of occurrences of a specified character in the string; make sure you take CString as input and return number of occurrences using call by reference. For example, Write a test program that reads a string and a character and displays the number of occurrences of the character in the string. Here is a sample run of the program:______.
Answer:
The algorithm is as follows:
1. Input sentence
2. Input character
3. Length = len(sentence)
4. count = 0
5. For i = 0 to Length-1
5.1 If sentence[i] == character
5.1.1 count++
6. Print count
7. Stop
The program in C++ is as follows:
#include <iostream>
#include <string.h>
using namespace std;
int main(){
char str[100]; char chr;
cin.getline(str, 100);
cin>>chr;
int count = 0;
for (int i=0;i<strlen(str);i++){
if (str[i] == chr){
count++;} }
cout << count;
return 0;}
Explanation:
I will provide explanation for the c++ program. The explanation can also be extended to the algorithm
This declares the string and the character
char str[100]; char chr;
This gets input for the string variable
cin.getline(str, 100);
This gets input for the character variable
cin>>chr;
This initializes count to 0
int count = 0;
This iterates through the characters of the string
for (int i=0;i<strlen(str);i++){
If the current character equals the search character, count is incremented by 1
if (str[i] == chr){ count++;} }
This prints the count
cout << count;
Write 'T' for true and 'F' for false statements.
1. The CPU is a piece of external hardware.
2. Keyboards can be connected to a computer using USB port.
3. Monitors are connected via the PS/2 port.
4. A computer can function without a CD drive.
5. Printer is an input device.
6. The read write data in magnetic disks.
7. Pen drives are connected to a computer via the USB interface.
NO LINKS
Write a function addingAllTheWeirdStuff which adds the sum of all the odd numbers in array2 to each element under 10 in array1. Similarly, addingAllTheWeirdStuff should also add the sum of all the even numbers in array2 to those elements over 10 in array1.
Answer:
The function is as follows:
def addingAllTheWeirdStuff(array1,array2):
sumOdd = 0
for i in array2:
if i % 2 == 1:
sumOdd+=i
for i in array1:
if i < 10:
sumOdd+=i
print("Sum:",sumOdd)
sumEven = 0
for i in array1:
if i % 2 == 0:
sumEven+=i
for i in array2:
if i > 10:
sumEven+=i
print("Sum:",sumEven)
Explanation:
This declares the function
def addingAllTheWeirdStuff(array1,array2):
This initializes the sum of odd numbers in array 2 to 0
sumOdd = 0
This iterates through array 2
for i in array2:
This adds up all odd numbers in it
if i % 2 == 1:
sumOdd+=i
This iterates through array 1
for i in array1:
This adds up all elements less than 10 to sumOdd
if i < 10:
sumOdd+=i
This prints the calculated sum
print("Sum:",sumOdd)
This initializes the sum of even numbers in array 1 to 0
sumEven = 0
This iterates through array 1
for i in array1:
This adds up all even numbers in it
if i % 2 == 0:
sumEven+=i
This iterates through array 2
for i in array2:
This adds up all elements greater than 10 to sumEven
if i > 10:
sumEven+=i
This prints the calculated sum
print("Sum:",sumEven)
Given two regular expressions r1 and r2, construct a decision procedure to determine whether the language of r1 is contained in the language r2; that is, the language of r1 is a subset of the language of r2.
Answer:
Test if L(M1-2) is empty.
Construct FA M2-1 from M1 and M2 which recognizes the language L(>M2) - L(>M1).
COMMENT: note we use the algorithm that is instrumental in proving that regular languages are closed with respect to the set difference operator.
Test if L(M2-1) is empty.
Answer yes if and only if both answers were yes.
Explanation:
An algorithm must be guaranteed to halt after a finite number of steps.
Each step of the algorithm must be well specified (deterministic rather than non-deterministic).
Three basic problems:
Given an FA M and an input x, does M accept x?
Is x in L(M)
Given an FA M, is there a string that it accepts?
Is L(M) the empty set?
Given an FA M, is L(M) finite?
Algorithm for determining if M accepts x.
Simply execute M on x.
Output yes if we end up at an accepting state.
This algorithm clearly halts after a finite number of steps, and it is well specified.
This algorithm is also clearly correct.
Testing if L(M) is empty.
Incorrect "Algorithm"
Simulate M on all strings x.
Output yes if and only if all strings are rejected.
The "algorithm" is well specified, and it is also clearly correct.
However, this is not an algorithm because there are an infinite number of strings to simulate M on, and thus it is not guaranteed to halt in a finite amount of time.
COMMENT: Note we use the algorithm for the first problem as a subroutine; you must think in this fashion to solve the problems we will ask.
Correct Algorithm
Simulate M on all strings of length between 0 and n-1 where M has n states.
Output no if and only if all strings are rejected.
Otherwise output yes.
This algorithm clearly halts after a finite number of steps, and it is well specified.
The correctness of the algorithm follows from the fact that if M accepts any strings, it must accept one of length at most n-1.
Suppose this is not true; that is, L(M) is not empty but the shortest string accepted by M has a length of at least n.
Let x be the shortest string accepted by M where |x| > n-1.
Using the Pumping Lemma, we know that there must be a "loop" in x which can be pumped 0 times to create a shorter string in L.
This is a contradiction and the result follows.
COMMENT: There are more efficient algorithms, but we won't get into that.
Testing if L(M) is finite
Incorrect "Algorithm"
Simulate M on all strings x.
Output yes if and only if there are a finite number of yes answers.
This "algorithm" is well specified and correct.
However, this is not an algorithm because there are an infinite number of strings to simulate M on, and thus it is not guaranteed to halt in a finite amount of time.
COMMENT: Note we again use the algorithm for the first problem as a subroutine.
Correct Algorithm
Simulate M on all strings of length between n and 2n-1 where M has n states.
Output yes if and only if no string is accepted.
Otherwise output no.
This algorithm clearly halts after a finite number of steps, and it is well specified.
The correctness of the algorithm follows from the fact that if M accepts an infinite number of strings, it must accept one of length between n and 2n-1.
This builds on the idea that if M accepts an infinite number of strings, there must be a "loop" that can be pumped.
This loop must have length at most n.
When we pump it 0 times, we have a string of length less than n.
When we pump it once, we increase the length of the string by at most n so we cannot exceed 2n-1. The problem is we might not exceed n-1 yet.
The key is we can keep pumping it and at some point, its length must exceed n-1, and in the step it does, it cannot jump past 2n-1 since the size of the loop is at most n.
This proof is not totally correct, but it captures the key idea.
COMMENT: There again are more efficient algorithms, but we won't get into that.
Other problems we can solve using these basic algorithms (and other algorithms we've seen earlier this chapter) as subroutines.
COMMENT: many of these algorithms depend on your understanding of basic set operations such as set complement, set difference, set union, etc.
Given a regular expression r, is Lr finite?
Convert r to an equivalent FA M.
COMMENT: note we use the two algorithms for converting a regular expression to an NFA and then an NFA to an FA.
Test if L(M) is finite.
Output the answer to the above test.
Given two FAs M1 and M2, is L(M1) = L(M2)?
Construct FA M1-2 from M1 and M2 which recognizes the language L(>M1) - L(>M2).
COMMENT: note we use the algorithm that is instrumental in proving that regular languages are closed with respect to the set difference operator.
Test if L(M1-2) is empty.
Construct FA M2-1 from M1 and M2 which recognizes the language L(>M2) - L(>M1).
COMMENT: note we use the algorithm that is instrumental in proving that regular languages are closed with respect to the set difference operator.
Test if L(M2-1) is empty.
Answer yes if and only if both answers were yes.
Given the following tree, use the hill climbing procedure to climb up the tree. Use your suggested solutions to problems if encountered. K is the goal state and numbers written on each node is the estimate of remaining distance to the goal.
what is the meaning of antimonographycationalis
Answer:
Although this word was made up in order to be a contender for the longest word in English, it can be broken down into smaller chunks in order to understand it.
Anti- means that you are against something; monopoly means the exclusive control over something; geographic is related to geography; and the remaining part has to do with nationalism.
So this word means something like 'a nationalistic feeling of being against geographic monopoly,' but you can see that it doesn't have much sense.
(answer copied from Kalahira just to save time)
Design a function int maxDigit (int num) to find and return the greatest digit from the arguments value num.
Also write a function void result() by passing parameters to print the greatest digit.
please tell in java programming
Answer:
Below is the required JAVA Code:
Explanation:
public static int largestDigit(int n) {
if (n < 0) {
return largestDigit(-1 * n);
} else if (n == 0) {
return 0;
} else {
int digit = n % 10;
int maxDigit = largestDigit(n / 10);
if (digit > maxDigit)
maxDigit = digit;
return maxDigit;
}
}
\color{red}Method\;tested\;in\;a\;complete\;java\;program\;if\;you\;are\;interested.
public class LargestDigitRecursive {
public static int largestDigit(int n) {
if (n < 0) {
return largestDigit(-1 * n);
} else if (n == 0) {
return 0;
} else {
int digit = n % 10;
int maxDigit = largestDigit(n / 10);
if (digit > maxDigit)
maxDigit = digit;
return maxDigit;
}
}
public static void main(String[] args) {
System.out.println(largestDigit(14263203));
System.out.println(largestDigit(845));
System.out.println(largestDigit(52649));
System.out.println(largestDigit(3));
System.out.println(largestDigit(0));
System.out.println(largestDigit(-573026));
System.out.println(largestDigit(-2));
}
}
OUTPUT:
6
8
9
3
0
7
2
Assume the variable sales references a float value. Write a statement that displays the value rounded to two decimal points.Assume the following statement has been executed:
number = 1234567.456
Write a Python statement that displays the value referenced by the number variable formatted as
1,234,567.5
Answer:
The statement is as follows:
print("{0:,.1f}".format(number))
Explanation:
Required
Statement to print 1234567.456 as 1,234,567.5
To do this, we make use of the format keyword, and we set the print format in the process.
To round up number to 1 decimal place, we use the following format:
"{0:,.1f}"
To include comma in the thousand place, we simply include a comma sign before the number of decimal place of the output; i.e. before 1
"{0:,.1f}"
So, the print statement is:
print("{0:,.1f}".format(number))
IT specialists must display technical expertise and collaborative proficiency in the workplace. Select the IT specialist who demonstrates a soft skill.
a. Terri uses her Java programming skills to write a key part of the company’s new software.
b. Joyce recruits users to test new software by explaining to them how it will benefit the organization.
c. Chandler evaluates the results of recent user tests of his company's new software.
d. Keith applies a filter to the company’s network that prevents users from accessing social media while they are working.
Answer:
b. Joyce recruits users to test new software by explaining to them how it will benefit the organization.
Explanation:
Skills can be classified as hard or soft. Hard skills include skills such as technical skills that are acquired through technical knowledge and training.
Soft skills on the other hand are skills exhibited as a result of personality traits, character and behaviours such as time management, leadership, communication and organizational skills.
Some hard skills include;
i. Ability to design banners and posters
ii. Proficiency in using programming languages such as Java to build software applications
iii. Evaluating the result of a test or research.
Some soft skills include;
i. Making public speeches that captivate the audience.
ii. Ability to recruit and test capabilities in others.
iii. Leading a team
So, Joyce recruiting users to test new software by explaining to them how it will benefit the organization is a form of soft skill since it consists, at minimum, of leadership and communication skills
16. A 6-cylinder engine has a bore of 4 inches and a stroke of 3.5 inches. What's the total piston displacement?
A. 260
B. 263.76
C. 253.76
D. 250
Answer:
b i just guessed
Explanation:
Suppose you are collecting money for something.
You need # 200 in all. You ask your parents, uncles
and aunts as well as grandparents. Different people
may give either ` 10, ` 20 or even ` 50. You will collect
till the total becomes 200. Write the algorithm.
Answer:
Step 1 : Start
Step 2 : Set target= 0
Step 3 : Use a While loop
Step 4 : input donation
Step 5 : Sum - - > target += donation
Step 6 :, check loop condition
Step 7 : End
Explanation:
Algorithm is a sequence of written instructions or steps which we want the computer to in other to solve a particular problem :
Counter is set at 0
Total amount is initially set to := 0
Using a while loop ;
While target amout is less than 200 ; user inputs the amout to donate and it is added to target amount. This loop continues until target amount is greater than 200. Then the loop terminates.
Write a short essay on the importance of information and communication technology (ICT) in the AFN industry. Add suitable examples to substantiate your answer.
Answer:
computer
Explanation:
is an ICT device that help and makes things or work easy
9- Which type of view is not present in MS
PowerPoint?
(A) Extreme animation
(B) Slide show
(C) Slide sorter
(D) Normal
Answer:
A.Extreme animation
hope it helpss
Which orientation style has more height than width?
Answer:
"Portrait orientation" would be the correct answer.
Explanation:
The vertical picture, communication as well as gadget architecture would be considered as Portrait orientation. A webpage featuring portrait orientation seems to be usually larger than large containing lettering, memo abases as well as numerous types of content publications.One such volume fraction also becomes perfect for impressionism depicting an individual from either the top.Thus the above is the correct answer.
How can we use APC to help with dynamic tracks?
Answer:
We can use APC to help with dynamic tracks by :-
by finding dynamic tracks. by checking if the dynamic tracks are fully completed.
The _________ attack exploits the common use of a modular exponentiation algorithm in RSA encryption and decryption, but can be adapted to work with any implementation that does not run in fixed time.
A. mathematical.
B. timing.
C. chosen ciphertext.
D. brute-force.
Answer:
chosen ciphertext
Explanation:
Chosen ciphertext attack is a scenario in which the attacker has the ability to choose ciphertexts C i and to view their corresponding decryptions – plaintexts P i . It is essentially the same scenario as a chosen plaintext attack but applied to a decryption function, instead of the encryption function.
Cyber attack usually associated with obtaining decryption keys that do not run in fixed time is called the chosen ciphertext attack.
Theae kind of attack is usually performed through gathering of decryption codes or key which are associated to certain cipher texts The attacker would then use the gathered patterns and information to obtain the decryption key to the selected or chosen ciphertext.Hence, chosen ciphertext attempts the use of modular exponentiation.
Learn more : https://brainly.com/question/14826269
Janice is preparing a recipe that calls for 3/4 cup of oil per serving if Janice needs to prepare for 2 / 2 3 servings how many cups of oil would she neex
Answer:
Three cups would be needed.
Explanation:
2 2/3 × 3/4 = 8/2 × 3/4 = 24/8 = 3
HEYYY! you're probably a really fast typer can you please type this for me! i tried copying and pasting it but it wouldn't let me!!! sooo can you please be a dear and kindly type it for me ^^
what i want you to type is directly in the image so please type exactly that
i dunno what subject this would be under so i'll just put it in any
Answer:
here you go. wish you a great day tomorrow.
and in fact,computer science is somewhat the right category
Abstract art may be - and may seem like - almost anything. This because, unlike the painter or artist who can consider how best they can convey their mind using colour or sculptural materials and techniques. The conceptual artist uses whatever materials and whatever form is most suited to putting their mind across - that would be anything from the presentation to a written statement. Although there is no one kind or structure employed by abstract artists, from the late 1960s specific tendencies emerged.
What two benefits are a result of configuring a wireless mesh network? Check all that apply.
1. Performance
2. Range
3. WiFi protected setup
4. Ad-hoc configuration
Answer:
1)PERFORMANCE
2)RANGE
Explanation:
A mesh network can be regarded as local network topology whereby infrastructure nodes connect dynamically and directly, with other different nodes ,cooperate with one another so that data can be efficiently route from/to clients. It could be a Wireless mesh network or wired one.
Wireless mesh network, utilize
only one node which is physically wired to a network connection such as DSL internet modem. Then the one wired node will now be responsible for sharing of its internet connection in wireless firm with all other nodes arround the vicinity. Then the nodes will now share the connection in wireless firm to nodes which are closest to them, and with this wireless connection wide range of area can be convered which is one advantage of wireless mesh network, other one is performance, wireless has greater performance than wired one.
Some of the benefits derived from configuring a wireless mesh network is
1)PERFORMANCE
2)RANGE
Based on the information given, the correct options are performance and range.
It should be noted that a mesh network can be regarded as the local network topology whereby infrastructure nodes connect directly, with other different nodes ,cooperate with one another so that data can be efficiently route from/to clients.
The advantage of configuring a wireless mesh network is that it enhances performance and range.
Learn more about network on:
https://brainly.com/question/1167985
Write a Program that will print all the numbers divisible by 2 between 0 and 100
Answer:
//In java
for (int i = 0; i <= 100; i++)
{
if ( i % 2 == 0 )
{
System.out.println( i + " ");
}
}
LAB: Winning team (classes)
Complete the Team class implementation. For the class method get_win_percentage(), the formula is:
team_wins / (team_wins + team_losses)
Note: Use floating-point division.
Ex: If the input is:
Ravens
13
3
where Ravens is the team's name, 13 is the number of team wins, and 3 is the number of team losses, the output is:
Congratulations, Team Ravens has a winning average!
If the input is Angels 80 82, the output is:
Team Angels has a losing average.
------------------------------------------------------------------------------------------------------------------------------------
We are given:
class Team:
def __init__(self):
self.team_name = 'none'
self.team_wins = 0
self.team_losses = 0
# TODO: Define get_win_percentage()
if __name__ == "__main__":
team = Team()
team_name = input()
team_wins = int(input())
team_losses = int(input())
team.set_team_name(team_name)
team.set_team_wins(team_wins)
team.set_team_losses(team_losses)
if team.get_win_percentage() >= 0.5:
print('Congratulations, Team', team.team_name,'has a winning average!')
else:
print('Team', team.team_name, 'has a losing average.')
Please help, in Python!
Answer:
The function is as follows:
def get_win_percentage(self):
return self.team_wins / (self.team_wins + self.team_losses)
Explanation:
This defines the function
def get_win_percentage(self):
This calculates the win percentage and returns it to main
return self.team_wins / (self.team_wins + self.team_losses)
See attachment for complete (and modified) program.
Answer: def get_win_percentage(self):
Explanation: got it right on edgen
Write a recursive method that receives a string as a parameter and recursively capitalizes each character in the string (change a small cap to a large cap, e.g. a to A, b to B, etc) as following: capitalize the first letter from the string, then calls the function recursively for the remainder of the string and in the end, build the capitalized string. For example, for "java", will capitalize the first letter to "J"(base case), calls the method recursively for the reminder of the string "ava" (reduction), and after recursion/reduction is over it and returns "AVA" will build a new string from "J" and "AVA" and return "JAVA" to the calling method.
Write this algorithms in java source code plz.
Answer:
String words[]=str.split("\\s");
String capitalizeWord="";
for(String w:words){
String first=w.substring(0,1);
String afterfirst=w.substring(1);
capitalizeWord+=first.toUpperCase()+afterfirst+" ";
}
return capitalizeWord.trim();
Explanation:
Define the word you are trying to capitalize and split it into an array.
String words[]=str.split("\\s");
Create a string for the capital output to be created as
String capitalizeWord="";
Capitalize the word using the "first.toUpperCase()" and "afterfirst" functions
for(String w:words){
String first=w.substring(0,1);
String afterfirst=w.substring(1);
capitalizeWord+=first.toUpperCase()+afterfirst+" ";
}
What is the output? answer = "Hi mom print(answer.lower()) I
Answer: hi mom
Explanation: got it right on edgen
Mice can be connected to a computer using the _________ or ________ port.
S.B. manages the website for the student union at Bridger College in Bozeman, Montana. The student union provides daily activities for the students on campus. As website manager, part of S.B.'s job is to keep the site up to date on the latest activities sponsored by the union. At the beginning of each week, he revises a set of seven web pages detailing the events for each day in the upcoming week. S.B. would like the website to display the current day's schedule within an aside element. To do this, the page must determine the day of the week and then load the appropriate HTML code into the element. He would also like the Today at the Union page to display the current day and date.Complete the following:Use your editor to open the bc_union_txt.html and bc_today_txt.js files from XX folder. Enter your name and the date in the comment section and save them as bc_union.html and bc_today.js. DONEGo to the bc_union.html file in your editor. Directly above the closing tag, insert a script element that links the page to the bc_today.js file. Defer the loading of the script until after the rest of the page is loaded by the browser. Study the contents of the file and save your changes. DONEGo to the bc_today.js file in your editor. At the top of the file, insert a statement indicating that the code will be handled by the browser assuming strict usage. Note that within the file is the getEvent() function, which returns the HTML code for the daily events at the union given a day number ranging from 0 (Sunday) to 6 (Saturday). "use strict";Declare the thisDate variable containing the Date object for the date October 12, 2018. var thisDate = new Date("October 12, 2018");Declare the dateString variable containing the text of the thisDate variable using local conventions. var dateStr = thisDate.toLocaleDateString();Declare the dateHTML variable containing the following text string
An exhibition from over 60 items in the BC permanent collection.
\Location: Room A414
\Time: 12 am – 4 pm
\Cost: free
\ \ Bridger Starlight Cinema \Recent, diverse, and provocative films straight from the art house. 35mm.
\Location: Fredric Whyte Play Circle
\Time: 7 pm – 10 pm
\Cost: $3.75 MWU students, Union members, Union staff. $4.25 all others
\ \ "; break; case 1: // Monday Events eventHTML = " \ Monday Billiards \Play in the BC Billiards league for fun and prizes
\Location: Union Game Room
\Time: 7 pm – 11 pm
\Cost: $3.75 for registration
\ \ Distinguished Lecture Series \Cultural critic Elizabeth Kellog speaks on the issues of the day.
\Location: Union Theater
\Time: 7 pm – 9 pm
\Cost: free, seating is limited
\ \ "; break;Answer:
hi
Explanation:
i did not known answers