Output in the file f1.txt must be the following:
✓ Kizspy. me (A,9,8) (C,6,5) (D,2,4) (E,7,9) (F,4,-7) (G,-3,2)
•
void f2()-There are 3 given Camel objects x, y, z in this function. Write statements
insert x,
y and z to the list so that x, y, z will be at positions 2, 4 and 5 (The head's position is 0). Output in
the file f2.txt must be the following:
(C,9,8) (D,6,3) (E,8,5) (F,5,4) (1,4,9) (J,3,7)
(C,9,8) (D,6,3) (X,1,2) (E,8,5) (Y,2,3) (Z,3,4) (F,5,4) (1,4,9) (J,3,7)
1
•
void f3()-Suppose p is the first node having maximum step in the list. Find the second node q
having q.info.step<p.info.step. Swap the contents of p and q. Output in the file f3.txt must be the
following:
(C,7,6) (D,6,7) (E,3,8) (F,7,9) (G,8,7) (H,4,9) (1,8,3) (J,5,4)
(C,7,6) (G,8,7) (E,3,8) (F,7,9) (D,6,7) (H,4,9) (1,8,3) (J,5,4)
. void f40) Find the element p having desert F. Reverse all elements after p. The content of the
output file f4.txt must be the following:
(C,9,8) (D,11,12) (E,8,7) (F,1,2) (1,7,9) (J,6,8) (K,5,6) (L,9,8) (M,3,4)
(C,9,8) (D,11,12) (E,8,7) (F,1,2) (M,3,4) (L,9,8) (K,5,6) (J,6,8) (1,7,9)
Zoom
+ 100%
Close
