Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Search & Filtering

Below is a nested MPLS network by MTN. With the assumption that Customer 6 (C6) is connected to Router 6 (R6), execute a Dijkstra Algorithm on a Link State routing to determine the shortest path for Customer 6 to transmit packets to every other Customer/Destination connected to the rest of the Routers on the network.


a. Tabulate the executed iteration for the Dijkstra Algorithm using the table below.


#loop through displayList
for i in range(0,len(displayList)):
    #Test if the fist item in the current sub-list contains the text "Price Level
    #Tip: Remeber that each sub-list is a (displayList). So you have
    #       to access its items via displayList followed by TWO indexes.
    if i[0] == 'priceLevel':
        #Extract the second item from the current sub-list into variable called priceLevel
        priceLevel = i[1]
    #Test if priceLevel is between pPrice and cPrice OR
    #priceLevel == pPrice OR
    #        priceLevel == cPrice
    if priceLevel >= self.__previousPrice and priceLevel <= self.__currentPrice or priceLevel == self.__previousPrice or priceLevel == self.__currentPrice:
        #Sound the alarm. Pass in the frequency and duration.
        if self.__currentPrice > self.__previousPrice:
            frequency = 800
            duration = 700
        else:
            frequency = 400
            duration = 700
        winsound.Beep(frequency, duration)
        #Print the text 'Alarm' with a green background color, so that the user
        #can go back and check when the alarm was sounded.
        print(Back.GREEN + "Alarm" + Style.RESET_ALL)







define a class length with feet (int type )and (float type) data members.define do-nothing constructor


1.     Define abstract class Shape with only one virtual method CalculateSurface() and fields width and height. Define two new classes Triangle and Rectangle that implement the virtual method and return the surface of the figure (height*width for rectangle and height*width/2 for triangle). Define class Circle and suitable constructor so that on initialization height must be kept equal to width and implement the CalculateSurface() method. Write a program that tests the behavior of the CalculateSurface() method for different shapes (Circle, Rectangle, Triangle) stored in an array.



Create a C++ Program that will identify the Discount Rate of a shopper based on issued loyalty card, take the following conditions:

Loyalty Card TypeDiscount (%)(1) Frequent Buyer10%(2) One Time Buyer0%(3) Senior Citizen15%

This should be the outcome if ever we run the program

Example:

Total Purchase Cost: Php 3000.00

Loyalty Card Type: 1

Discounted Cost: Php 2700.00

An ecommerce company plans to given their customer special discount .sum of all prime digits of total bill


Explain the following variables with example

1, static variable

2, object variable

3, instance variable


1, For each loop with example

2, do while loop with example


Draw a flowchart that uses while loops for the following steps:

a. Prompt the user to input two integers: firstNum and secondNum. (firstNum must be less than secondNum.)

b. Output all the odd numbers between firstNum and secondNum inclusive.

c. Output the sum of all the even numbers between firstNum and secondNum inclusive.

d. Output all the numbers and their squares between 1 and 10.

e. Output the sum of the squares of all the odd numbers between firstNum and secondNum inclusive.

Below is a nested MPLS network by MTN. With the assumption that Customer 6 (C6) is connected to Router 6 (R6), execute a Dijkstra Algorithm on a Link State routing to determine the shortest path for Customer 6 to transmit packets to every other Customer/Destination connected to the rest of the Routers on the network.

a. Tabulate the executed iteration for the Dijkstra Algorithm using the table below.

  Iteration

0 1 2 3 4 5 6 7 8 9

Nodes

[6]

[6,3]

[6,3,2] [6,3,2,1] [6,3,2,1,4] [6,3,2,1,4,5] [6,3,2,1,4,5,7] [6,3,2,1,4,5,7,8] [6,3,2,1,4,5,7,8,9] [6,3,2,1,4,5,7,8,9,10]

R1 R2 R3 R4 R5 R7 R8 R9 R10

                 


LATEST TUTORIALS
APPROVED BY CLIENTS