Homechevron_rightEngineeringchevron_rightRPSC Programmerchevron_rightProgrammer DBMSchevron_rightWhich is the most reliable topology

Which is the most reliable topology

  • Q. Which is the most reliable topology
  • filter_dramaExplanation
    Answer is : C

    the correct answer is option 3


    Mesh topology:

    A mesh topology provides a connection from each node to every other node on the network. This provides a fully redundant network and it is the most reliable of all networks. If any link or node in the network fails, then there will be another path that will allow network traffic to continue.

    What is Mesh Topology?

    Additional Information

    Ring topology:

    A ring topology is a in which each node connects to exactly two other nodes, forming a single continuous pathway for signals through each node that makes a ring. Data travels from node to node, with each node along the way handling every packet.

    Star topology:

    A star topology is a topology for a Local Area Network(LAN) in which all nodes are individually connected to a central connection point, like a hub or a switch. A star takes more cable than bus topology, but the benefit is that if a cable fails, only one node will be brought down.

    Bus topology:

    A bus topology is a topology for a LAN in which all the nodes are connected to a single cable. The cable to which the nodes connected is called a backbone. if the backbone is broken, the entire segment fails. Bus topology is easy to install and doesn't require much cabling compared to the alternatives.


    No one started the discussion yet. Break the ice and start the conversation.
    Please Login to be part of the discussion.

Similar Questions

  • 1.

    Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock?

    I. 2-phase locking

    II. Time-stamp ordering

  • filter_dramaExplanation
    Answer is : B

    Key Points

    • 2 PL is based on locks and hence not free from deadlock but ensures conflict serializability.
    • Timestamp ordering protocol is based on timestamps ensures conflict serializability and is also free from deadlock.

    Hence the correct answer is II only.

    Additional Information

    •  Any schedule is possible under 2PL it must ensure conflict serializability.
    • Deadlock may occur under 2PL.
    • Cascading rollbacks may occur under 2PL.
  • 2. If a computer provides database services to other, .then it will be known as.
  • filter_dramaExplanation
    Answer is : C


    • A database is a collection of information that is organized so that it can be easily accessed, managed, and updated.
    • Computer databases typically contain aggregations of data records or files.


    Database servers are used to store and manage databases that are stored on the server and to provide data access for authorized users. This type of server keeps the data in a central location that can be regularly backed up. It also allows users and applications to centrally access the data across the network.

    Important PointsWebserver

    • A web server is computer software and the underlying hardware that accepts requests via HTTP, the network protocol created to distribute web pages, or its secure variant HTTPS.
    • A user agent, commonly a web browser or web crawler, initiates communication by making a request for specific resources using HTTP.
  • 3.

    Which of the following is/are not true about the IP based router functionality

    1. It is necessary for a router to implement either RIP or OSPF routing algorithm 

    2. A router reassembles the IP packet in some special scenarios. 

  • filter_dramaExplanation
    Answer is : C

    Statement 1:  False.

    • A router need not necessarily implement any (RIP or OSPF) routing protocol .
    • If no routing protocol is specified for a router, default routing with address is implemented.

    Statement 2:  False

    • Re-assembly of IP fragments into a single IP packet is done only at the receiver site.

    Therefore both statement are not true

  • 4.

    Which of the following statements is/are TRUE?

    (i) Efficiency of CSMA/CD is \(\frac{1}{1 + 6.44a}\), where a = Tp/Tt

    (ii) Polling works like Time Division Multiplexing

    (iii) Maximum efficiency of pure aloha is 36.8%.

  • filter_dramaExplanation
    Answer is : C

    The correct answer is option 3.


    Option 1: Efficiency of CSMA/CD is \(\frac{1}{1 + 6.44a}\), where a = Tp/Tt

    True, In CSMA/CD Efficiency of CSMA/CD =\({T_x} \over {T_x+e.2 T_p}\)

    \(= {{1} \over {1+e.2{{ T_p} \over T_x}} } \)

    Jam signal is to alert all other stations that the collisions have taken place. It takes Tp to alert all stations. where a = Tp/Tt

    \(= {{1} \over {1+e.2{{ T_p} \over T_x}}+{T_p \over T_x} } \\={{1} \over {1+2 a e}+a} \\={{1} \over {1+2 a (2.7)}+a} \\={{1} \over {1+ 6.4}a}\)

    Option 2: Polling works like Time Division Multiplexing.

    False, Polling is an access control method, A polling is conducted in which all the stations are willing to send data to participate. In Time Division Multiplexing (TDM), the Time of the link is divided into fixed-size intervals called time slots or time slices.

    Option 3: Maximum efficiency of pure aloha is 36.8%.

    FalseIn pure aloha, any station can transmit the data at any time. In pure aloha, Maximum efficiency = 18.4%. In slotted aloha, any station can transmit the data at the beginning of any time slot. In slotted aloha, Maximum efficiency = 36.8%.

  • 5. Which aggregate function does not ignore nulls?
  • filter_dramaExplanation
    Answer is : D
    • Aggregate functions return a single result row based on groups of rows, rather than on single rows
    • Aggregate functions can appear in select lists and in ORDER BY and HAVING clauses
    • All aggregate functions except COUNT(*), GROUPING, and GROUPING_ID ignore nulls
    • Aggregate functions which ignore nulls are COUNT, MAX, MIN, SUM, AVG etc.

Programmer DBMSTopics

  • Rahul Kumar

    191 Points


    54 Points


    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points