{"id":190,"date":"2020-07-04T11:15:20","date_gmt":"2020-07-04T11:15:20","guid":{"rendered":"\/?p=190"},"modified":"2020-07-11T03:38:59","modified_gmt":"2020-07-11T03:38:59","slug":"hseb-2062","status":"publish","type":"post","link":"http:\/\/suryaprakash.com.np\/?p=190","title":{"rendered":"HSEB-2062"},"content":{"rendered":"

\/\/2062
\n\/\/Q1.a. write a c prgram to print the 10 positive integers and their factorials.
\n#include<stdio.h><\/span>
\n#define max 10<\/span>
\nvoid main()<\/span>
\n{<\/span>
\nint i,j,fact,N[max];<\/span>
\nprintf(“enter the value of entegers\\n”);<\/span>
\nfor(i=1;i<max;i++)<\/span>
\n{<\/span>
\nscanf(“%d”,&N[i]);<\/span><\/p>\n

}<\/span>
\nprintf(“Number\\t Factorial\\n”);<\/span>
\nfor(i=1;i<max;i++)<\/span>
\n{<\/span>
\nfact=1;<\/span>
\nfor(j=1;j<=N[i];j++)<\/span>
\n{<\/span>
\nfact*=j;<\/span>
\n}<\/span>
\n\/\/ printf(“the Number=%d and its Factorial=%d\\n”,N[i],fact);<\/span>
\nprintf(“%d\\t%d\\n”,N[i],fact);<\/span><\/p>\n

}<\/span><\/p>\n

}<\/span><\/p>\n

OUTPUT<\/strong><\/span><\/p>\n

\"\"<\/p>\n

I have given the input in random way.<\/span><\/p>\n

\/\/1.c.Write a C Program to input ‘n’ numbers and find out greatest and smallest number.<\/p>\n

#include<stdio.h><\/span>
\nvoid main()<\/span>
\n{<\/span>
\nint i,j,n, a[20],temp;<\/span>
\nprintf(“enter the size of array\\n”);<\/span>
\nscanf(“%d”,&n);<\/span>
\nprintf(“ente the numbers:-\\n”);<\/span>
\nfor(i=0;i<n;i++)<\/span>
\nscanf(“%d”,&a[i]); \/\/taking input values<\/span>
\nprintf(“the input values are:”);<\/span>
\nfor(i=0;i<n;i++)<\/span>
\nprintf(“\\t%d”,a[i]);\u00a0 \u00a0 \u00a0 \u00a0 <\/span>\u00a0<\/span><\/span>
\nfor(i=0;i<n-1;i++)<\/span>
\n{<\/span><\/p>\n

for(j=i+1;j<n;j++)<\/span>
\n{<\/span>
\nif(a[i]>a[j])<\/span>
\n{ \/\/the main logic part <\/span>
\ntemp=a[i];<\/span>
\na[i]=a[j];<\/span>
\na[j]=temp;<\/span>
\n}<\/span>
\n}<\/span>
\n}<\/span>
\nprintf(“\\nthe element in ascending order is:\\n”); <\/span>
\nfor(i=0;i<n;i++)<\/span>
\nprintf(“\\t%d”,a[i]);<\/span>
\nprintf(“\\nthe highest number is %d”,a[n-1]);<\/span>
\nprintf(“\\nthe lowest number is %d”,a[0]);<\/span>
\n}<\/span><\/p>\n

OUTPUT<\/strong><\/p>\n

\"\"<\/p>\n

In the given program first i have changed the array value\u00a0 in ascending order and then automatically the the first value of the array the array will be smallest and the last will be highest value.<\/span><\/p>\n

Note:- Displaying the numbers in ascending order is extra work in my program code. There is no need of that portion.<\/p>\n","protected":false},"excerpt":{"rendered":"

\/\/2062 \/\/Q1.a. write a c prgram to print the 10 positive integers and their factorials. #include<stdio.h> #define max 10 void … <\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[7,8],"tags":[],"_links":{"self":[{"href":"http:\/\/suryaprakash.com.np\/index.php?rest_route=\/wp\/v2\/posts\/190"}],"collection":[{"href":"http:\/\/suryaprakash.com.np\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/suryaprakash.com.np\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/suryaprakash.com.np\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/suryaprakash.com.np\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=190"}],"version-history":[{"count":5,"href":"http:\/\/suryaprakash.com.np\/index.php?rest_route=\/wp\/v2\/posts\/190\/revisions"}],"predecessor-version":[{"id":198,"href":"http:\/\/suryaprakash.com.np\/index.php?rest_route=\/wp\/v2\/posts\/190\/revisions\/198"}],"wp:attachment":[{"href":"http:\/\/suryaprakash.com.np\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=190"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/suryaprakash.com.np\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=190"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/suryaprakash.com.np\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=190"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}