Computer Science Test - 28

The correct option is C

1 → IV, 2 → II, 3 → I, 4 → V, 5 → III

• Bus topology → Each communicating device connects to a transmission medium.
• Ring topology → Each node is connected to two other devices, one each on either side.
• Mesh topology → Each communicating device is connected with every other device.
• Star topology → Each communicating device is connected to a central node.
• Hybrid topology → Each branch can have one or more basic topologies.

The correct answer is option D.

Concept:

Arithmetic Error:

An arithmetic Error is simply an error that occurs during numeric calculations. ArithmeticError types in Python include:

Over Flow Error.
Zero Division Error.
Floating Point Error.

All of these errors have the potential to cause Python programming to crash. Because we do not want our code to fail as a result of improper input from us or a user, it is crucial to capture errors.

Example:

Zero Division Error.:

try:
  arithmetic = 5/0
  print(arithmetic)
except ArithmeticError:
  print('Has error')

Over Flow Error:
import math
try:
    print("The exponential value is")
    print(math.exp(1000))
except OverflowError as oe:
    print("After overflow", oe)

Floating Point Error:
It happens frequently when a system handles floating-point numbers internally. This issue arises from floating-point numbers' underlying representation, which employs a set number of binary digits to represent a decimal integer. Since it might be challenging to convert a decimal integer to binary, roundoff mistakes frequently occur.

Hence the correct answer is All the above.

Statement (A) is correct: A queue follows the FIFO (First-In, First-Out) principle, meaning the first element added is the first to be removed.

Statement (B) is incorrect: The INSERT operation (also called ENQUEUE) adds an element at the rear, not the front.

Statement (C) is correct: The DELETE operation (also called DEQUEUE) removes an element from the front of the queue.

Statement (D) is correct: A queue can be implemented using lists in Python, where append() can be used for INSERT and pop(0) for DELETE.

Thus, the correct answer is (2) (A), (C), and (D) only.

Concept:

Conversion of the domain name of each web server to its corresponding IP address is called domain name resolution. It is done through a server called DNS server.

• A DNS server keeps a list of domain names and the IP addresses that go with them. Knowing how and where the DNS servers are housed is necessary to comprehend how domain name resolution functions.
• The DNS servers are organized in a hierarchy. There are 13 servers known as root servers at the highest level. There are then other DNS servers at various levels below the root servers.
• The HTTP protocol contacts a computer server called a DNS server when we type a URL into a web browser to get the IP address associated with that domain name.
• The process of obtaining a physical address from a machine or a virtual address that a network node or computer peripheral has sent is known as address resolution or name resolution.

Mean is the arithmetic average of a data set. This is found by adding the numbers in a data set and dividing by the number of observations in the data set.

The median is the middle number in a data set when the numbers are listed in either ascending or descending order.

MODE is the value of the observation which has the maximum frequency.

The Standard deviation is a measure of dispersion. It is the action or process of distributing thing over a wide area (nothing about central location)

∴ The Standard deviation is not a measure of central tendency.

Python provides the append() method to add elements to the top of a stack, until an overflow condition is encountered.

The operation of entering elements into a stack is called a Push operation, but Python does not have any in-built function with the same name.

The insert() and add() are not valid Python functions.

In bubble sort, selection sort, and insertion sort, two loops are required to sort the array into an ascending or descending order.

The outer loop determines the number of passes and runs as many times as there are elements in the array.

The inner loop for bubble sort compares every element with the adjacent element to determine their order.

The inner loop for selection sort runs through the array to determine the smallest element and then swaps it to the relevant position.

The inner loop for insertion sort determines the correct position for an element in the sorted part of the list by running through the sorted list.

As a result, all three algorithms have two loops, each running approximately n times, where n is the number of elements in the array.

Therefore, the bubble sort, selection sort, and insertion sort algorithms all have a time complexity of n².

The starting values of first and last are 0 and 14 respectively.

Therefore, the value of the variable last is 2 after the first two iterations.

Concept:

The first IP address, known as version 4 (IPV4 for short), is a 32-bit numeric address. As more devices connected to the internet, it was apparent that the 32-bit IP address would not be enough as it only provides slightly less than 4.3 billion unique addresses.