Posts

Showing posts from February, 2025

ds

  #include <stdio.h> #include <stdlib.h> // Define the structure for a node in the tree struct TreeNode {     int data;     struct TreeNode * left;     struct TreeNode * right; }; // Function to create a new node struct TreeNode * createNode ( int data ) {     struct TreeNode * newNode = ( struct TreeNode * ) malloc ( sizeof ( struct TreeNode));     newNode -> data = data;     newNode -> left = NULL ;     newNode -> right = NULL ;     return newNode; } // Function to insert a node in the tree (basic BST insert) struct TreeNode * insertNode ( struct TreeNode * root , int data ) {     if (root == NULL ) {         return createNode (data); // If the tree is empty, create the first node     }     if (data < root -> data ) {         root -> left = insertNode ( root -> lef...
Post a Comment
Read more

DS LAB BSC(cs) 2nd SEM 2025

Queue Implementation Using Array #include <stdio.h> #include <stdlib.h> #define MAX 5 // maximum size of the queue // Define a Queue structure struct Queue {     int front , rear ;     int arr [ MAX ]; }; // Function to initialize the queue void initQueue ( struct Queue * q ) {     q -> front = - 1 ;     q -> rear = - 1 ; } // Check if the queue is empty int isEmpty ( struct Queue * q ) {     return ( q -> front == - 1 ); } // Check if the queue is full int isFull ( struct Queue * q ) {     return ( q -> rear == MAX - 1 ); } // Enqueue operation (add an element to the queue) void enqueue ( struct Queue * q , int value ) {     if ( isFull ( q )) {         printf ( "Queue is full! Cannot enqueue %d \n " , value );     } else {         if ( q -> front == - 1 ) { // If the queue is empty, initialize front ...
Post a Comment
Read more

HTML WEB LAB BSC.(CS) 2nd SEM

Image
  <!-- 15.  Create the following table in HTML with Dummy Data:  --> < html >     < head >         < title > EXP.NO 15 </ title >     </ head >     < body >         < table Border = "10px" width = "500" >         < tr >             < th > Reg.NO </ th >             < th > Student Name </ th >             < th > Year </ th >             < th > Date of Admission </ th >         </ tr >               < tr >             < td > 202436706 </ td >             < td > Samprity </ td >           ...
Post a Comment
Read more

Popular posts from this blog

C-Programming of Class 12

1. Write a program to input any three numbers and find out which one is the largest number using user defined function.       #include<stdio.h> int larg_num(int num1, int num2, int num3){     if(num1 >= num2 && num1 >= num3){         return num1;     }else if(num2 >=num1 && num2>=num3){         return num2;     }     else{         return num3;     } } int main(){ int num1, num2, num3; scanf("%d%d%d", &num1,&num2,&num3); int largest = larg_num(num1,num2,num3); printf("the largest number is %d",largest);     return 0; } 2. Write a program to display the day using the switch statement depending upon the number entered. i.e. input 1 for Sunday, 7 for Saturday using user defined  function. #include <stdio.h> char *days(int num) {     switch (num)     {     case 1:   ...
Read more

C-Program of Class 11

 1. Define string. Explain any four-string handling function used in C. A String in C programming is a sequence of characters terminated with a null character ‘\0’. The C String is stored as an array of characters. #include <stdio.h> #include <string.h> int main() {     char str1[20] = "Hello";     char str2[20] = "World";     char str3[20];     strcpy(str3, str1);     printf("Copied string: %s\n", str3);     strcat(str2, str1);     printf("Concatenates string: %s\n", str1);     printf("Length of str1: %lu\n", strlen(str1));     if (strcmp(str1, str2) == 0)         printf("str1 and str2 are equal\n");     else if (strcmp(str1, str2) < 0)         printf("str1 is less than str2\n");     else         printf("str1 is greater than str2\n");     return 0; } strcat(): Concatenates (joins) two stri...
Read more