Tuesday, March 25, 2014

DAA(Lec-1)

12 comments:

  1. its really an amazing website (:

    ReplyDelete
  2. Thank's For Your Teaching Style ........T.waleed

    ReplyDelete
  3. it's good idea ................T.waleed

    ReplyDelete
  4. it's good idea .........................thank's

    ReplyDelete
  5. Thanks a lot for all of you........!!

    ReplyDelete
  6. can you give me electronic book about '# table ' proplem pleaes?

    ReplyDelete
  7. I found so many different answers but I've tried to solve 8-queens and maybe that is not what you meant ^.^
    here is the code....
    #include
    #include
    main()
    {
    int i,j;
    int a[8][8]={0};
    for(i=0;i<8;i++){
    for(j=0;j<8;j++){
    if((i==0)&&(j==0)||(i==1)&&(j==4)||(i==2)&&(j==7)||(i==3)&&(j==5)||(i==4)&&(j==2)||(i==5)&&(j==6)||(i==6)&&(j==1)||(i==7)&&(j==3))
    a[i][j]=1;
    cout<<a[i][j]<<"\t";}
    cout<<"\n";}
    getch();}

    ReplyDelete
  8. فين المشاكل يا استاذي ما لقيت الا متاهات هههههههههههههههه


    ReplyDelete
  9. السلام عليكم انا معجب جدا بوجودي معكم متمنيا ان اكون عند حسن ان شاء الله

    ReplyDelete
  10. السلام عليكم
    فين المشاكل ياستاذ وليد

    ReplyDelete