for lab

 https://drive.google.com/drive/folders/1xIaLYKSnZNi5RzIsCieYD2wcj-GR4rt9?usp=sharing

Comments

Post a Comment

Popular posts from this blog

O.S. MIDSEM by god

Image
copy paste from diff. source by Chetan yadav {god} download link >  Download 1 >> Components of Operating System apni iccha anusar yaad karna 2-3 line.. jo easy lage  There are various components of an Operating System to perform well defined tasks. Though most of the Operating Systems differ in structure but logically they have similar components. Each component must be a well-defined portion of a system that appropriately describes the functions, inputs, and outputs. There are following 8-components of an Operating System: 1.        Process Management 2.        I/O Device Management 3.        File Management 4.        Network Management 5.        Main Memory Management 6.        Secondary Storage Management 7.        Security Mana...
Read more

MINI project format >> 1st sem

Image
  just to preview  Guidelines for Preparation of Mini Project Report   1.     Font Type : Garamond 2.     The regular text in the project should be 12 font size. 3.     Title page to be placed on the spiral binding of the Project Report. What’s this ?? anyone ,,dm me 4.     There will be college project guide. 5.     Two copies of the project report to be prepared. One will be submitted in the college and one will be returned to the student. 6.     Samples pages are attached for your convenience. 7.     Sequence of pages will be as follows:                                               i.       ...
Read more

Assignment C Language 11-19 🎆

Image
CODE_HUB Yeh code VS code mein working hai (error aaye toh batana) 💟  This is me <3 Ou tput khudse kar lena (easy hai)   Q.11  Write a recursive function that will generate and print the first n Fibonacci number. Test the function for n=10 and n=15. Ans  #include <stdio.h> int fibonacci ( int f ); int main () {     int n , f = 0 , i ;     printf ( "Enter number" );     scanf ( " %d " , & n );     printf ( "Fibonacci series terms are:" );     for ( i = 1 ; i <= n ; i ++)     {         printf ( " %d " , fibonacci ( f ));         f ++;     }     return 0 ; } int fibonacci ( int n ) {     if ( n == 0 || n == 1 )         return n ;     else         return ( fibonacci ( n - 1 ) + fibonacci ( n - 2 )); } another way to direct print answer #include <stdio...
Read more