ADA LAB TEST-2 Time Table




5th May  2014 (Monday)

B1 Batch 9.30 AM to 12.30 PM
B2 Batch 11.00 AM to 2.00 PM
B3 Batch 2.00 PM to 5.00 PM

Comments

Post a Comment

Popular posts from this blog

ADA LAB  INSTRUCTIONS for 2nd Internals:  LAB  Programs for 2nd lab t est : 6,7a&7b,8,9,10,12 Strictly this time No Change of program allowed. If the student is absent, marks awarded are zero and no extra  test  is conducted. No change of batch is allowed. No other extra  lab  internals will be given.
Read more

ADA Exercise Solutions

https://drive.google.com/file/d/0Bxt9SSF8X6wuTDVzX09oTnZ5RUk/edit?usp=sharing https://drive.google.com/file/d/0Bxt9SSF8X6wua3ZJVE5SdXc2Ykk/edit?usp=sharing https://drive.google.com/file/d/0Bxt9SSF8X6wuai1RQVFSVXdtalk/edit?usp=sharing
Read more
//nqueens #include<iostream> #include <conio.h> #include<math.h> #include<stdlib.h> #define max 20 using namespace std; class nqueens { private:  int n; public:     nqueens(int num); void display(int [],int); int place(int [],int); }; nqueens::nqueens(int num) {     int x[max];     int k;     n=num;     cout<<"the soln to"<<n<<"queens problem is\n";     x[0]=-1;     k=0;     while(k>=0)     {         x[k]=x[k]+1;         while(x[k]<n&&!place(x,k))         x[k]=x[k]+1;         if(x[k]<n)         if(k==n-1)         display(x,n);         else         {                 k++;                 x[k]=-1;         }         else                 k--;     } } int nqueens::place(int x[],int k) {     int i;     for(i=0;i<k;i++)         if(x[i]==x[k]||abs(x[i]-x[k])==abs(i-k))             return 0;             return 1; } void nqueens::display(int x[],int n) {     char chessb[max][max];     int i,j;     for(i=0;i<n;i
Read more