All categories

4 years ago

Jason Is Working On A Video Science Project. As He Is Working On It, He Saves The Project.

1 answer:

7 0

I think the problem here is either you don't have enough space and power to run this with your file or the file its self is too large if that's not the case try to google it and look for techisky for help

You might be interested in

How do i work on code with someone else? i use visual studio code. me and a friend wanna make a game together with code. how do

Art [367]

Answer:

You can use Repl.it.com......It's best for practising coding languages...

7 0

3 years ago

Suppose you have a file of data of approximately 100,000 personnel records (FYI, 213 = 8192 and 214 = 16384) using Social Securi

Natali [406]

Answer:

See explaination

Explanation:

The reasons why indexed sequential search structure is better are:

1. In index sequential search any field of the records can be used as the key. This key field can be numerical or alphanumerical.

2. Since each record has its data block address, searching for a record in larger database is easy and quick. There is no extra effort to search records. But proper primary key has to be selected to make efficient.

3. This method gives flexibility of using any column as key field and index will be generated based on that. In addition to the primary key and its index, we can have index generated for other fields too. Hence searching becomes more efficient, if there is search based on columns other than primary key.

The reasons why 5 B-tree is better:

1.The B-tree Provides support for range of queries in an efficient manner and You can iterate over an ordered list of elements.

2. B-Tree algorithms are good for accessing pages (or blocks) of stored information which are then copied into main memory for processing. In the worst case, they are designed to do dynamic set operations in O(lg n) time because of their high "branching factor" (think hundreds or thousands of keys off of any node). It is this branching factor that makes B-Trees so efficient for block storage/retrieval, since a large branching factor greatly reduces the height of the tree and thus the number of disk accesses needed to find any key.

3. It is a generalization of a BST in that a node can have more than two children. These are self-balancing and hence the average and worst complexities is logarithmic. We opt for these when the data is too huge to fit in main memory. These structures are used in database indexing and help in faster operations on disk

the additional informations is we should first decide to choose which structure is suiatable for which algoritm in terms of space and time and then use the appropriate search algorithm.

8 0

3 years ago

Write a python program to read four numbers (representing the four octets of an IP) and print the next five IP addresses. Be sur

sdas [7]

Answer:

first_octet = int(input("Enter the first octet: "))

second_octet = int(input("Enter the second octet: "))

third_octet = int(input("Enter the third octet: "))

forth_octet = int(input("Enter the forth octet: "))

octet_start = forth_octet + 1

octet_end = forth_octet + 6

if (1 <= first_octet <= 255) and (0 <= second_octet <= 255) and (0 <= third_octet <= 255) and (0 <= forth_octet <= 255):

for ip in range(octet_start, octet_end):

forth_octet = forth_octet + 1

if forth_octet > 255:

forth_octet = (forth_octet % 255) - 1

third_octet = third_octet + 1

if third_octet > 255:

third_octet = (third_octet % 255) - 1

second_octet = second_octet + 1

if second_octet > 255:

second_octet = (second_octet % 255) - 1

first_octet = first_octet + 1

if first_octet > 255:

print("No more available IP!")

break

print(str(first_octet) + "." + str(second_octet) + "." + str(third_octet) + "." + str(forth_octet))

else:

print("Invalid input!")

Explanation:

- Ask the user for the octets

- Initialize the start and end points of the loop, since we will be printing next 5 IP range is set accordingly

- Check if the octets meet the restrictions

- Inside the loop, increase the forth octet by 1 on each iteration

- Check if octets reach the limit - 255, if they are greater than 255, calculate the mod and subtract 1. Then increase the previous octet by 1.

For example, if the input is: 1. 1. 20. 255, next ones will be:

1. 1. 21. 0

1. 1. 21. 1

1. 1. 21. 2

1. 1. 21. 3

1. 1. 21. 4

There is an exception for the first octet, if it reaches 255 and others also reach 255, this means there are no IP available.

- Print the result

8 0

4 years ago

Write a function called is_present that takes in two parameters: an integer and a list of integers (NOTE that the first paramete

Agata [3.3K]

Answer:

The function in python is as follows

def is_present(num,list):

stat = False

if num in list:

stat = True

return bool(stat)

Explanation:

This defines the function

def is_present(num,list):

This initializes a boolean variable to false

stat = False

If the integer number is present in the list

if num in list:

This boolean variable is updated to true

stat = True

This returns true or false

return bool(stat)

7 0

3 years ago

Size of a MAN can range from

Dovator [93]

Answer:

According to the latest CDC stats, these are the average heights for U.S. adult men based on age:

Ages 20 to 39: 176.1 centimeters

Ages 40 to 59: 175.8 centimeters

Age 60 and older: 173.4 centimeters

6 0

4 years ago