Skip to main content

Hhdjrn

 Ha Djjfnfjf

Comments

  1. CREATE TABLE MCA2022( ID INT, NAME CHAR(10), YEAR CHAR(8), PIN_CODE INT);

    INSERT INTO MCA2022 VALUES( 4 , 'Lucky Yadav', '1st Year' , 208024 );

    ReplyDelete
  2. CREATE TABLE MCA2022( ID INT, NAME CHAR(10), YEAR CHAR(8), PIN_CODE INT); // CREATE TABLE

    INSERT INTO MCA2022 VALUES( 5 , 'Lucky Yadav', '1st Year' , 208024 ); // INSERT DATA IN THE TABLE

    ALTER TABLE MCA2022
    ALTER COLUMN NAME CHAR(15); // TO UPDATE THE SIZE OF THE COLUMN AND DATA TYPE


    ALTER TABLE MCA2022
    ADD 4DIGIT_ROLL_NO INT; // ADD COLUMN IN TABLE

    ReplyDelete
  3. SELECT
    * FROM [Customers Extended] T1,[Customers Extended] T2
    WHERE T1.City= T1.City ;

    ReplyDelete
  4. Dim f As Object Dim strfile As String Dim strfolder As String

    Dim varitem As Variant

    Set f Application.FileDialog(3)

    f.allowMultiSelect = True

    If f.show Then

    For Each varitem In f.selecteditems

    strfile = Dir(varitem)

    strfolder Left(varitem, Len(varitem) - Len(strfile)) MsgBox "Folder" & strfolder & vbCrLf & "File:" & strfile

    picturesource = strfolder + strile Next

    End If Set f = Nothing

    ReplyDelete

Post a Comment

Popular posts from this blog

7 features of OOPs

The 7 features of OOPs are as follows: 1. Incapsulation 2. Abstraction 3. Inheritance 4. Polymorphism 5. Object must be used 6. Massage passing : One object can interect with another object 7. Dynamic binding The most initial 4 are the basic OOPs features that is required.

Sieve Erotosthenes program in c++

  #include <bits/stdc++.h> using namespace std ; /* this program is for finding the prime number till the given number */ void primeSieve ( long long n ) {     long long prime [ n + 1 ] = { 0 };     for ( long long i = 2 ; i <= n ; i ++ )     {         if ( prime [ i ] == 0 )         for ( long long j = i * i ; j <= n ; j += i )         {             prime [ j ] = 1 ;         }             }     for ( long long i = 2 ; i <= n ; i ++ )     {         if ( prime [ i ] == 0 )         cout << i << " " ;     }         } int main () {     long long n ;     cin >> n ;     primeSieve ( n );     return 0 ; }

Array Data Structure