Question

Python

Design a class named IP_address to represent IP address objects. The IP_addressclass contains the following

• A number of instance variables/fields to store a table of data. You can design them on your own.
• A constructor that creates a table with the following:
  • a list of data.
  • IP address
  • an integer to indicate the number of elements in the sum_list/freq_list/average_list
• A get_ip_address() method that returns the IP address

For example, consider the following code fragment:

ip_key = '192.168.0.24'
data_list =[(0, 84), (1, 84), (2, 84), (3, 84), (4, 84), (5, 84), (6, 84), (7, 84), (8, 84), (9, 84), (10, 84), (11, 84), (12, 84), (13, 84), (14, 84), (15, 84), (16, 84), (17, 84), (18, 84), (19, 84), (20, 84)]
size = 3
ip = IP_address(key, data_list, size)

The data_list contains a list of tuple objects. Each tuple consists of the time-period value and the packet-size. You should summarize this list and create a frequency list, a sum of the packet-size list and an average of the packet-size list. There are a lot of data for each time-period value. We calculate the total number of bytes that the source host sent for each 10-second interval. For example, the above data_list will be divided into 3 groups, such as (0-9 second), (10-19 second) and (20-29 second)

• (0, 84), (1, 84), (2, 84), (3, 84), (4, 84), (5, 84), (6, 84), (7, 84), (8, 84), (9, 84)
• (10, 84), (11, 84), (12, 84), (13, 84), (14, 84), (15, 84), (16, 84), (17, 84), (18, 84), (19, 84)
• (20, 84)

Therefore, the IP_address object should contain:

• the IP address: '192.168.0.24

This will give

ip_key = '192.168.0.24' data_list =[(0, 84), (1, 84), (2, 84), (3, 84), (4, 84), (5, 84), (6, 84), (7, 84), (8, 84), (9, 84), (10, 84), (11, 84), (12, 84), (13, 84), (14, 84), (15, 84), (16, 84), (17, 84), (18, 84), (19, 84), (20, 84)] size = 3 ip = IP_address(ip_key, data_list, size) print(ip.get_ip_address())

192.168.0.24

And

• modify the constructor and create the sum and average of the packet-size list
• add a method named get_sum_list(). The get_sum_list() method return a list of the sum of packet-size lists (i.e. if the sum list is [840, 840, 84], then the get_sum_list() should return [[0, 840], [1, 840], [2, 84]]
• add a method named get_avg_list(). The get_avg_list() method return a list of the average packet-size lists (i.e. if the sum list is [84.0, 84.0, 84.0], then the get_avg_list() should return [[0, 84.0], [1, 84.0], [2, 84.0]]

For example, consider the following code fragment:

ip_key = '192.168.0.24'
data_list =[(0, 84), (1, 84), (2, 84), (3, 84), (4, 84), (5, 84), (6, 84), (7, 84), (8, 84), (9, 84), (10, 84), (11, 84), (12, 84), (13, 84), (14, 84), (15, 84), (16, 84), (17, 84), (18, 84), (19, 84), (20, 84)]
size = 3
ip = IP_address(key, data_list, size)

The data_list contains a list of tuple objects.

• (0, 84), (1, 84), (2, 84), (3, 84), (4, 84), (5, 84), (6, 84), (7, 84), (8, 84), (9, 84)
• (10, 84), (11, 84), (12, 84), (13, 84), (14, 84), (15, 84), (16, 84), (17, 84), (18, 84), (19, 84)
• (20, 84)

Therefore, the ip object should contain:

• ip address: '192.168.0.24
• a sum of packet-size list: [840, 840, 84]
• an average packet-size list: [84.0, 84.0, 84.0]

For example

Test result

	ip_key = '192.168.0.24' data_list = [(0, 84), (1, 84), (2, 84), (3, 84), (4, 84)] size = 3 ip = IP_address(ip_key, data_list, size) print(ip.get_sum_list()) print(ip.get_avg_list())	get_sum_list: [[0, 840], [1, 840], [2, 84] get_avg_list: [[0, 84.0], [1, 0], [2, 0]]
	ip_key = '192.168.0.2' data_list = [(33, 60), (34, 64), (34, 1500), (34, 712), (35, 52), (35, 60), (36, 52), (36, 287), (37, 52), (37, 52), (37, 52), (39, 60), (40, 643), (40, 52)] size = 5 ip = IP_address(ip_key, data_list, size) print(ip.get_sum_list()) print(ip.get_avg_list())	get_sum_list: [[0, 0], [1, 0], [2, 0], [3, 3003], [4, 695]] get_avg_list: [[0, 0], [1, 0], [2, 0], [3, 250.2], [4, 347.5]]

Answer 1

def stoogesort(arr, l, h):

    if l >= h:

        return

  

    # If first element is smaller

    # than last,swap them

    if arr[l]>arr[h]:

        t = arr[l]

        arr[l] = arr[h]

        arr[h] = t

  

    # If there are more than 2 elements in

    # the array

    if h-l+1 > 2:

        t = (int)((h-l+1)/3)

  

        # Recursively sort first 2/3 elements

        stoogesort(arr, l, (h-t))

  

        # Recursively sort last 2/3 elements

        stoogesort(arr, l+t, (h))

  

        # Recursively sort first 2/3 elements

        # again to confirm

        stoogesort(arr, l, (h-t))

  

# deriver

arr = [2, 4, 5, 3, 1]

n = len(arr)

stoogesort(arr, 0, n-1)

  

for i in range(0, n):

    print(arr[i], end = \' \')

# Code Contributed by Mohit Gupta_OMG <(0_o)>

sorry students the above answer was not given by me someone used my account and posted answer literally i have no knowledge about that question sorry

The one who answerd this mentioned his name too :(