{"id":234,"date":"2022-12-27T00:37:40","date_gmt":"2022-12-26T19:07:40","guid":{"rendered":"https:\/\/prabodhcp.wordpress.com\/?p=234"},"modified":"2024-05-14T05:31:14","modified_gmt":"2024-05-14T00:01:14","slug":"principles-of-programming-using-c-lab-manual-for-vtu","status":"publish","type":"post","link":"https:\/\/moodle.sit.ac.in\/blog\/principles-of-programming-using-c-lab-manual-for-vtu\/","title":{"rendered":"Principles of Programming Using C Lab Manual for VTU"},"content":{"rendered":"\n
\"\"<\/figure>\n\n\n\n

The academic syllabus has been changed for the year 2022-23 in VTU<\/a>. A new subject has been introduced titled \u201cPrinciples of Programming Using C<\/strong>\u201d (Sub Code: BPOPS103\/203<\/strong>) for first year students of VTU<\/a>. This subject has an integrated lab component. Here I am publishing the first version of the lab manual which has solutions and sample output for all the lab programs. Gradually more documentation and algorithms are planned to be added. Anybody can contribute and re-share this manual as it is distributed under Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License<\/a>.<\/p>\n\n\n\n

All the programs have been compiled using the GNU GCC<\/strong><\/a> compiler version 9.4.0 and has been tested on Ubuntu 22.04.4 LTS (Jammy Jellyfish)<\/a>  64-bit Kernel Linux 5.15.0-56-generic.<\/p>\n\n\n\n

These programs can run on any GNU\/Linux Operating system or any other OS with GCC installed.<\/p>\n\n\n\n

GCC compiler can be obtained from here<\/a>. A nice tutorial is provided here<\/a> to get started with GCC.<\/p>\n\n\n\n

If you find the command line difficult to handle and looking for an GUI based IDE to work with, the best choice is Code::Blocks<\/a>. Code::Blocks uses the GNU GCC compiler collection. Two other good IDEs that you can try or Eclipse and Anjuta. I have provided links to this IDEs below you can click and download the necessary software and instructions to set up a working environment.<\/p>\n\n\n\n

    \n
  1. Code::Blocks<\/a><\/li>\n\n\n\n
  2. Anjuta DevStudio<\/a><\/li>\n\n\n\n
  3. Eclipse IDE for C\/C++<\/a><\/li>\n<\/ol>\n\n\n\n

    After getting the necessary development environment setup, Now lets focus on the solutions. You can go to the appropriate program by clicking on the links below.<\/p>\n\n\n\n

      \n
    1. Question 01 – Simple Calculator<\/a><\/li>\n\n\n\n
    2. Question 02 – Quadratic Equation<\/a><\/li>\n\n\n\n
    3. Question 03 – Electricity Bill<\/a><\/li>\n\n\n\n
    4. Question 04 – Printing Pattern<\/a><\/li>\n\n\n\n
    5. Question 05 – Binary Search<\/a><\/li>\n\n\n\n
    6. Question 06 – Matrix Multiplication<\/a><\/li>\n\n\n\n
    7. Question 07 – Compute Sine and Cosine of an Angle<\/a><\/li>\n\n\n\n
    8. Question 08 – Bubble Sort<\/a><\/li>\n\n\n\n
    9. Question 09 – String Operations<\/a><\/li>\n\n\n\n
    10. Question 10 – C Structures<\/a><\/li>\n\n\n\n
    11. Question 11 – Pointers and Arrays<\/a><\/li>\n\n\n\n
    12. Question 12 – File Copy<\/a><\/li>\n<\/ol>\n\n\n\n
      \n\n\n\n

       Question 1<\/h2>\n\n\n\n

      Simple Calculator<\/h3>\n\n\n\n

      Simulation of a Simple Calculator.<\/strong><\/p>\n\n\n\n

      C Code<\/h4>\n\n\n\n
      <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
      \/***************************************************************************<\/span><\/span>\n*File\t\t\t: A01Calculator.c<\/span><\/span>\n*Description\t: Program to simulate a commercial calculator<\/span><\/span>\n*Author\t\t: Prabodh C P<\/span><\/span>\n*Compiler\t\t: gcc compiler, Ubuntu 22.04<\/span><\/span>\n*Date\t\t\t: 10 August 2022<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\n<\/span>\n#include<\/span><stdio.h><\/span><\/span>\n#include<\/span><stdlib.h><\/span><\/span>\n#include<\/span><math.h><\/span><\/span>\n<\/span>\n\/***************************************************************************<\/span><\/span>\n*Function\t\t\t: \tmain<\/span><\/span>\n*Input parameters\t:\tno parameters<\/span><\/span>\n*RETURNS\t\t\t:\t0 on success<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\n<\/span>\nint<\/span> <\/span>main<\/span>()<\/span><\/span>\n{<\/span><\/span>\n\t<\/span>int<\/span> iChoice, iOperand1, iOperand2;<\/span><\/span>\n\t<\/span>char<\/span> cOperator;<\/span><\/span>\n\t<\/span><\/span>\n\t<\/span>for<\/span>(;;)<\/span><\/span>\n\t{<\/span><\/span>\n\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Enter the arithmetic expression(Do not add spaces in the expression)<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t\t<\/span>scanf<\/span>(<\/span>"<\/span>%d%c%d<\/span>"<\/span>, <\/span>&<\/span>iOperand1, <\/span>&<\/span>cOperator, <\/span>&<\/span>iOperand2);<\/span><\/span>\n\t\t<\/span>switch<\/span>(cOperator)<\/span><\/span>\n\t\t{<\/span><\/span>\n\t\t\t<\/span>case<\/span> <\/span>'+'<\/span>: \t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Result = <\/span>%d<\/span>"<\/span>, iOperand1 <\/span>+<\/span> iOperand2);<\/span><\/span>\n\t\t\t\t\t\t<\/span>break<\/span>;<\/span><\/span>\n\t\t\t\t\t<\/span><\/span>\n\t\t\t<\/span>case<\/span> <\/span>'-'<\/span>:\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Result = <\/span>%d<\/span>"<\/span>, iOperand1 <\/span>-<\/span> iOperand2);<\/span><\/span>\n\t\t\t\t\t\t<\/span>break<\/span>;<\/span><\/span>\n\t\t\t<\/span><\/span>\n\t\t\t<\/span>case<\/span> <\/span>'*'<\/span>:\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Result = <\/span>%d<\/span>"<\/span>, iOperand1 <\/span>*<\/span> <\/span>iOperand2<\/span>);<\/span><\/span>\n\t\t\t\t\t\t<\/span>break<\/span>;<\/span><\/span>\n\t\t\t\t\t\t<\/span><\/span>\n\t\t\t<\/span>case<\/span> <\/span>'\/'<\/span>:\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Result = <\/span>%g<\/span>"<\/span>, (<\/span>float<\/span>)iOperand1 <\/span>\/<\/span> iOperand2);<\/span><\/span>\n\t\t\t\t\t\t<\/span>break<\/span>;<\/span><\/span>\n\t\t\t<\/span>case<\/span> <\/span>'%'<\/span>:\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Result = <\/span>%d<\/span>"<\/span>, iOperand1 <\/span>%<\/span> iOperand2);<\/span><\/span>\n\t\t\t\t\t\t<\/span>break<\/span>;<\/span><\/span>\n\t\t\t\t\t<\/span><\/span>\n\t\t}<\/span><\/span>\n\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Press 1 to continue and 0 to quit : "<\/span>);<\/span><\/span>\n\t\t<\/span>scanf<\/span>(<\/span>"<\/span>%d<\/span>"<\/span>, <\/span>&<\/span>iChoice);<\/span><\/span>\n\t\t<\/span>if<\/span>(<\/span>0<\/span>==<\/span>iChoice)<\/span><\/span>\n\t\t{<\/span><\/span>\n\t\t\t<\/span>break<\/span>;<\/span><\/span>\n\t\t}<\/span><\/span>\n\t}<\/span><\/span>\n\t<\/span>return<\/span> <\/span>0<\/span>;\t\t<\/span><\/span>\n}<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
      Output<\/h4>\n\n\n\n
      <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
      \/***************************************<\/span><\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>arithmetic<\/span> <\/span>expression<\/span><\/span>\n4+6<\/span><\/span>\n<\/span>\nResult<\/span> <\/span>=<\/span> <\/span>10<\/span><\/span>\nPress<\/span> <\/span>1<\/span> <\/span>to<\/span> <\/span>continue<\/span> <\/span>and<\/span> <\/span>0<\/span> <\/span>to<\/span> <\/span>quit<\/span> <\/span>:<\/span> <\/span>1<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>arithmetic<\/span> <\/span>expression<\/span><\/span>\n2-9<\/span><\/span>\n<\/span>\nResult<\/span> <\/span>=<\/span> <\/span>-7<\/span><\/span>\nPress<\/span> <\/span>1<\/span> <\/span>to<\/span> <\/span>continue<\/span> <\/span>and<\/span> <\/span>0<\/span> <\/span>to<\/span> <\/span>quit<\/span> <\/span>:<\/span> <\/span>1<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>arithmetic<\/span> <\/span>expression<\/span><\/span>\n5*2<\/span><\/span>\n<\/span>\nResult<\/span> <\/span>=<\/span> <\/span>10<\/span><\/span>\nPress<\/span> <\/span>1<\/span> <\/span>to<\/span> <\/span>continue<\/span> <\/span>and<\/span> <\/span>0<\/span> <\/span>to<\/span> <\/span>quit<\/span> <\/span>:<\/span> <\/span>1<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>arithmetic<\/span> <\/span>expression<\/span><\/span>\n4\/5<\/span><\/span>\n<\/span>\nResult<\/span> <\/span>=<\/span> <\/span>0.8<\/span><\/span>\nPress<\/span> <\/span>1<\/span> <\/span>to<\/span> <\/span>continue<\/span> <\/span>and<\/span> <\/span>0<\/span> <\/span>to<\/span> <\/span>quit<\/span> <\/span>:<\/span> <\/span>1<\/span>   <\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>arithmetic<\/span> <\/span>expression<\/span><\/span>\n8\/4<\/span><\/span>\n<\/span>\nResult<\/span> <\/span>=<\/span> <\/span>2<\/span><\/span>\nPress<\/span> <\/span>1<\/span> <\/span>to<\/span> <\/span>continue<\/span> <\/span>and<\/span> <\/span>0<\/span> <\/span>to<\/span> <\/span>quit<\/span> <\/span>:<\/span> <\/span>1<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>arithmetic<\/span> <\/span>expression<\/span><\/span>\n15%4<\/span><\/span>\n<\/span>\nResult<\/span> <\/span>=<\/span> <\/span>3<\/span><\/span>\nPress<\/span> <\/span>1<\/span> <\/span>to<\/span> <\/span>continue<\/span> <\/span>and<\/span> <\/span>0<\/span> <\/span>to<\/span> <\/span>quit<\/span> <\/span>:<\/span> <\/span>0<\/span><\/span>\n***************************************<\/span>\/<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
      Question 2 <\/h2>\n\n\n\n
      Quadratic Equation<\/h3>\n\n\n\n
      Compute the roots of a quadratic equation by accepting the coefficients. Print appropriate messages.<\/strong><\/p>\n\n\n\n
      C Code<\/h4>\n\n\n\n
      <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
      \/***************************************************************************<\/span><\/span>\n*File\t\t\t: A02Quadratic.c<\/span><\/span>\n*Description\t: Program to find the roots of a Quadratic Equation<\/span><\/span>\n*Author\t\t: Prabodh C P<\/span><\/span>\n*Compiler\t\t: gcc compiler, Ubuntu 22.04<\/span><\/span>\n*Date\t\t\t: 10 August 2022<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\n<\/span>\n#include<\/span><stdio.h><\/span><\/span>\n#include<\/span><stdlib.h><\/span><\/span>\n#include<\/span><math.h><\/span><\/span>\n\/***************************************************************************<\/span><\/span>\n*Function\t\t\t: \tmain<\/span><\/span>\n*Input parameters\t:\tno parameters<\/span><\/span>\n*RETURNS\t\t\t:\t0 on success<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\nint<\/span> <\/span>main<\/span>(<\/span>void<\/span>)<\/span><\/span>\n{<\/span><\/span>\n\t<\/span>float<\/span> fA,fB,fC,fDesc,fX1,fX2,fRealp,fImagp;<\/span><\/span>\n\t<\/span>int<\/span> iState;<\/span><\/span>\n<\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>*************************************************************"<\/span>);<\/span><\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>*<\/span>\\t<\/span>PROGRAM TO FIND ROOTS OF A QUADRATIC EQUATION<\/span>\\t<\/span>    *<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t<\/span>printf<\/span>(<\/span>"*************************************************************"<\/span>);<\/span><\/span>\n<\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Enter the coefficients of a,b,c <\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t<\/span>scanf<\/span>(<\/span>"<\/span>%f%f%f<\/span>"<\/span>,<\/span>&<\/span>fA,<\/span>&<\/span>fB,<\/span>&<\/span>fC);<\/span><\/span>\n\t<\/span>if<\/span>(<\/span>0<\/span> <\/span>==<\/span> fA)<\/span><\/span>\n\t{<\/span><\/span>\n\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Invalid input, not a quadratic equation - try again<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t\t<\/span>exit<\/span>(<\/span>0<\/span>);<\/span><\/span>\n\t}<\/span><\/span>\n<\/span>\n\t\/*COMPUTE THE DESCRIMINANT*\/<\/span><\/span>\n\tfDesc <\/span>=<\/span> fB <\/span>*<\/span> fB <\/span>-<\/span> <\/span>4<\/span> <\/span>*<\/span> fA <\/span>*<\/span> fC;<\/span><\/span>\n\t((<\/span>0<\/span> <\/span>==<\/span> fDesc) <\/span>?<\/span> (iState <\/span>=<\/span> <\/span>1<\/span>)<\/span>:<\/span>((fDesc <\/span>><\/span> <\/span>0<\/span>) <\/span>?<\/span> (iState <\/span>=<\/span> <\/span>2<\/span>) <\/span>:<\/span> (iState <\/span>=<\/span> <\/span>3<\/span>)));<\/span><\/span>\n\t<\/span>switch<\/span>(iState)<\/span><\/span>\n\t{<\/span><\/span>\n\t\t<\/span>case<\/span> <\/span>1<\/span>:<\/span><\/span>\n\t\t\tfX1 <\/span>=<\/span> fX2 <\/span>=<\/span> <\/span>-<\/span>fB<\/span>\/<\/span>(<\/span>2<\/span>*<\/span>fA);<\/span><\/span>\n\t\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Roots are equal and the Roots are <\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Root1 = <\/span>%g<\/span> and Root2 = <\/span>%g\\n<\/span>"<\/span>,fX1,fX2);<\/span><\/span>\n\t\t\t<\/span>break<\/span>;<\/span><\/span>\n\t\t<\/span>case<\/span> <\/span>2<\/span>:<\/span><\/span>\n\t\t\tfX1 <\/span>=<\/span> (<\/span>-<\/span>fB<\/span>+<\/span>sqrt<\/span>(fDesc))<\/span>\/<\/span>(<\/span>2<\/span>*<\/span>fA);<\/span><\/span>\n\t\t\tfX2 <\/span>=<\/span> (<\/span>-<\/span>fB<\/span>-<\/span>sqrt<\/span>(fDesc))<\/span>\/<\/span>(<\/span>2<\/span>*<\/span>fA);<\/span><\/span>\n\t\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>The Roots are Real and distinct, they are <\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Root1 = <\/span>%g<\/span> and Root2 = <\/span>%g\\n<\/span>"<\/span>,fX1,fX2);<\/span><\/span>\n\t\t\t<\/span>break<\/span>;<\/span><\/span>\n\t\t<\/span>case<\/span> <\/span>3<\/span>:<\/span><\/span>\n\t\t\tfRealp <\/span>=<\/span> <\/span>-<\/span>fB <\/span>\/<\/span> (<\/span>2<\/span>*<\/span>fA);<\/span><\/span>\n\t\t\tfImagp <\/span>=<\/span> <\/span>sqrt<\/span>(<\/span>fabs<\/span>(fDesc))<\/span>\/<\/span>(<\/span>2<\/span>*<\/span>fA);<\/span><\/span>\n\t\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>The Roots are imaginary and they are<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Root1 = <\/span>%g<\/span>+i<\/span>%g\\n<\/span>"<\/span>,fRealp,fImagp);<\/span><\/span>\n\t\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Root2 = <\/span>%g<\/span>-i<\/span>%g\\n<\/span>"<\/span>,fRealp,fImagp);<\/span><\/span>\n\t}<\/span><\/span>\n\t<\/span>return<\/span> <\/span>0<\/span>;<\/span><\/span>\n}<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
      Output<\/h4>\n\n\n\n
      <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
      \/***************************************<\/span><\/span>\n*************************************************************<\/span><\/span>\n*<\/span>\tPROGRAM TO FIND ROOTS OF A QUADRATIC EQUATION\t    <\/span>*<\/span><\/span>\n*************************************************************<\/span><\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>coefficients<\/span> <\/span>of<\/span> <\/span>a,b,c<\/span> <\/span><\/span>\n1<\/span> <\/span>-5<\/span> <\/span>6<\/span><\/span>\n<\/span>\nThe<\/span> <\/span>Roots<\/span> <\/span>are<\/span> <\/span>Real<\/span> <\/span>and<\/span> <\/span>distinct,<\/span> <\/span>they<\/span> <\/span>are<\/span> <\/span><\/span>\n<\/span>\nRoot1<\/span> <\/span>=<\/span> <\/span>3<\/span> <\/span>and<\/span> <\/span>Root2<\/span> <\/span>=<\/span> <\/span>2<\/span><\/span>\n*************************************************************<\/span><\/span>\n*<\/span>\tPROGRAM TO FIND ROOTS OF A QUADRATIC EQUATION\t    <\/span>*<\/span><\/span>\n*************************************************************<\/span><\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>coefficients<\/span> <\/span>of<\/span> <\/span>a,b,c<\/span> <\/span><\/span>\n1<\/span> <\/span>4<\/span> <\/span>4<\/span><\/span>\n<\/span>\nRoots<\/span> <\/span>are<\/span> <\/span>equal<\/span> <\/span>and<\/span> <\/span>the<\/span> <\/span>Roots<\/span> <\/span>are<\/span> <\/span><\/span>\n<\/span>\nRoot1<\/span> <\/span>=<\/span> <\/span>-2<\/span> <\/span>and<\/span> <\/span>Root2<\/span> <\/span>=<\/span> <\/span>-2<\/span><\/span>\n*************************************************************<\/span><\/span>\n*<\/span>\tPROGRAM TO FIND ROOTS OF A QUADRATIC EQUATION\t    <\/span>*<\/span><\/span>\n*************************************************************<\/span><\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>coefficients<\/span> <\/span>of<\/span> <\/span>a,b,c<\/span> <\/span><\/span>\n1<\/span> <\/span>3<\/span> <\/span>3<\/span><\/span>\n<\/span>\nThe<\/span> <\/span>Roots<\/span> <\/span>are<\/span> <\/span>imaginary<\/span> <\/span>and<\/span> <\/span>they<\/span> <\/span>are<\/span><\/span>\n<\/span>\nRoot1<\/span> <\/span>=<\/span> <\/span>-1.5+i0.866025<\/span>\t\t<\/span>Root2<\/span> <\/span>=<\/span> <\/span>-1.5-i0.866025<\/span><\/span>\n*************************************************************<\/span><\/span>\n*<\/span>\tPROGRAM TO FIND ROOTS OF A QUADRATIC EQUATION\t    <\/span>*<\/span><\/span>\n*************************************************************<\/span><\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>coefficients<\/span> <\/span>of<\/span> <\/span>a,b,c<\/span> <\/span><\/span>\n0<\/span> <\/span>1<\/span> <\/span>2<\/span><\/span>\n<\/span>\nInvalid<\/span> <\/span>input,<\/span> <\/span>not<\/span> <\/span>a<\/span> <\/span>quadratic<\/span> <\/span>equation<\/span> <\/span>-<\/span> <\/span>try<\/span> <\/span>again<\/span><\/span>\n***************************************<\/span>\/<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
      Question 3 <\/h2>\n\n\n\n
      Electricity Bill<\/h3>\n\n\n\n
      An electricity board charges the following rates for the use of electricity: for the first 200 units 80 paise per unit: for the next 100 units 90 paise per unit: beyond 300 units Rs 1 per unit. All users are charged a minimum of Rs. 100 as meter charge. If the total amount is more than Rs 400, then an additional surcharge of 15% of total amount is charged. Write a program to read the name of the user, number of units consumed and print out the charges.<\/strong><\/p>\n\n\n\n
      C Code<\/h4>\n\n\n\n
      <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
      \/***************************************************************************<\/span><\/span>\n*File\t\t\t: A03ElectricBill.c<\/span><\/span>\n*Description\t: Program to perform a binary search on 1D Array<\/span><\/span>\n*Author\t\t: Prabodh C P<\/span><\/span>\n*Compiler\t\t: gcc compiler, Ubuntu 22.04<\/span><\/span>\n*Date\t\t\t: 10 August 2022<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\n#include<\/span><stdio.h><\/span><\/span>\n#include<\/span><stdlib.h><\/span><\/span>\n\/***************************************************************************<\/span><\/span>\n*Function\t\t: \tmain<\/span><\/span>\n*Input parameters\t:\tno parameters<\/span><\/span>\n*RETURNS\t\t:\t0 on success<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\nint<\/span> <\/span>main<\/span>(<\/span>void<\/span>)<\/span><\/span>\n{<\/span><\/span>\n\t<\/span>char<\/span> <\/span>cName<\/span>[<\/span>30<\/span>];<\/span><\/span>\n\t<\/span>int<\/span> iUnits;<\/span><\/span>\n\t<\/span>const<\/span> <\/span>int<\/span> iMinCharge <\/span>=<\/span> <\/span>100<\/span>;<\/span><\/span>\n\t<\/span>const<\/span> <\/span>double<\/span> dSlab1 <\/span>=<\/span> <\/span>0.8<\/span>;<\/span><\/span>\n\t<\/span>const<\/span> <\/span>double<\/span> dSlab2 <\/span>=<\/span> <\/span>0.9<\/span>;<\/span><\/span>\n\t<\/span>const<\/span> <\/span>double<\/span> dSlab3 <\/span>=<\/span> <\/span>1.0<\/span>;<\/span><\/span>\n\t<\/span>const<\/span> <\/span>double<\/span> dSurcharge <\/span>=<\/span> <\/span>0.15<\/span>;<\/span><\/span>\n\t<\/span>double<\/span> dBillAmount <\/span>=<\/span> <\/span>0.0<\/span>;<\/span><\/span>\n<\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Enter the name of the customer : "<\/span>); \t\t<\/span>scanf<\/span>(<\/span>"<\/span>%s<\/span>"<\/span>, cName);<\/span><\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Enter the number of units consumed : "<\/span>); \t<\/span>scanf<\/span>(<\/span>"<\/span>%d<\/span>"<\/span>, <\/span>&<\/span>iUnits);\t<\/span><\/span>\n\tdBillAmount <\/span>+=<\/span> iMinCharge;<\/span><\/span>\n\t<\/span>if<\/span>(iUnits <\/span><=<\/span> <\/span>200<\/span>)<\/span><\/span>\n\t{<\/span><\/span>\n\t\tdBillAmount <\/span>+=<\/span> iUnits<\/span>*<\/span>dSlab1;<\/span><\/span>\n\t}<\/span><\/span>\n\t<\/span>else<\/span> <\/span>if<\/span>(iUnits <\/span>><\/span> <\/span>200<\/span> <\/span>&&<\/span> iUnits <\/span><=<\/span> <\/span>300<\/span>)<\/span><\/span>\n\t{<\/span><\/span>\n\t\tdBillAmount <\/span>+=<\/span> (<\/span>200<\/span>*<\/span>dSlab1)<\/span>+<\/span>((iUnits<\/span>-<\/span>200<\/span>)<\/span>*<\/span>dSlab2);<\/span><\/span>\n\t}<\/span><\/span>\n\t<\/span>else<\/span><\/span>\n\t{<\/span><\/span>\n\t\tdBillAmount <\/span>+=<\/span> (<\/span>200<\/span>*<\/span>dSlab1)<\/span>+<\/span>(<\/span>100<\/span>*<\/span>dSlab2)<\/span>+<\/span>((iUnits<\/span>-<\/span>300<\/span>)<\/span>*<\/span>dSlab3);<\/span><\/span>\n\t}<\/span><\/span>\n\t<\/span>if<\/span>(dBillAmount <\/span>><\/span> <\/span>400<\/span>)<\/span><\/span>\n\t{<\/span><\/span>\n\t\tdBillAmount <\/span>+=<\/span> dBillAmount <\/span>*<\/span> dSurcharge;<\/span><\/span>\n\t}<\/span><\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Electricity Bill<\/span>\\n<\/span>==================================="<\/span>);<\/span><\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Customer Name<\/span>\\t<\/span>: <\/span>%s<\/span>"<\/span>, cName);<\/span><\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Units Consumed<\/span>\\t<\/span>: <\/span>%d<\/span>"<\/span>, iUnits);<\/span><\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Bill Amount<\/span>\\t<\/span>: <\/span>%0.2lf<\/span> Rupees<\/span>\\n\\n<\/span>"<\/span>, dBillAmount);<\/span><\/span>\n\t<\/span>return<\/span> <\/span>0<\/span>;<\/span><\/span>\n}<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
      Output<\/h4>\n\n\n\n
      <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
      \/***************************************<\/span><\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>name<\/span> <\/span>of<\/span> <\/span>the<\/span> <\/span>customer<\/span> <\/span>:<\/span> <\/span>Ramesh<\/span><\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>number<\/span> <\/span>of<\/span> <\/span>units<\/span> <\/span>consumed<\/span> <\/span>:<\/span> <\/span>457<\/span><\/span>\n<\/span>\nElectricity<\/span> <\/span>Bill<\/span><\/span>\n===================================<\/span><\/span>\nCustomer<\/span> <\/span>Name<\/span>\t<\/span>:<\/span> <\/span>Ramesh<\/span><\/span>\nUnits<\/span> <\/span>Consumed<\/span>\t<\/span>:<\/span> <\/span>457<\/span><\/span>\nBill<\/span> <\/span>Amount<\/span>\t<\/span>:<\/span> <\/span>583.05<\/span> <\/span>Rupees<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>name<\/span> <\/span>of<\/span> <\/span>the<\/span> <\/span>customer<\/span> <\/span>:<\/span> <\/span>Sayeed<\/span> <\/span><\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>number<\/span> <\/span>of<\/span> <\/span>units<\/span> <\/span>consumed<\/span> <\/span>:<\/span> <\/span>150<\/span><\/span>\n<\/span>\nElectricity<\/span> <\/span>Bill<\/span><\/span>\n===================================<\/span><\/span>\nCustomer<\/span> <\/span>Name<\/span>\t<\/span>:<\/span> <\/span>Sayeed<\/span><\/span>\nUnits<\/span> <\/span>Consumed<\/span>\t<\/span>:<\/span> <\/span>150<\/span><\/span>\nBill<\/span> <\/span>Amount<\/span>\t<\/span>:<\/span> <\/span>220.00<\/span> <\/span>Rupees<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>name<\/span> <\/span>of<\/span> <\/span>the<\/span> <\/span>customer<\/span> <\/span>:<\/span> <\/span>Jaswinder<\/span><\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>number<\/span> <\/span>of<\/span> <\/span>units<\/span> <\/span>consumed<\/span> <\/span>:<\/span> <\/span>300<\/span><\/span>\n<\/span>\nElectricity<\/span> <\/span>Bill<\/span><\/span>\n===================================<\/span><\/span>\nCustomer<\/span> <\/span>Name<\/span>\t<\/span>:<\/span> <\/span>Jaswinder<\/span><\/span>\nUnits<\/span> <\/span>Consumed<\/span>\t<\/span>:<\/span> <\/span>300<\/span><\/span>\nBill<\/span> <\/span>Amount<\/span>\t<\/span>:<\/span> <\/span>350.00<\/span> <\/span>Rupees<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>name<\/span> <\/span>of<\/span> <\/span>the<\/span> <\/span>customer<\/span> <\/span>:<\/span> <\/span>Shyam<\/span><\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>number<\/span> <\/span>of<\/span> <\/span>units<\/span> <\/span>consumed<\/span> <\/span>:<\/span> <\/span>182<\/span><\/span>\n<\/span>\nElectricity<\/span> <\/span>Bill<\/span><\/span>\n===================================<\/span><\/span>\nCustomer<\/span> <\/span>Name<\/span>\t<\/span>:<\/span> <\/span>Shyam<\/span><\/span>\nUnits<\/span> <\/span>Consumed<\/span>\t<\/span>:<\/span> <\/span>182<\/span><\/span>\nBill<\/span> <\/span>Amount<\/span>\t<\/span>:<\/span> <\/span>245.60<\/span> <\/span>Rupees<\/span><\/span>\n***************************************<\/span>\/<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
      Output<\/h4>\n\n\n\n
      <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
      \/***************************************<\/span><\/span>\nEnter<\/span> <\/span>Customer<\/span> <\/span>name:SHAM<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>number<\/span> <\/span>of<\/span> <\/span>units<\/span> <\/span>consumed:<\/span> <\/span>150<\/span><\/span>\nELECTRIC<\/span> <\/span>BILL<\/span><\/span>\nName<\/span> <\/span>:<\/span>                   <\/span>SHAM<\/span><\/span>\nUnits<\/span> <\/span>Consumed<\/span> <\/span>:<\/span>         <\/span>150<\/span> <\/span>units<\/span><\/span>\nBill<\/span> <\/span>Minimum<\/span>            <\/span>=<\/span>  <\/span>100.00<\/span> <\/span>Rs<\/span><\/span>\n\t<\/span>150<\/span> <\/span>*<\/span>  <\/span>80<\/span> <\/span>paise<\/span>     <\/span>=<\/span>  <\/span>120.00<\/span><\/span>\nTotal<\/span> <\/span>Bill<\/span> <\/span>Charges<\/span>      <\/span>=<\/span>  <\/span>220.00<\/span> <\/span>Rs<\/span><\/span>\n===================================<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>Customer<\/span> <\/span>name:BABU<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>number<\/span> <\/span>of<\/span> <\/span>units<\/span> <\/span>consumed:<\/span> <\/span>260<\/span><\/span>\nELECTRIC<\/span> <\/span>BILL<\/span><\/span>\nName<\/span> <\/span>:<\/span>                   <\/span>BABU<\/span><\/span>\nUnits<\/span> <\/span>Consumed<\/span> <\/span>:<\/span>         <\/span>260<\/span> <\/span>units<\/span><\/span>\nBill<\/span> <\/span>Minimum<\/span>            <\/span>=<\/span>  <\/span>100.00<\/span> <\/span>Rs<\/span><\/span>\n\t<\/span>200<\/span> <\/span>*<\/span>  <\/span>80<\/span> <\/span>paise<\/span>     <\/span>=<\/span>  <\/span>160.00<\/span><\/span>\n\t <\/span>60<\/span> <\/span>*<\/span>  <\/span>90<\/span> <\/span>paise<\/span>     <\/span>=<\/span>   <\/span>54.00<\/span><\/span>\nTotal<\/span> <\/span>Bill<\/span> <\/span>Charges<\/span>      <\/span>=<\/span>  <\/span>314.00<\/span> <\/span>Rs<\/span><\/span>\n===================================<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>Customer<\/span> <\/span>name:RAMU<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>number<\/span> <\/span>of<\/span> <\/span>units<\/span> <\/span>consumed:<\/span> <\/span>555<\/span><\/span>\nELECTRIC<\/span> <\/span>BILL<\/span><\/span>\nName<\/span> <\/span>:<\/span>                   <\/span>RAMU<\/span><\/span>\nUnits<\/span> <\/span>Consumed<\/span> <\/span>:<\/span>         <\/span>555<\/span> <\/span>units<\/span><\/span>\nBill<\/span> <\/span>Minimum<\/span>            <\/span>=<\/span>  <\/span>100.00<\/span> <\/span>Rs<\/span><\/span>\n\t<\/span>200<\/span> <\/span>*<\/span>  <\/span>80<\/span> <\/span>paise<\/span>     <\/span>=<\/span>  <\/span>160.00<\/span> <\/span>Rs<\/span><\/span>\n\t<\/span>100<\/span> <\/span>*<\/span>  <\/span>90<\/span> <\/span>paise<\/span>     <\/span>=<\/span>   <\/span>90.00<\/span> <\/span>Rs<\/span><\/span>\n\t<\/span>255<\/span> <\/span>*<\/span> <\/span>100<\/span> <\/span>paise<\/span>     <\/span>=<\/span>  <\/span>255.00<\/span> <\/span>Rs<\/span><\/span>\nSurcharge<\/span> <\/span>Amount<\/span>        <\/span>=<\/span>  <\/span>104.36<\/span> <\/span>Rs<\/span><\/span>\nTotal<\/span> <\/span>Bill<\/span> <\/span>Charges<\/span>      <\/span>=<\/span>  <\/span>695.75<\/span> <\/span>Rs<\/span><\/span>\n===================================<\/span><\/span>\n<\/span>\n***************************************<\/span>\/<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
      Question 4 <\/h2>\n\n\n\n
      Printing Pattern<\/h3>\n\n\n\n
      Write a C Program to display the following by reading the number of rows as input<\/strong><\/p>\n\n\n\n
      C Code<\/h4>\n\n\n\n
      <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
      \/***************************************************************************<\/span><\/span>\n*File\t\t\t: A04Pattern.c<\/span><\/span>\n*Description\t: Program to print a Pattern<\/span><\/span>\n*Author\t\t\t: Prabodh C P<\/span><\/span>\n*Compiler\t\t: gcc compiler, Ubuntu 22.04<\/span><\/span>\n*Date\t\t\t: 26 December 2022<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\n#include<\/span><stdio.h><\/span><\/span>\n#include<\/span><stdlib.h><\/span><\/span>\n\/***************************************************************************<\/span><\/span>\n*Function\t\t: \tmain<\/span><\/span>\n*Input parameters\t:\tno parameters<\/span><\/span>\n*RETURNS\t\t:\t0 on success<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\n<\/span>\nint<\/span> <\/span>main<\/span>()<\/span><\/span>\n{<\/span><\/span>\n    <\/span>int<\/span> iNum, iSp_cnt, iNum_cnt, iVal, i, j, k;<\/span><\/span>\n    <\/span>printf<\/span>(<\/span>"Enter the number of rows : "<\/span>);<\/span><\/span>\n    <\/span>scanf<\/span>(<\/span>"<\/span>%d<\/span>"<\/span>, <\/span>&<\/span>iNum);<\/span><\/span>\n    iSp_cnt <\/span>=<\/span> iNum <\/span>-<\/span> <\/span>1<\/span>;<\/span><\/span>\n    iNum_cnt <\/span>=<\/span> <\/span>1<\/span>;<\/span><\/span>\n<\/span>\n    <\/span>for<\/span>(i<\/span>=<\/span>0<\/span>;i<\/span><<\/span>iNum;i<\/span>++<\/span>)<\/span><\/span>\n    {<\/span><\/span>\n        iVal <\/span>=<\/span> <\/span>1<\/span>;<\/span><\/span>\n        <\/span>for<\/span>(j<\/span>=<\/span>0<\/span>;j<\/span><<\/span>iSp_cnt;j<\/span>++<\/span>)<\/span><\/span>\n        {<\/span><\/span>\n            <\/span>printf<\/span>(<\/span>"  "<\/span>);<\/span><\/span>\n        }<\/span><\/span>\n        <\/span>for<\/span>(k<\/span>=<\/span>0<\/span>;k<\/span><<\/span>iNum_cnt;k<\/span>++<\/span>)<\/span><\/span>\n        {<\/span><\/span>\n            <\/span>if<\/span>(k <\/span><=<\/span> iNum_cnt<\/span>\/<\/span>2<\/span>)<\/span><\/span>\n            {<\/span><\/span>\n                <\/span>printf<\/span>(<\/span>"<\/span>%d<\/span> "<\/span>, iVal);<\/span><\/span>\n                iVal<\/span>++<\/span>;<\/span><\/span>\n            }<\/span><\/span>\n            <\/span>else<\/span><\/span>\n            {<\/span><\/span>\n                iVal<\/span>--<\/span>;<\/span><\/span>\n                <\/span>printf<\/span>(<\/span>"<\/span>%d<\/span> "<\/span>, iVal<\/span>-<\/span>1<\/span>);<\/span><\/span>\n            }<\/span><\/span>\n        }<\/span><\/span>\n        <\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n        iSp_cnt<\/span>--<\/span>;<\/span><\/span>\n        iNum_cnt <\/span>+=<\/span> <\/span>2<\/span>;<\/span><\/span>\n    }<\/span><\/span>\n    <\/span>return<\/span> <\/span>0<\/span>;<\/span><\/span>\n}<\/span><\/span>\n<\/span><\/code><\/pre><\/div>\n\n\n\n
      Output<\/h4>\n\n\n\n
      <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
      \/****************************<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>number<\/span> <\/span>of<\/span> <\/span>rows<\/span> <\/span>:<\/span> <\/span>3<\/span><\/span>\n    <\/span>1<\/span> <\/span><\/span>\n  <\/span>1<\/span> <\/span>2<\/span> <\/span>1<\/span> <\/span><\/span>\n1<\/span> <\/span>2<\/span> <\/span>3<\/span> <\/span>2<\/span> <\/span>1<\/span> <\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>number<\/span> <\/span>of<\/span> <\/span>rows<\/span> <\/span>:<\/span> <\/span>4<\/span><\/span>\n      <\/span>1<\/span> <\/span><\/span>\n    <\/span>1<\/span> <\/span>2<\/span> <\/span>1<\/span> <\/span><\/span>\n  <\/span>1<\/span> <\/span>2<\/span> <\/span>3<\/span> <\/span>2<\/span> <\/span>1<\/span> <\/span><\/span>\n1<\/span> <\/span>2<\/span> <\/span>3<\/span> <\/span>4<\/span> <\/span>3<\/span> <\/span>2<\/span> <\/span>1<\/span> <\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>number<\/span> <\/span>of<\/span> <\/span>rows<\/span> <\/span>:<\/span> <\/span>5<\/span><\/span>\n        <\/span>1<\/span> <\/span><\/span>\n      <\/span>1<\/span> <\/span>2<\/span> <\/span>1<\/span> <\/span><\/span>\n    <\/span>1<\/span> <\/span>2<\/span> <\/span>3<\/span> <\/span>2<\/span> <\/span>1<\/span> <\/span><\/span>\n  <\/span>1<\/span> <\/span>2<\/span> <\/span>3<\/span> <\/span>4<\/span> <\/span>3<\/span> <\/span>2<\/span> <\/span>1<\/span> <\/span><\/span>\n1<\/span> <\/span>2<\/span> <\/span>3<\/span> <\/span>4<\/span> <\/span>5<\/span> <\/span>4<\/span> <\/span>3<\/span> <\/span>2<\/span> <\/span>1<\/span> <\/span><\/span>\n***************************************<\/span>\/<\/span><\/span>\n<\/span><\/code><\/pre><\/div>\n\n\n\n
      Question 5 <\/h2>\n\n\n\n
      Binary Search<\/h3>\n\n\n\n
      Implement Binary Search on Integers.<\/strong><\/strong><\/p>\n\n\n\n
      C Code<\/h4>\n\n\n\n
      <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
      \/***************************************************************************<\/span><\/span>\n*File\t\t\t: A05BinarySearchIntegers.c<\/span><\/span>\n*Description\t: Program to perform a binary search on 1D Array of Integers\t<\/span><\/span>\n*Author\t\t: Prabodh C P<\/span><\/span>\n*Compiler\t\t: gcc compiler, Ubuntu 22.04<\/span><\/span>\n*Date\t\t\t: 10 August 2022<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\n<\/span>\n#include<\/span><stdio.h><\/span><\/span>\n#include<\/span><stdlib.h><\/span><\/span>\n<\/span>\n\/***************************************************************************<\/span><\/span>\n*Function\t\t\t: \tmain<\/span><\/span>\n*Input parameters\t:\tno parameters<\/span><\/span>\n*RETURNS\t\t\t:\t0 on success<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\n<\/span>\nint<\/span> <\/span>main<\/span>(<\/span>void<\/span>)<\/span><\/span>\n{<\/span><\/span>\n\t<\/span>int<\/span> <\/span>iaArr<\/span>[<\/span>100<\/span>],iNum,i,iMid,iLow,iHigh,iFound,iKey;<\/span><\/span>\n<\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Enter the number of elements<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t<\/span>scanf<\/span>(<\/span>"<\/span>%d<\/span>"<\/span>,<\/span>&<\/span>iNum);<\/span><\/span>\n<\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Enter the elements in ascending order<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t<\/span>for<\/span>(i<\/span>=<\/span>0<\/span>;i<\/span><<\/span>iNum;i<\/span>++<\/span>)<\/span><\/span>\n\t\t<\/span>scanf<\/span>(<\/span>"<\/span>%d<\/span>"<\/span>,<\/span>&<\/span>iaArr<\/span>[i]);<\/span><\/span>\n<\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Enter the key element<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t<\/span>scanf<\/span>(<\/span>"<\/span>%d<\/span>"<\/span>,<\/span>&<\/span>iKey);<\/span><\/span>\n<\/span>\n\tiFound <\/span>=<\/span> <\/span>0<\/span>;<\/span><\/span>\n\tiLow <\/span>=<\/span> <\/span>0<\/span>;<\/span><\/span>\n\tiHigh <\/span>=<\/span> iNum<\/span>-<\/span>1<\/span>;<\/span><\/span>\n\t<\/span>while<\/span>(iLow <\/span><=<\/span> iHigh)<\/span><\/span>\n\t{\t<\/span><\/span>\n\t\tiMid <\/span>=<\/span> (iLow<\/span>+<\/span>iHigh)<\/span>\/<\/span>2<\/span>;<\/span><\/span>\n\t\t<\/span>if<\/span>(iKey <\/span>==<\/span> <\/span>iaArr<\/span>[iMid])<\/span><\/span>\n\t\t{<\/span><\/span>\n\t\t\tiFound <\/span>=<\/span> <\/span>1<\/span>;<\/span><\/span>\n\t\t\t<\/span>break<\/span>;<\/span><\/span>\n\t\t}<\/span><\/span>\n\t\t<\/span>else<\/span> <\/span>if<\/span>(iKey <\/span><<\/span> <\/span>iaArr<\/span>[iMid])<\/span><\/span>\n\t\t{<\/span><\/span>\n\t\t\tiHigh <\/span>=<\/span> iMid<\/span>-<\/span>1<\/span>;<\/span><\/span>\n\t\t}<\/span><\/span>\n\t\t<\/span>else<\/span><\/span>\n\t\t{<\/span><\/span>\n\t\t\tiLow <\/span>=<\/span> iMid<\/span>+<\/span>1<\/span>;<\/span><\/span>\n\t\t}<\/span><\/span>\n\t}<\/span><\/span>\n<\/span>\n\t<\/span>if<\/span>(iFound)<\/span><\/span>\n\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Key element <\/span>%d<\/span> found at position <\/span>%d\\n<\/span>"<\/span>,iKey,iMid<\/span>+<\/span>1<\/span>);<\/span><\/span>\n\t<\/span>else<\/span><\/span>\n\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Key element not found<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n<\/span>\n\t<\/span>return<\/span> <\/span>0<\/span>;<\/span><\/span>\n}<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
      Output<\/h4>\n\n\n\n
      <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
      \/****************************<\/span><\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>number<\/span> <\/span>of<\/span> <\/span>elements<\/span><\/span>\n5<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>elements<\/span> <\/span>in<\/span> <\/span>ascending<\/span> <\/span>order<\/span><\/span>\n1<\/span> <\/span>3<\/span> <\/span>5<\/span> <\/span>7<\/span> <\/span>9<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>key<\/span> <\/span>element<\/span><\/span>\n8<\/span><\/span>\n<\/span>\nKey<\/span> <\/span>element<\/span> <\/span>not<\/span> <\/span>found<\/span><\/span>\n===============================================<\/span><\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>number<\/span> <\/span>of<\/span> <\/span>elements<\/span><\/span>\n4<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>elements<\/span> <\/span>in<\/span> <\/span>ascending<\/span> <\/span>order<\/span><\/span>\n1<\/span> <\/span>4<\/span> <\/span>5<\/span> <\/span>7<\/span> <\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>key<\/span> <\/span>element<\/span><\/span>\n5<\/span><\/span>\n<\/span>\nKey<\/span> <\/span>element<\/span> <\/span>5<\/span> <\/span>found<\/span> <\/span>at<\/span> <\/span>position<\/span> <\/span>3<\/span><\/span>\n===============================================<\/span><\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>number<\/span> <\/span>of<\/span> <\/span>elements<\/span><\/span>\n6<\/span><\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>elements<\/span> <\/span>in<\/span> <\/span>ascending<\/span> <\/span>order<\/span><\/span>\n2<\/span> <\/span>4<\/span> <\/span>6<\/span> <\/span>8<\/span> <\/span>9<\/span> <\/span>10<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>key<\/span> <\/span>element<\/span><\/span>\n9<\/span><\/span>\n<\/span>\nKey<\/span> <\/span>element<\/span> <\/span>9<\/span> <\/span>found<\/span> <\/span>at<\/span> <\/span>position<\/span> <\/span>5<\/span><\/span>\n***************************************<\/span>\/<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
      Question 6 <\/h2>\n\n\n\n
      Matrix Multiplication<\/h3>\n\n\n\n
      Implement Matrix multiplication and validate the rules of multiplication.<\/strong><\/p>\n\n\n\n
      C Code<\/h4>\n\n\n\n
      <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
      \/***************************************************************************<\/span><\/span>\n*File\t\t\t: A06MatrixMul.c<\/span><\/span>\n*Description\t: Program to implement Matrix Multiplication<\/span><\/span>\n*Author\t\t: Prabodh C P<\/span><\/span>\n*Compiler\t\t: gcc compiler, Ubuntu 22.04<\/span><\/span>\n*Date\t\t\t: 10 August 2022<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\n<\/span>\n#include<\/span><stdio.h><\/span><\/span>\n#include<\/span><stdlib.h><\/span><\/span>\n<\/span>\n\/***************************************************************************<\/span><\/span>\n*Function\t\t\t: \tmain<\/span><\/span>\n*Input parameters\t:\tno parameters<\/span><\/span>\n*RETURNS\t\t\t:\t0 on success<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\n<\/span>\nint<\/span> <\/span>main<\/span>(<\/span>void<\/span>)<\/span><\/span>\n{<\/span><\/span>\n\t<\/span>int<\/span> iM, iN, iP, iQ, i, j, k, <\/span>iaMat1<\/span>[<\/span>10<\/span>][<\/span>10<\/span>], <\/span>iaMat2<\/span>[<\/span>10<\/span>][<\/span>10<\/span>];<\/span><\/span>\n\t<\/span>int<\/span> <\/span>iaProd<\/span>[<\/span>10<\/span>][<\/span>10<\/span>] <\/span>=<\/span> {<\/span>0<\/span>};<\/span><\/span>\n<\/span>\n<\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>*********************************************************"<\/span>);<\/span><\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>*<\/span>\\t<\/span>PROGRAM TO IMPLEMENT MATRIX MULIPLICATION<\/span>\\t<\/span>*<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t<\/span>printf<\/span>(<\/span>"*********************************************************"<\/span>);<\/span><\/span>\n<\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Enter the order of Matrix1<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t<\/span>scanf<\/span>(<\/span>"<\/span>%d%d<\/span>"<\/span>,<\/span>&<\/span>iM,<\/span>&<\/span>iN);<\/span><\/span>\n<\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Enter the order of Matrix2<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t<\/span>scanf<\/span>(<\/span>"<\/span>%d%d<\/span>"<\/span>,<\/span>&<\/span>iP,<\/span>&<\/span>iQ);<\/span><\/span>\n<\/span>\n\t<\/span>if<\/span>( iN <\/span>!=<\/span> iP)<\/span><\/span>\n\t{<\/span><\/span>\n\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Matrix Multiplication not possible<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t\t<\/span>exit<\/span>(<\/span>0<\/span>);<\/span><\/span>\n\t}<\/span><\/span>\n<\/span>\n<\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Enter the elements of Matrix 1<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t<\/span>for<\/span>(i<\/span>=<\/span>0<\/span>;i<\/span><<\/span>iM;i<\/span>++<\/span>)<\/span><\/span>\n\t\t<\/span>for<\/span>(j<\/span>=<\/span>0<\/span>;j<\/span><<\/span>iN;j<\/span>++<\/span>)<\/span><\/span>\n\t\t\t<\/span>scanf<\/span>(<\/span>"<\/span>%d<\/span>"<\/span>,<\/span>&<\/span>iaMat1<\/span>[i][j]);<\/span><\/span>\n<\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Enter the elements of Matrix 2<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t<\/span>for<\/span>(i<\/span>=<\/span>0<\/span>;i<\/span><<\/span>iP;i<\/span>++<\/span>)<\/span><\/span>\n\t\t<\/span>for<\/span>(j<\/span>=<\/span>0<\/span>;j<\/span><<\/span>iQ;j<\/span>++<\/span>)<\/span><\/span>\n\t\t\t<\/span>scanf<\/span>(<\/span>"<\/span>%d<\/span>"<\/span>,<\/span>&<\/span>iaMat2<\/span>[i][j]);<\/span><\/span>\n<\/span>\n<\/span>\n\t<\/span>for<\/span>(i<\/span>=<\/span>0<\/span>;i<\/span><<\/span>iM;i<\/span>++<\/span>)<\/span><\/span>\n\t{<\/span><\/span>\n\t\t<\/span>for<\/span>(j<\/span>=<\/span>0<\/span>;j<\/span><<\/span>iQ;j<\/span>++<\/span>)<\/span><\/span>\n\t\t{<\/span><\/span>\n\t\t\t<\/span>for<\/span>(k<\/span>=<\/span>0<\/span>;k<\/span><<\/span>iN;k<\/span>++<\/span>)<\/span><\/span>\n\t\t\t{<\/span><\/span>\n\t\t\t\t<\/span>iaProd<\/span>[i][j] <\/span>+=<\/span> <\/span>iaMat1<\/span>[i][k] <\/span>*<\/span> <\/span>iaMat2<\/span>[k][j];<\/span><\/span>\n\t\t\t}<\/span><\/span>\n\t\t}<\/span><\/span>\n\t}<\/span><\/span>\n<\/span>\n\/**************************************************************************************************<\/span><\/span>\n\t         |*|\t         |*|<\/span><\/span>\na00  a01  a02|*|b00  b01  b02|*|<\/span><\/span>\n\t         |*|\t         |*|<\/span><\/span>\na10  a11  a12|*|b10  b11  b12|*|<\/span><\/span>\n\t         |*|\t         |*|<\/span><\/span>\na20  a21  a22|*|b20  b21  b22|*|<\/span><\/span>\n\t         |*|\t         |*|<\/span><\/span>\n<\/span>\n(a00*b00+a01*b10+a02*b20) (a00*b01+a01*b11+a02*b21) (a00*b02+a01*b12+a02*b22)<\/span><\/span>\n(a10*b00+a11*b10+a12*b20) (a10*b01+a11*b11+a12*b21) (a10*b02+a11*b12+a12*b22)<\/span><\/span>\n(a20*b00+a21*b10+a22*b20) (a20*b01+a21*b11+a22*b21) (a20*b02+a21*b12+a22*b22)<\/span><\/span>\n**************************************************************************************************\/<\/span><\/span>\n<\/span>\n<\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Matrix 1<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n<\/span>\n\t<\/span>for<\/span>(i<\/span>=<\/span>0<\/span>;i<\/span><<\/span>iM;i<\/span>++<\/span>)<\/span><\/span>\n\t{<\/span><\/span>\n\t\t<\/span>for<\/span>(j<\/span>=<\/span>0<\/span>;j<\/span><<\/span>iN;j<\/span>++<\/span>)<\/span><\/span>\n\t\t{<\/span><\/span>\n\t\t\t<\/span>printf<\/span>(<\/span>"<\/span>%d\\t<\/span>"<\/span>,<\/span>iaMat1<\/span>[i][j]);<\/span><\/span>\n\t\t}<\/span><\/span>\n\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t}<\/span><\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n<\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Matrix 2<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n<\/span>\n\t<\/span>for<\/span>(i<\/span>=<\/span>0<\/span>;i<\/span><<\/span>iP;i<\/span>++<\/span>)<\/span><\/span>\n\t{<\/span><\/span>\n\t\t<\/span>for<\/span>(j<\/span>=<\/span>0<\/span>;j<\/span><<\/span>iQ;j<\/span>++<\/span>)<\/span><\/span>\n\t\t{<\/span><\/span>\n\t\t\t<\/span>printf<\/span>(<\/span>"<\/span>%d\\t<\/span>"<\/span>,<\/span>iaMat2<\/span>[i][j]);<\/span><\/span>\n\t\t}<\/span><\/span>\n\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t}<\/span><\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n<\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>The Product matrix is is <\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n<\/span>\n\t<\/span>for<\/span>(i<\/span>=<\/span>0<\/span>;i<\/span><<\/span>iM;i<\/span>++<\/span>)<\/span><\/span>\n\t{<\/span><\/span>\n\t\t<\/span>for<\/span>(j<\/span>=<\/span>0<\/span>;j<\/span><<\/span>iQ;j<\/span>++<\/span>)<\/span><\/span>\n\t\t{<\/span><\/span>\n\t\t\t<\/span>printf<\/span>(<\/span>"<\/span>%d\\t<\/span>"<\/span>,<\/span>iaProd<\/span>[i][j]);<\/span><\/span>\n\t\t}<\/span><\/span>\n\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t}<\/span><\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t<\/span>return<\/span> <\/span>0<\/span>;<\/span><\/span>\n}<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
      Output<\/h4>\n\n\n\n
      <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
      \/***************************************<\/span><\/span>\n<\/span>\n*********************************************************<\/span><\/span>\n*<\/span>\tPROGRAM TO IMPLEMENT MATRIX MULIPLICATION\t<\/span>*<\/span><\/span>\n*********************************************************<\/span><\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>order<\/span> <\/span>of<\/span> <\/span>Matrix1<\/span><\/span>\n2<\/span> <\/span>3<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>order<\/span> <\/span>of<\/span> <\/span>Matrix2<\/span><\/span>\n4<\/span> <\/span>5<\/span><\/span>\n<\/span>\nMatrix<\/span> <\/span>Multiplication<\/span> <\/span>not<\/span> <\/span>possible<\/span><\/span>\n<\/span>\n*********************************************************<\/span><\/span>\n*<\/span>\tPROGRAM TO IMPLEMENT MATRIX MULIPLICATION\t<\/span>*<\/span><\/span>\n*********************************************************<\/span><\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>order<\/span> <\/span>of<\/span> <\/span>Matrix1<\/span><\/span>\n2<\/span> <\/span>3<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>order<\/span> <\/span>of<\/span> <\/span>Matrix2<\/span><\/span>\n3<\/span> <\/span>2<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>elements<\/span> <\/span>of<\/span> <\/span>Matrix<\/span> <\/span>1<\/span><\/span>\n1<\/span> <\/span>2<\/span> <\/span>3<\/span><\/span>\n4<\/span> <\/span>5<\/span> <\/span>6<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>elements<\/span> <\/span>of<\/span> <\/span>Matrix<\/span> <\/span>2<\/span><\/span>\n1<\/span> <\/span>2<\/span><\/span>\n3<\/span> <\/span>4<\/span><\/span>\n5<\/span> <\/span>6<\/span><\/span>\n<\/span>\nMatrix<\/span> <\/span>1<\/span><\/span>\n1<\/span>\t<\/span>2<\/span>\t<\/span>3<\/span>\t<\/span><\/span>\n4<\/span>\t<\/span>5<\/span>\t<\/span>6<\/span>\t<\/span><\/span>\n<\/span>\nMatrix<\/span> <\/span>2<\/span><\/span>\n1<\/span>\t<\/span>2<\/span>\t<\/span><\/span>\n3<\/span>\t<\/span>4<\/span>\t<\/span><\/span>\n5<\/span>\t<\/span>6<\/span>\t<\/span><\/span>\n<\/span>\nThe<\/span> <\/span>Product<\/span> <\/span>matrix<\/span> <\/span>is<\/span> <\/span>is<\/span> <\/span><\/span>\n22<\/span>\t<\/span>28<\/span>\t<\/span><\/span>\n49<\/span>\t<\/span>64<\/span>\t<\/span><\/span>\n<\/span>\n*********************************************************<\/span><\/span>\n*<\/span>\tPROGRAM TO IMPLEMENT MATRIX MULIPLICATION\t<\/span>*<\/span><\/span>\n*********************************************************<\/span><\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>order<\/span> <\/span>of<\/span> <\/span>Matrix1<\/span><\/span>\n2<\/span> <\/span>2<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>order<\/span> <\/span>of<\/span> <\/span>Matrix2<\/span><\/span>\n2<\/span> <\/span>2<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>elements<\/span> <\/span>of<\/span> <\/span>Matrix<\/span> <\/span>1<\/span><\/span>\n1<\/span> <\/span>2<\/span> <\/span><\/span>\n3<\/span> <\/span>4<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>elements<\/span> <\/span>of<\/span> <\/span>Matrix<\/span> <\/span>2<\/span><\/span>\n1<\/span> <\/span>0<\/span><\/span>\n0<\/span> <\/span>1<\/span><\/span>\n<\/span>\nMatrix<\/span> <\/span>1<\/span><\/span>\n1<\/span>\t<\/span>2<\/span>\t<\/span><\/span>\n3<\/span>\t<\/span>4<\/span>\t<\/span><\/span>\n<\/span>\nMatrix<\/span> <\/span>2<\/span><\/span>\n1<\/span>\t<\/span>0<\/span>\t<\/span><\/span>\n0<\/span>\t<\/span>1<\/span>\t<\/span><\/span>\n<\/span>\nThe<\/span> <\/span>Product<\/span> <\/span>matrix<\/span> <\/span>is<\/span> <\/span>is<\/span> <\/span><\/span>\n1<\/span>\t<\/span>2<\/span>\t<\/span><\/span>\n3<\/span>\t<\/span>4<\/span>\t<\/span><\/span>\n***************************************<\/span>\/<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
      Question 7 <\/h2>\n\n\n\n
      Compute Sine and Cosine of an Angle<\/h3>\n\n\n\n
      Compute sin(x)\/cos(x) using Taylor series approximation. Compare your result with the built-in library function. Print both the results with appropriate inferences.<\/strong><\/p>\n\n\n\n
      C Code<\/h4>\n\n\n\n
      <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
      \/***************************************************************************<\/span><\/span>\n*File\t\t\t: A07SineCosAngle.c<\/span><\/span>\n*Description\t: Program to calculate Sin(x)\/Cos(x) using Taylor series<\/span><\/span>\n*Author\t\t: Prabodh C P<\/span><\/span>\n*Compiler\t\t: gcc compiler, Ubuntu 22.04<\/span><\/span>\n*Date\t\t\t: 10 August 2022<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\n#include<\/span><stdio.h><\/span><\/span>\n#include<\/span><stdlib.h><\/span><\/span>\n#include<\/span> <\/span><math.h><\/span><\/span>\n\/***************************************************************************<\/span><\/span>\n*Function\t\t\t: \tmain<\/span><\/span>\n*Input parameters\t:\tno parameters<\/span><\/span>\n*RETURNS\t\t\t:\t0 on success<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\nint<\/span> <\/span>main<\/span>()<\/span><\/span>\n{<\/span><\/span>\n\t<\/span>float<\/span> fAngD, fAngR;<\/span><\/span>\n\t<\/span>float<\/span> fTerm, fNum, fDen, fSVal,fCVal;<\/span><\/span>\n\t<\/span>int<\/span> i,iNum;<\/span><\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Enter the Angle : "<\/span>);\t<\/span>scanf<\/span>(<\/span>"<\/span>%f<\/span>"<\/span>,<\/span>&<\/span>fAngD);<\/span><\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Enter the Number of terms : "<\/span>);\t\t<\/span>scanf<\/span>(<\/span>"<\/span>%d<\/span>"<\/span>,<\/span>&<\/span>iNum);<\/span><\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Input Angle = <\/span>%g\\n<\/span>"<\/span>,fAngD);\t<\/span><\/span>\n\t<\/span>printf<\/span>(<\/span>"No of terms = <\/span>%d\\n<\/span>"<\/span>,iNum);<\/span><\/span>\n<\/span>\n\tfAngR<\/span>=<\/span> (fAngD<\/span>*<\/span>M_PI)<\/span>\/<\/span>180<\/span> ;<\/span><\/span>\n\t<\/span><\/span>\n\t<\/span>\/\/Calculation of Sine of an angle using Taylor's series<\/span><\/span>\n\tfNum<\/span>=<\/span>fAngR;<\/span><\/span>\n\tfDen<\/span>=<\/span>1.0<\/span>;<\/span><\/span>\n\tfSVal <\/span>=<\/span>0.0<\/span>;<\/span><\/span>\n\tfTerm<\/span>=<\/span>fNum<\/span>\/<\/span>fDen;<\/span><\/span>\n\t<\/span>for<\/span>(i<\/span>=<\/span>1<\/span>;i<\/span><=<\/span>iNum;i<\/span>++<\/span>)<\/span><\/span>\n\t{<\/span><\/span>\n\t\tfSVal <\/span>=<\/span> fSVal <\/span>+<\/span> fTerm;<\/span><\/span>\n\t\tfNum <\/span>=<\/span> <\/span>-<\/span>fNum <\/span>*<\/span> fAngR <\/span>*<\/span> fAngR ;<\/span><\/span>\n\t\tfDen <\/span>=<\/span> fDen <\/span>*<\/span> (<\/span>2<\/span>*<\/span>i) <\/span>*<\/span> (<\/span>2<\/span>*<\/span>i<\/span>+<\/span>1<\/span>);<\/span><\/span>\n\t\tfTerm <\/span>=<\/span> fNum<\/span>\/<\/span>fDen;<\/span><\/span>\n\t}<\/span><\/span>\n<\/span>\n\t<\/span>\/\/Calculation of Cosine of an angle using Taylor's series<\/span><\/span>\n\tfNum<\/span>=<\/span>1.0<\/span>;<\/span><\/span>\n\tfDen<\/span>=<\/span>1.0<\/span>;<\/span><\/span>\n\tfCVal <\/span>=<\/span>0.0<\/span>;<\/span><\/span>\n\tfTerm<\/span>=<\/span>1.0<\/span>;<\/span><\/span>\n\t<\/span>for<\/span>(i<\/span>=<\/span>1<\/span>;i<\/span><=<\/span>iNum;i<\/span>++<\/span>)<\/span><\/span>\n\t{<\/span><\/span>\n\t\tfCVal <\/span>=<\/span> fCVal <\/span>+<\/span> fTerm;<\/span><\/span>\n\t\tfNum <\/span>=<\/span> <\/span>-<\/span>fNum <\/span>*<\/span> fAngR <\/span>*<\/span> fAngR ;<\/span><\/span>\n\t\tfDen <\/span>=<\/span> fDen <\/span>*<\/span> (<\/span>2<\/span>*<\/span>i) <\/span>*<\/span> (<\/span>2<\/span>*<\/span>i<\/span>-<\/span>1<\/span>);<\/span><\/span>\n\t\tfTerm <\/span>=<\/span> fNum<\/span>\/<\/span>fDen;<\/span><\/span>\n\t}<\/span><\/span>\n\t<\/span><\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Calculated value is :<\/span>\\n<\/span>Sin(<\/span>%g<\/span>)\/Cos(<\/span>%g<\/span>) = <\/span>%g\\n<\/span>"<\/span>,fAngD, fAngD, fSVal<\/span>\/<\/span>fCVal);<\/span><\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Built In function value is :<\/span>\\n<\/span>Sin(<\/span>%g<\/span>)\/Cos(<\/span>%g<\/span>) = <\/span>%g\\n<\/span>"<\/span>, fAngD, fAngD, <\/span>sin<\/span>(fAngR)<\/span>\/<\/span>cos<\/span>(fAngR));<\/span><\/span>\n<\/span>\n\t<\/span>return<\/span> <\/span>0<\/span>;<\/span><\/span>\n}<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
      Output<\/h4>\n\n\n\n
      <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
      \/***************************************<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>Angle<\/span> <\/span>:<\/span> <\/span>60<\/span><\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>Number<\/span> <\/span>of<\/span> <\/span>terms<\/span> <\/span>:<\/span> <\/span>12<\/span><\/span>\n<\/span>\nInput<\/span> <\/span>Angle<\/span> <\/span>=<\/span> <\/span>60<\/span>\t<\/span>No<\/span> <\/span>of<\/span> <\/span>terms<\/span> <\/span>=<\/span> <\/span>12<\/span><\/span>\nCalculated<\/span> <\/span>value<\/span> <\/span>is<\/span> <\/span>:<\/span><\/span>\nSin(60<\/span>)\/Cos(<\/span>60<\/span>) = 1.73205<\/span><\/span>\n<\/span>\nBuilt<\/span> <\/span>In<\/span> <\/span>function<\/span> <\/span>value<\/span> <\/span>is<\/span> <\/span>:<\/span><\/span>\nSin(60<\/span>)\/Cos(<\/span>60<\/span>) = 1.73205<\/span><\/span>\n=========================================<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>Angle<\/span> <\/span>:<\/span> <\/span>30<\/span><\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>Number<\/span> <\/span>of<\/span> <\/span>terms<\/span> <\/span>:<\/span> <\/span>3<\/span><\/span>\n<\/span>\nInput<\/span> <\/span>Angle<\/span> <\/span>=<\/span> <\/span>30<\/span>\t<\/span>No<\/span> <\/span>of<\/span> <\/span>terms<\/span> <\/span>=<\/span> <\/span>3<\/span><\/span>\nCalculated<\/span> <\/span>value<\/span> <\/span>is<\/span> <\/span>:<\/span><\/span>\nSin(30<\/span>)\/Cos(<\/span>30<\/span>) = 0.577334<\/span><\/span>\n<\/span>\nBuilt<\/span> <\/span>In<\/span> <\/span>function<\/span> <\/span>value<\/span> <\/span>is<\/span> <\/span>:<\/span><\/span>\nSin(30<\/span>)\/Cos(<\/span>30<\/span>) = 0.57735<\/span><\/span>\n=========================================<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>Angle<\/span> <\/span>:<\/span> <\/span>45<\/span><\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>Number<\/span> <\/span>of<\/span> <\/span>terms<\/span> <\/span>:<\/span> <\/span>11<\/span><\/span>\n<\/span>\nInput<\/span> <\/span>Angle<\/span> <\/span>=<\/span> <\/span>45<\/span>\t<\/span>No<\/span> <\/span>of<\/span> <\/span>terms<\/span> <\/span>=<\/span> <\/span>11<\/span><\/span>\nCalculated<\/span> <\/span>value<\/span> <\/span>is<\/span> <\/span>:<\/span><\/span>\nSin(45<\/span>)\/Cos(<\/span>45<\/span>) = 1<\/span><\/span>\n<\/span>\nBuilt<\/span> <\/span>In<\/span> <\/span>function<\/span> <\/span>value<\/span> <\/span>is<\/span> <\/span>:<\/span><\/span>\nSin(45<\/span>)\/Cos(<\/span>45<\/span>) = 1<\/span><\/span>\n***************************************<\/span>\/<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
      Question 8 <\/h2>\n\n\n\n
      Bubble sort.<\/h3>\n\n\n\n
      Sort the given set of N numbers using Bubble sort.<\/strong><\/p>\n\n\n\n
      C Code<\/h4>\n\n\n\n
      <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
      \/***************************************************************************<\/span><\/span>\n*File\t\t\t: A08BubbleSort.c<\/span><\/span>\n*Description\t: Program to implement Bubble Sort Algorithm<\/span><\/span>\n*Author\t\t: Prabodh C P<\/span><\/span>\n*Compiler\t\t: gcc compiler, Ubuntu 22.04<\/span><\/span>\n*Date\t\t\t: 10 August 2022<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\n<\/span>\n#include<\/span><stdio.h><\/span><\/span>\n#include<\/span><stdlib.h><\/span><\/span>\n<\/span>\n\/***************************************************************************<\/span><\/span>\n*Function\t\t\t: \tmain<\/span><\/span>\n*Input parameters\t:\tno parameters<\/span><\/span>\n*RETURNS\t\t\t:\t0 on success<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\n<\/span>\nint<\/span> <\/span>main<\/span>(<\/span>void<\/span>)<\/span><\/span>\n{<\/span><\/span>\n\t<\/span>int<\/span> iNum, i, j, <\/span>iaArr<\/span>[<\/span>10<\/span>], iTemp;<\/span><\/span>\n<\/span>\n<\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>*************************************************"<\/span>);<\/span><\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>*<\/span>\\t<\/span>PROGRAM TO IMPLEMENT BUBBLE SORT<\/span>\\t<\/span>*<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t<\/span>printf<\/span>(<\/span>"*************************************************"<\/span>);<\/span><\/span>\n<\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Enter no of elements<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t<\/span>scanf<\/span>(<\/span>"<\/span>%d<\/span>"<\/span>,<\/span>&<\/span>iNum);<\/span><\/span>\n<\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Enter the elements<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t<\/span>for<\/span>(i<\/span>=<\/span>0<\/span>;i<\/span><<\/span>iNum;i<\/span>++<\/span>)<\/span><\/span>\n\t\t<\/span>scanf<\/span>(<\/span>"<\/span>%d<\/span>"<\/span>,<\/span>&<\/span>iaArr<\/span>[i]);<\/span><\/span>\n<\/span>\n\t<\/span>for<\/span>(i<\/span>=<\/span>0<\/span>;i<\/span><<\/span>iNum;i<\/span>++<\/span>)<\/span><\/span>\n\t{<\/span><\/span>\n\t\t<\/span>for<\/span>(j<\/span>=<\/span>0<\/span>;j<\/span><<\/span>iNum<\/span>-<\/span>i<\/span>-<\/span>1<\/span>;j<\/span>++<\/span>)<\/span><\/span>\n\t\t{<\/span><\/span>\n\t\t\t<\/span>if<\/span>(<\/span>iaArr<\/span>[j] <\/span>><\/span> <\/span>iaArr<\/span>[j<\/span>+<\/span>1<\/span>])<\/span><\/span>\n\t\t\t{<\/span><\/span>\n\t\t\t\tiTemp <\/span>=<\/span> <\/span>iaArr<\/span>[j];<\/span><\/span>\n\t\t\t\t<\/span>iaArr<\/span>[j] <\/span>=<\/span> <\/span>iaArr<\/span>[j<\/span>+<\/span>1<\/span>];<\/span><\/span>\n\t\t\t\t<\/span>iaArr<\/span>[j<\/span>+<\/span>1<\/span>] <\/span>=<\/span> iTemp;<\/span><\/span>\n\t\t\t}<\/span><\/span>\n<\/span>\n\/*Code to show the program trace*\/<\/span>\t\t<\/span><\/span>\n\/*\t\t\tprintf("\\nIteration i=%d, j=%d\\n",i,j);*\/<\/span><\/span>\n\/*\t\t\tfor(k=0;k<iNum;k++)*\/<\/span><\/span>\n\/*\t\t\t\tprintf("%d\\t",iaArr[k]);*\/<\/span><\/span>\n\t\t}<\/span><\/span>\n<\/span>\n\t}<\/span><\/span>\n<\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>The Sorted array is <\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n<\/span>\n\t<\/span>for<\/span>(i<\/span>=<\/span>0<\/span>;i<\/span><<\/span>iNum;i<\/span>++<\/span>)<\/span><\/span>\n\t\t<\/span>printf<\/span>(<\/span>"<\/span>%d\\t<\/span>"<\/span>,<\/span>iaArr<\/span>[i]);<\/span><\/span>\n<\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t<\/span>return<\/span> <\/span>0<\/span>;<\/span><\/span>\n}<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
      Output<\/h4>\n\n\n\n
      <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
      \/***************************************<\/span><\/span>\n*************************************************<\/span><\/span>\n*<\/span>\tPROGRAM TO IMPLEMENT BUBBLE SORT\t<\/span>*<\/span><\/span>\n*************************************************<\/span><\/span>\nEnter<\/span> <\/span>no<\/span> <\/span>of<\/span> <\/span>elements<\/span><\/span>\n5<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>elements<\/span><\/span>\n2<\/span> <\/span>1<\/span> <\/span>6<\/span> <\/span>5<\/span> <\/span>7<\/span><\/span>\n<\/span>\nThe<\/span> <\/span>Sorted<\/span> <\/span>array<\/span> <\/span>is<\/span> <\/span><\/span>\n1<\/span>\t<\/span>2<\/span>\t<\/span>5<\/span>\t<\/span>6<\/span>\t<\/span>7<\/span>\t<\/span><\/span>\n<\/span>\n*************************************************<\/span><\/span>\n*<\/span>\tPROGRAM TO IMPLEMENT BUBBLE SORT\t<\/span>*<\/span><\/span>\n*************************************************<\/span><\/span>\nEnter<\/span> <\/span>no<\/span> <\/span>of<\/span> <\/span>elements<\/span><\/span>\n6<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>elements<\/span><\/span>\n9<\/span> <\/span>7<\/span> <\/span>5<\/span> <\/span>3<\/span> <\/span>1<\/span> <\/span>0<\/span><\/span>\n<\/span>\nThe<\/span> <\/span>Sorted<\/span> <\/span>array<\/span> <\/span>is<\/span> <\/span><\/span>\n0<\/span>\t<\/span>1<\/span>\t<\/span>3<\/span>\t<\/span>5<\/span>\t<\/span>7<\/span>\t<\/span>9<\/span>\t<\/span><\/span>\n***************************************<\/span>\/<\/span><\/span>\n<\/span><\/code><\/pre><\/div>\n\n\n\n
      Question 9 <\/h2>\n\n\n\n
      String Operations<\/h3>\n\n\n\n
      Write functions to implement string operations such as compare, concatenate, and find string length. Use the parameter passing techniques.<\/strong><\/p>\n\n\n\n
      C Code<\/h4>\n\n\n\n
      <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
      \/***************************************************************************<\/span><\/span>\n*File\t\t\t: A09StringFunctions.c<\/span><\/span>\n*Description\t: Program to implement string operations as functions<\/span><\/span>\n*Author\t\t: Prabodh C P<\/span><\/span>\n*Compiler\t\t: gcc compiler, Ubuntu 22.04<\/span><\/span>\n*Date\t\t\t: 10 August 2022<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\n<\/span>\n#include<\/span><stdio.h><\/span><\/span>\n#include<\/span><stdlib.h><\/span><\/span>\n<\/span>\nint<\/span> <\/span>fnMyStrCmp<\/span>(<\/span>const<\/span> <\/span>char*<\/span>, <\/span>const<\/span> <\/span>char*<\/span>);<\/span><\/span>\nvoid<\/span> <\/span>fnMyStrCat<\/span>(<\/span>char*<\/span>, <\/span>const<\/span> <\/span>char*<\/span>);<\/span><\/span>\nint<\/span> <\/span>fnMyStrLen<\/span>(<\/span>const<\/span> <\/span>char*<\/span>);<\/span><\/span>\n<\/span>\n\/***************************************************************************<\/span><\/span>\n*Function\t\t: \tmain<\/span><\/span>\n*Input parameters\t:\tno parameters<\/span><\/span>\n*RETURNS\t\t:\t0 on success<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\n<\/span>\nint<\/span> <\/span>main<\/span>()<\/span><\/span>\n{<\/span><\/span>\n\t<\/span>int<\/span> iChoice;<\/span><\/span>\n\t<\/span>char<\/span> <\/span>acStr1<\/span>[<\/span>30<\/span>], <\/span>acStr2<\/span>[<\/span>30<\/span>];<\/span><\/span>\n\t<\/span>int<\/span> iLen;<\/span><\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>=====================<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t<\/span>printf<\/span>(<\/span>"STRING OPERATIONS"<\/span>);<\/span><\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>=====================<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t<\/span>for<\/span>(;;)<\/span><\/span>\n\t{<\/span><\/span>\n\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Enter two strings<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>String 1 : "<\/span>); \t<\/span>scanf<\/span>(<\/span>"<\/span>%s<\/span>"<\/span>, acStr1);<\/span><\/span>\n\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>String 2 : "<\/span>); \t<\/span>scanf<\/span>(<\/span>"<\/span>%s<\/span>"<\/span>, acStr2);<\/span><\/span>\n\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>1.String Compare<\/span>\\n<\/span>2.String Concatenate<\/span>\\n<\/span>3.String Length"<\/span>);<\/span><\/span>\n\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Enter your choice : "<\/span>);\t<\/span>scanf<\/span>(<\/span>"<\/span>%d<\/span>"<\/span>, <\/span>&<\/span>iChoice);\t<\/span><\/span>\n\t\t<\/span>switch<\/span>(iChoice)<\/span><\/span>\n\t\t{<\/span><\/span>\n\t\t\t<\/span>case<\/span> <\/span>1<\/span>: <\/span>if<\/span>(<\/span>fnMyStrCmp<\/span>(acStr1, acStr2) <\/span>==<\/span> <\/span>0<\/span>)<\/span><\/span>\n\t\t\t\t\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Two strings are equal"<\/span>);<\/span><\/span>\n\t\t\t\t\t<\/span>else<\/span> <\/span>if<\/span>(<\/span>fnMyStrCmp<\/span>(acStr1, acStr2) <\/span>><\/span> <\/span>0<\/span>)<\/span><\/span>\n\t\t\t\t\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>String <\/span>%s<\/span> is greater than String <\/span>%s<\/span>"<\/span>, acStr1, acStr2);<\/span><\/span>\n\t\t\t\t\t<\/span>else<\/span><\/span>\n\t\t\t\t\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>String <\/span>%s<\/span> is greater than String <\/span>%s<\/span>"<\/span>, acStr2, acStr1);<\/span><\/span>\n\t\t\t\t\t<\/span>break<\/span>;<\/span><\/span>\n\t\t\t\t\t<\/span><\/span>\n\t\t\t<\/span>case<\/span> <\/span>2<\/span>:\t<\/span>fnMyStrCat<\/span>(acStr1, acStr2);<\/span><\/span>\n\t\t\t\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Concatenated String is<\/span>\\n%s<\/span>"<\/span>, acStr1);<\/span><\/span>\n\t\t\t\t\t<\/span>break<\/span>;<\/span><\/span>\n\t\t\t<\/span><\/span>\n\t\t\t<\/span>case<\/span> <\/span>3<\/span>:\tiLen <\/span>=<\/span> <\/span>fnMyStrLen<\/span>(acStr1);<\/span><\/span>\n\t\t\t\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Length of String <\/span>%s<\/span> is <\/span>%d\\n<\/span>"<\/span>, acStr1, iLen);<\/span><\/span>\n\t\t\t\t\tiLen <\/span>=<\/span> <\/span>fnMyStrLen<\/span>(acStr2);<\/span><\/span>\n\t\t\t\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Length of String <\/span>%s<\/span> is <\/span>%d\\n<\/span>"<\/span>, acStr2, iLen);<\/span><\/span>\n\t\t\t\t\t<\/span>break<\/span>;<\/span><\/span>\n\t\t\t\t\t<\/span><\/span>\n\t\t}<\/span><\/span>\n\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Press 1 to continue and 0 to quit : "<\/span>);<\/span><\/span>\n\t\t<\/span>scanf<\/span>(<\/span>"<\/span>%d<\/span>"<\/span>, <\/span>&<\/span>iChoice);<\/span><\/span>\n\t\t<\/span>if<\/span>(<\/span>0<\/span>==<\/span>iChoice)<\/span><\/span>\n\t\t{<\/span><\/span>\n\t\t\t<\/span>break<\/span>;<\/span><\/span>\n\t\t}<\/span><\/span>\n\t}<\/span><\/span>\n\t<\/span>return<\/span> <\/span>0<\/span>;\t\t<\/span><\/span>\n}<\/span><\/span>\n<\/span>\n\/***************************************************************************<\/span><\/span>\n*Function\t\t\t: fnMyStrCmp<\/span><\/span>\n*Description\t\t: Function that compares the two strings s1 and s2.  <\/span><\/span>\n*Input parameters\t:<\/span><\/span>\n*\t\tconst char *s1, const char *s2 - two strings to be compared<\/span><\/span>\n*RETURNS\t\t:<\/span><\/span>\n*\t1 if s1 is greater than s2.<\/span><\/span>\n*\t0 if s1 matches s2.<\/span><\/span>\n*\t-1 if s1 is less than s2.<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\n<\/span>\nint<\/span> <\/span>fnMyStrCmp<\/span>(<\/span>const<\/span> <\/span>char<\/span> <\/span>*<\/span>s1<\/span>, <\/span>const<\/span> <\/span>char<\/span> <\/span>*<\/span>s2<\/span>)<\/span><\/span>\n{<\/span><\/span>\n\t<\/span>int<\/span> k;<\/span><\/span>\n\t<\/span>for<\/span>(k<\/span>=<\/span>0<\/span>; <\/span>s1<\/span>[k] <\/span>==<\/span> <\/span>s2<\/span>[k] <\/span>&&<\/span> <\/span>s1<\/span>[k]<\/span>!=<\/span>'<\/span>\\0<\/span>'<\/span>&&<\/span> <\/span>s2<\/span>[k]<\/span>!=<\/span>'<\/span>\\0<\/span>'<\/span>; k<\/span>++<\/span>);<\/span><\/span>\n<\/span>\n\t<\/span>if<\/span>( k<\/span>==<\/span>(<\/span>fnMyStrLen<\/span>(s1)) <\/span>&&<\/span> k<\/span>==<\/span>(<\/span>fnMyStrLen<\/span>(s2)) )\t<\/span><\/span>\n\t{<\/span><\/span>\n\t\t<\/span>return<\/span> <\/span>0<\/span>;<\/span><\/span>\n\t}<\/span><\/span>\n\t<\/span>else<\/span> <\/span>if<\/span>(<\/span>s1<\/span>[k] <\/span>><\/span> <\/span>s2<\/span>[k])\t\t<\/span><\/span>\n\t{<\/span><\/span>\n\t\t<\/span>return<\/span> <\/span>1<\/span>;<\/span><\/span>\n\t}<\/span><\/span>\n\t<\/span>else<\/span> \t<\/span><\/span>\n\t{<\/span><\/span>\n\t\t<\/span>return<\/span> <\/span>-<\/span>1<\/span>;<\/span><\/span>\n\t}\t<\/span><\/span>\n}<\/span><\/span>\n<\/span>\n\/***************************************************************************<\/span><\/span>\n*Function\t\t\t: fnMyStrCat<\/span><\/span>\n*Description\t\t: function that appends the src string to the dest string<\/span><\/span>\n*Input parameters\t:<\/span><\/span>\n*\t\tchar *dest - first string <\/span><\/span>\n*\t\tconst char *src - second string<\/span><\/span>\n*RETURNS\t\t\t: nothing<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\n<\/span>\nvoid<\/span> <\/span>fnMyStrCat<\/span>(<\/span>char<\/span> <\/span>*<\/span>dest<\/span>, <\/span>const<\/span> <\/span>char<\/span> <\/span>*<\/span>src<\/span>)<\/span><\/span>\n{<\/span><\/span>\n\t<\/span>int<\/span> dest_len, i;<\/span><\/span>\n\tdest_len <\/span>=<\/span> <\/span>fnMyStrLen<\/span>(dest);<\/span><\/span>\n\t<\/span>for<\/span> (i <\/span>=<\/span> <\/span>0<\/span> ; <\/span>src<\/span>[i] <\/span>!=<\/span> <\/span>'<\/span>\\0<\/span>'<\/span> ; i<\/span>++<\/span>)<\/span><\/span>\n\t\t<\/span>dest<\/span>[dest_len <\/span>+<\/span> i] <\/span>=<\/span> <\/span>src<\/span>[i];<\/span><\/span>\n\t<\/span>dest<\/span>[dest_len <\/span>+<\/span> i] <\/span>=<\/span> <\/span>'<\/span>\\0<\/span>'<\/span>;<\/span><\/span>\n}<\/span><\/span>\n<\/span>\n\/***************************************************************************<\/span><\/span>\n*Function\t\t\t: fnMyStrLen<\/span><\/span>\n*Description\t\t: function that calculates the length of a string<\/span><\/span>\n*Input parameters\t:<\/span><\/span>\n*\t\tconst char *str - string whose length needs to be found<\/span><\/span>\n*RETURNS\t\t\t: <\/span><\/span>\n*\tinteger which is the length of the string<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\n<\/span>\nint<\/span> <\/span>fnMyStrLen<\/span>(<\/span>const<\/span> <\/span>char<\/span> <\/span>*<\/span>str<\/span>)<\/span><\/span>\n{<\/span><\/span>\n\t<\/span>int<\/span> iLen;<\/span><\/span>\n\t<\/span>for<\/span>(iLen<\/span>=<\/span>0<\/span>; <\/span>str<\/span>[iLen] <\/span>!=<\/span> <\/span>'<\/span>\\0<\/span>'<\/span>; iLen<\/span>++<\/span>);<\/span><\/span>\n\t<\/span>return<\/span> iLen;<\/span><\/span>\n}<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
      Output<\/h4>\n\n\n\n
      <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
      \/***************************************<\/span><\/span>\n=====================<\/span><\/span>\nSTRING<\/span> <\/span>OPERATIONS<\/span><\/span>\n=====================<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>two<\/span> <\/span>strings<\/span><\/span>\n<\/span>\nString<\/span> <\/span>1<\/span> <\/span>:<\/span> <\/span>shiva<\/span> <\/span><\/span>\n<\/span>\nString<\/span> <\/span>2<\/span> <\/span>:<\/span> <\/span>shankar<\/span><\/span>\n<\/span>\n1.String<\/span> <\/span>Compare<\/span><\/span>\n2.String<\/span> <\/span>Concatenate<\/span><\/span>\n3.String<\/span> <\/span>Length<\/span><\/span>\nEnter<\/span> <\/span>your<\/span> <\/span>choice<\/span> <\/span>:<\/span> <\/span>2<\/span><\/span>\n<\/span>\nConcatenated<\/span> <\/span>String<\/span> <\/span>is<\/span><\/span>\nshivashankar<\/span><\/span>\nPress<\/span> <\/span>1<\/span> <\/span>to<\/span> <\/span>continue<\/span> <\/span>and<\/span> <\/span>0<\/span> <\/span>to<\/span> <\/span>quit<\/span> <\/span>:<\/span> <\/span>1<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>two<\/span> <\/span>strings<\/span><\/span>\n<\/span>\nString<\/span> <\/span>1<\/span> <\/span>:<\/span> <\/span>ramesh<\/span><\/span>\n<\/span>\nString<\/span> <\/span>2<\/span> <\/span>:<\/span> <\/span>sumesh<\/span><\/span>\n<\/span>\n1.String<\/span> <\/span>Compare<\/span><\/span>\n2.String<\/span> <\/span>Concatenate<\/span><\/span>\n3.String<\/span> <\/span>Length<\/span><\/span>\nEnter<\/span> <\/span>your<\/span> <\/span>choice<\/span> <\/span>:<\/span> <\/span>1<\/span><\/span>\n<\/span>\nString<\/span> <\/span>sumesh<\/span> <\/span>is<\/span> <\/span>greater<\/span> <\/span>than<\/span> <\/span>String<\/span> <\/span>ramesh<\/span><\/span>\nPress<\/span> <\/span>1<\/span> <\/span>to<\/span> <\/span>continue<\/span> <\/span>and<\/span> <\/span>0<\/span> <\/span>to<\/span> <\/span>quit<\/span> <\/span>:<\/span> <\/span>1<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>two<\/span> <\/span>strings<\/span><\/span>\n<\/span>\nString<\/span> <\/span>1<\/span> <\/span>:<\/span> <\/span>sam<\/span><\/span>\n<\/span>\nString<\/span> <\/span>2<\/span> <\/span>:<\/span> <\/span>samantha<\/span><\/span>\n<\/span>\n1.String<\/span> <\/span>Compare<\/span><\/span>\n2.String<\/span> <\/span>Concatenate<\/span><\/span>\n3.String<\/span> <\/span>Length<\/span><\/span>\nEnter<\/span> <\/span>your<\/span> <\/span>choice<\/span> <\/span>:<\/span> <\/span>3<\/span><\/span>\n<\/span>\nLength<\/span> <\/span>of<\/span> <\/span>String<\/span> <\/span>sam<\/span> <\/span>is<\/span> <\/span>3<\/span><\/span>\n<\/span>\nLength<\/span> <\/span>of<\/span> <\/span>String<\/span> <\/span>samantha<\/span> <\/span>is<\/span> <\/span>8<\/span><\/span>\n<\/span>\nPress<\/span> <\/span>1<\/span> <\/span>to<\/span> <\/span>continue<\/span> <\/span>and<\/span> <\/span>0<\/span> <\/span>to<\/span> <\/span>quit<\/span> <\/span>:<\/span> <\/span>0<\/span><\/span>\n***************************************<\/span>\/<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
      Question 10 <\/h2>\n\n\n\n
      C Structures<\/h3>\n\n\n\n
      Implement structures to read, write and compute average- marks and the students scoring above and below the average marks for a class of N students.<\/strong><\/p>\n\n\n\n
      C Code<\/h4>\n\n\n\n
      <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
      \/***************************************************************************<\/span><\/span>\n*File\t\t\t: A10StudentStructure.c<\/span><\/span>\n*Description\t: Program to implement structure and compute average marks<\/span><\/span>\n*Author\t\t: Prabodh C P<\/span><\/span>\n*Compiler\t\t: gcc compiler, Ubuntu 22.04<\/span><\/span>\n*Date\t\t\t: 10 August 2022<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\n<\/span>\n#include<\/span><stdio.h><\/span><\/span>\n#include<\/span><stdlib.h><\/span><\/span>\n#define<\/span> <\/span>STRSIZE<\/span> <\/span>30<\/span><\/span>\n<\/span>\ntypedef<\/span> <\/span>struct<\/span><\/span>\n{<\/span><\/span>\n\t<\/span>char<\/span> <\/span>cName<\/span>[STRSIZE];<\/span><\/span>\n\t<\/span>char<\/span> <\/span>cUSN<\/span>[<\/span>11<\/span>];<\/span><\/span>\n\t<\/span>int<\/span> iMarks;<\/span><\/span>\n}STUDENT_TYPE;<\/span><\/span>\n<\/span>\n\/***************************************************************************<\/span><\/span>\n*Function\t\t\t: \tmain<\/span><\/span>\n*Input parameters\t:\tno parameters<\/span><\/span>\n*RETURNS\t\t\t:\t0 on success<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\n<\/span>\nint<\/span> <\/span>main<\/span>(<\/span>void<\/span>)<\/span><\/span>\n{<\/span><\/span>\n\tSTUDENT_TYPE <\/span>students<\/span>[<\/span>100<\/span>];<\/span><\/span>\n\t<\/span>int<\/span> iNum, i;<\/span><\/span>\n\t<\/span>double<\/span> dAvg <\/span>=<\/span> <\/span>0.0<\/span>;<\/span><\/span>\n\t<\/span><\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Enter the number of students : "<\/span>);<\/span><\/span>\n\t<\/span>scanf<\/span>(<\/span>"<\/span>%d<\/span>"<\/span>, <\/span>&<\/span>iNum);<\/span><\/span>\n\t<\/span><\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Enter the Student details<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t<\/span>for<\/span>(i<\/span>=<\/span>0<\/span>;i<\/span><<\/span>iNum;i<\/span>++<\/span>)<\/span><\/span>\n\t{<\/span><\/span>\n\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>###############################"<\/span>);<\/span><\/span>\n\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Name : "<\/span>); \t<\/span>scanf<\/span>(<\/span>"<\/span>%s<\/span>"<\/span>, <\/span>students<\/span>[i].cName);<\/span><\/span>\n\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>USN : "<\/span>); \t<\/span>scanf<\/span>(<\/span>"<\/span>%s<\/span>"<\/span>, <\/span>students<\/span>[i].cUSN);<\/span><\/span>\n\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Marks : "<\/span>); \t<\/span>scanf<\/span>(<\/span>"<\/span>%d<\/span>"<\/span>, <\/span>&<\/span>students<\/span>[i].iMarks);<\/span><\/span>\n\t\tdAvg <\/span>+=<\/span> <\/span>students<\/span>[i].iMarks;<\/span><\/span>\n\t}<\/span><\/span>\n\t<\/span><\/span>\n\tdAvg <\/span>\/=<\/span> iNum;<\/span><\/span>\n\t<\/span><\/span>\n\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>The average marks for the class is : <\/span>%g\\n<\/span>"<\/span>, dAvg);<\/span><\/span>\n\t<\/span><\/span>\n\t<\/span>for<\/span>(i<\/span>=<\/span>0<\/span>;i<\/span><<\/span>iNum;i<\/span>++<\/span>)<\/span><\/span>\n\t{<\/span><\/span>\n\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>###############################"<\/span>);\t\t<\/span><\/span>\n\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Name<\/span>\\t<\/span>: <\/span>%s<\/span>"<\/span>, <\/span>students<\/span>[i].cName);<\/span><\/span>\n\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>USN<\/span>\\t<\/span>: <\/span>%s<\/span>"<\/span>, <\/span>students<\/span>[i].cUSN);<\/span><\/span>\n\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Marks<\/span>\\t<\/span>: <\/span>%d<\/span>"<\/span>, <\/span>students<\/span>[i].iMarks);<\/span><\/span>\n\t\t<\/span>if<\/span>(<\/span>students<\/span>[i].iMarks <\/span><<\/span> dAvg)<\/span><\/span>\n\t\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>The student has scored below average<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t\t<\/span>else<\/span><\/span>\n\t\t\t<\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>The student has scored above average<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n\t}<\/span><\/span>\n\t\t<\/span><\/span>\n\t<\/span>return<\/span> <\/span>0<\/span>;<\/span><\/span>\n}<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
      Output<\/h4>\n\n\n\n
      <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
      \/***************************************<\/span><\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>number<\/span> <\/span>of<\/span> <\/span>students<\/span> <\/span>:<\/span> <\/span>4<\/span><\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>Student<\/span> <\/span>details<\/span><\/span>\n<\/span>\n=========================================<\/span><\/span>\nName<\/span> <\/span>:<\/span> <\/span>Raju<\/span><\/span>\nUSN<\/span> <\/span>:<\/span> <\/span>1<\/span>SI17CS036<\/span><\/span>\nMarks<\/span> <\/span>:<\/span> <\/span>67<\/span><\/span>\n=========================================<\/span><\/span>\nName<\/span> <\/span>:<\/span> <\/span>Michael<\/span><\/span>\nUSN<\/span> <\/span>:<\/span> <\/span>1<\/span>SI17CS045<\/span><\/span>\nMarks<\/span> <\/span>:<\/span> <\/span>87<\/span><\/span>\n=========================================<\/span><\/span>\nName<\/span> <\/span>:<\/span> <\/span>Sahana<\/span><\/span>\nUSN<\/span> <\/span>:<\/span> <\/span>1<\/span>SI17CS405<\/span><\/span>\nMarks<\/span> <\/span>:<\/span> <\/span>77<\/span><\/span>\n=========================================<\/span><\/span>\nName<\/span> <\/span>:<\/span> <\/span>Jonathan<\/span><\/span>\nUSN<\/span> <\/span>:<\/span> <\/span>1<\/span>SI17CS025<\/span><\/span>\nMarks<\/span> <\/span>:<\/span> <\/span>83<\/span><\/span>\n<\/span>\nThe<\/span> <\/span>average<\/span> <\/span>marks<\/span> <\/span>for<\/span> <\/span>the<\/span> <\/span>class<\/span> <\/span>is<\/span> <\/span>:<\/span> <\/span>78.5<\/span><\/span>\n<\/span>\n=========================================<\/span><\/span>\nName<\/span>\t<\/span>:<\/span> <\/span>Raju<\/span><\/span>\nUSN<\/span>\t<\/span>:<\/span> <\/span>1<\/span>SI17CS036<\/span><\/span>\nMarks<\/span>\t<\/span>:<\/span> <\/span>67<\/span><\/span>\nThe<\/span> <\/span>student<\/span> <\/span>has<\/span> <\/span>scored<\/span> <\/span>below<\/span> <\/span>average<\/span><\/span>\n=========================================<\/span><\/span>\nName<\/span>\t<\/span>:<\/span> <\/span>Michael<\/span><\/span>\nUSN<\/span>\t<\/span>:<\/span> <\/span>1<\/span>SI17CS045<\/span><\/span>\nMarks<\/span>\t<\/span>:<\/span> <\/span>87<\/span><\/span>\nThe<\/span> <\/span>student<\/span> <\/span>has<\/span> <\/span>scored<\/span> <\/span>above<\/span> <\/span>average<\/span><\/span>\n=========================================<\/span><\/span>\nName<\/span>\t<\/span>:<\/span> <\/span>Sahana<\/span><\/span>\nUSN<\/span>\t<\/span>:<\/span> <\/span>1<\/span>SI17CS405<\/span><\/span>\nMarks<\/span>\t<\/span>:<\/span> <\/span>77<\/span><\/span>\nThe<\/span> <\/span>student<\/span> <\/span>has<\/span> <\/span>scored<\/span> <\/span>below<\/span> <\/span>average<\/span><\/span>\n=========================================<\/span><\/span>\nName<\/span>\t<\/span>:<\/span> <\/span>Jonathan<\/span><\/span>\nUSN<\/span>\t<\/span>:<\/span> <\/span>1<\/span>SI17CS025<\/span><\/span>\nMarks<\/span>\t<\/span>:<\/span> <\/span>83<\/span><\/span>\nThe<\/span> <\/span>student<\/span> <\/span>has<\/span> <\/span>scored<\/span> <\/span>above<\/span> <\/span>average<\/span><\/span>\n***************************************<\/span>\/<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
      Question 11 <\/h2>\n\n\n\n
      Pointers and Arrays<\/h3>\n\n\n\n
      Develop a program using pointers to compute the sum, mean and standard deviation of all elements stored in an array of N real numbers.<\/strong><\/p>\n\n\n\n
      C Code<\/h4>\n\n\n\n
      <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
      \/***************************************************************************<\/span><\/span>\n*File\t\t\t: A11MeanVarianceSD.c<\/span><\/span>\n*Description\t: Program to compute Mean, Variance and Standard Deviation<\/span><\/span>\n\t\t\t\t\tusing pointer to an array<\/span><\/span>\n*Author\t\t: Prabodh C P<\/span><\/span>\n*Compiler\t\t: gcc compiler, Ubuntu 22.04<\/span><\/span>\n*Date\t\t\t: 10 August 2022<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\n#include<\/span><stdio.h><\/span><\/span>\n#include<\/span><stdlib.h><\/span><\/span>\n#include<\/span><math.h><\/span><\/span>\n\/***************************************************************************<\/span><\/span>\n*Function\t\t\t: \tmain<\/span><\/span>\n*Input parameters\t:\tno parameters<\/span><\/span>\n*RETURNS\t\t\t:\t0 on success<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\nint<\/span> <\/span>main<\/span>(<\/span>void<\/span>)<\/span><\/span>\n{<\/span><\/span>\n    <\/span>int<\/span> i,iNum;<\/span><\/span>\n    <\/span>float<\/span> fMean <\/span>=<\/span> <\/span>0.0<\/span>f<\/span>, fVariance <\/span>=<\/span> <\/span>0.0<\/span>f<\/span>, fSd <\/span>=<\/span> <\/span>0.0<\/span>f<\/span>,<\/span>faArray<\/span>[<\/span>100<\/span>],fSum<\/span>=<\/span>0.0<\/span>f<\/span>;<\/span><\/span>\n    <\/span>float<\/span> <\/span>*<\/span>fptr;<\/span><\/span>\n<\/span>\n    <\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Enter the number of Values : "<\/span>);<\/span><\/span>\n    <\/span>scanf<\/span>(<\/span>"<\/span>%d<\/span>"<\/span>,<\/span>&<\/span>iNum);<\/span><\/span>\n    fptr <\/span>=<\/span> faArray; <\/span><\/span>\n\/*    fptr = (float*)malloc(iNum*sizeof(float));*\/<\/span><\/span>\n    <\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Enter <\/span>%d<\/span> values<\/span>\\n<\/span>"<\/span>, iNum);<\/span><\/span>\n    <\/span>for<\/span>(i<\/span>=<\/span>0<\/span>; i<\/span><<\/span>iNum; i<\/span>++<\/span>)<\/span><\/span>\n    {<\/span><\/span>\n        <\/span>scanf<\/span>(<\/span>"<\/span>%f<\/span>"<\/span>,fptr<\/span>+<\/span>i);<\/span><\/span>\n        fSum <\/span>+=<\/span> <\/span>*<\/span>(fptr<\/span>+<\/span>i);<\/span>\t\t\/\/fSum += fptr[i]; this is also valid<\/span><\/span>\n    }<\/span><\/span>\n    fMean <\/span>=<\/span> fSum<\/span>\/<\/span>iNum;<\/span><\/span>\n<\/span>\n    <\/span>for<\/span>(i<\/span>=<\/span>0<\/span>; i<\/span><<\/span>iNum; i<\/span>++<\/span>)<\/span><\/span>\n    {<\/span><\/span>\n        fVariance <\/span>+=<\/span> (<\/span>fptr<\/span>[i] <\/span>-<\/span> fMean)<\/span>*<\/span>(<\/span>fptr<\/span>[i] <\/span>-<\/span> fMean);<\/span><\/span>\n\t\t<\/span>\/\/fVariance += (*(fptr+i) - fMean)*(*(fptr+i) - fMean);<\/span><\/span>\n    }<\/span><\/span>\n    fVariance <\/span>\/=<\/span> iNum;<\/span><\/span>\n    fSd <\/span>=<\/span> <\/span>sqrt<\/span>(fVariance);<\/span><\/span>\n    <\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>The values entered are"<\/span>);<\/span><\/span>\n    <\/span>for<\/span>(i<\/span>=<\/span>0<\/span>; i<\/span><<\/span>iNum; i<\/span>++<\/span>)<\/span><\/span>\n    {<\/span><\/span>\n        <\/span>printf<\/span>(<\/span>"<\/span>\\t%g<\/span>"<\/span>,<\/span>fptr<\/span>[i]);<\/span>        \/\/printf("\\n\\t%f",*(fptr+i));<\/span><\/span>\n    }<\/span><\/span>\n    <\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n<\/span>\n    <\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>**************************************<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n    <\/span>printf<\/span>(<\/span>"<\/span>\\t<\/span>Sum<\/span>\\t<\/span> = <\/span>\\t%g\\n\\t<\/span>Mean<\/span>\\t<\/span> = <\/span>\\t%g\\n\\t<\/span>Variance = <\/span>\\t%g\\n<\/span>Standard Deviation = <\/span>\\t%g<\/span>"<\/span>,fSum,fMean,fVariance,fSd);<\/span><\/span>\n    <\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>**************************************<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n    <\/span>return<\/span> <\/span>0<\/span>;<\/span><\/span>\n}<\/span><\/span>\n<\/span><\/code><\/pre><\/div>\n\n\n\n
      Output<\/h4>\n\n\n\n
      <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
      \/***************************************<\/span><\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>number<\/span> <\/span>of<\/span> <\/span>Values<\/span> <\/span>:<\/span> <\/span>4<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>4<\/span> <\/span>values<\/span><\/span>\n1.1<\/span> <\/span>2.2<\/span> <\/span>3.3<\/span> <\/span>4.4<\/span><\/span>\n<\/span>\nThe<\/span> <\/span>values<\/span> <\/span>entered<\/span> <\/span>are<\/span>\t<\/span>1.1<\/span>\t<\/span>2.2<\/span>\t<\/span>3.3<\/span>\t<\/span>4.4<\/span><\/span>\n<\/span>\n**************************************<\/span><\/span>\n\t<\/span>Sum<\/span>\t <\/span>=<\/span> \t<\/span>11<\/span><\/span>\n\t<\/span>Mean<\/span>\t <\/span>=<\/span> \t<\/span>2.75<\/span><\/span>\n\t<\/span>Variance<\/span> <\/span>=<\/span> \t<\/span>1.5125<\/span><\/span>\nStandard<\/span> <\/span>Deviation<\/span> <\/span>=<\/span> \t<\/span>1.22984<\/span><\/span>\n**************************************<\/span><\/span>\n============================================================<\/span><\/span>\nEnter<\/span> <\/span>the<\/span> <\/span>number<\/span> <\/span>of<\/span> <\/span>Values<\/span> <\/span>:<\/span> <\/span>5<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>5<\/span> <\/span>values<\/span><\/span>\n5.345<\/span> <\/span>6.765<\/span> <\/span>7.234<\/span> <\/span>8.675<\/span> <\/span>9.765<\/span><\/span>\n<\/span>\nThe<\/span> <\/span>values<\/span> <\/span>entered<\/span> <\/span>are<\/span>\t<\/span>5.345<\/span>\t<\/span>6.765<\/span>\t<\/span>7.234<\/span>\t<\/span>8.675<\/span>\t<\/span>9.765<\/span><\/span>\n<\/span>\n**************************************<\/span><\/span>\n\t<\/span>Sum<\/span>\t <\/span>=<\/span> \t<\/span>37.784<\/span><\/span>\n\t<\/span>Mean<\/span>\t <\/span>=<\/span> \t<\/span>7.5568<\/span><\/span>\n\t<\/span>Variance<\/span> <\/span>=<\/span> \t<\/span>2.34995<\/span><\/span>\nStandard<\/span> <\/span>Deviation<\/span> <\/span>=<\/span> \t<\/span>1.53295<\/span><\/span>\n**************************************<\/span><\/span>\n***************************************<\/span>\/<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
      Question 12 <\/h2>\n\n\n\n
      File Copy<\/h3>\n\n\n\n
      Write a C program to copy a text file to another, read both the input file name and target file name.<\/strong><\/p>\n\n\n\n
      C Code<\/h4>\n\n\n\n
      <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
      \/***************************************************************************<\/span><\/span>\n*File\t\t\t: A12FileCopy.c<\/span><\/span>\n*Description\t: Program to copy a text file to another<\/span><\/span>\n*Author\t\t: Prabodh C P<\/span><\/span>\n*Compiler\t\t: gcc compiler, Ubuntu 22.04<\/span><\/span>\n*Date\t\t\t: 22 December 2022<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\n<\/span>\n#include<\/span><stdio.h><\/span><\/span>\n#include<\/span><stdlib.h><\/span><\/span>\n<\/span>\n\/***************************************************************************<\/span><\/span>\n*Function\t\t\t: \tmain<\/span><\/span>\n*Input parameters\t:\tno parameters<\/span><\/span>\n*RETURNS\t\t\t:\t0 on success<\/span><\/span>\n***************************************************************************\/<\/span><\/span>\nint<\/span> <\/span>main<\/span>(<\/span>void<\/span>)<\/span><\/span>\n{<\/span><\/span>\n    FILE <\/span>*<\/span>fp1,<\/span>*<\/span>fp2;<\/span><\/span>\n    <\/span>int<\/span> ch;<\/span><\/span>\n    <\/span>char<\/span> <\/span>fname1<\/span>[<\/span>100<\/span>], <\/span>fname2<\/span>[<\/span>100<\/span>];<\/span><\/span>\n    <\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Enter File name to be copied<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n    <\/span>scanf<\/span>(<\/span>"<\/span>%s<\/span>"<\/span>,fname1);<\/span><\/span>\n    fp1 <\/span>=<\/span> <\/span>fopen<\/span>(fname1,<\/span>"r"<\/span>);<\/span><\/span>\n<\/span>\n    <\/span>if<\/span>(fp1 <\/span>==<\/span> <\/span>NULL<\/span>)<\/span><\/span>\n    {<\/span><\/span>\n        <\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Input File <\/span>%s<\/span> doesn't exist<\/span>\\n<\/span>"<\/span>, fname1);<\/span><\/span>\n        <\/span>exit<\/span>(<\/span>0<\/span>);<\/span><\/span>\n    }<\/span><\/span>\n<\/span>\n    <\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>Enter target File name<\/span>\\n<\/span>"<\/span>);<\/span><\/span>\n    <\/span>scanf<\/span>(<\/span>"<\/span>%s<\/span>"<\/span>,fname2);<\/span><\/span>\n<\/span>\n    fp2 <\/span>=<\/span> <\/span>fopen<\/span>(fname2,<\/span>"w"<\/span>);<\/span><\/span>\n    <\/span>while<\/span>((ch<\/span>=<\/span>fgetc<\/span>(fp1)) <\/span>!=<\/span> EOF)<\/span><\/span>\n    {<\/span><\/span>\n        <\/span>fputc<\/span>(ch,fp2);<\/span><\/span>\n    }<\/span><\/span>\n    <\/span>printf<\/span>(<\/span>"<\/span>\\n<\/span>File <\/span>%s<\/span> successfully created<\/span>\\n<\/span>"<\/span>,fname2);<\/span><\/span>\n<\/span>\n    <\/span>fclose<\/span>(fp1);<\/span><\/span>\n    <\/span>fclose<\/span>(fp2);<\/span><\/span>\n<\/span>\n    <\/span>return<\/span> <\/span>0<\/span>;<\/span><\/span>\n}<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
      Output<\/h4>\n\n\n\n
      <\/circle><\/circle><\/circle><\/g><\/svg><\/span><\/path><\/path><\/svg><\/span>
      \/**************************************************<\/span><\/span>\nEnter<\/span> <\/span>File<\/span> <\/span>name<\/span> <\/span>to<\/span> <\/span>be<\/span> <\/span>copied<\/span><\/span>\nout9.c<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>target<\/span> <\/span>File<\/span> <\/span>name<\/span><\/span>\nout99.c<\/span><\/span>\n<\/span>\nFile<\/span> <\/span>out99.c<\/span> <\/span>successfully<\/span> <\/span>created<\/span><\/span>\n<\/span>\n===============================================<\/span><\/span>\n<\/span>\nEnter<\/span> <\/span>File<\/span> <\/span>name<\/span> <\/span>to<\/span> <\/span>be<\/span> <\/span>copied<\/span><\/span>\nsecret.txt<\/span><\/span>\n<\/span>\nInput<\/span> <\/span>File<\/span> <\/span>secret.txt<\/span> <\/span>doesn't exist<\/span><\/span>\n<\/span>\n**************************************************\/<\/span><\/span><\/code><\/pre><\/div>\n\n\n\n
      If you are also looking for other subject Lab Manuals, head over to my following blog :<\/p>\n\n\n\n
      \n
      VTU Lab Manuals using FOSS<\/a><\/blockquote>