The answer is C press agency
Because it is a very fun game and if it is fun people like it
"flat file"
A simple database program whose records have no relationship to one another<span>single</span>
Answer:
1. PANs uses Star Topology.
2. LAN uses four topology (Bus, Ring, Star and Tree).
3. MAN uses Star Topology.
4. WAN uses Bus topology.
Explanation:
1. PAN is the personnel area network, in which different personnel devices of a person are connect to each other with the help of the central computer with the help of Bluetooth, WiFi or some other medium. The central computer will work like a hub and all the devices are directly connected to the central PC. It is same as the ring topology where all the devices are connected to the central PC. So we can say that, PANs use star topology.
2. LAN is the local area network that has been established with in the premises of the organization. In this type of network, four typologies involve to complete the network connection. First is star topology, that is used to connect all the devices with the switches. Then Bus topology is used to connect all the switches with the single main cable. Ring topology is involved to connect all the switches with each other. Tree topology is used to connect different block if the organization in the form of branch to connect the central router or switch.
3. MAN is the Metropolitan Area Network which is comprise of different LANs. All the LANs are connected to the Router in the form of Star topology.
4. WAN is the wide area network. In WAN different MANs are connected to the network through single cable. This type of network uses Bus topology.
Answer and Explanation:
Given that total number of records in a file = 100000
Each record consists of= 240 bytes
Given that B= 2400 bytes.
Then total blocks in file = 100000 records * 240 / 2400
= 10000 blocks.
Time that will take for exhaustive read
= s + r + b.btt
= 16 + 8.3 + (10000) * 0.8
= 8024.3 msec
Now as per given X be the number of records that are searched randomly and it takes more than exhaustive read time.
Hence, X (s + r + btt) > 8024.3
X (16+8.3+0.8) > 8024.3
X > 8024.3/25.1
So that, X > 319.69
Hence, atleast 320 random reads should be made to search the file
