Advertisement
Guest User

LAB WEEK 7

a guest
Jun 19th, 2019
65
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.67 KB | None | 0 0
  1. #include <iostream>
  2. #include <iomanip>
  3.  
  4. using namespace std;
  5.  
  6. int Q1() {
  7. int array1[5] = {24,29,18,23,12};
  8. float array2[5] = {0.0};
  9. char array3[5];
  10. for (int i = 0; i < 5; i++) array3[i] = 'C';
  11. }
  12. int Q3() {
  13. int score[5][3];
  14. int total[5] = {0};
  15. float avg[5];
  16.  
  17. for (int i = 0; i < 5; i++) {
  18. cout << "\n\nFor student " << i + 1 << ": ";
  19.  
  20. for (int j = 0; j < 3; j++) {
  21. switch (j) {
  22. case 0: {
  23. cout << "\n\nMaths: ";
  24. break;
  25. }
  26. case 1: {
  27. cout << "English: ";
  28. break;
  29. }
  30. case 2: {
  31. cout << "Drawing: ";
  32. break;
  33. }
  34. } // switch
  35. cin >> score[i][j];
  36. total[i] += score[i][j];
  37.  
  38. } // for j
  39.  
  40. avg[i] = total[i] / 3.0;
  41. } // for i
  42.  
  43. cout << fixed << setprecision(1) << endl;
  44.  
  45. for (int i = 0; i < 5; i++) {
  46. cout << "\n\nStudent " << i + 1 << " total marks: " << total[i];
  47. cout << "\nStudent " << i + 1 << " average marks: " << avg[i];
  48. }
  49. }
  50. int Q4() {
  51. int pattern[5][5];
  52.  
  53. for (int i = 0; i < 5; i++) {
  54. for (int j = 0; j < 5; j++) {
  55. if (j % 2 == 0) pattern[i][j] = 1; else pattern[i][j] = 0;
  56. }
  57. }
  58.  
  59. for (int i = 0; i < 5; i++) {
  60. for (int j = 0; j < 5; j++) {
  61. cout << pattern[i][j];
  62. }
  63. cout << endl;
  64. }
  65.  
  66. return 0;
  67. }
  68. int Q5() {
  69. int pattern[5][5] = {0}, i, j;
  70.  
  71. for (i = 0; i < 5; i++) {
  72. for (j = 0; j < 5; j++) {
  73. if (j % 2 == 0) {
  74. if (i % 2 == 0) pattern[i][j] = 1;
  75. }
  76. else if (i % 2) pattern[i][j] = 1;
  77. }
  78. }
  79.  
  80. for (i = 0; i < 5; i++) {
  81. for (j = 0; j < 5; j++) {
  82. cout << pattern[i][j];
  83. }
  84. cout << endl;
  85. }
  86. }
  87. int Q6() {
  88. int pattern[5][5] = {0}, i, j;
  89.  
  90. for (i = 0; i < 5; i++) {
  91. for (j = 0; j < 5; j++) {
  92. if (i != j) if (i < j) pattern[i][j] = -1; else pattern[i][j] = 1;
  93. }
  94. }
  95.  
  96. for (i = 0; i < 5; i++) {
  97. for (j = 0; j < 5; j++) {
  98. cout << pattern[i][j] << "\t";
  99. }
  100. cout << endl;
  101. }
  102. }
  103. int Q7() {
  104. int pattern[5][5] = {0}, i, j;
  105.  
  106. for (i = 0; i < 5; i++) {
  107. for (j = 0; j < 5; j++) {
  108. if (i == 0 || i == 4 || j == 0 || j == 4) pattern[i][j] = 1;
  109. }
  110. }
  111.  
  112. for (i = 0; i < 5; i++) {
  113. for (j = 0; j < 5; j++) {
  114. cout << pattern[i][j];
  115. }
  116. cout << endl;
  117. }
  118. }
  119. int Q8() {
  120. const int total_row = 10;
  121. int pattern[total_row + 1][total_row + 1] = {0}, i, j;
  122.  
  123. pattern[0][0] = 1;
  124. for (i = 1; i < total_row; i++) {
  125. for (j = 0; j < total_row; j++) {
  126. pattern[i][j] = pattern[i - 1][j] + pattern[i - 1][j - 1];
  127. }
  128. }
  129.  
  130. for (i = 0; i < total_row; i++) {
  131. for (j = 0; j < total_row; j++) {
  132. if (pattern[i][j] == 0) {
  133. cout << endl;
  134. break;
  135. }
  136. else cout << pattern[i][j] << "\t";
  137. }
  138. }
  139. }
  140.  
  141.  
  142. int main() {
  143. return Q8(); //run question as desired
  144. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement