<span>a distributed application structure that partitions tasks or workloads between the providers of a resource or service, called servers, and service requester, called clients</span>
Answer:
- #include <iostream>
- using namespace std;
- struct Point{
- double x;
- double y;
- };
- int main()
- {
- Point origin;
- origin.x = 0;
- origin.y = 0;
- return 0;
- }
Explanation:
The solution code is written in C++.
Firstly, we create a data structure Point with two fields, x and y (Line 5 -8).
In the main program, declare an origin object with Point type (Line 12).
Set the x and y fields of origin object to zero using dot syntax (Line 13-14).
Answer:
ring network
Explanation:
In a ring network, the nodes are arranged in a circular pattern where each node is connected to two adjacent nodes. In this topology, any node can communicate with any other node via the intermediaries.
In comparison,
- in a star network every communication needs to pass through a central hub node
- in a bus, each node is connected to a shared linear communication bus.
- in a hierarchical network nodes are organized along a tree structure layout.
Answer:
Using Merge Sort.
Explanation:
Merge Sort is preferred for sorting the linked list because the the data stored in linked list is not in serial memory address which makes the quick sort algorithm very slow and other sorting algorithms impossible.
Merge Sort is a divide and conquer algorithm.
In this algorithms we divide the linked list into sub parts and sort the sub parts of the linked list and then we merge them in sorted order. It is a very effective approach for linked list sorting.
The time complexity of merge sort is O(NLogN).
