Answer:
#include <iostream>
using namespace std;
int main() {
int k;
double d;
string s;
cin >> k >> d >> s;
cout << s << " " << d << " " << k << "\n" << k << " " << d << " " << s; }
Explanation:
k is int type variable that stores integer values.
d is double type variable that stores real number.
s is string type variable that stores word.
cin statement is used to take input from user. cin takes an integer, a real number and a word from user. The user first enters an integer value, then a real number and then a small word as input.
cout statement is used to display the output on the screen. cout displays the value of k, d and s which entered by user.
First the values of k, d and s are displayed in reverse order. This means the word is displayed first, then the real number and then the integer separated again by EXACTLY one space from each other. " " used to represent a single space.
Then next line \n is used to produce a new line.
So in the next line values of k, d and s are displayed in original order (the integer , the real, and the word), separated again by EXACTLY one space from each other.
The program along with the output is attached.
Answer:
Finding kth element is more efficient in a doubly-linked list when compared to a singly-linked list
Explanation:
Assuming that both lists have firs_t and last_ pointers.
For a singly-linked list ; when locating a kth element, you have iterate through a number of k-1 elements which means that locating an element will be done only in one ( 1 ) direction
For a Doubly-linked list : To locate the Kth element can be done from two ( directions ) i.e. if the Kth element can found either by traversing the number of elements before it or after it . This makes finding the Kth element faster because the shortest route can be taken.
<em>Finding kth element is more efficient in a doubly-linked list when compared to a singly-linked list </em>